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-167905979000506.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-05, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905979000506
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 6.6K Feb 26 03:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Feb 26 03:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 03:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 03:48 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 5.1K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 28K Feb 26 03:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 241K Feb 26 03:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 03:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 26 03:50 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 155K 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-05-CTLFireability-00
FORMULA_NAME SimpleLoadBal-PT-05-CTLFireability-01
FORMULA_NAME SimpleLoadBal-PT-05-CTLFireability-02
FORMULA_NAME SimpleLoadBal-PT-05-CTLFireability-03
FORMULA_NAME SimpleLoadBal-PT-05-CTLFireability-04
FORMULA_NAME SimpleLoadBal-PT-05-CTLFireability-05
FORMULA_NAME SimpleLoadBal-PT-05-CTLFireability-06
FORMULA_NAME SimpleLoadBal-PT-05-CTLFireability-07
FORMULA_NAME SimpleLoadBal-PT-05-CTLFireability-08
FORMULA_NAME SimpleLoadBal-PT-05-CTLFireability-09
FORMULA_NAME SimpleLoadBal-PT-05-CTLFireability-10
FORMULA_NAME SimpleLoadBal-PT-05-CTLFireability-11
FORMULA_NAME SimpleLoadBal-PT-05-CTLFireability-12
FORMULA_NAME SimpleLoadBal-PT-05-CTLFireability-13
FORMULA_NAME SimpleLoadBal-PT-05-CTLFireability-14
FORMULA_NAME SimpleLoadBal-PT-05-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679358758591

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SimpleLoadBal-PT-05
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-21 00:32:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 00:32:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 00:32:40] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2023-03-21 00:32:40] [INFO ] Transformed 59 places.
[2023-03-21 00:32:40] [INFO ] Transformed 180 transitions.
[2023-03-21 00:32:40] [INFO ] Found NUPN structural information;
[2023-03-21 00:32:40] [INFO ] Completing missing partition info from NUPN : creating a component with [P_client_idle_1, P_client_idle_2, P_client_idle_3, P_client_idle_4, P_client_idle_5, P_client_waiting_1, P_client_waiting_2, P_client_waiting_3, P_client_waiting_4, P_client_waiting_5, P_client_request_1, P_client_request_2, P_client_request_3, P_client_request_4, P_client_request_5, P_client_ack_1, P_client_ack_2, P_client_ack_3, P_client_ack_4, P_client_ack_5, 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_server_request_3_1, P_server_request_3_2, P_server_request_4_1, P_server_request_4_2, P_server_request_5_1, P_server_request_5_2, P_lb_idle_1, P_lb_routing_1_1, P_lb_routing_1_2, P_lb_routing_1_3, P_lb_routing_1_4, P_lb_routing_1_5, P_lb_balancing_1, P_lb_load_1_0, P_lb_load_1_1, P_lb_load_1_2, P_lb_load_1_3, P_lb_load_1_4, P_lb_load_1_5, P_lb_load_2_0, P_lb_load_2_1, P_lb_load_2_2, P_lb_load_2_3, P_lb_load_2_4, P_lb_load_2_5]
[2023-03-21 00:32:40] [INFO ] Parsed PT model containing 59 places and 180 transitions and 1158 arcs in 160 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 22 ms.
Support contains 40 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 180/180 transitions.
Applied a total of 0 rules in 26 ms. Remains 59 /59 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2023-03-21 00:32:40] [INFO ] Flow matrix only has 140 transitions (discarded 40 similar events)
// Phase 1: matrix 140 rows 59 cols
[2023-03-21 00:32:40] [INFO ] Computed 19 place invariants in 11 ms
[2023-03-21 00:32:40] [INFO ] Implicit Places using invariants in 294 ms returned [6, 8, 9, 22, 23]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 333 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/59 places, 180/180 transitions.
Applied a total of 0 rules in 29 ms. Remains 54 /54 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 389 ms. Remains : 54/59 places, 180/180 transitions.
Support contains 40 out of 54 places after structural reductions.
[2023-03-21 00:32:41] [INFO ] Flatten gal took : 109 ms
[2023-03-21 00:32:41] [INFO ] Flatten gal took : 43 ms
[2023-03-21 00:32:41] [INFO ] Input system was already deterministic with 180 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 737 ms. (steps per millisecond=13 ) properties (out of 69) seen :47
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Running SMT prover for 22 properties.
[2023-03-21 00:32:42] [INFO ] Flow matrix only has 140 transitions (discarded 40 similar events)
// Phase 1: matrix 140 rows 54 cols
[2023-03-21 00:32:42] [INFO ] Computed 14 place invariants in 9 ms
[2023-03-21 00:32:43] [INFO ] [Real]Absence check using 10 positive place invariants in 80 ms returned sat
[2023-03-21 00:32:43] [INFO ] [Real]Absence check using 10 positive and 4 generalized place invariants in 29 ms returned sat
[2023-03-21 00:32:45] [INFO ] After 2635ms SMT Verify possible using all constraints in real domain returned unsat :8 sat :0 real:14
[2023-03-21 00:32:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2023-03-21 00:32:45] [INFO ] [Nat]Absence check using 10 positive and 4 generalized place invariants in 14 ms returned sat
[2023-03-21 00:32:45] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :17 sat :5
[2023-03-21 00:32:45] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-21 00:32:45] [INFO ] After 76ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :17 sat :5
[2023-03-21 00:32:46] [INFO ] Deduced a trap composed of 8 places in 854 ms of which 8 ms to minimize.
[2023-03-21 00:32:46] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2023-03-21 00:32:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 917 ms
[2023-03-21 00:32:46] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2023-03-21 00:32:46] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2023-03-21 00:32:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 99 ms
[2023-03-21 00:32:46] [INFO ] After 1220ms SMT Verify possible using trap constraints in natural domain returned unsat :19 sat :3
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-21 00:32:46] [INFO ] After 1518ms SMT Verify possible using all constraints in natural domain returned unsat :19 sat :3
Fused 22 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 17 ms.
Support contains 7 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 180/180 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 54 transition count 175
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 49 transition count 175
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 44 transition count 170
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 40 transition count 168
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 38 transition count 166
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 38 transition count 162
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 38 place count 34 transition count 162
Applied a total of 38 rules in 50 ms. Remains 34 /54 variables (removed 20) and now considering 162/180 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 34/54 places, 162/180 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-21 00:32:47] [INFO ] Flow matrix only has 122 transitions (discarded 40 similar events)
// Phase 1: matrix 122 rows 34 cols
[2023-03-21 00:32:47] [INFO ] Computed 12 place invariants in 6 ms
[2023-03-21 00:32:47] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-21 00:32:47] [INFO ] [Real]Absence check using 8 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-21 00:32:47] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 00:32:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-21 00:32:47] [INFO ] [Nat]Absence check using 8 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-21 00:32:47] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 00:32:47] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-21 00:32:47] [INFO ] After 21ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 00:32:47] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-21 00:32:47] [INFO ] After 137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 162/162 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 34 transition count 161
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 33 transition count 161
Applied a total of 2 rules in 22 ms. Remains 33 /34 variables (removed 1) and now considering 161/162 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 33/34 places, 161/162 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Probably explored full state space saw : 1308 states, properties seen :0
Probabilistic random walk after 6810 steps, saw 1308 distinct states, run finished after 60 ms. (steps per millisecond=113 ) properties seen :0
Explored full state space saw : 1308 states, properties seen :0
Exhaustive walk after 6810 steps, saw 1308 distinct states, run finished after 29 ms. (steps per millisecond=234 ) properties seen :0
Successfully simplified 21 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA SimpleLoadBal-PT-05-CTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-05-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-05-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-05-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-05-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-21 00:32:47] [INFO ] Flatten gal took : 27 ms
[2023-03-21 00:32:47] [INFO ] Flatten gal took : 17 ms
[2023-03-21 00:32:47] [INFO ] Input system was already deterministic with 180 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 54/54 places, 180/180 transitions.
[2023-03-21 00:32:47] [INFO ] Flatten gal took : 15 ms
[2023-03-21 00:32:47] [INFO ] Flatten gal took : 15 ms
[2023-03-21 00:32:47] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 180/180 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 54/54 places, 180/180 transitions.
[2023-03-21 00:32:47] [INFO ] Flatten gal took : 15 ms
[2023-03-21 00:32:47] [INFO ] Flatten gal took : 14 ms
[2023-03-21 00:32:48] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 180/180 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 54 transition count 175
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 49 transition count 175
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 18 place count 45 transition count 171
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 41 transition count 169
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 39 transition count 167
Applied a total of 28 rules in 25 ms. Remains 39 /54 variables (removed 15) and now considering 167/180 (removed 13) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 39/54 places, 167/180 transitions.
[2023-03-21 00:32:48] [INFO ] Flatten gal took : 14 ms
[2023-03-21 00:32:48] [INFO ] Flatten gal took : 15 ms
[2023-03-21 00:32:48] [INFO ] Input system was already deterministic with 167 transitions.
Finished random walk after 112 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=112 )
FORMULA SimpleLoadBal-PT-05-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 180/180 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 54/54 places, 180/180 transitions.
[2023-03-21 00:32:48] [INFO ] Flatten gal took : 11 ms
[2023-03-21 00:32:48] [INFO ] Flatten gal took : 12 ms
[2023-03-21 00:32:48] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 54/54 places, 180/180 transitions.
[2023-03-21 00:32:48] [INFO ] Flatten gal took : 11 ms
[2023-03-21 00:32:48] [INFO ] Flatten gal took : 12 ms
[2023-03-21 00:32:48] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 180/180 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 54/54 places, 180/180 transitions.
[2023-03-21 00:32:48] [INFO ] Flatten gal took : 10 ms
[2023-03-21 00:32:48] [INFO ] Flatten gal took : 10 ms
[2023-03-21 00:32:48] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 180/180 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 54/54 places, 180/180 transitions.
[2023-03-21 00:32:48] [INFO ] Flatten gal took : 10 ms
[2023-03-21 00:32:48] [INFO ] Flatten gal took : 9 ms
[2023-03-21 00:32:48] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 54/54 places, 180/180 transitions.
[2023-03-21 00:32:48] [INFO ] Flatten gal took : 9 ms
[2023-03-21 00:32:48] [INFO ] Flatten gal took : 10 ms
[2023-03-21 00:32:48] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 54/54 places, 180/180 transitions.
[2023-03-21 00:32:48] [INFO ] Flatten gal took : 8 ms
[2023-03-21 00:32:48] [INFO ] Flatten gal took : 9 ms
[2023-03-21 00:32:48] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 180/180 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 54/54 places, 180/180 transitions.
[2023-03-21 00:32:48] [INFO ] Flatten gal took : 8 ms
[2023-03-21 00:32:48] [INFO ] Flatten gal took : 8 ms
[2023-03-21 00:32:48] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 180/180 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 54/54 places, 180/180 transitions.
[2023-03-21 00:32:48] [INFO ] Flatten gal took : 6 ms
[2023-03-21 00:32:48] [INFO ] Flatten gal took : 7 ms
[2023-03-21 00:32:48] [INFO ] Input system was already deterministic with 180 transitions.
[2023-03-21 00:32:48] [INFO ] Flatten gal took : 7 ms
[2023-03-21 00:32:48] [INFO ] Flatten gal took : 7 ms
[2023-03-21 00:32:48] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-21 00:32:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 54 places, 180 transitions and 1148 arcs took 1 ms.
Total runtime 8298 ms.
There are residual formulas that ITS could not solve within timeout
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=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 54 NrTr: 180 NrArc: 1148)

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

