Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r233-tall-167856418900418.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is LamportFastMutEx-PT-5, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856418900418
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 12K Feb 25 13:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 13:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Feb 25 13:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 145K Feb 25 13:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 38K Feb 25 13:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 249K Feb 25 13:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 42K Feb 25 13:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 224K Feb 25 13:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 157K Mar 5 18:22 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 LamportFastMutEx-PT-5-CTLFireability-00
FORMULA_NAME LamportFastMutEx-PT-5-CTLFireability-01
FORMULA_NAME LamportFastMutEx-PT-5-CTLFireability-02
FORMULA_NAME LamportFastMutEx-PT-5-CTLFireability-03
FORMULA_NAME LamportFastMutEx-PT-5-CTLFireability-04
FORMULA_NAME LamportFastMutEx-PT-5-CTLFireability-05
FORMULA_NAME LamportFastMutEx-PT-5-CTLFireability-06
FORMULA_NAME LamportFastMutEx-PT-5-CTLFireability-07
FORMULA_NAME LamportFastMutEx-PT-5-CTLFireability-08
FORMULA_NAME LamportFastMutEx-PT-5-CTLFireability-09
FORMULA_NAME LamportFastMutEx-PT-5-CTLFireability-10
FORMULA_NAME LamportFastMutEx-PT-5-CTLFireability-11
FORMULA_NAME LamportFastMutEx-PT-5-CTLFireability-12
FORMULA_NAME LamportFastMutEx-PT-5-CTLFireability-13
FORMULA_NAME LamportFastMutEx-PT-5-CTLFireability-14
FORMULA_NAME LamportFastMutEx-PT-5-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679516381533

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=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-5
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 20:19:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 20:19:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 20:19:43] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2023-03-22 20:19:43] [INFO ] Transformed 174 places.
[2023-03-22 20:19:43] [INFO ] Transformed 318 transitions.
[2023-03-22 20:19:43] [INFO ] Found NUPN structural information;
[2023-03-22 20:19:43] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, P_start_1_3, P_start_1_4, P_start_1_5, P_b_0_false, P_b_0_true, P_b_1_false, P_b_1_true, P_b_2_false, P_b_2_true, P_b_3_false, P_b_3_true, P_b_4_false, P_b_4_true, P_b_5_false, P_b_5_true, P_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setx_3_4, P_setx_3_5, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_setbi_5_3, P_setbi_5_4, P_setbi_5_5, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_ify0_4_4, P_ify0_4_5, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_sety_9_3, P_sety_9_4, P_sety_9_5, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_ifxi_10_4, P_ifxi_10_5, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_setbi_11_3, P_setbi_11_4, P_setbi_11_5, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_fordo_12_4, P_fordo_12_5, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_0_3, P_wait_0_4, P_wait_0_5, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_1_4, P_wait_1_5, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_wait_2_3, P_wait_2_4, P_wait_2_5, P_wait_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_wait_3_4, P_wait_3_5, P_wait_4_0, P_wait_4_1, P_wait_4_2, P_wait_4_3, P_wait_4_4, P_wait_4_5, P_wait_5_0, P_wait_5_1, P_wait_5_2, P_wait_5_3, P_wait_5_4, P_wait_5_5, P_await_13_0, P_await_13_1, P_await_13_2, P_await_13_3, P_await_13_4, P_await_13_5, P_done_0_0, P_done_0_1, P_done_0_2, P_done_0_3, P_done_0_4, P_done_0_5, P_done_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_1_4, P_done_1_5, P_done_2_0, P_done_2_1, P_done_2_2, P_done_2_3, P_done_2_4, P_done_2_5, P_done_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_done_3_4, P_done_3_5, P_done_4_0, P_done_4_1, P_done_4_2, P_done_4_3, P_done_4_4, P_done_4_5, P_done_5_0, P_done_5_1, P_done_5_2, P_done_5_3, P_done_5_4, P_done_5_5, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_ifyi_15_3, P_ifyi_15_4, P_ifyi_15_5, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_awaity_5, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_CS_21_3, P_CS_21_4, P_CS_21_5, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3, P_setbi_24_4, P_setbi_24_5]
[2023-03-22 20:19:43] [INFO ] Parsed PT model containing 174 places and 318 transitions and 1380 arcs in 150 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 58 transitions.
Support contains 137 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 16 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2023-03-22 20:19:43] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2023-03-22 20:19:43] [INFO ] Computed 37 place invariants in 10 ms
[2023-03-22 20:19:43] [INFO ] Implicit Places using invariants in 200 ms returned []
[2023-03-22 20:19:43] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
[2023-03-22 20:19:43] [INFO ] Invariant cache hit.
[2023-03-22 20:19:43] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-22 20:19:43] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2023-03-22 20:19:43] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
[2023-03-22 20:19:43] [INFO ] Invariant cache hit.
[2023-03-22 20:19:44] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 669 ms. Remains : 137/137 places, 260/260 transitions.
Support contains 137 out of 137 places after structural reductions.
[2023-03-22 20:19:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-22 20:19:44] [INFO ] Flatten gal took : 73 ms
FORMULA LamportFastMutEx-PT-5-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 20:19:44] [INFO ] Flatten gal took : 42 ms
[2023-03-22 20:19:44] [INFO ] Input system was already deterministic with 260 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 51) seen :48
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-22 20:19:45] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
[2023-03-22 20:19:45] [INFO ] Invariant cache hit.
[2023-03-22 20:19:45] [INFO ] [Real]Absence check using 37 positive place invariants in 7 ms returned sat
[2023-03-22 20:19:45] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 20:19:45] [INFO ] [Nat]Absence check using 37 positive place invariants in 15 ms returned sat
[2023-03-22 20:19:45] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 20:19:45] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-22 20:19:45] [INFO ] After 62ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 20:19:46] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 4 ms to minimize.
[2023-03-22 20:19:46] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2023-03-22 20:19:46] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2023-03-22 20:19:46] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 2 ms to minimize.
[2023-03-22 20:19:46] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 3 ms to minimize.
[2023-03-22 20:19:46] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2023-03-22 20:19:46] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2023-03-22 20:19:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 636 ms
[2023-03-22 20:19:46] [INFO ] After 736ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-22 20:19:46] [INFO ] After 1021ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 5 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 260/260 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
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 132 transition count 255
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 15 place count 132 transition count 250
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 20 place count 127 transition count 250
Applied a total of 20 rules in 51 ms. Remains 127 /137 variables (removed 10) and now considering 250/260 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 127/137 places, 250/260 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 20:19:46] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 127 cols
[2023-03-22 20:19:46] [INFO ] Computed 37 place invariants in 6 ms
[2023-03-22 20:19:46] [INFO ] [Real]Absence check using 37 positive place invariants in 27 ms returned sat
[2023-03-22 20:19:46] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 20:19:46] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2023-03-22 20:19:47] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 20:19:47] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-22 20:19:47] [INFO ] After 13ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 20:19:47] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-22 20:19:47] [INFO ] After 147ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 250/250 transitions.
Applied a total of 0 rules in 22 ms. Remains 127 /127 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 127/127 places, 250/250 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1502163 steps, run timeout after 3001 ms. (steps per millisecond=500 ) properties seen :{}
Probabilistic random walk after 1502163 steps, saw 388078 distinct states, run finished after 3002 ms. (steps per millisecond=500 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 20:19:50] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
[2023-03-22 20:19:50] [INFO ] Invariant cache hit.
[2023-03-22 20:19:50] [INFO ] [Real]Absence check using 37 positive place invariants in 7 ms returned sat
[2023-03-22 20:19:50] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 20:19:50] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-22 20:19:50] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 20:19:50] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-22 20:19:50] [INFO ] After 15ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 20:19:50] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-22 20:19:50] [INFO ] After 154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 250/250 transitions.
Applied a total of 0 rules in 11 ms. Remains 127 /127 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 127/127 places, 250/250 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 250/250 transitions.
Applied a total of 0 rules in 9 ms. Remains 127 /127 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 20:19:50] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
[2023-03-22 20:19:50] [INFO ] Invariant cache hit.
[2023-03-22 20:19:50] [INFO ] Implicit Places using invariants in 143 ms returned [82, 83, 84, 85, 86]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 145 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 122/127 places, 250/250 transitions.
Applied a total of 0 rules in 9 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 163 ms. Remains : 122/127 places, 250/250 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1540712 steps, run timeout after 3001 ms. (steps per millisecond=513 ) properties seen :{}
Probabilistic random walk after 1540712 steps, saw 400204 distinct states, run finished after 3001 ms. (steps per millisecond=513 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 20:19:53] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2023-03-22 20:19:53] [INFO ] Computed 32 place invariants in 2 ms
[2023-03-22 20:19:53] [INFO ] [Real]Absence check using 32 positive place invariants in 5 ms returned sat
[2023-03-22 20:19:53] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 20:19:53] [INFO ] [Nat]Absence check using 32 positive place invariants in 5 ms returned sat
[2023-03-22 20:19:53] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 20:19:53] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 20:19:53] [INFO ] After 15ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 20:19:53] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-22 20:19:53] [INFO ] After 140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 250/250 transitions.
Applied a total of 0 rules in 10 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 122/122 places, 250/250 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 250/250 transitions.
Applied a total of 0 rules in 7 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 20:19:53] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
[2023-03-22 20:19:53] [INFO ] Invariant cache hit.
[2023-03-22 20:19:53] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-22 20:19:53] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
[2023-03-22 20:19:53] [INFO ] Invariant cache hit.
[2023-03-22 20:19:54] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 20:19:54] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2023-03-22 20:19:54] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-22 20:19:54] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
[2023-03-22 20:19:54] [INFO ] Invariant cache hit.
[2023-03-22 20:19:54] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 398 ms. Remains : 122/122 places, 250/250 transitions.
Graph (trivial) has 118 edges and 122 vertex of which 41 / 122 are part of one of the 5 SCC in 2 ms
Free SCC test removed 36 places
Drop transitions removed 65 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 113 transitions.
Graph (complete) has 222 edges and 86 vertex of which 80 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 80 transition count 112
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 25 Pre rules applied. Total rules applied 27 place count 80 transition count 87
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 1 with 70 rules applied. Total rules applied 97 place count 35 transition count 87
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 1 with 8 rules applied. Total rules applied 105 place count 31 transition count 83
Graph (trivial) has 14 edges and 31 vertex of which 13 / 31 are part of one of the 5 SCC in 0 ms
Free SCC test removed 8 places
Discarding 8 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Remove reverse transitions (loop back) rule discarded transition t251 and 8 places that fell out of Prefix Of Interest.
Iterating global reduction 1 with 2 rules applied. Total rules applied 107 place count 11 transition count 71
Drop transitions removed 13 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 30 transitions.
Graph (trivial) has 17 edges and 11 vertex of which 4 / 11 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 31 rules applied. Total rules applied 138 place count 8 transition count 41
Drop transitions removed 12 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 165 place count 8 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 166 place count 8 transition count 13
Applied a total of 166 rules in 22 ms. Remains 8 /122 variables (removed 114) and now considering 13/250 (removed 237) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 13 rows 8 cols
[2023-03-22 20:19:54] [INFO ] Computed 3 place invariants in 8 ms
[2023-03-22 20:19:54] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-22 20:19:54] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 20:19:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-22 20:19:54] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 20:19:54] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-22 20:19:54] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2023-03-22 20:19:54] [INFO ] Flatten gal took : 19 ms
[2023-03-22 20:19:54] [INFO ] Flatten gal took : 26 ms
[2023-03-22 20:19:54] [INFO ] Input system was already deterministic with 260 transitions.
Computed a total of 1 stabilizing places and 5 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 2 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 137/137 places, 260/260 transitions.
[2023-03-22 20:19:54] [INFO ] Flatten gal took : 13 ms
[2023-03-22 20:19:54] [INFO ] Flatten gal took : 15 ms
[2023-03-22 20:19:54] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 1 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 137/137 places, 260/260 transitions.
[2023-03-22 20:19:54] [INFO ] Flatten gal took : 14 ms
[2023-03-22 20:19:54] [INFO ] Flatten gal took : 13 ms
[2023-03-22 20:19:54] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 1 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 137/137 places, 260/260 transitions.
[2023-03-22 20:19:54] [INFO ] Flatten gal took : 12 ms
[2023-03-22 20:19:54] [INFO ] Flatten gal took : 14 ms
[2023-03-22 20:19:54] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 6 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 137/137 places, 260/260 transitions.
[2023-03-22 20:19:54] [INFO ] Flatten gal took : 11 ms
[2023-03-22 20:19:54] [INFO ] Flatten gal took : 11 ms
[2023-03-22 20:19:54] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 1 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 137/137 places, 260/260 transitions.
[2023-03-22 20:19:54] [INFO ] Flatten gal took : 18 ms
[2023-03-22 20:19:54] [INFO ] Flatten gal took : 17 ms
[2023-03-22 20:19:54] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 10 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 137/137 places, 260/260 transitions.
[2023-03-22 20:19:54] [INFO ] Flatten gal took : 9 ms
[2023-03-22 20:19:54] [INFO ] Flatten gal took : 10 ms
[2023-03-22 20:19:54] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 1 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 137/137 places, 260/260 transitions.
[2023-03-22 20:19:54] [INFO ] Flatten gal took : 9 ms
[2023-03-22 20:19:55] [INFO ] Flatten gal took : 10 ms
[2023-03-22 20:19:55] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 1 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 137/137 places, 260/260 transitions.
[2023-03-22 20:19:55] [INFO ] Flatten gal took : 10 ms
[2023-03-22 20:19:55] [INFO ] Flatten gal took : 11 ms
[2023-03-22 20:19:55] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 1 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 137/137 places, 260/260 transitions.
[2023-03-22 20:19:55] [INFO ] Flatten gal took : 9 ms
[2023-03-22 20:19:55] [INFO ] Flatten gal took : 10 ms
[2023-03-22 20:19:55] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 1 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 137/137 places, 260/260 transitions.
[2023-03-22 20:19:55] [INFO ] Flatten gal took : 8 ms
[2023-03-22 20:19:55] [INFO ] Flatten gal took : 8 ms
[2023-03-22 20:19:55] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 137/137 places, 260/260 transitions.
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 10 place count 132 transition count 255
Applied a total of 10 rules in 8 ms. Remains 132 /137 variables (removed 5) and now considering 255/260 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 132/137 places, 255/260 transitions.
[2023-03-22 20:19:55] [INFO ] Flatten gal took : 8 ms
[2023-03-22 20:19:55] [INFO ] Flatten gal took : 8 ms
[2023-03-22 20:19:55] [INFO ] Input system was already deterministic with 255 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 137/137 places, 260/260 transitions.
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 8 place count 133 transition count 256
Applied a total of 8 rules in 8 ms. Remains 133 /137 variables (removed 4) and now considering 256/260 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 133/137 places, 256/260 transitions.
[2023-03-22 20:19:55] [INFO ] Flatten gal took : 8 ms
[2023-03-22 20:19:55] [INFO ] Flatten gal took : 8 ms
[2023-03-22 20:19:55] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 2 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 137/137 places, 260/260 transitions.
[2023-03-22 20:19:55] [INFO ] Flatten gal took : 12 ms
[2023-03-22 20:19:55] [INFO ] Flatten gal took : 8 ms
[2023-03-22 20:19:55] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 137/137 places, 260/260 transitions.
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 10 place count 132 transition count 255
Applied a total of 10 rules in 8 ms. Remains 132 /137 variables (removed 5) and now considering 255/260 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 132/137 places, 255/260 transitions.
[2023-03-22 20:19:55] [INFO ] Flatten gal took : 7 ms
[2023-03-22 20:19:55] [INFO ] Flatten gal took : 7 ms
[2023-03-22 20:19:55] [INFO ] Input system was already deterministic with 255 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 1 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 137/137 places, 260/260 transitions.
[2023-03-22 20:19:55] [INFO ] Flatten gal took : 7 ms
[2023-03-22 20:19:55] [INFO ] Flatten gal took : 7 ms
[2023-03-22 20:19:55] [INFO ] Input system was already deterministic with 260 transitions.
[2023-03-22 20:19:55] [INFO ] Flatten gal took : 16 ms
[2023-03-22 20:19:55] [INFO ] Flatten gal took : 17 ms
[2023-03-22 20:19:55] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 16 ms.
[2023-03-22 20:19:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 137 places, 260 transitions and 1120 arcs took 2 ms.
Total runtime 12429 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/537/ctl_0_ --ctl=/tmp/537/ctl_1_ --ctl=/tmp/537/ctl_2_ --ctl=/tmp/537/ctl_3_ --ctl=/tmp/537/ctl_4_ --ctl=/tmp/537/ctl_5_ --ctl=/tmp/537/ctl_6_ --ctl=/tmp/537/ctl_7_ --ctl=/tmp/537/ctl_8_ --ctl=/tmp/537/ctl_9_ --ctl=/tmp/537/ctl_10_ --ctl=/tmp/537/ctl_11_ --ctl=/tmp/537/ctl_12_ --ctl=/tmp/537/ctl_13_ --ctl=/tmp/537/ctl_14_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393216 kB
MemFree: 196748 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16092972 kB
Could not compute solution for formula : LamportFastMutEx-PT-5-CTLFireability-00
Could not compute solution for formula : LamportFastMutEx-PT-5-CTLFireability-01
Could not compute solution for formula : LamportFastMutEx-PT-5-CTLFireability-02
Could not compute solution for formula : LamportFastMutEx-PT-5-CTLFireability-03
Could not compute solution for formula : LamportFastMutEx-PT-5-CTLFireability-04
Could not compute solution for formula : LamportFastMutEx-PT-5-CTLFireability-05
Could not compute solution for formula : LamportFastMutEx-PT-5-CTLFireability-06
Could not compute solution for formula : LamportFastMutEx-PT-5-CTLFireability-07
Could not compute solution for formula : LamportFastMutEx-PT-5-CTLFireability-08
Could not compute solution for formula : LamportFastMutEx-PT-5-CTLFireability-09
Could not compute solution for formula : LamportFastMutEx-PT-5-CTLFireability-10
Could not compute solution for formula : LamportFastMutEx-PT-5-CTLFireability-11
Could not compute solution for formula : LamportFastMutEx-PT-5-CTLFireability-12
Could not compute solution for formula : LamportFastMutEx-PT-5-CTLFireability-13
FORMULA LamportFastMutEx-PT-5-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679519968063

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2023
ctl formula name LamportFastMutEx-PT-5-CTLFireability-00
ctl formula formula --ctl=/tmp/537/ctl_0_
ctl formula name LamportFastMutEx-PT-5-CTLFireability-01
ctl formula formula --ctl=/tmp/537/ctl_1_
ctl formula name LamportFastMutEx-PT-5-CTLFireability-02
ctl formula formula --ctl=/tmp/537/ctl_2_
ctl formula name LamportFastMutEx-PT-5-CTLFireability-03
ctl formula formula --ctl=/tmp/537/ctl_3_
ctl formula name LamportFastMutEx-PT-5-CTLFireability-04
ctl formula formula --ctl=/tmp/537/ctl_4_
ctl formula name LamportFastMutEx-PT-5-CTLFireability-05
ctl formula formula --ctl=/tmp/537/ctl_5_
ctl formula name LamportFastMutEx-PT-5-CTLFireability-06
ctl formula formula --ctl=/tmp/537/ctl_6_
ctl formula name LamportFastMutEx-PT-5-CTLFireability-07
ctl formula formula --ctl=/tmp/537/ctl_7_
ctl formula name LamportFastMutEx-PT-5-CTLFireability-08
ctl formula formula --ctl=/tmp/537/ctl_8_
ctl formula name LamportFastMutEx-PT-5-CTLFireability-09
ctl formula formula --ctl=/tmp/537/ctl_9_
ctl formula name LamportFastMutEx-PT-5-CTLFireability-10
ctl formula formula --ctl=/tmp/537/ctl_10_
ctl formula name LamportFastMutEx-PT-5-CTLFireability-11
ctl formula formula --ctl=/tmp/537/ctl_11_
ctl formula name LamportFastMutEx-PT-5-CTLFireability-12
ctl formula formula --ctl=/tmp/537/ctl_12_
ctl formula name LamportFastMutEx-PT-5-CTLFireability-13
ctl formula formula --ctl=/tmp/537/ctl_13_
ctl formula name LamportFastMutEx-PT-5-CTLFireability-15
ctl formula formula --ctl=/tmp/537/ctl_14_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 137 places, 260 transitions and 1120 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 260->225 groups
pnml2lts-sym: Regrouping took 0.040 real 0.050 user 0.000 sys
pnml2lts-sym: state vector length is 137; there are 225 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Exploration took 28162627 group checks and 0 next state calls
pnml2lts-sym: reachability took 244.280 real 961.050 user 15.090 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.060 real 0.260 user 0.000 sys
pnml2lts-sym: state space has 530682432 states, 558726 nodes
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/537/ctl_14_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
Killing (15) : 543
Killing (9) : 543

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="LamportFastMutEx-PT-5"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is LamportFastMutEx-PT-5, 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 r233-tall-167856418900418"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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