About the Execution of LTSMin+red for GlobalResAllocation-COL-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 406.915 | 23498.00 | 39666.00 | 678.00 | FFFTFFTF?FFTTTFF | normal |
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.r201-smll-167840347400204.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 GlobalResAllocation-COL-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-167840347400204
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 8.1K Feb 25 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 16:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 25 16:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 16:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 25 16:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 29K 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 GlobalResAllocation-COL-10-LTLFireability-00
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-01
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-02
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-03
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-04
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-05
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-06
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-07
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-08
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-09
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-10
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-11
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-12
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-13
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-14
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678623199590
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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GlobalResAllocation-COL-10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 12:13:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 12:13:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 12:13:22] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-12 12:13:22] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-12 12:13:22] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 681 ms
[2023-03-12 12:13:22] [INFO ] Imported 5 HL places and 7 HL transitions for a total of 250 PT places and 1688410.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
[2023-03-12 12:13:23] [INFO ] Built PT skeleton of HLPN with 5 places and 7 transitions 29 arcs in 6 ms.
[2023-03-12 12:13:23] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 4 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 33 steps, including 0 resets, run visited all 4 properties in 9 ms. (steps per millisecond=3 )
[2023-03-12 12:13:23] [INFO ] Flatten gal took : 18 ms
[2023-03-12 12:13:23] [INFO ] Flatten gal took : 3 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Res
Symmetric sort wr.t. initial detected :Res
Symmetric sort wr.t. initial and guards detected :Res
Applying symmetric unfolding of full symmetric sort :Res domain size was 20
Transition release1 forces synchronizations/join behavior on parameter p of sort Proc
[2023-03-12 12:13:23] [INFO ] Unfolded HLPN to a Petri net with 41 places and 70 transitions 290 arcs in 18 ms.
[2023-03-12 12:13:23] [INFO ] Unfolded 16 HLPN properties in 0 ms.
Initial state reduction rules removed 2 formulas.
FORMULA GlobalResAllocation-COL-10-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-10-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 70/70 transitions.
Reduce isomorphic (modulo) transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 41 transition count 60
Applied a total of 20 rules in 12 ms. Remains 41 /41 variables (removed 0) and now considering 60/70 (removed 10) transitions.
// Phase 1: matrix 60 rows 41 cols
[2023-03-12 12:13:23] [INFO ] Computed 21 place invariants in 9 ms
[2023-03-12 12:13:23] [INFO ] Dead Transitions using invariants and state equation in 390 ms found 0 transitions.
[2023-03-12 12:13:23] [INFO ] Invariant cache hit.
[2023-03-12 12:13:23] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-12 12:13:23] [INFO ] Invariant cache hit.
[2023-03-12 12:13:24] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2023-03-12 12:13:24] [INFO ] Invariant cache hit.
[2023-03-12 12:13:24] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 41/41 places, 60/70 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 758 ms. Remains : 41/41 places, 60/70 transitions.
Support contains 41 out of 41 places after structural reductions.
[2023-03-12 12:13:24] [INFO ] Flatten gal took : 33 ms
[2023-03-12 12:13:24] [INFO ] Flatten gal took : 30 ms
[2023-03-12 12:13:24] [INFO ] Input system was already deterministic with 60 transitions.
Finished random walk after 1685 steps, including 0 resets, run visited all 13 properties in 62 ms. (steps per millisecond=27 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&p0)))'
Support contains 11 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 31 transition count 60
Applied a total of 10 rules in 11 ms. Remains 31 /41 variables (removed 10) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 31 cols
[2023-03-12 12:13:25] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-12 12:13:25] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
[2023-03-12 12:13:25] [INFO ] Invariant cache hit.
[2023-03-12 12:13:25] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-12 12:13:25] [INFO ] Invariant cache hit.
[2023-03-12 12:13:25] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2023-03-12 12:13:25] [INFO ] Invariant cache hit.
[2023-03-12 12:13:25] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 31/41 places, 60/60 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 335 ms. Remains : 31/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 359 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (OR (LT s0 1) (LT s10 4)) (OR (LT s9 1) (LT s10 4)) (OR (LT s3 1) (LT s10 4)) (OR (LT s4 1) (LT s10 4)) (OR (LT s7 1) (LT s10 4)) (OR (LT s5 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA GlobalResAllocation-COL-10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-10-LTLFireability-00 finished in 794 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 20 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Applied a total of 0 rules in 8 ms. Remains 41 /41 variables (removed 0) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 41 cols
[2023-03-12 12:13:25] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-12 12:13:25] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
[2023-03-12 12:13:25] [INFO ] Invariant cache hit.
[2023-03-12 12:13:25] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-12 12:13:25] [INFO ] Invariant cache hit.
[2023-03-12 12:13:25] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2023-03-12 12:13:25] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 12:13:25] [INFO ] Invariant cache hit.
[2023-03-12 12:13:26] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 311 ms. Remains : 41/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s20 2) (GEQ s30 2)) (AND (GEQ s11 2) (GEQ s21 2)) (AND (GEQ s13 2) (GEQ s23 2)) (AND (GEQ s15 2) (GEQ s25 2)) (AND (GEQ s17 2) (GEQ s27 2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 42543 reset in 501 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA GlobalResAllocation-COL-10-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-10-LTLFireability-01 finished in 869 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p1)||p0))))'
Support contains 21 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Ensure Unique test removed 10 places
Applied a total of 0 rules in 4 ms. Remains 31 /41 variables (removed 10) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 31 cols
[2023-03-12 12:13:26] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-12 12:13:26] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
[2023-03-12 12:13:26] [INFO ] Invariant cache hit.
[2023-03-12 12:13:26] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-12 12:13:26] [INFO ] Invariant cache hit.
[2023-03-12 12:13:26] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-12 12:13:26] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 12:13:26] [INFO ] Invariant cache hit.
[2023-03-12 12:13:26] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 236 ms. Remains : 31/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (LT s25 4) (LT s26 4) (LT s28 4) (LT s27 4) (LT s30 4) (LT s29 4) (LT s21 4) (LT s22 4) (LT s23 4) (LT s24 4)) (AND (OR (LT s4 1) (LT s10 2)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4398 reset in 463 ms.
Stack based approach found an accepted trace after 2292 steps with 95 reset with depth 40 and stack size 40 in 17 ms.
FORMULA GlobalResAllocation-COL-10-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-10-LTLFireability-02 finished in 840 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(p1))||p0))))'
Support contains 31 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 41 cols
[2023-03-12 12:13:27] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-12 12:13:27] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
[2023-03-12 12:13:27] [INFO ] Invariant cache hit.
[2023-03-12 12:13:27] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-12 12:13:27] [INFO ] Invariant cache hit.
[2023-03-12 12:13:27] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2023-03-12 12:13:27] [INFO ] Invariant cache hit.
[2023-03-12 12:13:27] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 278 ms. Remains : 41/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s11 1) (GEQ s21 1)) (AND (GEQ s15 1) (GEQ s25 1)) (AND (GEQ s19 1) (GEQ s29 1)) (AND (GEQ s13 1) (GEQ s23 1)) (AND (GEQ s17 1) (GEQ s27 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 232 ms.
Product exploration explored 100000 steps with 50000 reset in 282 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 131 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GlobalResAllocation-COL-10-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GlobalResAllocation-COL-10-LTLFireability-03 finished in 1102 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(G(p1)))))'
Support contains 11 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 31 transition count 60
Applied a total of 10 rules in 5 ms. Remains 31 /41 variables (removed 10) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 31 cols
[2023-03-12 12:13:28] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-12 12:13:28] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
[2023-03-12 12:13:28] [INFO ] Invariant cache hit.
[2023-03-12 12:13:28] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-12 12:13:28] [INFO ] Invariant cache hit.
[2023-03-12 12:13:28] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-12 12:13:28] [INFO ] Invariant cache hit.
[2023-03-12 12:13:28] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 31/41 places, 60/60 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 229 ms. Remains : 31/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p1:(OR (AND (GEQ s4 1) (GEQ s10 2)) (AND (GEQ s3 1) (GEQ s10 2)) (AND (GEQ s5 1) (GEQ s10 2)) (AND (GEQ s6 1) (GEQ s10 2)) (AND (GEQ s9 1) (GEQ s10 2)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 1 ms.
FORMULA GlobalResAllocation-COL-10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-10-LTLFireability-04 finished in 405 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U (G(!p1)||G(p2))))'
Support contains 21 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Ensure Unique test removed 10 places
Applied a total of 0 rules in 5 ms. Remains 31 /41 variables (removed 10) and now considering 60/60 (removed 0) transitions.
[2023-03-12 12:13:28] [INFO ] Invariant cache hit.
[2023-03-12 12:13:29] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
[2023-03-12 12:13:29] [INFO ] Invariant cache hit.
[2023-03-12 12:13:29] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-12 12:13:29] [INFO ] Invariant cache hit.
[2023-03-12 12:13:29] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-12 12:13:29] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 12:13:29] [INFO ] Invariant cache hit.
[2023-03-12 12:13:29] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 226 ms. Remains : 31/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 300 ms :[(AND p1 (NOT p2)), true, (OR (AND p0 (NOT p1)) (AND p0 p2)), p1, (NOT p2), (AND p1 (NOT p2)), (AND p1 p0 p2), (AND (NOT p1) p0 (NOT p2))]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 p2 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={1} source=0 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 3}, { cond=(AND p1 p2 p0), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 6}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=0 dest: 7}], [{ cond=true, acceptance={0, 1} source=1 dest: 1}], [{ cond=(OR (AND (NOT p1) p0) (AND p2 p0)), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p1 p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 5}], [{ cond=(AND p1 p2 p0), acceptance={} source=6 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(AND (OR (LT s0 1) (LT s10 4)) (OR (LT s9 1) (LT s10 4)) (OR (LT s3 1) (LT s10 4)) (OR (LT s4 1) (LT s10 4)) (OR (LT s7 1) (LT s10 4)) (OR (LT s5 1) (L...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 1 ms.
FORMULA GlobalResAllocation-COL-10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-10-LTLFireability-05 finished in 552 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U p1)))'
Support contains 31 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 41 cols
[2023-03-12 12:13:29] [INFO ] Computed 21 place invariants in 3 ms
[2023-03-12 12:13:29] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
[2023-03-12 12:13:29] [INFO ] Invariant cache hit.
[2023-03-12 12:13:29] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-12 12:13:29] [INFO ] Invariant cache hit.
[2023-03-12 12:13:29] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2023-03-12 12:13:29] [INFO ] Invariant cache hit.
[2023-03-12 12:13:29] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 250 ms. Remains : 41/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s11 1) (GEQ s21 1)) (AND (GEQ s15 1) (GEQ s25 1)) (AND (GEQ s19 1) (GEQ s29 1)) (AND (GEQ s13 1) (GEQ s23 1)) (AND (GEQ s17 1) (GEQ s27 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 271 ms.
Product exploration explored 100000 steps with 50000 reset in 283 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 6 factoid took 242 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GlobalResAllocation-COL-10-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GlobalResAllocation-COL-10-LTLFireability-06 finished in 1203 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 20 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-12 12:13:30] [INFO ] Invariant cache hit.
[2023-03-12 12:13:30] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
[2023-03-12 12:13:30] [INFO ] Invariant cache hit.
[2023-03-12 12:13:30] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-12 12:13:30] [INFO ] Invariant cache hit.
[2023-03-12 12:13:31] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2023-03-12 12:13:31] [INFO ] Invariant cache hit.
[2023-03-12 12:13:31] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 457 ms. Remains : 41/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, p0, p0]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s20 2) (GEQ s30 2)) (AND (GEQ s11 2) (GEQ s21 2)) (AND (GEQ s13 2) (GEQ s23 2)) (AND (GEQ s15 2) (GEQ s25 2)) (AND (GEQ s17 2) (GEQ s27 2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA GlobalResAllocation-COL-10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-10-LTLFireability-07 finished in 558 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X((X(!p2)&&p1)))))'
Support contains 30 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-12 12:13:31] [INFO ] Invariant cache hit.
[2023-03-12 12:13:31] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
[2023-03-12 12:13:31] [INFO ] Invariant cache hit.
[2023-03-12 12:13:31] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-12 12:13:31] [INFO ] Invariant cache hit.
[2023-03-12 12:13:31] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-12 12:13:31] [INFO ] Invariant cache hit.
[2023-03-12 12:13:31] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 218 ms. Remains : 41/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (AND (GEQ s20 2) (GEQ s30 2)) (AND (GEQ s11 2) (GEQ s21 2)) (AND (GEQ s13 2) (GEQ s23 2)) (AND (GEQ s15 2) (GEQ s25 2)) (AND (GEQ s17 2) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 8356 reset in 456 ms.
Product exploration explored 100000 steps with 8437 reset in 541 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 2 factoid took 180 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p0)]
Finished random walk after 125 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F p0), (F (AND p2 (NOT p0))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 2 factoid took 276 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 412 ms :[(AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p0)]
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p0)]
Support contains 30 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-12 12:13:34] [INFO ] Invariant cache hit.
[2023-03-12 12:13:34] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
[2023-03-12 12:13:34] [INFO ] Invariant cache hit.
[2023-03-12 12:13:34] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-12 12:13:34] [INFO ] Invariant cache hit.
[2023-03-12 12:13:34] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-03-12 12:13:34] [INFO ] Invariant cache hit.
[2023-03-12 12:13:34] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 281 ms. Remains : 41/41 places, 60/60 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1)]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 1 factoid took 148 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Finished random walk after 507 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=126 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1)]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p2)), (F (NOT (AND (NOT p0) p1))), (F p0)]
Knowledge based reduction with 1 factoid took 280 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Product exploration explored 100000 steps with 8391 reset in 408 ms.
Product exploration explored 100000 steps with 8442 reset in 435 ms.
Applying partial POR strategy [true, false, false, true, false]
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Support contains 30 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-12 12:13:36] [INFO ] Invariant cache hit.
[2023-03-12 12:13:36] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
[2023-03-12 12:13:36] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 12:13:36] [INFO ] Invariant cache hit.
[2023-03-12 12:13:36] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 119 ms. Remains : 41/41 places, 60/60 transitions.
Support contains 30 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-12 12:13:36] [INFO ] Invariant cache hit.
[2023-03-12 12:13:37] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
[2023-03-12 12:13:37] [INFO ] Invariant cache hit.
[2023-03-12 12:13:37] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-12 12:13:37] [INFO ] Invariant cache hit.
[2023-03-12 12:13:37] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-12 12:13:37] [INFO ] Invariant cache hit.
[2023-03-12 12:13:37] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 255 ms. Remains : 41/41 places, 60/60 transitions.
Treatment of property GlobalResAllocation-COL-10-LTLFireability-08 finished in 6025 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!p0)&&G((F(p1)&&F(G(p2)))))))'
Support contains 31 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-12 12:13:37] [INFO ] Invariant cache hit.
[2023-03-12 12:13:37] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
[2023-03-12 12:13:37] [INFO ] Invariant cache hit.
[2023-03-12 12:13:37] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-12 12:13:37] [INFO ] Invariant cache hit.
[2023-03-12 12:13:37] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2023-03-12 12:13:37] [INFO ] Invariant cache hit.
[2023-03-12 12:13:37] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 251 ms. Remains : 41/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p1) (NOT p2) p0), (OR (NOT p1) (NOT p2) p0), p0, (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}, { cond=true, acceptance={} source=1 dest: 5}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s10 4)) (OR (LT s9 1) (LT s10 4)) (OR (LT s3 1) (LT s10 4)) (OR (LT s4 1) (LT s10 4)) (OR (LT s7 1) (LT s10 4)) (OR (LT s5 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 327 ms.
Stack based approach found an accepted trace after 37 steps with 0 reset with depth 38 and stack size 38 in 0 ms.
FORMULA GlobalResAllocation-COL-10-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-10-LTLFireability-09 finished in 887 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&((F(!p1)&&G(F(p0))) U p0))))'
Support contains 31 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Applied a total of 0 rules in 0 ms. Remains 41 /41 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-12 12:13:38] [INFO ] Invariant cache hit.
[2023-03-12 12:13:38] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
[2023-03-12 12:13:38] [INFO ] Invariant cache hit.
[2023-03-12 12:13:38] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-12 12:13:38] [INFO ] Invariant cache hit.
[2023-03-12 12:13:38] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-12 12:13:38] [INFO ] Invariant cache hit.
[2023-03-12 12:13:38] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 233 ms. Remains : 41/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 393 ms :[(NOT p0), (NOT p0), (NOT p0), p1, (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 5}, { cond=(NOT p0), acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 7}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=6 dest: 3}, { cond=(NOT p0), acceptance={0} source=6 dest: 5}, { cond=(NOT p0), acceptance={0} source=6 dest: 6}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(OR (AND (GEQ s11 1) (GEQ s21 1)) (AND (GEQ s15 1) (GEQ s25 1)) (AND (GEQ s19 1) (GEQ s29 1)) (AND (GEQ s13 1) (GEQ s23 1)) (AND (GEQ s17 1) (GEQ s27 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 92 steps with 30 reset in 0 ms.
FORMULA GlobalResAllocation-COL-10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-10-LTLFireability-10 finished in 649 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 11 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 31 transition count 60
Applied a total of 10 rules in 2 ms. Remains 31 /41 variables (removed 10) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 31 cols
[2023-03-12 12:13:38] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-12 12:13:38] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
[2023-03-12 12:13:38] [INFO ] Invariant cache hit.
[2023-03-12 12:13:38] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-12 12:13:38] [INFO ] Invariant cache hit.
[2023-03-12 12:13:38] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-12 12:13:38] [INFO ] Invariant cache hit.
[2023-03-12 12:13:39] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 31/41 places, 60/60 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 191 ms. Remains : 31/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s4 1) (GEQ s10 3)) (AND (GEQ s3 1) (GEQ s10 3)) (AND (GEQ s6 1) (GEQ s10 3)) (AND (GEQ s9 1) (GEQ s10 3)) (AND (GEQ s5 1) (GEQ s10 3)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 196 ms.
Product exploration explored 100000 steps with 50000 reset in 211 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GlobalResAllocation-COL-10-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GlobalResAllocation-COL-10-LTLFireability-13 finished in 755 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(!p0)))))'
Support contains 20 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Applied a total of 0 rules in 0 ms. Remains 41 /41 variables (removed 0) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 41 cols
[2023-03-12 12:13:39] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-12 12:13:39] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
[2023-03-12 12:13:39] [INFO ] Invariant cache hit.
[2023-03-12 12:13:39] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-12 12:13:39] [INFO ] Invariant cache hit.
[2023-03-12 12:13:39] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2023-03-12 12:13:39] [INFO ] Invariant cache hit.
[2023-03-12 12:13:39] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 243 ms. Remains : 41/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 191 ms :[true, p0, p0, p0, p0]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (AND (GEQ s20 2) (GEQ s30 2)) (AND (GEQ s11 2) (GEQ s21 2)) (AND (GEQ s13 2) (GEQ s23 2)) (AND (GEQ s15 2) (GEQ s25 2)) (AND (GEQ s17 2) (GEQ s27 2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA GlobalResAllocation-COL-10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-10-LTLFireability-14 finished in 449 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&(!p1||X(F(!p2)))&&p0)))'
Support contains 11 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 31 transition count 60
Applied a total of 10 rules in 2 ms. Remains 31 /41 variables (removed 10) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 31 cols
[2023-03-12 12:13:40] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-12 12:13:40] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
[2023-03-12 12:13:40] [INFO ] Invariant cache hit.
[2023-03-12 12:13:40] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-12 12:13:40] [INFO ] Invariant cache hit.
[2023-03-12 12:13:40] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-12 12:13:40] [INFO ] Invariant cache hit.
[2023-03-12 12:13:40] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 31/41 places, 60/60 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 205 ms. Remains : 31/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (OR (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), (OR (NOT p1) (NOT p0) p2), true]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(OR (AND (GEQ s4 1) (GEQ s10 2)) (AND (GEQ s3 1) (GEQ s10 2)) (AND (GEQ s5 1) (GEQ s10 2)) (AND (GEQ s6 1) (GEQ s10 2)) (AND (GEQ s9 1) (GEQ s10 2)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GlobalResAllocation-COL-10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-10-LTLFireability-15 finished in 418 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X((X(!p2)&&p1)))))'
[2023-03-12 12:13:40] [INFO ] Flatten gal took : 10 ms
[2023-03-12 12:13:40] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2023-03-12 12:13:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 41 places, 60 transitions and 250 arcs took 2 ms.
Total runtime 18535 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1266/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : GlobalResAllocation-COL-10-LTLFireability-08
BK_STOP 1678623223088
--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name GlobalResAllocation-COL-10-LTLFireability-08
ltl formula formula --ltl=/tmp/1266/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 41 places, 60 transitions and 250 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1266/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1266/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1266/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1266/ltl_0_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
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="GlobalResAllocation-COL-10"
export BK_EXAMINATION="LTLFireability"
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 GlobalResAllocation-COL-10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r201-smll-167840347400204"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GlobalResAllocation-COL-10.tgz
mv GlobalResAllocation-COL-10 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;