net check time: 0m 0.000sec

init dd package: 0m 3.387sec


RS generation: 0m 0.287sec


-> reachability set: #nodes 8915 (8.9e+03) #states 116,176 (5)



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

checking: AG [EF [EX [0<=0]]]
normalized: ~ [E [true U ~ [E [true U EX [0<=0]]]]]

abstracting: (0<=0)
states: 116,176 (5)
.-> the formula is TRUE

FORMULA SimpleLoadBal-PT-05-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.168sec

checking: AG [EF [AX [[[[p44<=1 & 1<=p44] & [p51<=1 & 1<=p51]] & [1<=p40 & p40<=1]]]]]
normalized: ~ [E [true U ~ [E [true U ~ [EX [~ [[[1<=p40 & p40<=1] & [[p44<=1 & 1<=p44] & [p51<=1 & 1<=p51]]]]]]]]]]

abstracting: (1<=p51)
states: 9,560 (3)
abstracting: (p51<=1)
states: 116,176 (5)
abstracting: (1<=p44)
states: 38,140 (4)
abstracting: (p44<=1)
states: 116,176 (5)
abstracting: (p40<=1)
states: 116,176 (5)
abstracting: (1<=p40)
states: 7,040 (3)
.-> the formula is FALSE

FORMULA SimpleLoadBal-PT-05-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AX [[[p38<=0 & 0<=p38] | [[p43<=0 & 0<=p43] | [p49<=0 & 0<=p49]]]]
normalized: ~ [EX [~ [[[[p49<=0 & 0<=p49] | [p43<=0 & 0<=p43]] | [p38<=0 & 0<=p38]]]]]

