fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r426-tajo-167905979000502
Last Updated
May 14, 2023

About the Execution of Marcie+red for SimpleLoadBal-PT-02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5449.567 8903.00 13733.00 129.10 FTTFFTFFFFTTTTTF normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905979000502.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is SimpleLoadBal-PT-02, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905979000502
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.9K Feb 26 03:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 03:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 03:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 03:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 26 03:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 173K Feb 26 03:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 03:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 03:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 17:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 38K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SimpleLoadBal-PT-02-ReachabilityCardinality-00
FORMULA_NAME SimpleLoadBal-PT-02-ReachabilityCardinality-01
FORMULA_NAME SimpleLoadBal-PT-02-ReachabilityCardinality-02
FORMULA_NAME SimpleLoadBal-PT-02-ReachabilityCardinality-03
FORMULA_NAME SimpleLoadBal-PT-02-ReachabilityCardinality-04
FORMULA_NAME SimpleLoadBal-PT-02-ReachabilityCardinality-05
FORMULA_NAME SimpleLoadBal-PT-02-ReachabilityCardinality-06
FORMULA_NAME SimpleLoadBal-PT-02-ReachabilityCardinality-07
FORMULA_NAME SimpleLoadBal-PT-02-ReachabilityCardinality-08
FORMULA_NAME SimpleLoadBal-PT-02-ReachabilityCardinality-09
FORMULA_NAME SimpleLoadBal-PT-02-ReachabilityCardinality-10
FORMULA_NAME SimpleLoadBal-PT-02-ReachabilityCardinality-11
FORMULA_NAME SimpleLoadBal-PT-02-ReachabilityCardinality-12
FORMULA_NAME SimpleLoadBal-PT-02-ReachabilityCardinality-13
FORMULA_NAME SimpleLoadBal-PT-02-ReachabilityCardinality-14
FORMULA_NAME SimpleLoadBal-PT-02-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679358703600

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SimpleLoadBal-PT-02
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-21 00:31:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 00:31:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 00:31:46] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2023-03-21 00:31:46] [INFO ] Transformed 32 places.
[2023-03-21 00:31:46] [INFO ] Transformed 45 transitions.
[2023-03-21 00:31:46] [INFO ] Found NUPN structural information;
[2023-03-21 00:31:46] [INFO ] Completing missing partition info from NUPN : creating a component with [P_client_idle_1, P_client_idle_2, P_client_waiting_1, P_client_waiting_2, P_client_request_1, P_client_request_2, P_client_ack_1, P_client_ack_2, P_server_idle_1, P_server_idle_2, P_server_waiting_1, P_server_waiting_2, P_server_processed_1, P_server_processed_2, P_server_notification_1, P_server_notification_2, P_server_notification_ack_1, P_server_notification_ack_2, P_server_request_1_1, P_server_request_1_2, P_server_request_2_1, P_server_request_2_2, P_lb_idle_1, P_lb_routing_1_1, P_lb_routing_1_2, P_lb_balancing_1, P_lb_load_1_0, P_lb_load_1_1, P_lb_load_1_2, P_lb_load_2_0, P_lb_load_2_1, P_lb_load_2_2]
[2023-03-21 00:31:46] [INFO ] Parsed PT model containing 32 places and 45 transitions and 252 arcs in 156 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA SimpleLoadBal-PT-02-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-02-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-02-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-02-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-02-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-02-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-02-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-02-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 8) seen :7
FORMULA SimpleLoadBal-PT-02-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-02-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-02-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-02-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-02-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-02-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-02-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 00:31:46] [INFO ] Flow matrix only has 35 transitions (discarded 10 similar events)
// Phase 1: matrix 35 rows 32 cols
[2023-03-21 00:31:46] [INFO ] Computed 13 place invariants in 14 ms
[2023-03-21 00:31:47] [INFO ] After 236ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
FORMULA SimpleLoadBal-PT-02-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
All properties solved without resorting to model-checking.
Total runtime 979 ms.
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: SimpleLoadBal_PT_02
(NrP: 32 NrTr: 45 NrArc: 252)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 2.962sec


RS generation: 0m 0.017sec


-> reachability set: #nodes 668 (6.7e+02) #states 832



starting MCC model checker
--------------------------

checking: EF [P_client_idle_2<=0]
normalized: E [true U P_client_idle_2<=0]

abstracting: (P_client_idle_2<=0)
states: 664
-> the formula is TRUE

FORMULA SimpleLoadBal-PT-02-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [1<=P_server_notification_ack_1]
normalized: ~ [E [true U ~ [1<=P_server_notification_ack_1]]]

abstracting: (1<=P_server_notification_ack_1)
states: 212
-> the formula is FALSE

FORMULA SimpleLoadBal-PT-02-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [P_lb_idle_1<=1]
normalized: ~ [E [true U ~ [P_lb_idle_1<=1]]]

abstracting: (P_lb_idle_1<=1)
states: 832
-> the formula is TRUE

FORMULA SimpleLoadBal-PT-02-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [P_client_idle_1<=P_lb_load_2_0]]
normalized: E [true U ~ [P_client_idle_1<=P_lb_load_2_0]]

abstracting: (P_client_idle_1<=P_lb_load_2_0)
states: 732
-> the formula is TRUE

FORMULA SimpleLoadBal-PT-02-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: EF [[1<=P_lb_load_1_2 | ~ [[~ [[[1<=P_lb_load_2_2 | [~ [P_client_waiting_2<=P_lb_load_1_2] | [1<=P_lb_idle_1 & P_lb_balancing_1<=0]]] & ~ [[1<=P_server_processed_2 & [P_server_processed_2<=P_server_notification_1 | 1<=P_lb_load_1_1]]]]] | 1<=P_client_ack_2]]]]
normalized: E [true U [~ [[~ [[~ [[[P_server_processed_2<=P_server_notification_1 | 1<=P_lb_load_1_1] & 1<=P_server_processed_2]] & [[[1<=P_lb_idle_1 & P_lb_balancing_1<=0] | ~ [P_client_waiting_2<=P_lb_load_1_2]] | 1<=P_lb_load_2_2]]] | 1<=P_client_ack_2]] | 1<=P_lb_load_1_2]]

abstracting: (1<=P_lb_load_1_2)
states: 112
abstracting: (1<=P_client_ack_2)
states: 168
abstracting: (1<=P_lb_load_2_2)
states: 104
abstracting: (P_client_waiting_2<=P_lb_load_1_2)
states: 268
abstracting: (P_lb_balancing_1<=0)
states: 468
abstracting: (1<=P_lb_idle_1)
states: 324
abstracting: (1<=P_server_processed_2)
states: 206
abstracting: (1<=P_lb_load_1_1)
states: 448
abstracting: (P_server_processed_2<=P_server_notification_1)
states: 680
-> the formula is TRUE

