About the Execution of LTSMin+red for ResAllocation-PT-R003C010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 386.907 | 12143.00 | 19931.00 | 353.00 | FFTFFFFFFTFFFFFF | 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.r329-tall-167889202400692.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 ResAllocation-PT-R003C010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-167889202400692
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 7.8K Feb 25 15:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 15:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 15:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 15:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 15:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 15:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 15:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Feb 25 15:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 71K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ResAllocation-PT-R003C010-LTLFireability-00
FORMULA_NAME ResAllocation-PT-R003C010-LTLFireability-01
FORMULA_NAME ResAllocation-PT-R003C010-LTLFireability-02
FORMULA_NAME ResAllocation-PT-R003C010-LTLFireability-03
FORMULA_NAME ResAllocation-PT-R003C010-LTLFireability-04
FORMULA_NAME ResAllocation-PT-R003C010-LTLFireability-05
FORMULA_NAME ResAllocation-PT-R003C010-LTLFireability-06
FORMULA_NAME ResAllocation-PT-R003C010-LTLFireability-07
FORMULA_NAME ResAllocation-PT-R003C010-LTLFireability-08
FORMULA_NAME ResAllocation-PT-R003C010-LTLFireability-09
FORMULA_NAME ResAllocation-PT-R003C010-LTLFireability-10
FORMULA_NAME ResAllocation-PT-R003C010-LTLFireability-11
FORMULA_NAME ResAllocation-PT-R003C010-LTLFireability-12
FORMULA_NAME ResAllocation-PT-R003C010-LTLFireability-13
FORMULA_NAME ResAllocation-PT-R003C010-LTLFireability-14
FORMULA_NAME ResAllocation-PT-R003C010-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679164512966
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=ResAllocation-PT-R003C010
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 18:35:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 18:35:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 18:35:14] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2023-03-18 18:35:14] [INFO ] Transformed 60 places.
[2023-03-18 18:35:14] [INFO ] Transformed 40 transitions.
[2023-03-18 18:35:14] [INFO ] Parsed PT model containing 60 places and 40 transitions and 174 arcs in 108 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ResAllocation-PT-R003C010-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C010-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C010-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C010-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 40/40 transitions.
Applied a total of 0 rules in 10 ms. Remains 60 /60 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 60 cols
[2023-03-18 18:35:14] [INFO ] Computed 30 place invariants in 8 ms
[2023-03-18 18:35:15] [INFO ] Implicit Places using invariants in 314 ms returned []
[2023-03-18 18:35:15] [INFO ] Invariant cache hit.
[2023-03-18 18:35:15] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
[2023-03-18 18:35:15] [INFO ] Invariant cache hit.
[2023-03-18 18:35:15] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 481 ms. Remains : 60/60 places, 40/40 transitions.
Support contains 42 out of 60 places after structural reductions.
[2023-03-18 18:35:15] [INFO ] Flatten gal took : 22 ms
[2023-03-18 18:35:15] [INFO ] Flatten gal took : 8 ms
[2023-03-18 18:35:15] [INFO ] Input system was already deterministic with 40 transitions.
Incomplete random walk after 10000 steps, including 424 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 28) seen :27
Incomplete Best-First random walk after 10000 steps, including 54 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 18:35:15] [INFO ] Invariant cache hit.
[2023-03-18 18:35:15] [INFO ] [Real]Absence check using 30 positive place invariants in 6 ms returned sat
[2023-03-18 18:35:15] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA ResAllocation-PT-R003C010-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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((X(F(p0))||G(F(p1)))) U p2))'
Support contains 7 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 40/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2023-03-18 18:35:15] [INFO ] Invariant cache hit.
[2023-03-18 18:35:16] [INFO ] Implicit Places using invariants in 49 ms returned [55, 57]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 51 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 58/60 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 54 ms. Remains : 58/60 places, 40/40 transitions.
Stuttering acceptance computed with spot in 291 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ResAllocation-PT-R003C010-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s19 1) (GEQ s25 1) (GEQ s1 1) (GEQ s7 1) (GEQ s8 1)), p0:(AND (GEQ s19 1) (GEQ s25 1)), p1:(AND (GEQ s53 1) (GEQ s57 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]]
Stuttering criterion allowed to conclude after 138 steps with 23 reset in 7 ms.
FORMULA ResAllocation-PT-R003C010-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C010-LTLFireability-00 finished in 413 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(p0)))'
Support contains 3 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 40/40 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 51 transition count 31
Applied a total of 18 rules in 14 ms. Remains 51 /60 variables (removed 9) and now considering 31/40 (removed 9) transitions.
// Phase 1: matrix 31 rows 51 cols
[2023-03-18 18:35:16] [INFO ] Computed 30 place invariants in 1 ms
[2023-03-18 18:35:16] [INFO ] Implicit Places using invariants in 60 ms returned [48, 50]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 61 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/60 places, 31/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 31/31 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 78 ms. Remains : 49/60 places, 31/40 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C010-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s41 1) (GEQ s46 1) (GEQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 1 ms.
FORMULA ResAllocation-PT-R003C010-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C010-LTLFireability-01 finished in 125 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(!(p0 U p1))||X((G(!p0)||F(p2)))))'
Support contains 7 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 40/40 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 60 cols
[2023-03-18 18:35:16] [INFO ] Computed 30 place invariants in 2 ms
[2023-03-18 18:35:16] [INFO ] Implicit Places using invariants in 49 ms returned [55, 57, 59]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 50 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/60 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 54 ms. Remains : 57/60 places, 40/40 transitions.
Stuttering acceptance computed with spot in 351 ms :[(NOT p2), (AND (NOT p2) p0 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p0), (AND p1 (NOT p2))]
Running random walk in product with property : ResAllocation-PT-R003C010-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(OR (LT s15 1) (LT s21 1) (LT s22 1)), p0:(AND (GEQ s21 1) (GEQ s24 1) (GEQ s27 1)), p1:(AND (GEQ s7 1) (GEQ s13 1))], 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 38490 reset in 265 ms.
Stack based approach found an accepted trace after 44360 steps with 16950 reset with depth 12 and stack size 12 in 106 ms.
FORMULA ResAllocation-PT-R003C010-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ResAllocation-PT-R003C010-LTLFireability-03 finished in 799 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((G(p2)||p1))))'
Support contains 7 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 40/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2023-03-18 18:35:17] [INFO ] Invariant cache hit.
[2023-03-18 18:35:17] [INFO ] Implicit Places using invariants in 43 ms returned [55, 57, 59]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 44 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/60 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47 ms. Remains : 57/60 places, 40/40 transitions.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C010-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s37 1) (GEQ s43 1) (GEQ s44 1)) (AND (GEQ s1 1) (GEQ s7 1) (GEQ s8 1)) (GEQ s28 1)), p2:(GEQ s28 1), p0:(AND (GEQ s37 1) (GEQ s43 1) (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][false, false, false, false]]
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 1 ms.
FORMULA ResAllocation-PT-R003C010-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C010-LTLFireability-05 finished in 219 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((X(p1)||p0)))'
Support contains 9 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 40/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2023-03-18 18:35:17] [INFO ] Invariant cache hit.
[2023-03-18 18:35:17] [INFO ] Implicit Places using invariants in 41 ms returned [55, 57, 59]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 42 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/60 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45 ms. Remains : 57/60 places, 40/40 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ResAllocation-PT-R003C010-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s13 1) (GEQ s19 1) (GEQ s20 1)) (AND (GEQ s11 1) (GEQ s14 1) (GEQ s17 1))), p1:(OR (AND (GEQ s39 1) (GEQ s45 1) (GEQ s46 1)) (AND (GEQ s1...], 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]]
Stuttering criterion allowed to conclude after 34 steps with 2 reset in 1 ms.
FORMULA ResAllocation-PT-R003C010-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C010-LTLFireability-07 finished in 150 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&&F(p1)))||X(G(p2)))))'
Support contains 6 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 40/40 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2023-03-18 18:35:17] [INFO ] Invariant cache hit.
[2023-03-18 18:35:17] [INFO ] Implicit Places using invariants in 49 ms returned [55, 57, 59]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 62 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/60 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66 ms. Remains : 57/60 places, 40/40 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ResAllocation-PT-R003C010-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(GEQ s1 1), p0:(OR (LT s41 1) (LT s47 1)), p2:(AND (GEQ s3 1) (GEQ s9 1) (GEQ s10 1))], 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, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 37 steps with 3 reset in 1 ms.
FORMULA ResAllocation-PT-R003C010-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C010-LTLFireability-08 finished in 292 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(p1)&&p0) U G((!p2||X(F(!p1)))))))'
Support contains 6 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 40/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2023-03-18 18:35:17] [INFO ] Invariant cache hit.
[2023-03-18 18:35:17] [INFO ] Implicit Places using invariants in 51 ms returned [55, 57, 59]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 52 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/60 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55 ms. Remains : 57/60 places, 40/40 transitions.
Stuttering acceptance computed with spot in 212 ms :[(AND p1 p2), (AND p1 p2), p1, (AND p1 p2), (AND p1 p2), (AND p1 p2)]
Running random walk in product with property : ResAllocation-PT-R003C010-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND p2 p0), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND p2 (NOT p0) p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p2 p0 p1), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=(AND p2 p1), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s7 1) (GEQ s8 1)), p2:(AND (GEQ s19 1) (GEQ s25 1)), p1:(GEQ s30 1)], 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 16962 reset in 242 ms.
Product exploration explored 100000 steps with 17053 reset in 222 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) p2 (NOT p1)), (X (NOT (AND p2 p0))), (X (NOT p0)), (X (X (NOT (AND p2 (NOT p0) p1)))), true, (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 608 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[p1, p1, (AND p1 p2)]
Finished random walk after 484 steps, including 21 resets, run visited all 2 properties in 3 ms. (steps per millisecond=161 )
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND p2 p0))), (X (NOT p0)), (X (X (NOT (AND p2 (NOT p0) p1)))), true, (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 586 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[p1, p1, (AND p1 p2)]
Stuttering acceptance computed with spot in 132 ms :[p1, p1, (AND p1 p2)]
Support contains 3 out of 57 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 57 cols
[2023-03-18 18:35:20] [INFO ] Computed 27 place invariants in 3 ms
[2023-03-18 18:35:20] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-18 18:35:20] [INFO ] Invariant cache hit.
[2023-03-18 18:35:20] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-03-18 18:35:20] [INFO ] Invariant cache hit.
[2023-03-18 18:35:20] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 147 ms. Remains : 57/57 places, 40/40 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 p1) p2), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 258 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[p1, p1, (AND p1 p2)]
Finished random walk after 87 steps, including 4 resets, run visited all 2 properties in 4 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (F p1), (F (NOT p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 304 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[p1, p1, (AND p1 p2)]
Stuttering acceptance computed with spot in 110 ms :[p1, p1, (AND p1 p2)]
Stuttering acceptance computed with spot in 132 ms :[p1, p1, (AND p1 p2)]
Product exploration explored 100000 steps with 25626 reset in 155 ms.
Product exploration explored 100000 steps with 25571 reset in 161 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 126 ms :[p1, p1, (AND p1 p2)]
Support contains 3 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 40/40 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 57 transition count 40
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 8 rules in 10 ms. Remains 57 /57 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2023-03-18 18:35:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 40 rows 57 cols
[2023-03-18 18:35:22] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-18 18:35:22] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/57 places, 40/40 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62 ms. Remains : 57/57 places, 40/40 transitions.
Support contains 3 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 57 cols
[2023-03-18 18:35:22] [INFO ] Computed 27 place invariants in 0 ms
[2023-03-18 18:35:22] [INFO ] Implicit Places using invariants in 191 ms returned []
[2023-03-18 18:35:22] [INFO ] Invariant cache hit.
[2023-03-18 18:35:22] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2023-03-18 18:35:22] [INFO ] Invariant cache hit.
[2023-03-18 18:35:22] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 359 ms. Remains : 57/57 places, 40/40 transitions.
Treatment of property ResAllocation-PT-R003C010-LTLFireability-10 finished in 4695 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((F((p0||G(p1)))&&F(G(p2)))))'
Support contains 7 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 40/40 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 6 places and 0 transitions.
Iterating global reduction 0 with 11 rules applied. Total rules applied 11 place count 54 transition count 35
Applied a total of 11 rules in 7 ms. Remains 54 /60 variables (removed 6) and now considering 35/40 (removed 5) transitions.
// Phase 1: matrix 35 rows 54 cols
[2023-03-18 18:35:22] [INFO ] Computed 29 place invariants in 1 ms
[2023-03-18 18:35:22] [INFO ] Implicit Places using invariants in 40 ms returned [51, 53]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/60 places, 35/40 transitions.
Applied a total of 0 rules in 16 ms. Remains 52 /52 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 69 ms. Remains : 52/60 places, 35/40 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : ResAllocation-PT-R003C010-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s10 1) (GEQ s13 1) (GEQ s16 1)), p1:(AND (GEQ s6 1) (GEQ s12 1)), p2:(AND (GEQ s28 1) (GEQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R003C010-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C010-LTLFireability-11 finished in 195 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(p1))&&p0)))'
Support contains 5 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 40/40 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 60 cols
[2023-03-18 18:35:22] [INFO ] Computed 30 place invariants in 1 ms
[2023-03-18 18:35:22] [INFO ] Implicit Places using invariants in 55 ms returned [55, 57, 59]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 56 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/60 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60 ms. Remains : 57/60 places, 40/40 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R003C010-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s13 1) (GEQ s19 1) (GEQ s20 1)), p1:(OR (LT s2 1) (LT s5 1))], 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 1 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R003C010-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C010-LTLFireability-13 finished in 183 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((!p0 U (p1||G(!p0)))))'
Support contains 5 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2023-03-18 18:35:22] [INFO ] Invariant cache hit.
[2023-03-18 18:35:23] [INFO ] Implicit Places using invariants in 43 ms returned [55, 59]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 58/60 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48 ms. Remains : 58/60 places, 40/40 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : ResAllocation-PT-R003C010-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (NOT (AND (GEQ s7 1) (GEQ s13 1))) (NOT (AND (GEQ s51 1) (GEQ s56 1) (GEQ s57 1)))), p0:(AND (GEQ s7 1) (GEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 ResAllocation-PT-R003C010-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C010-LTLFireability-14 finished in 141 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(((p1 U X(p2))&&X(p1)&&p0)) U X(p3)))'
Support contains 10 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 40/40 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2023-03-18 18:35:23] [INFO ] Invariant cache hit.
[2023-03-18 18:35:23] [INFO ] Implicit Places using invariants in 40 ms returned [55, 59]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 58/60 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45 ms. Remains : 58/60 places, 40/40 transitions.
Stuttering acceptance computed with spot in 304 ms :[(NOT p3), (NOT p3), (AND p0 p1 (NOT p3) (NOT p2)), (NOT p3), true, (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2)]
Running random walk in product with property : ResAllocation-PT-R003C010-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p3), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 p1 (NOT p3) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 p1 (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), acceptance={0} source=3 dest: 4}, { cond=(AND p0 p1 (NOT p3)), acceptance={0} source=3 dest: 5}, { cond=(AND p0 p1 (NOT p3)), acceptance={0} source=3 dest: 7}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}, { cond=(AND p0 p1 p2), acceptance={} source=5 dest: 7}], [{ cond=(NOT p2), acceptance={} source=6 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s7 1) (GEQ s8 1)), p1:(GEQ s6 1), p3:(AND (GEQ s51 1) (GEQ s56 1) (GEQ s57 1)), p2:(AND (GEQ s21 1) (GEQ s24 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 1 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R003C010-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C010-LTLFireability-15 finished in 377 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(p1)&&p0) U G((!p2||X(F(!p1)))))))'
Found a Lengthening insensitive property : ResAllocation-PT-R003C010-LTLFireability-10
Stuttering acceptance computed with spot in 246 ms :[(AND p1 p2), (AND p1 p2), p1, (AND p1 p2), (AND p1 p2), (AND p1 p2)]
Support contains 6 out of 60 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 60/60 places, 40/40 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 15 rules applied. Total rules applied 15 place count 52 transition count 33
Applied a total of 15 rules in 9 ms. Remains 52 /60 variables (removed 8) and now considering 33/40 (removed 7) transitions.
// Phase 1: matrix 33 rows 52 cols
[2023-03-18 18:35:23] [INFO ] Computed 29 place invariants in 1 ms
[2023-03-18 18:35:23] [INFO ] Implicit Places using invariants in 39 ms returned [49, 51]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 50/60 places, 33/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 53 ms. Remains : 50/60 places, 33/40 transitions.
Running random walk in product with property : ResAllocation-PT-R003C010-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND p2 p0), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND p2 (NOT p0) p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p2 p0 p1), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=(AND p2 p1), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s6 1) (GEQ s7 1)), p2:(AND (GEQ s17 1) (GEQ s23 1)), p1:(GEQ s27 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16959 reset in 162 ms.
Stack based approach found an accepted trace after 70359 steps with 12105 reset with depth 9 and stack size 9 in 132 ms.
Treatment of property ResAllocation-PT-R003C010-LTLFireability-10 finished in 694 ms.
FORMULA ResAllocation-PT-R003C010-LTLFireability-10 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-18 18:35:24] [INFO ] Flatten gal took : 6 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 9773 ms.
ITS solved all properties within timeout
BK_STOP 1679164525109
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
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="ResAllocation-PT-R003C010"
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 ResAllocation-PT-R003C010, 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 r329-tall-167889202400692"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R003C010.tgz
mv ResAllocation-PT-R003C010 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 ;