abstracting: (0<=p38)
states: 116,176 (5)
abstracting: (p38<=0)
states: 109,136 (5)
abstracting: (0<=p43)
states: 116,176 (5)
abstracting: (p43<=0)
states: 65,608 (4)
abstracting: (0<=p49)
states: 116,176 (5)
abstracting: (p49<=0)
states: 65,008 (4)
.-> the formula is TRUE

FORMULA SimpleLoadBal-PT-05-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: EF [EX [AX [[[EX [[[p38<=1 & 1<=p38] & [[p42<=1 & 1<=p42] & [p48<=1 & 1<=p48]]]] & [p38<=1 & 1<=p38]] & [[p44<=1 & 1<=p44] & [p50<=1 & 1<=p50]]]]]]
normalized: E [true U EX [~ [EX [~ [[[[p50<=1 & 1<=p50] & [p44<=1 & 1<=p44]] & [[p38<=1 & 1<=p38] & EX [[[[p48<=1 & 1<=p48] & [p42<=1 & 1<=p42]] & [p38<=1 & 1<=p38]]]]]]]]]]

abstracting: (1<=p38)
states: 7,040 (3)
abstracting: (p38<=1)
states: 116,176 (5)
abstracting: (1<=p42)
states: 16,668 (4)
abstracting: (p42<=1)
states: 116,176 (5)
abstracting: (1<=p48)
states: 17,028 (4)
abstracting: (p48<=1)
states: 116,176 (5)
.abstracting: (1<=p38)
states: 7,040 (3)
abstracting: (p38<=1)
states: 116,176 (5)
abstracting: (1<=p44)
states: 38,140 (4)
abstracting: (p44<=1)
states: 116,176 (5)
abstracting: (1<=p50)
states: 38,420 (4)
abstracting: (p50<=1)
states: 116,176 (5)
..-> the formula is FALSE

FORMULA SimpleLoadBal-PT-05-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: AG [[AF [EX [[[[p25<=1 & 1<=p25] & [p41<=1 & 1<=p41]] & [[p46<=1 & 1<=p46] & [p50<=1 & 1<=p50]]]]] | AG [AF [[[~ [[p25<=1 & 1<=p25]] | ~ [[p41<=1 & 1<=p41]]] | [~ [[p45<=1 & 1<=p45]] | ~ [[p49<=1 & 1<=p49]]]]]]]]
normalized: ~ [E [true U ~ [[~ [E [true U EG [~ [[[~ [[p49<=1 & 1<=p49]] | ~ [[p45<=1 & 1<=p45]]] | [~ [[p41<=1 & 1<=p41]] | ~ [[p25<=1 & 1<=p25]]]]]]]] | ~ [EG [~ [EX [[[[p50<=1 & 1<=p50] & [p46<=1 & 1<=p46]] & [[p41<=1 & 1<=p41] & [p25<=1 & 1<=p25]]]]]]]]]]]

abstracting: (1<=p25)
states: 20,500 (4)
abstracting: (p25<=1)
states: 116,176 (5)
abstracting: (1<=p41)
states: 47,968 (4)
abstracting: (p41<=1)
states: 116,176 (5)
abstracting: (1<=p46)
states: 1,280 (3)
abstracting: (p46<=1)
states: 116,176 (5)
abstracting: (1<=p50)
states: 38,420 (4)
abstracting: (p50<=1)
states: 116,176 (5)
....
EG iterations: 3
abstracting: (1<=p25)
states: 20,500 (4)
abstracting: (p25<=1)
states: 116,176 (5)
abstracting: (1<=p41)
states: 47,968 (4)
abstracting: (p41<=1)
states: 116,176 (5)
abstracting: (1<=p45)
states: 9,520 (3)
abstracting: (p45<=1)
states: 116,176 (5)
abstracting: (1<=p49)
states: 51,168 (4)
abstracting: (p49<=1)
states: 116,176 (5)
..............
EG iterations: 14
-> the formula is TRUE

FORMULA SimpleLoadBal-PT-05-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.089sec