FORMULA SimpleLoadBal-PT-02-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [[1<=P_server_request_2_2 | [1<=P_server_idle_2 & [~ [P_client_idle_1<=0] | [[1<=P_client_ack_1 & P_lb_load_1_1<=0] & ~ [[~ [[1<=P_lb_routing_1_1 & P_lb_idle_1<=P_client_idle_2]] | [~ [1<=P_client_ack_1] & [P_server_request_1_1<=P_server_idle_1 & [1<=P_server_request_2_1 & P_lb_load_2_0<=1]]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[~ [[[[[1<=P_server_request_2_1 & P_lb_load_2_0<=1] & P_server_request_1_1<=P_server_idle_1] & ~ [1<=P_client_ack_1]] | ~ [[1<=P_lb_routing_1_1 & P_lb_idle_1<=P_client_idle_2]]]] & [1<=P_client_ack_1 & P_lb_load_1_1<=0]] | ~ [P_client_idle_1<=0]] & 1<=P_server_idle_2] | 1<=P_server_request_2_2]]]]

abstracting: (1<=P_server_request_2_2)
states: 124
abstracting: (1<=P_server_idle_2)
states: 210
abstracting: (P_client_idle_1<=0)
states: 664
abstracting: (P_lb_load_1_1<=0)
states: 384
abstracting: (1<=P_client_ack_1)
states: 168
abstracting: (P_lb_idle_1<=P_client_idle_2)
states: 580
abstracting: (1<=P_lb_routing_1_1)
states: 72
abstracting: (1<=P_client_ack_1)
states: 168
abstracting: (P_server_request_1_1<=P_server_idle_1)
states: 740
abstracting: (P_lb_load_2_0<=1)
states: 832
abstracting: (1<=P_server_request_2_1)
states: 132
-> the formula is FALSE

FORMULA SimpleLoadBal-PT-02-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [~ [[~ [[~ [[1<=P_server_request_2_1 & ~ [[~ [P_client_request_2<=1] & [1<=P_server_request_2_1 | P_server_idle_1<=P_server_notification_ack_1]]]]] | [[~ [P_client_waiting_2<=0] & [[P_server_waiting_1<=1 | ~ [P_lb_balancing_1<=P_client_request_2]] | ~ [1<=P_client_request_2]]] | [P_client_ack_1<=P_server_notification_1 & ~ [[P_client_ack_1<=P_server_request_1_1 & 1<=P_server_idle_1]]]]]] | 1<=P_server_notification_2]]]
normalized: ~ [E [true U [~ [[[[[~ [1<=P_client_request_2] | [~ [P_lb_balancing_1<=P_client_request_2] | P_server_waiting_1<=1]] & ~ [P_client_waiting_2<=0]] | [~ [[P_client_ack_1<=P_server_request_1_1 & 1<=P_server_idle_1]] & P_client_ack_1<=P_server_notification_1]] | ~ [[~ [[[1<=P_server_request_2_1 | P_server_idle_1<=P_server_notification_ack_1] & ~ [P_client_request_2<=1]]] & 1<=P_server_request_2_1]]]] | 1<=P_server_notification_2]]]

abstracting: (1<=P_server_notification_2)
states: 206
abstracting: (1<=P_server_request_2_1)
states: 132
abstracting: (P_client_request_2<=1)
states: 832
abstracting: (P_server_idle_1<=P_server_notification_ack_1)
states: 620
abstracting: (1<=P_server_request_2_1)
states: 132
abstracting: (P_client_ack_1<=P_server_notification_1)
states: 706
abstracting: (1<=P_server_idle_1)
states: 212
abstracting: (P_client_ack_1<=P_server_request_1_1)
states: 664
abstracting: (P_client_waiting_2<=0)
states: 168
abstracting: (P_server_waiting_1<=1)
states: 832
abstracting: (P_lb_balancing_1<=P_client_request_2)
states: 548
abstracting: (1<=P_client_request_2)
states: 168
-> the formula is FALSE

FORMULA SimpleLoadBal-PT-02-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: AG [[~ [[[1<=P_lb_load_2_2 | [[~ [P_client_request_2<=0] & P_client_idle_2<=P_lb_load_2_1] | [[~ [P_server_request_1_2<=0] | ~ [1<=P_server_idle_2]] | [[P_client_request_2<=P_server_notification_1 | P_server_notification_ack_2<=1] | ~ [1<=P_server_notification_1]]]]] | [[P_server_processed_2<=P_server_notification_1 & ~ [[~ [1<=P_lb_load_2_2] | 1<=P_client_waiting_2]]] | P_client_idle_1<=P_server_notification_ack_1]]] | 1<=P_lb_routing_1_2]]
normalized: ~ [E [true U ~ [[~ [[[[~ [[~ [1<=P_lb_load_2_2] | 1<=P_client_waiting_2]] & P_server_processed_2<=P_server_notification_1] | P_client_idle_1<=P_server_notification_ack_1] | [[[[~ [1<=P_server_notification_1] | [P_client_request_2<=P_server_notification_1 | P_server_notification_ack_2<=1]] | [~ [1<=P_server_idle_2] | ~ [P_server_request_1_2<=0]]] | [~ [P_client_request_2<=0] & P_client_idle_2<=P_lb_load_2_1]] | 1<=P_lb_load_2_2]]] | 1<=P_lb_routing_1_2]]]]

abstracting: (1<=P_lb_routing_1_2)
states: 72
abstracting: (1<=P_lb_load_2_2)
states: 104
abstracting: (P_client_idle_2<=P_lb_load_2_1)
states: 752
abstracting: (P_client_request_2<=0)
states: 664
abstracting: (P_server_request_1_2<=0)
states: 708
abstracting: (1<=P_server_idle_2)
states: 210
abstracting: (P_server_notification_ack_2<=1)
states: 832
abstracting: (P_client_request_2<=P_server_notification_1)
states: 706
abstracting: (1<=P_server_notification_1)
states: 204
abstracting: (P_client_idle_1<=P_server_notification_ack_1)
states: 706
abstracting: (P_server_processed_2<=P_server_notification_1)
states: 680
abstracting: (1<=P_client_waiting_2)
states: 664
abstracting: (1<=P_lb_load_2_2)
states: 104
-> the formula is FALSE

FORMULA SimpleLoadBal-PT-02-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EF [[~ [P_client_idle_2<=P_server_notification_ack_2] | [~ [P_lb_load_1_2<=P_client_request_2] | [[P_lb_load_2_0<=P_lb_load_2_2 & ~ [[1<=P_lb_balancing_1 | P_client_waiting_1<=1]]] | [P_client_request_1<=1 | [[~ [P_server_notification_1<=1] | [[[P_server_processed_1<=0 & P_lb_idle_1<=1] & [P_server_notification_ack_1<=1 & P_client_request_1<=P_lb_load_2_2]] | [[1<=P_lb_routing_1_2 & P_server_request_1_2<=0] & ~ [P_lb_load_2_0<=0]]]] & [P_server_notification_ack_1<=1 & ~ [[~ [P_lb_routing_1_1<=0] & ~ [P_server_request_2_2<=P_server_request_1_2]]]]]]]]]]
normalized: E [true U [[[[[[~ [[~ [P_server_request_2_2<=P_server_request_1_2] & ~ [P_lb_routing_1_1<=0]]] & P_server_notification_ack_1<=1] & [[[~ [P_lb_load_2_0<=0] & [1<=P_lb_routing_1_2 & P_server_request_1_2<=0]] | [[P_server_notification_ack_1<=1 & P_client_request_1<=P_lb_load_2_2] & [P_server_processed_1<=0 & P_lb_idle_1<=1]]] | ~ [P_server_notification_1<=1]]] | P_client_request_1<=1] | [~ [[1<=P_lb_balancing_1 | P_client_waiting_1<=1]] & P_lb_load_2_0<=P_lb_load_2_2]] | ~ [P_lb_load_1_2<=P_client_request_2]] | ~ [P_client_idle_2<=P_server_notification_ack_2]]]

abstracting: (P_client_idle_2<=P_server_notification_ack_2)
states: 706
abstracting: (P_lb_load_1_2<=P_client_request_2)
states: 732
abstracting: (P_lb_load_2_0<=P_lb_load_2_2)
states: 556
abstracting: (P_client_waiting_1<=1)
states: 832
abstracting: (1<=P_lb_balancing_1)
states: 364
abstracting: (P_client_request_1<=1)
states: 832
abstracting: (P_server_notification_1<=1)
states: 832
abstracting: (P_lb_idle_1<=1)
states: 832
abstracting: (P_server_processed_1<=0)
states: 628
abstracting: (P_client_request_1<=P_lb_load_2_2)
states: 676
abstracting: (P_server_notification_ack_1<=1)
states: 832
abstracting: (P_server_request_1_2<=0)
states: 708
abstracting: (1<=P_lb_routing_1_2)
states: 72
abstracting: (P_lb_load_2_0<=0)
states: 556
abstracting: (P_server_notification_ack_1<=1)
states: 832
abstracting: (P_lb_routing_1_1<=0)
states: 760
abstracting: (P_server_request_2_2<=P_server_request_1_2)
states: 708
-> the formula is TRUE

FORMULA SimpleLoadBal-PT-02-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EF [[P_lb_idle_1<=P_lb_routing_1_1 | [~ [P_lb_balancing_1<=1] | ~ [[[[~ [1<=P_server_idle_1] & ~ [1<=P_client_waiting_2]] & [[[1<=P_server_waiting_2 | [1<=P_client_waiting_2 & P_client_request_2<=1]] & P_lb_routing_1_2<=P_lb_balancing_1] & P_client_waiting_2<=1]] & ~ [[[[~ [P_server_processed_2<=1] & [1<=P_server_request_2_2 & P_client_waiting_1<=0]] & [[P_lb_load_1_1<=1 & P_lb_load_1_0<=0] | [P_client_ack_2<=P_lb_load_2_2 & P_lb_load_1_2<=P_lb_balancing_1]]] & [[~ [P_client_idle_1<=P_server_notification_2] & 1<=P_server_request_1_1] & ~ [[P_lb_load_1_1<=P_client_waiting_2 | P_server_notification_2<=1]]]]]]]]]]
normalized: E [true U [[~ [[~ [[[~ [[P_lb_load_1_1<=P_client_waiting_2 | P_server_notification_2<=1]] & [~ [P_client_idle_1<=P_server_notification_2] & 1<=P_server_request_1_1]] & [[[P_client_ack_2<=P_lb_load_2_2 & P_lb_load_1_2<=P_lb_balancing_1] | [P_lb_load_1_1<=1 & P_lb_load_1_0<=0]] & [[1<=P_server_request_2_2 & P_client_waiting_1<=0] & ~ [P_server_processed_2<=1]]]]] & [[[[[1<=P_client_waiting_2 & P_client_request_2<=1] | 1<=P_server_waiting_2] & P_lb_routing_1_2<=P_lb_balancing_1] & P_client_waiting_2<=1] & [~ [1<=P_client_waiting_2] & ~ [1<=P_server_idle_1]]]]] | ~ [P_lb_balancing_1<=1]] | P_lb_idle_1<=P_lb_routing_1_1]]

abstracting: (P_lb_idle_1<=P_lb_routing_1_1)
states: 508
abstracting: (P_lb_balancing_1<=1)
states: 832
abstracting: (1<=P_server_idle_1)
states: 212
abstracting: (1<=P_client_waiting_2)
states: 664
abstracting: (P_client_waiting_2<=1)
states: 832
abstracting: (P_lb_routing_1_2<=P_lb_balancing_1)
states: 760
abstracting: (1<=P_server_waiting_2)
states: 416
abstracting: (P_client_request_2<=1)
states: 832
abstracting: (1<=P_client_waiting_2)
states: 664
abstracting: (P_server_processed_2<=1)
states: 832
abstracting: (P_client_waiting_1<=0)
states: 168
abstracting: (1<=P_server_request_2_2)
states: 124
abstracting: (P_lb_load_1_0<=0)
states: 560
abstracting: (P_lb_load_1_1<=1)
states: 832
abstracting: (P_lb_load_1_2<=P_lb_balancing_1)
states: 780
abstracting: (P_client_ack_2<=P_lb_load_2_2)
states: 676
abstracting: (1<=P_server_request_1_1)
states: 132
abstracting: (P_client_idle_1<=P_server_notification_2)
states: 706
abstracting: (P_server_notification_2<=1)
states: 832
abstracting: (P_lb_load_1_1<=P_client_waiting_2)
states: 744
-> the formula is TRUE

FORMULA SimpleLoadBal-PT-02-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: AG [[[[[1<=P_lb_load_2_2 | [~ [P_server_processed_1<=P_client_idle_1] | ~ [[~ [P_lb_load_1_2<=P_server_processed_2] | [P_lb_load_1_1<=0 & P_client_waiting_1<=P_client_ack_2]]]]] & P_lb_routing_1_2<=P_server_request_2_1] & [~ [P_server_processed_2<=P_client_request_2] | [[P_lb_load_2_1<=0 | [P_lb_load_2_1<=P_server_waiting_2 & [[[P_server_waiting_1<=0 | P_server_idle_2<=P_client_request_2] & 1<=P_client_ack_2] & [[1<=P_lb_routing_1_2 | P_server_notification_ack_1<=1] & [P_server_notification_2<=P_client_request_1 | 1<=P_client_request_2]]]]] & P_server_waiting_1<=1]]] | ~ [1<=P_lb_load_1_0]]]
normalized: ~ [E [true U ~ [[~ [1<=P_lb_load_1_0] | [[[[[[[[P_server_notification_2<=P_client_request_1 | 1<=P_client_request_2] & [1<=P_lb_routing_1_2 | P_server_notification_ack_1<=1]] & [[P_server_waiting_1<=0 | P_server_idle_2<=P_client_request_2] & 1<=P_client_ack_2]] & P_lb_load_2_1<=P_server_waiting_2] | P_lb_load_2_1<=0] & P_server_waiting_1<=1] | ~ [P_server_processed_2<=P_client_request_2]] & [[[~ [[[P_lb_load_1_1<=0 & P_client_waiting_1<=P_client_ack_2] | ~ [P_lb_load_1_2<=P_server_processed_2]]] | ~ [P_server_processed_1<=P_client_idle_1]] | 1<=P_lb_load_2_2] & P_lb_routing_1_2<=P_server_request_2_1]]]]]]

abstracting: (P_lb_routing_1_2<=P_server_request_2_1)
states: 760
abstracting: (1<=P_lb_load_2_2)
states: 104
abstracting: (P_server_processed_1<=P_client_idle_1)
states: 670
abstracting: (P_lb_load_1_2<=P_server_processed_2)
states: 754
abstracting: (P_client_waiting_1<=P_client_ack_2)
states: 304
abstracting: (P_lb_load_1_1<=0)
states: 384
abstracting: (P_server_processed_2<=P_client_request_2)
states: 668
abstracting: (P_server_waiting_1<=1)
states: 832
abstracting: (P_lb_load_2_1<=0)
states: 380
abstracting: (P_lb_load_2_1<=P_server_waiting_2)
states: 606
abstracting: (1<=P_client_ack_2)
states: 168
abstracting: (P_server_idle_2<=P_client_request_2)
states: 664
abstracting: (P_server_waiting_1<=0)
states: 416
abstracting: (P_server_notification_ack_1<=1)
states: 832
abstracting: (1<=P_lb_routing_1_2)
states: 72
abstracting: (1<=P_client_request_2)
states: 168
abstracting: (P_server_notification_2<=P_client_request_1)
states: 668
abstracting: (1<=P_lb_load_1_0)
states: 272
-> the formula is FALSE

FORMULA SimpleLoadBal-PT-02-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: EF [~ [[[[[~ [[[1<=P_server_idle_1 & [P_server_request_2_1<=P_lb_idle_1 | 1<=P_server_notification_ack_2]] | [~ [P_client_waiting_1<=0] & 1<=P_client_idle_1]]] & ~ [P_lb_load_2_1<=0]] & [1<=P_server_processed_2 & [~ [[P_server_request_2_2<=P_server_idle_1 | ~ [P_lb_load_1_2<=1]]] & [~ [[1<=P_server_idle_1 | P_server_notification_2<=P_lb_load_1_0]] & [[1<=P_client_idle_1 | P_lb_balancing_1<=P_lb_routing_1_2] & [P_lb_balancing_1<=1 | 1<=P_lb_load_2_1]]]]]] & ~ [[[[~ [[P_lb_routing_1_2<=0 & P_lb_load_1_1<=1]] | [P_client_ack_2<=P_lb_load_2_1 | [P_server_request_2_1<=0 | 1<=P_lb_load_2_2]]] & ~ [P_lb_load_2_1<=P_lb_load_2_2]] & [[~ [P_server_request_2_1<=P_server_processed_1] | ~ [[1<=P_server_waiting_1 & 1<=P_server_request_2_2]]] & [~ [[1<=P_client_request_1 & 1<=P_lb_routing_1_1]] | ~ [[1<=P_client_idle_2 & 1<=P_lb_load_1_0]]]]]]] | ~ [P_client_ack_1<=0]]]]
normalized: E [true U ~ [[~ [P_client_ack_1<=0] | [~ [[[[~ [[1<=P_client_idle_2 & 1<=P_lb_load_1_0]] | ~ [[1<=P_client_request_1 & 1<=P_lb_routing_1_1]]] & [~ [[1<=P_server_waiting_1 & 1<=P_server_request_2_2]] | ~ [P_server_request_2_1<=P_server_processed_1]]] & [~ [P_lb_load_2_1<=P_lb_load_2_2] & [[[P_server_request_2_1<=0 | 1<=P_lb_load_2_2] | P_client_ack_2<=P_lb_load_2_1] | ~ [[P_lb_routing_1_2<=0 & P_lb_load_1_1<=1]]]]]] & [[[[[[P_lb_balancing_1<=1 | 1<=P_lb_load_2_1] & [1<=P_client_idle_1 | P_lb_balancing_1<=P_lb_routing_1_2]] & ~ [[1<=P_server_idle_1 | P_server_notification_2<=P_lb_load_1_0]]] & ~ [[~ [P_lb_load_1_2<=1] | P_server_request_2_2<=P_server_idle_1]]] & 1<=P_server_processed_2] & [~ [P_lb_load_2_1<=0] & ~ [[[~ [P_client_waiting_1<=0] & 1<=P_client_idle_1] | [[P_server_request_2_1<=P_lb_idle_1 | 1<=P_server_notification_ack_2] & 1<=P_server_idle_1]]]]]]]]]

abstracting: (1<=P_server_idle_1)
states: 212
abstracting: (1<=P_server_notification_ack_2)
states: 210
abstracting: (P_server_request_2_1<=P_lb_idle_1)
states: 756
abstracting: (1<=P_client_idle_1)
states: 168
abstracting: (P_client_waiting_1<=0)
states: 168
abstracting: (P_lb_load_2_1<=0)
states: 380
abstracting: (1<=P_server_processed_2)
states: 206
abstracting: (P_server_request_2_2<=P_server_idle_1)
states: 736
abstracting: (P_lb_load_1_2<=1)
states: 832
abstracting: (P_server_notification_2<=P_lb_load_1_0)
states: 686
abstracting: (1<=P_server_idle_1)
states: 212
abstracting: (P_lb_balancing_1<=P_lb_routing_1_2)
states: 468
abstracting: (1<=P_client_idle_1)
states: 168
abstracting: (1<=P_lb_load_2_1)
states: 452
abstracting: (P_lb_balancing_1<=1)
states: 832
abstracting: (P_lb_load_1_1<=1)
states: 832
abstracting: (P_lb_routing_1_2<=0)
states: 760
abstracting: (P_client_ack_2<=P_lb_load_2_1)
states: 752
abstracting: (1<=P_lb_load_2_2)
states: 104
abstracting: (P_server_request_2_1<=0)
states: 700
abstracting: (P_lb_load_2_1<=P_lb_load_2_2)
states: 380
abstracting: (P_server_request_2_1<=P_server_processed_1)
states: 726
abstracting: (1<=P_server_request_2_2)
states: 124
abstracting: (1<=P_server_waiting_1)
states: 416
abstracting: (1<=P_lb_routing_1_1)
states: 72
abstracting: (1<=P_client_request_1)
states: 168
abstracting: (1<=P_lb_load_1_0)
states: 272
abstracting: (1<=P_client_idle_2)
states: 168
abstracting: (P_client_ack_1<=0)
states: 664
-> the formula is TRUE

FORMULA SimpleLoadBal-PT-02-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: EF [[~ [[P_server_processed_1<=1 & [[~ [[~ [[P_server_waiting_1<=1 | P_server_notification_ack_2<=1]] | ~ [P_server_notification_1<=1]]] | [P_client_ack_1<=1 | 1<=P_lb_balancing_1]] & [~ [[[P_server_processed_2<=P_lb_routing_1_1 | P_server_request_2_1<=P_lb_load_2_0] & [P_server_notification_ack_1<=P_lb_routing_1_1 & P_lb_routing_1_2<=P_lb_idle_1]]] & [~ [P_server_request_1_2<=P_server_waiting_2] & [[~ [1<=P_client_ack_2] & 1<=P_client_ack_1] | ~ [P_server_request_1_1<=0]]]]]]] & ~ [[[[~ [[[[P_server_request_1_1<=P_lb_balancing_1 | P_server_processed_1<=P_server_processed_2] | P_server_notification_2<=0] & [[1<=P_lb_load_1_0 & 1<=P_lb_load_2_1] | ~ [P_client_waiting_1<=0]]]] | [[~ [1<=P_lb_routing_1_2] | [[P_server_waiting_1<=P_lb_load_2_0 & P_lb_load_1_0<=1] & ~ [1<=P_client_idle_1]]] & [~ [P_server_request_1_2<=P_server_notification_2] | [P_server_processed_1<=0 | P_lb_load_2_1<=0]]]] & ~ [P_server_idle_1<=0]] | 1<=P_client_idle_1]]]]
normalized: E [true U [~ [[[~ [P_server_idle_1<=0] & [[[[P_server_processed_1<=0 | P_lb_load_2_1<=0] | ~ [P_server_request_1_2<=P_server_notification_2]] & [[~ [1<=P_client_idle_1] & [P_server_waiting_1<=P_lb_load_2_0 & P_lb_load_1_0<=1]] | ~ [1<=P_lb_routing_1_2]]] | ~ [[[~ [P_client_waiting_1<=0] | [1<=P_lb_load_1_0 & 1<=P_lb_load_2_1]] & [[P_server_request_1_1<=P_lb_balancing_1 | P_server_processed_1<=P_server_processed_2] | P_server_notification_2<=0]]]]] | 1<=P_client_idle_1]] & ~ [[[[[[~ [P_server_request_1_1<=0] | [~ [1<=P_client_ack_2] & 1<=P_client_ack_1]] & ~ [P_server_request_1_2<=P_server_waiting_2]] & ~ [[[P_server_notification_ack_1<=P_lb_routing_1_1 & P_lb_routing_1_2<=P_lb_idle_1] & [P_server_processed_2<=P_lb_routing_1_1 | P_server_request_2_1<=P_lb_load_2_0]]]] & [[P_client_ack_1<=1 | 1<=P_lb_balancing_1] | ~ [[~ [P_server_notification_1<=1] | ~ [[P_server_waiting_1<=1 | P_server_notification_ack_2<=1]]]]]] & P_server_processed_1<=1]]]]

abstracting: (P_server_processed_1<=1)
states: 832
abstracting: (P_server_notification_ack_2<=1)
states: 832
abstracting: (P_server_waiting_1<=1)
states: 832
abstracting: (P_server_notification_1<=1)
states: 832
abstracting: (1<=P_lb_balancing_1)
states: 364
abstracting: (P_client_ack_1<=1)
states: 832
abstracting: (P_server_request_2_1<=P_lb_load_2_0)
states: 744
abstracting: (P_server_processed_2<=P_lb_routing_1_1)
states: 644
abstracting: (P_lb_routing_1_2<=P_lb_idle_1)
states: 760
abstracting: (P_server_notification_ack_1<=P_lb_routing_1_1)
states: 638
abstracting: (P_server_request_1_2<=P_server_waiting_2)
states: 770
abstracting: (1<=P_client_ack_1)
states: 168
abstracting: (1<=P_client_ack_2)
states: 168
abstracting: (P_server_request_1_1<=0)
states: 700
abstracting: (1<=P_client_idle_1)
states: 168
abstracting: (P_server_notification_2<=0)
states: 626
abstracting: (P_server_processed_1<=P_server_processed_2)
states: 682
abstracting: (P_server_request_1_1<=P_lb_balancing_1)
states: 764
abstracting: (1<=P_lb_load_2_1)
states: 452
abstracting: (1<=P_lb_load_1_0)
states: 272
abstracting: (P_client_waiting_1<=0)
states: 168
abstracting: (1<=P_lb_routing_1_2)
states: 72
abstracting: (P_lb_load_1_0<=1)
states: 832
abstracting: (P_server_waiting_1<=P_lb_load_2_0)
states: 554
abstracting: (1<=P_client_idle_1)
states: 168
abstracting: (P_server_request_1_2<=P_server_notification_2)
states: 734
abstracting: (P_lb_load_2_1<=0)
states: 380
abstracting: (P_server_processed_1<=0)
states: 628
abstracting: (P_server_idle_1<=0)
states: 620
-> the formula is TRUE

FORMULA SimpleLoadBal-PT-02-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: AG [[[[~ [[[[~ [[P_lb_routing_1_2<=P_client_ack_1 & P_lb_load_1_0<=P_lb_load_2_1]] | [[1<=P_client_request_1 | 1<=P_client_waiting_2] | P_server_notification_ack_1<=1]] | 1<=P_lb_load_1_0] | P_server_notification_1<=P_lb_load_2_0]] | P_server_request_2_2<=P_lb_load_2_0] | 1<=P_server_processed_1] & ~ [[[[~ [[P_server_waiting_2<=P_client_idle_1 | ~ [1<=P_server_notification_1]]] | [[[~ [P_server_idle_1<=0] | [P_server_waiting_2<=1 & 1<=P_lb_load_1_1]] | [[P_server_notification_2<=P_lb_balancing_1 | 1<=P_lb_load_1_1] | [1<=P_server_request_1_1 & P_server_request_2_1<=P_server_notification_ack_1]]] & P_server_idle_2<=P_lb_routing_1_2]] & [[[P_lb_routing_1_2<=P_client_idle_1 | ~ [[P_client_idle_1<=1 | P_lb_balancing_1<=P_client_ack_1]]] & 1<=P_lb_load_2_2] & [[[~ [1<=P_client_waiting_2] & P_lb_load_1_1<=0] & P_server_processed_1<=P_server_notification_2] & P_server_request_2_2<=P_client_request_2]]] & [~ [[[[1<=P_server_waiting_1 | [P_server_waiting_2<=P_server_processed_1 | 1<=P_client_waiting_1]] & P_client_waiting_2<=P_server_request_2_2] & ~ [P_client_idle_2<=P_server_idle_2]]] | [~ [[[[1<=P_client_ack_2 | 1<=P_server_waiting_2] & [1<=P_server_notification_ack_2 & P_server_request_2_1<=1]] | [P_lb_load_2_0<=0 | [P_client_idle_2<=P_server_waiting_1 & P_server_notification_ack_1<=0]]]] | [~ [[P_server_processed_1<=1 | P_server_notification_2<=P_lb_load_2_0]] & ~ [1<=P_server_waiting_1]]]]]]]]
normalized: ~ [E [true U ~ [[~ [[[[[~ [1<=P_server_waiting_1] & ~ [[P_server_processed_1<=1 | P_server_notification_2<=P_lb_load_2_0]]] | ~ [[[[P_client_idle_2<=P_server_waiting_1 & P_server_notification_ack_1<=0] | P_lb_load_2_0<=0] | [[1<=P_server_notification_ack_2 & P_server_request_2_1<=1] & [1<=P_client_ack_2 | 1<=P_server_waiting_2]]]]] | ~ [[~ [P_client_idle_2<=P_server_idle_2] & [[[P_server_waiting_2<=P_server_processed_1 | 1<=P_client_waiting_1] | 1<=P_server_waiting_1] & P_client_waiting_2<=P_server_request_2_2]]]] & [[[P_server_request_2_2<=P_client_request_2 & [P_server_processed_1<=P_server_notification_2 & [P_lb_load_1_1<=0 & ~ [1<=P_client_waiting_2]]]] & [1<=P_lb_load_2_2 & [P_lb_routing_1_2<=P_client_idle_1 | ~ [[P_client_idle_1<=1 | P_lb_balancing_1<=P_client_ack_1]]]]] & [[P_server_idle_2<=P_lb_routing_1_2 & [[[1<=P_server_request_1_1 & P_server_request_2_1<=P_server_notification_ack_1] | [P_server_notification_2<=P_lb_balancing_1 | 1<=P_lb_load_1_1]] | [[P_server_waiting_2<=1 & 1<=P_lb_load_1_1] | ~ [P_server_idle_1<=0]]]] | ~ [[P_server_waiting_2<=P_client_idle_1 | ~ [1<=P_server_notification_1]]]]]]] & [1<=P_server_processed_1 | [P_server_request_2_2<=P_lb_load_2_0 | ~ [[P_server_notification_1<=P_lb_load_2_0 | [1<=P_lb_load_1_0 | [[P_server_notification_ack_1<=1 | [1<=P_client_request_1 | 1<=P_client_waiting_2]] | ~ [[P_lb_routing_1_2<=P_client_ack_1 & P_lb_load_1_0<=P_lb_load_2_1]]]]]]]]]]]]

abstracting: (P_lb_load_1_0<=P_lb_load_2_1)
states: 712
abstracting: (P_lb_routing_1_2<=P_client_ack_1)
states: 776
abstracting: (1<=P_client_waiting_2)
states: 664
abstracting: (1<=P_client_request_1)
states: 168
abstracting: (P_server_notification_ack_1<=1)
states: 832
abstracting: (1<=P_lb_load_1_0)
states: 272
abstracting: (P_server_notification_1<=P_lb_load_2_0)
states: 688
abstracting: (P_server_request_2_2<=P_lb_load_2_0)
states: 708
abstracting: (1<=P_server_processed_1)
states: 204
abstracting: (1<=P_server_notification_1)
states: 204
abstracting: (P_server_waiting_2<=P_client_idle_1)
states: 500
abstracting: (P_server_idle_1<=0)
states: 620
abstracting: (1<=P_lb_load_1_1)
states: 448
abstracting: (P_server_waiting_2<=1)
states: 832
abstracting: (1<=P_lb_load_1_1)
states: 448
abstracting: (P_server_notification_2<=P_lb_balancing_1)
states: 714
abstracting: (P_server_request_2_1<=P_server_notification_ack_1)
states: 740
abstracting: (1<=P_server_request_1_1)
states: 132
abstracting: (P_server_idle_2<=P_lb_routing_1_2)
states: 640
abstracting: (P_lb_balancing_1<=P_client_ack_1)
states: 548
abstracting: (P_client_idle_1<=1)
states: 832
abstracting: (P_lb_routing_1_2<=P_client_idle_1)
states: 776
abstracting: (1<=P_lb_load_2_2)
states: 104
abstracting: (1<=P_client_waiting_2)
states: 664
abstracting: (P_lb_load_1_1<=0)
states: 384
abstracting: (P_server_processed_1<=P_server_notification_2)
states: 682
abstracting: (P_server_request_2_2<=P_client_request_2)
states: 708
abstracting: (P_client_waiting_2<=P_server_request_2_2)
states: 292
abstracting: (1<=P_server_waiting_1)
states: 416
abstracting: (1<=P_client_waiting_1)
states: 664
abstracting: (P_server_waiting_2<=P_server_processed_1)
states: 518
abstracting: (P_client_idle_2<=P_server_idle_2)
states: 706
abstracting: (1<=P_server_waiting_2)
states: 416
abstracting: (1<=P_client_ack_2)
states: 168
abstracting: (P_server_request_2_1<=1)
states: 832
abstracting: (1<=P_server_notification_ack_2)
states: 210
abstracting: (P_lb_load_2_0<=0)
states: 556
abstracting: (P_server_notification_ack_1<=0)
states: 620
abstracting: (P_client_idle_2<=P_server_waiting_1)
states: 748
abstracting: (P_server_notification_2<=P_lb_load_2_0)
states: 626
abstracting: (P_server_processed_1<=1)
states: 832
abstracting: (1<=P_server_waiting_1)
states: 416
-> the formula is FALSE

FORMULA SimpleLoadBal-PT-02-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: EF [[[[[~ [P_server_request_1_2<=P_lb_balancing_1] & P_client_idle_2<=P_server_request_2_2] | [[[[1<=P_lb_routing_1_1 & [[P_client_request_2<=P_client_waiting_2 | 1<=P_lb_load_1_2] & [P_client_request_1<=0 & P_client_idle_1<=0]]] & ~ [P_lb_load_1_2<=P_client_idle_2]] | [~ [[~ [1<=P_server_idle_2] & ~ [1<=P_client_waiting_1]]] | [[[P_server_waiting_1<=1 | P_server_idle_2<=1] & [P_lb_balancing_1<=0 & P_server_notification_ack_2<=0]] & P_lb_routing_1_2<=1]]] | [[~ [[[1<=P_lb_load_1_2 & 1<=P_server_notification_1] | [P_client_idle_2<=P_server_request_2_2 & P_server_notification_1<=P_server_idle_2]]] | [[[P_server_processed_2<=1 | 1<=P_server_notification_2] & [P_client_request_1<=P_server_idle_2 | P_client_request_1<=P_server_notification_1]] & [~ [1<=P_lb_load_2_2] | P_lb_balancing_1<=0]]] & ~ [[[~ [P_server_idle_2<=1] & 1<=P_server_request_1_1] | [[1<=P_lb_load_2_1 & 1<=P_lb_load_2_1] & [P_lb_routing_1_1<=P_server_notification_ack_2 | P_client_idle_2<=P_server_notification_ack_2]]]]]]] | [~ [[[[1<=P_client_waiting_2 & [[P_server_processed_2<=0 & 1<=P_lb_idle_1] | [P_lb_load_2_0<=0 & P_server_request_1_1<=P_server_notification_ack_1]]] | P_client_waiting_2<=0] & P_client_idle_1<=P_client_request_1]] & [~ [[~ [1<=P_lb_load_2_2] | P_server_idle_2<=P_server_waiting_1]] & ~ [[P_server_processed_1<=0 | 1<=P_lb_load_2_0]]]]] & ~ [[~ [[[~ [1<=P_client_idle_2] | P_client_request_2<=1] & [[[1<=P_client_ack_2 | ~ [P_lb_balancing_1<=P_server_notification_1]] & [[1<=P_lb_load_2_1 & 1<=P_lb_load_1_0] | [P_lb_load_1_1<=P_lb_idle_1 & P_server_idle_1<=1]]] | ~ [1<=P_server_notification_2]]]] | [~ [1<=P_lb_load_2_1] | [P_server_request_2_2<=P_client_waiting_2 | [P_client_waiting_2<=P_lb_load_2_0 | P_client_waiting_1<=0]]]]]]]
normalized: E [true U [~ [[[[P_server_request_2_2<=P_client_waiting_2 | [P_client_waiting_2<=P_lb_load_2_0 | P_client_waiting_1<=0]] | ~ [1<=P_lb_load_2_1]] | ~ [[[~ [1<=P_server_notification_2] | [[[P_lb_load_1_1<=P_lb_idle_1 & P_server_idle_1<=1] | [1<=P_lb_load_2_1 & 1<=P_lb_load_1_0]] & [1<=P_client_ack_2 | ~ [P_lb_balancing_1<=P_server_notification_1]]]] & [P_client_request_2<=1 | ~ [1<=P_client_idle_2]]]]]] & [[[~ [[P_server_processed_1<=0 | 1<=P_lb_load_2_0]] & ~ [[P_server_idle_2<=P_server_waiting_1 | ~ [1<=P_lb_load_2_2]]]] & ~ [[P_client_idle_1<=P_client_request_1 & [P_client_waiting_2<=0 | [1<=P_client_waiting_2 & [[P_lb_load_2_0<=0 & P_server_request_1_1<=P_server_notification_ack_1] | [P_server_processed_2<=0 & 1<=P_lb_idle_1]]]]]]] | [[[~ [[[[P_lb_routing_1_1<=P_server_notification_ack_2 | P_client_idle_2<=P_server_notification_ack_2] & [1<=P_lb_load_2_1 & 1<=P_lb_load_2_1]] | [1<=P_server_request_1_1 & ~ [P_server_idle_2<=1]]]] & [[[P_lb_balancing_1<=0 | ~ [1<=P_lb_load_2_2]] & [[P_client_request_1<=P_server_idle_2 | P_client_request_1<=P_server_notification_1] & [P_server_processed_2<=1 | 1<=P_server_notification_2]]] | ~ [[[P_client_idle_2<=P_server_request_2_2 & P_server_notification_1<=P_server_idle_2] | [1<=P_lb_load_1_2 & 1<=P_server_notification_1]]]]] | [[[P_lb_routing_1_2<=1 & [[P_lb_balancing_1<=0 & P_server_notification_ack_2<=0] & [P_server_waiting_1<=1 | P_server_idle_2<=1]]] | ~ [[~ [1<=P_client_waiting_1] & ~ [1<=P_server_idle_2]]]] | [~ [P_lb_load_1_2<=P_client_idle_2] & [1<=P_lb_routing_1_1 & [[P_client_request_1<=0 & P_client_idle_1<=0] & [P_client_request_2<=P_client_waiting_2 | 1<=P_lb_load_1_2]]]]]] | [P_client_idle_2<=P_server_request_2_2 & ~ [P_server_request_1_2<=P_lb_balancing_1]]]]]]

abstracting: (P_server_request_1_2<=P_lb_balancing_1)
states: 768
abstracting: (P_client_idle_2<=P_server_request_2_2)
states: 664
abstracting: (1<=P_lb_load_1_2)
states: 112
abstracting: (P_client_request_2<=P_client_waiting_2)
states: 832
abstracting: (P_client_idle_1<=0)
states: 664
abstracting: (P_client_request_1<=0)
states: 664
abstracting: (1<=P_lb_routing_1_1)
states: 72
abstracting: (P_lb_load_1_2<=P_client_idle_2)
states: 732
abstracting: (1<=P_server_idle_2)
states: 210
abstracting: (1<=P_client_waiting_1)
states: 664
abstracting: (P_server_idle_2<=1)
states: 832
abstracting: (P_server_waiting_1<=1)
states: 832
abstracting: (P_server_notification_ack_2<=0)
states: 622
abstracting: (P_lb_balancing_1<=0)
states: 468
abstracting: (P_lb_routing_1_2<=1)
states: 832
abstracting: (1<=P_server_notification_1)
states: 204
abstracting: (1<=P_lb_load_1_2)
states: 112
abstracting: (P_server_notification_1<=P_server_idle_2)
states: 676
abstracting: (P_client_idle_2<=P_server_request_2_2)
states: 664
abstracting: (1<=P_server_notification_2)
states: 206
abstracting: (P_server_processed_2<=1)
states: 832
abstracting: (P_client_request_1<=P_server_notification_1)
states: 706
abstracting: (P_client_request_1<=P_server_idle_2)
states: 706
abstracting: (1<=P_lb_load_2_2)
states: 104
abstracting: (P_lb_balancing_1<=0)
states: 468
abstracting: (P_server_idle_2<=1)
states: 832
abstracting: (1<=P_server_request_1_1)
states: 132
abstracting: (1<=P_lb_load_2_1)
states: 452
abstracting: (1<=P_lb_load_2_1)
states: 452
abstracting: (P_client_idle_2<=P_server_notification_ack_2)
states: 706
abstracting: (P_lb_routing_1_1<=P_server_notification_ack_2)
states: 778
abstracting: (1<=P_lb_idle_1)
states: 324
abstracting: (P_server_processed_2<=0)
states: 626
abstracting: (P_server_request_1_1<=P_server_notification_ack_1)
states: 740
abstracting: (P_lb_load_2_0<=0)
states: 556
abstracting: (1<=P_client_waiting_2)
states: 664
abstracting: (P_client_waiting_2<=0)
states: 168
abstracting: (P_client_idle_1<=P_client_request_1)
states: 664
abstracting: (1<=P_lb_load_2_2)
states: 104
abstracting: (P_server_idle_2<=P_server_waiting_1)
states: 727
abstracting: (1<=P_lb_load_2_0)
states: 276
abstracting: (P_server_processed_1<=0)
states: 628
abstracting: (1<=P_client_idle_2)
states: 168
abstracting: (P_client_request_2<=1)
states: 832
abstracting: (P_lb_balancing_1<=P_server_notification_1)
states: 556
abstracting: (1<=P_client_ack_2)
states: 168
abstracting: (1<=P_lb_load_1_0)
states: 272
abstracting: (1<=P_lb_load_2_1)
states: 452
abstracting: (P_server_idle_1<=1)
states: 832
abstracting: (P_lb_load_1_1<=P_lb_idle_1)
states: 568
abstracting: (1<=P_server_notification_2)
states: 206
abstracting: (1<=P_lb_load_2_1)
states: 452
abstracting: (P_client_waiting_1<=0)
states: 168
abstracting: (P_client_waiting_2<=P_lb_load_2_0)
states: 376
abstracting: (P_server_request_2_2<=P_client_waiting_2)
states: 832
-> the formula is FALSE

FORMULA SimpleLoadBal-PT-02-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: AG [[[~ [[[[~ [[P_server_request_1_1<=P_lb_load_1_1 | ~ [P_lb_idle_1<=1]]] & [~ [[P_client_request_2<=1 & P_server_request_2_1<=P_lb_balancing_1]] | ~ [P_client_request_1<=P_client_request_2]]] | [[[[P_server_request_1_1<=P_server_notification_ack_2 | P_server_notification_ack_2<=P_server_notification_ack_2] & 1<=P_server_request_1_1] | ~ [[1<=P_lb_routing_1_2 & P_server_request_1_2<=0]]] | [P_lb_balancing_1<=0 | P_server_waiting_1<=1]]] & [1<=P_lb_routing_1_1 | P_lb_load_2_1<=1]]] & [[[~ [1<=P_client_idle_2] | 1<=P_client_ack_1] & [~ [[[P_server_request_1_1<=1 | P_server_notification_2<=P_server_request_1_2] & ~ [P_client_ack_2<=0]]] | [P_server_request_1_2<=P_server_request_2_1 & [[[1<=P_client_idle_2 | P_lb_routing_1_2<=0] | ~ [P_client_ack_1<=1]] | 1<=P_client_request_2]]]] & [[[P_server_notification_ack_1<=P_client_waiting_1 | [~ [1<=P_client_ack_1] | ~ [[P_lb_load_1_2<=0 & 1<=P_server_request_1_2]]]] | ~ [[[[P_server_notification_1<=P_server_request_1_2 & 1<=P_lb_load_1_2] & ~ [P_server_request_1_1<=P_client_request_2]] | [[P_server_idle_1<=P_lb_balancing_1 & P_server_processed_2<=0] & 1<=P_client_request_2]]]] | [[~ [P_lb_load_2_0<=P_lb_load_1_0] | [[[P_server_processed_2<=0 | 1<=P_lb_balancing_1] & [P_client_ack_1<=P_server_request_2_2 & P_lb_load_2_1<=P_server_notification_ack_1]] | [~ [P_lb_routing_1_2<=P_server_request_1_2] | [P_server_request_2_1<=1 | P_lb_load_1_1<=0]]]] | 1<=P_lb_load_2_2]]]] | [[[[P_lb_load_1_2<=0 | P_lb_load_1_1<=P_server_idle_1] | ~ [P_server_request_1_2<=P_lb_balancing_1]] | ~ [[~ [P_lb_load_1_2<=1] | [P_server_waiting_1<=0 | [[[P_lb_load_2_2<=0 | P_client_request_2<=P_server_processed_2] | [P_lb_load_1_1<=P_server_request_1_1 | 1<=P_server_processed_1]] & 1<=P_server_notification_1]]]]] & [[P_lb_load_2_0<=P_lb_load_2_1 | [P_lb_load_2_1<=P_client_waiting_2 | ~ [[[P_lb_load_1_1<=P_lb_routing_1_2 | [1<=P_server_waiting_2 & 1<=P_server_request_1_2]] | [[1<=P_lb_load_2_0 & P_client_request_2<=1] | [P_server_request_2_1<=P_server_request_2_2 | 1<=P_lb_load_2_1]]]]]] & [~ [[~ [P_server_request_1_2<=0] & ~ [P_client_ack_2<=P_client_request_2]]] & [[P_lb_load_2_1<=1 | P_lb_load_2_2<=1] | 1<=P_lb_load_2_2]]]]]]
normalized: ~ [E [true U ~ [[[[[~ [[~ [P_server_request_1_2<=0] & ~ [P_client_ack_2<=P_client_request_2]]] & [1<=P_lb_load_2_2 | [P_lb_load_2_1<=1 | P_lb_load_2_2<=1]]] & [P_lb_load_2_0<=P_lb_load_2_1 | [P_lb_load_2_1<=P_client_waiting_2 | ~ [[[[P_server_request_2_1<=P_server_request_2_2 | 1<=P_lb_load_2_1] | [1<=P_lb_load_2_0 & P_client_request_2<=1]] | [P_lb_load_1_1<=P_lb_routing_1_2 | [1<=P_server_waiting_2 & 1<=P_server_request_1_2]]]]]]] & [~ [[[P_server_waiting_1<=0 | [1<=P_server_notification_1 & [[P_lb_load_2_2<=0 | P_client_request_2<=P_server_processed_2] | [P_lb_load_1_1<=P_server_request_1_1 | 1<=P_server_processed_1]]]] | ~ [P_lb_load_1_2<=1]]] | [~ [P_server_request_1_2<=P_lb_balancing_1] | [P_lb_load_1_2<=0 | P_lb_load_1_1<=P_server_idle_1]]]] | [[[[1<=P_lb_load_2_2 | [[[[P_server_processed_2<=0 | 1<=P_lb_balancing_1] & [P_client_ack_1<=P_server_request_2_2 & P_lb_load_2_1<=P_server_notification_ack_1]] | [[P_server_request_2_1<=1 | P_lb_load_1_1<=0] | ~ [P_lb_routing_1_2<=P_server_request_1_2]]] | ~ [P_lb_load_2_0<=P_lb_load_1_0]]] | [~ [[[1<=P_client_request_2 & [P_server_idle_1<=P_lb_balancing_1 & P_server_processed_2<=0]] | [~ [P_server_request_1_1<=P_client_request_2] & [P_server_notification_1<=P_server_request_1_2 & 1<=P_lb_load_1_2]]]] | [P_server_notification_ack_1<=P_client_waiting_1 | [~ [[P_lb_load_1_2<=0 & 1<=P_server_request_1_2]] | ~ [1<=P_client_ack_1]]]]] & [[[P_server_request_1_2<=P_server_request_2_1 & [1<=P_client_request_2 | [~ [P_client_ack_1<=1] | [1<=P_client_idle_2 | P_lb_routing_1_2<=0]]]] | ~ [[~ [P_client_ack_2<=0] & [P_server_request_1_1<=1 | P_server_notification_2<=P_server_request_1_2]]]] & [1<=P_client_ack_1 | ~ [1<=P_client_idle_2]]]] & ~ [[[1<=P_lb_routing_1_1 | P_lb_load_2_1<=1] & [[[P_lb_balancing_1<=0 | P_server_waiting_1<=1] | [~ [[1<=P_lb_routing_1_2 & P_server_request_1_2<=0]] | [1<=P_server_request_1_1 & [P_server_request_1_1<=P_server_notification_ack_2 | P_server_notification_ack_2<=P_server_notification_ack_2]]]] | [[~ [P_client_request_1<=P_client_request_2] | ~ [[P_client_request_2<=1 & P_server_request_2_1<=P_lb_balancing_1]]] & ~ [[P_server_request_1_1<=P_lb_load_1_1 | ~ [P_lb_idle_1<=1]]]]]]]]]]]]

abstracting: (P_lb_idle_1<=1)
states: 832
abstracting: (P_server_request_1_1<=P_lb_load_1_1)
states: 772
abstracting: (P_server_request_2_1<=P_lb_balancing_1)
states: 764
abstracting: (P_client_request_2<=1)
states: 832
abstracting: (P_client_request_1<=P_client_request_2)
states: 696
abstracting: (P_server_notification_ack_2<=P_server_notification_ack_2)
states: 832
abstracting: (P_server_request_1_1<=P_server_notification_ack_2)
states: 730
abstracting: (1<=P_server_request_1_1)
states: 132
abstracting: (P_server_request_1_2<=0)
states: 708
abstracting: (1<=P_lb_routing_1_2)
states: 72
abstracting: (P_server_waiting_1<=1)
states: 832
abstracting: (P_lb_balancing_1<=0)
states: 468
abstracting: (P_lb_load_2_1<=1)
states: 832
abstracting: (1<=P_lb_routing_1_1)
states: 72
abstracting: (1<=P_client_idle_2)
states: 168
abstracting: (1<=P_client_ack_1)
states: 168
abstracting: (P_server_notification_2<=P_server_request_1_2)
states: 652
abstracting: (P_server_request_1_1<=1)
states: 832
abstracting: (P_client_ack_2<=0)
states: 664
abstracting: (P_lb_routing_1_2<=0)
states: 760
abstracting: (1<=P_client_idle_2)
states: 168
abstracting: (P_client_ack_1<=1)
states: 832
abstracting: (1<=P_client_request_2)
states: 168
abstracting: (P_server_request_1_2<=P_server_request_2_1)
states: 736
abstracting: (1<=P_client_ack_1)
states: 168
abstracting: (1<=P_server_request_1_2)
states: 124
abstracting: (P_lb_load_1_2<=0)
states: 720
abstracting: (P_server_notification_ack_1<=P_client_waiting_1)
states: 790
abstracting: (1<=P_lb_load_1_2)
states: 112
abstracting: (P_server_notification_1<=P_server_request_1_2)
states: 662
abstracting: (P_server_request_1_1<=P_client_request_2)
states: 728
abstracting: (P_server_processed_2<=0)
states: 626
abstracting: (P_server_idle_1<=P_lb_balancing_1)
states: 714
abstracting: (1<=P_client_request_2)
states: 168
abstracting: (P_lb_load_2_0<=P_lb_load_1_0)
states: 652
abstracting: (P_lb_routing_1_2<=P_server_request_1_2)
states: 772
abstracting: (P_lb_load_1_1<=0)
states: 384
abstracting: (P_server_request_2_1<=1)
states: 832
abstracting: (P_lb_load_2_1<=P_server_notification_ack_1)
states: 494
abstracting: (P_client_ack_1<=P_server_request_2_2)
states: 692
abstracting: (1<=P_lb_balancing_1)
states: 364
abstracting: (P_server_processed_2<=0)
states: 626
abstracting: (1<=P_lb_load_2_2)
states: 104
abstracting: (P_lb_load_1_1<=P_server_idle_1)
states: 456
abstracting: (P_lb_load_1_2<=0)
states: 720
abstracting: (P_server_request_1_2<=P_lb_balancing_1)
states: 768
abstracting: (P_lb_load_1_2<=1)
states: 832
abstracting: (1<=P_server_processed_1)
states: 204
abstracting: (P_lb_load_1_1<=P_server_request_1_1)
states: 456
abstracting: (P_client_request_2<=P_server_processed_2)
states: 706
abstracting: (P_lb_load_2_2<=0)
states: 728
abstracting: (1<=P_server_notification_1)
states: 204
abstracting: (P_server_waiting_1<=0)
states: 416
abstracting: (1<=P_server_request_1_2)
states: 124
abstracting: (1<=P_server_waiting_2)
states: 416
abstracting: (P_lb_load_1_1<=P_lb_routing_1_2)
states: 424
abstracting: (P_client_request_2<=1)
states: 832
abstracting: (1<=P_lb_load_2_0)
states: 276
abstracting: (1<=P_lb_load_2_1)
states: 452
abstracting: (P_server_request_2_1<=P_server_request_2_2)
states: 700
abstracting: (P_lb_load_2_1<=P_client_waiting_2)
states: 744
abstracting: (P_lb_load_2_0<=P_lb_load_2_1)
states: 556
abstracting: (P_lb_load_2_2<=1)
states: 832
abstracting: (P_lb_load_2_1<=1)
states: 832
abstracting: (1<=P_lb_load_2_2)
states: 104
abstracting: (P_client_ack_2<=P_client_request_2)
states: 664
abstracting: (P_server_request_1_2<=0)
states: 708
-> the formula is FALSE

FORMULA SimpleLoadBal-PT-02-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

totally nodes used: 25322 (2.5e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 28850 78396 107246
used/not used/entry size/cache size: 85528 67023336 16 1024MB
basic ops cache: hits/miss/sum: 23104 93873 116977
used/not used/entry size/cache size: 147200 16630016 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 4103 10595 14698
used/not used/entry size/cache size: 10595 8378013 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67083885
1 24642
2 331
3 6
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.090sec


BK_STOP 1679358712503

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:1125 (25), effective:119 (2)

initing FirstDep: 0m 0.000sec


iterations count:47 (1), effective:1 (0)

iterations count:47 (1), effective:1 (0)

iterations count:641 (14), effective:53 (1)

iterations count:50 (1), effective:4 (0)

iterations count:153 (3), effective:8 (0)

iterations count:241 (5), effective:23 (0)

iterations count:191 (4), effective:6 (0)

iterations count:45 (1), effective:0 (0)

iterations count:47 (1), effective:1 (0)

iterations count:529 (11), effective:35 (0)

iterations count:47 (1), effective:1 (0)

iterations count:262 (5), effective:25 (0)

iterations count:601 (13), effective:50 (1)

iterations count:831 (18), effective:78 (1)

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="SimpleLoadBal-PT-02"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is SimpleLoadBal-PT-02, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r426-tajo-167905979000502"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SimpleLoadBal-PT-02.tgz
mv SimpleLoadBal-PT-02 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;