checking: [EF [AG [[[p36<=1 & 1<=p36] & [[p42<=1 & 1<=p42] & [p48<=1 & 1<=p48]]]]] & EX [[AG [EF [[~ [[p39<=1 & 1<=p39]] | [~ [[p43<=1 & 1<=p43]] | ~ [[p48<=1 & 1<=p48]]]]]] & AX [EG [[[p41<=0 & 0<=p41] | [[p44<=0 & 0<=p44] | [p49<=0 & 0<=p49]]]]]]]]
normalized: [EX [[~ [EX [~ [EG [[[[p49<=0 & 0<=p49] | [p44<=0 & 0<=p44]] | [p41<=0 & 0<=p41]]]]]] & ~ [E [true U ~ [E [true U [[~ [[p48<=1 & 1<=p48]] | ~ [[p43<=1 & 1<=p43]]] | ~ [[p39<=1 & 1<=p39]]]]]]]]] & E [true U ~ [E [true U ~ [[[[p48<=1 & 1<=p48] & [p42<=1 & 1<=p42]] & [p36<=1 & 1<=p36]]]]]]]

abstracting: (1<=p36)
states: 7,040 (3)
abstracting: (p36<=1)
states: 116,176 (5)
abstracting: (1<=p42)
states: 16,668 (4)
abstracting: (p42<=1)
states: 116,176 (5)
abstracting: (1<=p48)
states: 17,028 (4)
abstracting: (p48<=1)
states: 116,176 (5)
abstracting: (1<=p39)
states: 7,040 (3)
abstracting: (p39<=1)
states: 116,176 (5)
abstracting: (1<=p43)
states: 50,568 (4)
abstracting: (p43<=1)
states: 116,176 (5)
abstracting: (1<=p48)
states: 17,028 (4)
abstracting: (p48<=1)
states: 116,176 (5)
abstracting: (0<=p41)
states: 116,176 (5)
abstracting: (p41<=0)
states: 68,208 (4)
abstracting: (0<=p44)
states: 116,176 (5)
abstracting: (p44<=0)
states: 78,036 (4)
abstracting: (0<=p49)
states: 116,176 (5)
abstracting: (p49<=0)
states: 65,008 (4)
.
EG iterations: 1
..-> the formula is FALSE

FORMULA SimpleLoadBal-PT-05-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.053sec

checking: [EF [[[p41<=1 & 1<=p41] & [[p43<=1 & 1<=p43] & [p50<=1 & 1<=p50]]]] | [EG [[EX [[~ [[p18<=1 & 1<=p18]] | ~ [[p28<=1 & 1<=p28]]]] & [[~ [[p28<=1 & 1<=p28]] | ~ [[p41<=1 & 1<=p41]]] | [~ [[p43<=1 & 1<=p43]] | ~ [[p51<=1 & 1<=p51]]]]]] & EG [EF [[[p18<=1 & 1<=p18] & [p26<=1 & 1<=p26]]]]]]
normalized: [[EG [E [true U [[p26<=1 & 1<=p26] & [p18<=1 & 1<=p18]]]] & EG [[[[~ [[p51<=1 & 1<=p51]] | ~ [[p43<=1 & 1<=p43]]] | [~ [[p41<=1 & 1<=p41]] | ~ [[p28<=1 & 1<=p28]]]] & EX [[~ [[p28<=1 & 1<=p28]] | ~ [[p18<=1 & 1<=p18]]]]]]] | E [true U [[[p50<=1 & 1<=p50] & [p43<=1 & 1<=p43]] & [p41<=1 & 1<=p41]]]]

abstracting: (1<=p41)
states: 47,968 (4)
abstracting: (p41<=1)
states: 116,176 (5)
abstracting: (1<=p43)
states: 50,568 (4)
abstracting: (p43<=1)
states: 116,176 (5)
abstracting: (1<=p50)
states: 38,420 (4)
abstracting: (p50<=1)
states: 116,176 (5)
abstracting: (1<=p18)
states: 29,374 (4)
abstracting: (p18<=1)
states: 116,176 (5)
abstracting: (1<=p28)
states: 19,852 (4)
abstracting: (p28<=1)
states: 116,176 (5)
.abstracting: (1<=p28)
states: 19,852 (4)
abstracting: (p28<=1)
states: 116,176 (5)
abstracting: (1<=p41)
states: 47,968 (4)
abstracting: (p41<=1)
states: 116,176 (5)
abstracting: (1<=p43)
states: 50,568 (4)
abstracting: (p43<=1)
states: 116,176 (5)
abstracting: (1<=p51)
states: 9,560 (3)
abstracting: (p51<=1)
states: 116,176 (5)
.
EG iterations: 1
abstracting: (1<=p18)
states: 29,374 (4)
abstracting: (p18<=1)
states: 116,176 (5)
abstracting: (1<=p26)
states: 19,852 (4)
abstracting: (p26<=1)
states: 116,176 (5)

EG iterations: 0
-> the formula is TRUE

FORMULA SimpleLoadBal-PT-05-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.284sec

checking: [AF [[AG [[[p39<=0 & 0<=p39] | [[p43<=0 & 0<=p43] | [p49<=0 & 0<=p49]]]] & [~ [E [[[p5<=1 & 1<=p5] & [p12<=1 & 1<=p12]] U [[p37<=1 & 1<=p37] & [[p44<=1 & 1<=p44] & [p50<=1 & 1<=p50]]]]] & EF [[[p38<=0 & 0<=p38] | [[p45<=0 & 0<=p45] | [p50<=0 & 0<=p50]]]]]]] | [EX [[[p38<=0 & 0<=p38] | [[p45<=0 & 0<=p45] | [p51<=0 & 0<=p51]]]] & AG [[[p21<=0 & 0<=p21] | [[p35<=0 & 0<=p35] | [p45<=0 & 0<=p45]]]]]]
normalized: [[~ [E [true U ~ [[[[p45<=0 & 0<=p45] | [p35<=0 & 0<=p35]] | [p21<=0 & 0<=p21]]]]] & EX [[[[p51<=0 & 0<=p51] | [p45<=0 & 0<=p45]] | [p38<=0 & 0<=p38]]]] | ~ [EG [~ [[[E [true U [[[p50<=0 & 0<=p50] | [p45<=0 & 0<=p45]] | [p38<=0 & 0<=p38]]] & ~ [E [[[p12<=1 & 1<=p12] & [p5<=1 & 1<=p5]] U [[[p50<=1 & 1<=p50] & [p44<=1 & 1<=p44]] & [p37<=1 & 1<=p37]]]]] & ~ [E [true U ~ [[[[p49<=0 & 0<=p49] | [p43<=0 & 0<=p43]] | [p39<=0 & 0<=p39]]]]]]]]]]

abstracting: (0<=p39)
states: 116,176 (5)
abstracting: (p39<=0)
states: 109,136 (5)
abstracting: (0<=p43)
states: 116,176 (5)
abstracting: (p43<=0)
states: 65,608 (4)
abstracting: (0<=p49)
states: 116,176 (5)
abstracting: (p49<=0)
states: 65,008 (4)
abstracting: (1<=p37)
states: 7,040 (3)
abstracting: (p37<=1)
states: 116,176 (5)
abstracting: (1<=p44)
states: 38,140 (4)
abstracting: (p44<=1)
states: 116,176 (5)
abstracting: (1<=p50)
states: 38,420 (4)
abstracting: (p50<=1)
states: 116,176 (5)
abstracting: (1<=p5)
states: 93,248 (4)
abstracting: (p5<=1)
states: 116,176 (5)
abstracting: (1<=p12)
states: 22,928 (4)
abstracting: (p12<=1)
states: 116,176 (5)
abstracting: (0<=p38)
states: 116,176 (5)
abstracting: (p38<=0)
states: 109,136 (5)
abstracting: (0<=p45)
states: 116,176 (5)
abstracting: (p45<=0)
states: 106,656 (5)
abstracting: (0<=p50)
states: 116,176 (5)
abstracting: (p50<=0)
states: 77,756 (4)

EG iterations: 0
abstracting: (0<=p38)
states: 116,176 (5)
abstracting: (p38<=0)
states: 109,136 (5)
abstracting: (0<=p45)
states: 116,176 (5)
abstracting: (p45<=0)
states: 106,656 (5)
abstracting: (0<=p51)
states: 116,176 (5)
abstracting: (p51<=0)
states: 106,616 (5)
.abstracting: (0<=p21)
states: 116,176 (5)
abstracting: (p21<=0)
states: 87,162 (4)
abstracting: (0<=p35)
states: 116,176 (5)
abstracting: (p35<=0)
states: 83,168 (4)
abstracting: (0<=p45)
states: 116,176 (5)
abstracting: (p45<=0)
states: 106,656 (5)
-> the formula is FALSE

FORMULA SimpleLoadBal-PT-05-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.276sec

checking: AG [[EF [[AG [[[p39<=1 & 1<=p39] & [[p43<=1 & 1<=p43] & [p48<=1 & 1<=p48]]]] | AX [[[[p29<=1 & 1<=p29] & [p41<=1 & 1<=p41]] & [[p44<=1 & 1<=p44] & [p48<=1 & 1<=p48]]]]]] | E [E [[[p37<=1 & 1<=p37] & [[p43<=1 & 1<=p43] & [p50<=1 & 1<=p50]]] U [[p39<=1 & 1<=p39] & [[p43<=1 & 1<=p43] & [p50<=1 & 1<=p50]]]] U [[[p41<=1 & 1<=p41] & [[p43<=1 & 1<=p43] & [p49<=1 & 1<=p49]]] | [[[p40<=1 & 1<=p40] & [[p46<=1 & 1<=p46] & [p52<=1 & 1<=p52]]] & [[[p25<=1 & 1<=p25] & [p41<=1 & 1<=p41]] & [[p47<=1 & 1<=p47] & [p51<=1 & 1<=p51]]]]]]]]
normalized: ~ [E [true U ~ [[E [E [[[[p50<=1 & 1<=p50] & [p43<=1 & 1<=p43]] & [p37<=1 & 1<=p37]] U [[[p50<=1 & 1<=p50] & [p43<=1 & 1<=p43]] & [p39<=1 & 1<=p39]]] U [[[[[p51<=1 & 1<=p51] & [p47<=1 & 1<=p47]] & [[p41<=1 & 1<=p41] & [p25<=1 & 1<=p25]]] & [[[p52<=1 & 1<=p52] & [p46<=1 & 1<=p46]] & [p40<=1 & 1<=p40]]] | [[[p49<=1 & 1<=p49] & [p43<=1 & 1<=p43]] & [p41<=1 & 1<=p41]]]] | E [true U [~ [EX [~ [[[[p48<=1 & 1<=p48] & [p44<=1 & 1<=p44]] & [[p41<=1 & 1<=p41] & [p29<=1 & 1<=p29]]]]]] | ~ [E [true U ~ [[[[p48<=1 & 1<=p48] & [p43<=1 & 1<=p43]] & [p39<=1 & 1<=p39]]]]]]]]]]]

abstracting: (1<=p39)
states: 7,040 (3)
abstracting: (p39<=1)
states: 116,176 (5)
abstracting: (1<=p43)
states: 50,568 (4)
abstracting: (p43<=1)
states: 116,176 (5)
abstracting: (1<=p48)
states: 17,028 (4)
abstracting: (p48<=1)
states: 116,176 (5)
abstracting: (1<=p29)
states: 20,500 (4)
abstracting: (p29<=1)
states: 116,176 (5)
abstracting: (1<=p41)
states: 47,968 (4)
abstracting: (p41<=1)
states: 116,176 (5)
abstracting: (1<=p44)
states: 38,140 (4)
abstracting: (p44<=1)
states: 116,176 (5)
abstracting: (1<=p48)
states: 17,028 (4)
abstracting: (p48<=1)
states: 116,176 (5)
.abstracting: (1<=p41)
states: 47,968 (4)
abstracting: (p41<=1)
states: 116,176 (5)
abstracting: (1<=p43)
states: 50,568 (4)
abstracting: (p43<=1)
states: 116,176 (5)
abstracting: (1<=p49)
states: 51,168 (4)
abstracting: (p49<=1)
states: 116,176 (5)
abstracting: (1<=p40)
states: 7,040 (3)
abstracting: (p40<=1)
states: 116,176 (5)
abstracting: (1<=p46)
states: 1,280 (3)
abstracting: (p46<=1)
states: 116,176 (5)
abstracting: (1<=p52)
states: 0
abstracting: (p52<=1)
states: 116,176 (5)
abstracting: (1<=p25)
states: 20,500 (4)
abstracting: (p25<=1)
states: 116,176 (5)
abstracting: (1<=p41)
states: 47,968 (4)
abstracting: (p41<=1)
states: 116,176 (5)
abstracting: (1<=p47)
states: 0
abstracting: (p47<=1)
states: 116,176 (5)
abstracting: (1<=p51)
states: 9,560 (3)
abstracting: (p51<=1)
states: 116,176 (5)
abstracting: (1<=p39)
states: 7,040 (3)
abstracting: (p39<=1)
states: 116,176 (5)
abstracting: (1<=p43)
states: 50,568 (4)
abstracting: (p43<=1)
states: 116,176 (5)
abstracting: (1<=p50)
states: 38,420 (4)
abstracting: (p50<=1)
states: 116,176 (5)
abstracting: (1<=p37)
states: 7,040 (3)
abstracting: (p37<=1)
states: 116,176 (5)
abstracting: (1<=p43)
states: 50,568 (4)
abstracting: (p43<=1)
states: 116,176 (5)
abstracting: (1<=p50)
states: 38,420 (4)
abstracting: (p50<=1)
states: 116,176 (5)
-> the formula is TRUE

FORMULA SimpleLoadBal-PT-05-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.068sec

checking: [EF [[AX [[A [[[[p30<=1 & 1<=p30] & [p41<=1 & 1<=p41]] & [[p42<=1 & 1<=p42] & [p50<=1 & 1<=p50]]] U [[p40<=1 & 1<=p40] & [[p45<=1 & 1<=p45] & [p51<=1 & 1<=p51]]]] | [[p17<=1 & 1<=p17] & [p29<=1 & 1<=p29]]]] | AG [[[[p37<=0 & 0<=p37] | [[p45<=0 & 0<=p45] | [p51<=0 & 0<=p51]]] & [A [[[p38<=1 & 1<=p38] & [[p43<=1 & 1<=p43] & [p48<=1 & 1<=p48]]] U [[p21<=1 & 1<=p21] & [[p35<=1 & 1<=p35] & [p45<=1 & 1<=p45]]]] & [AG [[p20<=1 & 1<=p20]] | EX [[[p22<=1 & 1<=p22] & [[p41<=1 & 1<=p41] & [p51<=1 & 1<=p51]]]]]]]]]] & [EG [E [EX [EF [[[[p31<=1 & 1<=p31] & [p41<=1 & 1<=p41]] & [[p45<=1 & 1<=p45] & [p49<=1 & 1<=p49]]]]] U ~ [A [[[p37<=1 & 1<=p37] & [[p44<=1 & 1<=p44] & [p51<=1 & 1<=p51]]] U [[p41<=1 & 1<=p41] & [[p43<=1 & 1<=p43] & [p48<=1 & 1<=p48]]]]]]] & [EG [[[p22<=1 & 1<=p22] & [[p41<=1 & 1<=p41] & [p51<=1 & 1<=p51]]]] | [AF [[[[[p32<=1 & 1<=p32] & [p41<=1 & 1<=p41]] & [[p44<=1 & 1<=p44] & [p52<=1 & 1<=p52]]] | [[p40<=1 & 1<=p40] & [[p42<=1 & 1<=p42] & [p48<=1 & 1<=p48]]]]] | AG [E [[[[p25<=1 & 1<=p25] & [p41<=1 & 1<=p41]] & [[p45<=1 & 1<=p45] & [p49<=1 & 1<=p49]]] U AX [[[p36<=1 & 1<=p36] & [[p44<=1 & 1<=p44] & [p51<=1 & 1<=p51]]]]]]]]]]
normalized: [[[[~ [E [true U ~ [E [[[[p49<=1 & 1<=p49] & [p45<=1 & 1<=p45]] & [[p41<=1 & 1<=p41] & [p25<=1 & 1<=p25]]] U ~ [EX [~ [[[[p51<=1 & 1<=p51] & [p44<=1 & 1<=p44]] & [p36<=1 & 1<=p36]]]]]]]]] | ~ [EG [~ [[[[[p48<=1 & 1<=p48] & [p42<=1 & 1<=p42]] & [p40<=1 & 1<=p40]] | [[[p52<=1 & 1<=p52] & [p44<=1 & 1<=p44]] & [[p41<=1 & 1<=p41] & [p32<=1 & 1<=p32]]]]]]]] | EG [[[[p51<=1 & 1<=p51] & [p41<=1 & 1<=p41]] & [p22<=1 & 1<=p22]]]] & EG [E [EX [E [true U [[[p49<=1 & 1<=p49] & [p45<=1 & 1<=p45]] & [[p41<=1 & 1<=p41] & [p31<=1 & 1<=p31]]]]] U ~ [[~ [EG [~ [[[[p48<=1 & 1<=p48] & [p43<=1 & 1<=p43]] & [p41<=1 & 1<=p41]]]]] & ~ [E [~ [[[[p48<=1 & 1<=p48] & [p43<=1 & 1<=p43]] & [p41<=1 & 1<=p41]]] U [~ [[[[p51<=1 & 1<=p51] & [p44<=1 & 1<=p44]] & [p37<=1 & 1<=p37]]] & ~ [[[[p48<=1 & 1<=p48] & [p43<=1 & 1<=p43]] & [p41<=1 & 1<=p41]]]]]]]]]]] & E [true U [~ [E [true U ~ [[[[EX [[[[p51<=1 & 1<=p51] & [p41<=1 & 1<=p41]] & [p22<=1 & 1<=p22]]] | ~ [E [true U ~ [[p20<=1 & 1<=p20]]]]] & [~ [EG [~ [[[[p45<=1 & 1<=p45] & [p35<=1 & 1<=p35]] & [p21<=1 & 1<=p21]]]]] & ~ [E [~ [[[[p45<=1 & 1<=p45] & [p35<=1 & 1<=p35]] & [p21<=1 & 1<=p21]]] U [~ [[[[p48<=1 & 1<=p48] & [p43<=1 & 1<=p43]] & [p38<=1 & 1<=p38]]] & ~ [[[[p45<=1 & 1<=p45] & [p35<=1 & 1<=p35]] & [p21<=1 & 1<=p21]]]]]]]] & [[[p51<=0 & 0<=p51] | [p45<=0 & 0<=p45]] | [p37<=0 & 0<=p37]]]]]] | ~ [EX [~ [[[[p29<=1 & 1<=p29] & [p17<=1 & 1<=p17]] | [~ [EG [~ [[[[p51<=1 & 1<=p51] & [p45<=1 & 1<=p45]] & [p40<=1 & 1<=p40]]]]] & ~ [E [~ [[[[p51<=1 & 1<=p51] & [p45<=1 & 1<=p45]] & [p40<=1 & 1<=p40]]] U [~ [[[[p50<=1 & 1<=p50] & [p42<=1 & 1<=p42]] & [[p41<=1 & 1<=p41] & [p30<=1 & 1<=p30]]]] & ~ [[[[p51<=1 & 1<=p51] & [p45<=1 & 1<=p45]] & [p40<=1 & 1<=p40]]]]]]]]]]]]]]

abstracting: (1<=p40)
states: 7,040 (3)
abstracting: (p40<=1)
states: 116,176 (5)
abstracting: (1<=p45)
states: 9,520 (3)
abstracting: (p45<=1)
states: 116,176 (5)
abstracting: (1<=p51)
states: 9,560 (3)
abstracting: (p51<=1)
states: 116,176 (5)
abstracting: (1<=p30)
states: 19,852 (4)
abstracting: (p30<=1)
states: 116,176 (5)
abstracting: (1<=p41)
states: 47,968 (4)
abstracting: (p41<=1)
states: 116,176 (5)
abstracting: (1<=p42)
states: 16,668 (4)
abstracting: (p42<=1)
states: 116,176 (5)
abstracting: (1<=p50)
states: 38,420 (4)
abstracting: (p50<=1)
states: 116,176 (5)
abstracting: (1<=p40)
states: 7,040 (3)
abstracting: (p40<=1)
states: 116,176 (5)
abstracting: (1<=p45)
states: 9,520 (3)
abstracting: (p45<=1)
states: 116,176 (5)
abstracting: (1<=p51)
states: 9,560 (3)
abstracting: (p51<=1)
states: 116,176 (5)
abstracting: (1<=p40)
states: 7,040 (3)
abstracting: (p40<=1)
states: 116,176 (5)
abstracting: (1<=p45)
states: 9,520 (3)
abstracting: (p45<=1)
states: 116,176 (5)
abstracting: (1<=p51)
states: 9,560 (3)
abstracting: (p51<=1)
states: 116,176 (5)
.
EG iterations: 1
abstracting: (1<=p17)
states: 29,074 (4)
abstracting: (p17<=1)
states: 116,176 (5)
abstracting: (1<=p29)
states: 20,500 (4)
abstracting: (p29<=1)
states: 116,176 (5)
.abstracting: (0<=p37)
states: 116,176 (5)
abstracting: (p37<=0)
states: 109,136 (5)
abstracting: (0<=p45)
states: 116,176 (5)
abstracting: (p45<=0)
states: 106,656 (5)
abstracting: (0<=p51)
states: 116,176 (5)
abstracting: (p51<=0)
states: 106,616 (5)
abstracting: (1<=p21)
states: 29,014 (4)
abstracting: (p21<=1)
states: 116,176 (5)
abstracting: (1<=p35)
states: 33,008 (4)
abstracting: (p35<=1)
states: 116,176 (5)
abstracting: (1<=p45)
states: 9,520 (3)
abstracting: (p45<=1)
states: 116,176 (5)
abstracting: (1<=p38)
states: 7,040 (3)
abstracting: (p38<=1)
states: 116,176 (5)
abstracting: (1<=p43)
states: 50,568 (4)
abstracting: (p43<=1)
states: 116,176 (5)
abstracting: (1<=p48)
states: 17,028 (4)
abstracting: (p48<=1)
states: 116,176 (5)
abstracting: (1<=p21)
states: 29,014 (4)
abstracting: (p21<=1)
states: 116,176 (5)
abstracting: (1<=p35)
states: 33,008 (4)
abstracting: (p35<=1)
states: 116,176 (5)
abstracting: (1<=p45)
states: 9,520 (3)
abstracting: (p45<=1)
states: 116,176 (5)
abstracting: (1<=p21)
states: 29,014 (4)
abstracting: (p21<=1)
states: 116,176 (5)
abstracting: (1<=p35)
states: 33,008 (4)
abstracting: (p35<=1)
states: 116,176 (5)
abstracting: (1<=p45)
states: 9,520 (3)
abstracting: (p45<=1)
states: 116,176 (5)
.........
EG iterations: 9
abstracting: (1<=p20)
states: 28,714 (4)
abstracting: (p20<=1)
states: 116,176 (5)
abstracting: (1<=p22)
states: 28,714 (4)
abstracting: (p22<=1)
states: 116,176 (5)
abstracting: (1<=p41)
states: 47,968 (4)
abstracting: (p41<=1)
states: 116,176 (5)
abstracting: (1<=p51)
states: 9,560 (3)
abstracting: (p51<=1)
states: 116,176 (5)
.abstracting: (1<=p41)
states: 47,968 (4)
abstracting: (p41<=1)
states: 116,176 (5)
abstracting: (1<=p43)
states: 50,568 (4)
abstracting: (p43<=1)
states: 116,176 (5)
abstracting: (1<=p48)
states: 17,028 (4)
abstracting: (p48<=1)
states: 116,176 (5)
abstracting: (1<=p37)
states: 7,040 (3)
abstracting: (p37<=1)
states: 116,176 (5)
abstracting: (1<=p44)
states: 38,140 (4)
abstracting: (p44<=1)
states: 116,176 (5)
abstracting: (1<=p51)
states: 9,560 (3)
abstracting: (p51<=1)
states: 116,176 (5)
abstracting: (1<=p41)
states: 47,968 (4)
abstracting: (p41<=1)
states: 116,176 (5)
abstracting: (1<=p43)
states: 50,568 (4)
abstracting: (p43<=1)
states: 116,176 (5)
abstracting: (1<=p48)
states: 17,028 (4)
abstracting: (p48<=1)
states: 116,176 (5)
abstracting: (1<=p41)
states: 47,968 (4)
abstracting: (p41<=1)
states: 116,176 (5)
abstracting: (1<=p43)
states: 50,568 (4)
abstracting: (p43<=1)
states: 116,176 (5)
abstracting: (1<=p48)
states: 17,028 (4)
abstracting: (p48<=1)
states: 116,176 (5)
.
EG iterations: 1
abstracting: (1<=p31)
states: 20,500 (4)
abstracting: (p31<=1)
states: 116,176 (5)
abstracting: (1<=p41)
states: 47,968 (4)
abstracting: (p41<=1)
states: 116,176 (5)
abstracting: (1<=p45)
states: 9,520 (3)
abstracting: (p45<=1)
states: 116,176 (5)
abstracting: (1<=p49)
states: 51,168 (4)
abstracting: (p49<=1)
states: 116,176 (5)
.
EG iterations: 0
abstracting: (1<=p22)
states: 28,714 (4)
abstracting: (p22<=1)
states: 116,176 (5)
abstracting: (1<=p41)
states: 47,968 (4)
abstracting: (p41<=1)
states: 116,176 (5)
abstracting: (1<=p51)
states: 9,560 (3)
abstracting: (p51<=1)
states: 116,176 (5)
.....................
EG iterations: 21
abstracting: (1<=p32)
states: 19,852 (4)
abstracting: (p32<=1)
states: 116,176 (5)
abstracting: (1<=p41)
states: 47,968 (4)
abstracting: (p41<=1)
states: 116,176 (5)
abstracting: (1<=p44)
states: 38,140 (4)
abstracting: (p44<=1)
states: 116,176 (5)
abstracting: (1<=p52)
states: 0
abstracting: (p52<=1)
states: 116,176 (5)
abstracting: (1<=p40)
states: 7,040 (3)
abstracting: (p40<=1)
states: 116,176 (5)
abstracting: (1<=p42)
states: 16,668 (4)
abstracting: (p42<=1)
states: 116,176 (5)
abstracting: (1<=p48)
states: 17,028 (4)
abstracting: (p48<=1)
states: 116,176 (5)
.
EG iterations: 1
abstracting: (1<=p36)
states: 7,040 (3)
abstracting: (p36<=1)
states: 116,176 (5)
abstracting: (1<=p44)
states: 38,140 (4)
abstracting: (p44<=1)
states: 116,176 (5)
abstracting: (1<=p51)
states: 9,560 (3)
abstracting: (p51<=1)
states: 116,176 (5)
.abstracting: (1<=p25)
states: 20,500 (4)
abstracting: (p25<=1)
states: 116,176 (5)
abstracting: (1<=p41)
states: 47,968 (4)
abstracting: (p41<=1)
states: 116,176 (5)
abstracting: (1<=p45)
states: 9,520 (3)
abstracting: (p45<=1)
states: 116,176 (5)
abstracting: (1<=p49)
states: 51,168 (4)
abstracting: (p49<=1)
states: 116,176 (5)
-> the formula is FALSE

FORMULA SimpleLoadBal-PT-05-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.646sec

totally nodes used: 590829 (5.9e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1642857 5327636 6970493
used/not used/entry size/cache size: 5539973 61568891 16 1024MB
basic ops cache: hits/miss/sum: 193309 493469 686778
used/not used/entry size/cache size: 806232 15970984 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: 13062 47772 60834
used/not used/entry size/cache size: 47665 8340943 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 66563389
1 505341
2 35414
3 4261
4 421
5 35
6 3
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 8.273sec


BK_STOP 1679358777208

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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:32048 (178), effective:1959 (10)

initing FirstDep: 0m 0.000sec


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

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

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

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

iterations count:6132 (34), effective:195 (1)

iterations count:7746 (43), effective:270 (1)

iterations count:7291 (40), effective:191 (1)

iterations count:6637 (36), effective:237 (1)

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

iterations count:7147 (39), effective:272 (1)

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

iterations count:10940 (60), effective:408 (2)

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

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

iterations count:317 (1), effective:7 (0)

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

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

iterations count:351 (1), effective:10 (0)

iterations count:11231 (62), effective:395 (2)

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

iterations count:16561 (92), effective:648 (3)

iterations count:193 (1), effective:3 (0)

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

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-05"
export BK_EXAMINATION="CTLFireability"
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-05, examination is CTLFireability"
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-167905979000506"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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