About the Execution of 2023-gold for SharedMemory-COL-000020
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
554.228 | 44609.00 | 63790.00 | 464.20 | FFFFTFFTFFFFTFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r351-tall-171679102400448.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is SharedMemory-COL-000020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r351-tall-171679102400448
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 9.2K Apr 12 15:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 12 15:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 12 15:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 15:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 23 07:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 12 16:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 175K Apr 12 16:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 16:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 12 16:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 13K May 18 16:43 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 SharedMemory-COL-000020-LTLFireability-00
FORMULA_NAME SharedMemory-COL-000020-LTLFireability-01
FORMULA_NAME SharedMemory-COL-000020-LTLFireability-02
FORMULA_NAME SharedMemory-COL-000020-LTLFireability-03
FORMULA_NAME SharedMemory-COL-000020-LTLFireability-04
FORMULA_NAME SharedMemory-COL-000020-LTLFireability-05
FORMULA_NAME SharedMemory-COL-000020-LTLFireability-06
FORMULA_NAME SharedMemory-COL-000020-LTLFireability-07
FORMULA_NAME SharedMemory-COL-000020-LTLFireability-08
FORMULA_NAME SharedMemory-COL-000020-LTLFireability-09
FORMULA_NAME SharedMemory-COL-000020-LTLFireability-10
FORMULA_NAME SharedMemory-COL-000020-LTLFireability-11
FORMULA_NAME SharedMemory-COL-000020-LTLFireability-12
FORMULA_NAME SharedMemory-COL-000020-LTLFireability-13
FORMULA_NAME SharedMemory-COL-000020-LTLFireability-14
FORMULA_NAME SharedMemory-COL-000020-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716899974056
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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SharedMemory-COL-000020
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-28 12:39:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 12:39:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 12:39:35] [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.
[2024-05-28 12:39:36] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 12:39:36] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 794 ms
[2024-05-28 12:39:36] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 481 PT places and 1240.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 12:39:36] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 16 arcs in 7 ms.
[2024-05-28 12:39:36] [INFO ] Skeletonized 14 HLPN properties in 3 ms. Removed 2 properties that had guard overlaps.
Initial state reduction rules removed 1 formulas.
FORMULA SharedMemory-COL-000020-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 3 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 25 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
[2024-05-28 12:39:36] [INFO ] Flatten gal took : 13 ms
[2024-05-28 12:39:36] [INFO ] Flatten gal took : 1 ms
Domain [P(20), P(20)] of place Ext_Mem_Acc breaks symmetries in sort P
[2024-05-28 12:39:36] [INFO ] Unfolded HLPN to a Petri net with 481 places and 840 transitions 3280 arcs in 39 ms.
[2024-05-28 12:39:36] [INFO ] Unfolded 15 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 20 transitions.
FORMULA SharedMemory-COL-000020-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000020-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 461 out of 461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 461/461 places, 820/820 transitions.
Applied a total of 0 rules in 33 ms. Remains 461 /461 variables (removed 0) and now considering 820/820 (removed 0) transitions.
// Phase 1: matrix 820 rows 461 cols
[2024-05-28 12:39:37] [INFO ] Computed 41 invariants in 31 ms
[2024-05-28 12:39:37] [INFO ] Implicit Places using invariants in 238 ms returned []
[2024-05-28 12:39:37] [INFO ] Invariant cache hit.
[2024-05-28 12:39:37] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
[2024-05-28 12:39:37] [INFO ] Invariant cache hit.
[2024-05-28 12:39:38] [INFO ] Dead Transitions using invariants and state equation in 371 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 941 ms. Remains : 461/461 places, 820/820 transitions.
Support contains 461 out of 461 places after structural reductions.
[2024-05-28 12:39:38] [INFO ] Flatten gal took : 93 ms
[2024-05-28 12:39:38] [INFO ] Flatten gal took : 87 ms
[2024-05-28 12:39:39] [INFO ] Input system was already deterministic with 820 transitions.
Finished random walk after 50 steps, including 0 resets, run visited all 7 properties in 9 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
FORMULA SharedMemory-COL-000020-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA SharedMemory-COL-000020-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 380 out of 461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 461/461 places, 820/820 transitions.
Applied a total of 0 rules in 9 ms. Remains 461 /461 variables (removed 0) and now considering 820/820 (removed 0) transitions.
[2024-05-28 12:39:39] [INFO ] Invariant cache hit.
[2024-05-28 12:39:39] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-28 12:39:39] [INFO ] Invariant cache hit.
[2024-05-28 12:39:39] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
[2024-05-28 12:39:39] [INFO ] Invariant cache hit.
[2024-05-28 12:39:40] [INFO ] Dead Transitions using invariants and state equation in 317 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 805 ms. Remains : 461/461 places, 820/820 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SharedMemory-COL-000020-LTLFireability-01 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 (GEQ s252 1) (GEQ s128 1) (GEQ s376 1) (GEQ s314 1) (GEQ s190 1) (GEQ s438 1) (GEQ s143 1) (GEQ s391 1) (GEQ s267 1) (GEQ s81 1) (GEQ s329 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][false, false]]
Product exploration explored 100000 steps with 18447 reset in 1395 ms.
Stack based approach found an accepted trace after 340 steps with 68 reset with depth 3 and stack size 3 in 5 ms.
FORMULA SharedMemory-COL-000020-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000020-LTLFireability-01 finished in 2455 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 61 out of 461 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 461/461 places, 820/820 transitions.
Applied a total of 0 rules in 93 ms. Remains 461 /461 variables (removed 0) and now considering 820/820 (removed 0) transitions.
[2024-05-28 12:39:42] [INFO ] Invariant cache hit.
[2024-05-28 12:39:42] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-28 12:39:42] [INFO ] Invariant cache hit.
[2024-05-28 12:39:42] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2024-05-28 12:39:42] [INFO ] Redundant transitions in 47 ms returned []
[2024-05-28 12:39:42] [INFO ] Invariant cache hit.
[2024-05-28 12:39:42] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 819 ms. Remains : 461/461 places, 820/820 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SharedMemory-COL-000020-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s31 1) (LT s49 1) (LT s460 1)) (OR (LT s24 1) (LT s59 1) (LT s460 1)) (OR (LT s32 1) (LT s46 1) (LT s460 1)) (OR (LT s33 1) (LT s43 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2 reset in 3263 ms.
Stack based approach found an accepted trace after 103 steps with 6 reset with depth 41 and stack size 40 in 3 ms.
FORMULA SharedMemory-COL-000020-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000020-LTLFireability-02 finished in 4247 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 61 out of 461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 461/461 places, 820/820 transitions.
Applied a total of 0 rules in 13 ms. Remains 461 /461 variables (removed 0) and now considering 820/820 (removed 0) transitions.
[2024-05-28 12:39:46] [INFO ] Invariant cache hit.
[2024-05-28 12:39:46] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-28 12:39:46] [INFO ] Invariant cache hit.
[2024-05-28 12:39:46] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2024-05-28 12:39:46] [INFO ] Invariant cache hit.
[2024-05-28 12:39:46] [INFO ] Dead Transitions using invariants and state equation in 285 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 653 ms. Remains : 461/461 places, 820/820 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SharedMemory-COL-000020-LTLFireability-04 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 (GEQ s65 1) (GEQ s64 1) (GEQ s67 1) (GEQ s66 1) (GEQ s69 1) (GEQ s68 1) (GEQ s71 1) (GEQ s70 1) (GEQ s73 1) (GEQ s72 1) (GEQ s75 1) (GEQ s74 1) (GE...], 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 498 ms.
Product exploration explored 100000 steps with 50000 reset in 522 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 (Minato strategy)
Knowledge based reduction with 3 factoid took 22 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SharedMemory-COL-000020-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SharedMemory-COL-000020-LTLFireability-04 finished in 1810 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0||F(G(p1)))))||X(!p0)))'
Support contains 400 out of 461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 461/461 places, 820/820 transitions.
Applied a total of 0 rules in 7 ms. Remains 461 /461 variables (removed 0) and now considering 820/820 (removed 0) transitions.
[2024-05-28 12:39:47] [INFO ] Invariant cache hit.
[2024-05-28 12:39:48] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-28 12:39:48] [INFO ] Invariant cache hit.
[2024-05-28 12:39:48] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
[2024-05-28 12:39:48] [INFO ] Invariant cache hit.
[2024-05-28 12:39:48] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 740 ms. Remains : 461/461 places, 820/820 transitions.
Stuttering acceptance computed with spot in 147 ms :[false, false, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SharedMemory-COL-000020-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (LT s252 1) (LT s128 1) (LT s376 1) (LT s314 1) (LT s190 1) (LT s438 1) (LT s143 1) (LT s391 1) (LT s267 1) (LT s81 1) (LT s329 1) (LT s205 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4 reset in 3015 ms.
Stack based approach found an accepted trace after 67 steps with 7 reset with depth 47 and stack size 45 in 1 ms.
FORMULA SharedMemory-COL-000020-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000020-LTLFireability-06 finished in 3928 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 380 out of 461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 461/461 places, 820/820 transitions.
Applied a total of 0 rules in 5 ms. Remains 461 /461 variables (removed 0) and now considering 820/820 (removed 0) transitions.
[2024-05-28 12:39:51] [INFO ] Invariant cache hit.
[2024-05-28 12:39:52] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-28 12:39:52] [INFO ] Invariant cache hit.
[2024-05-28 12:39:52] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
[2024-05-28 12:39:52] [INFO ] Invariant cache hit.
[2024-05-28 12:39:52] [INFO ] Dead Transitions using invariants and state equation in 297 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 820 ms. Remains : 461/461 places, 820/820 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SharedMemory-COL-000020-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (GEQ s252 1) (GEQ s128 1) (GEQ s376 1) (GEQ s314 1) (GEQ s190 1) (GEQ s438 1) (GEQ s143 1) (GEQ s391 1) (GEQ s267 1) (GEQ s81 1) (GEQ s329 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]]
Product exploration explored 100000 steps with 17780 reset in 936 ms.
Stack based approach found an accepted trace after 638 steps with 109 reset with depth 7 and stack size 7 in 7 ms.
FORMULA SharedMemory-COL-000020-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000020-LTLFireability-09 finished in 1948 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 20 out of 461 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 461/461 places, 820/820 transitions.
Applied a total of 0 rules in 65 ms. Remains 461 /461 variables (removed 0) and now considering 820/820 (removed 0) transitions.
[2024-05-28 12:39:53] [INFO ] Invariant cache hit.
[2024-05-28 12:39:54] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-05-28 12:39:54] [INFO ] Invariant cache hit.
[2024-05-28 12:39:54] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
[2024-05-28 12:39:54] [INFO ] Redundant transitions in 108 ms returned []
[2024-05-28 12:39:54] [INFO ] Invariant cache hit.
[2024-05-28 12:39:54] [INFO ] Dead Transitions using invariants and state equation in 305 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1082 ms. Remains : 461/461 places, 820/820 transitions.
Stuttering acceptance computed with spot in 100 ms :[p0, p0]
Running random walk in product with property : SharedMemory-COL-000020-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s65 1) (GEQ s64 1) (GEQ s67 1) (GEQ s66 1) (GEQ s69 1) (GEQ s68 1) (GEQ s71 1) (GEQ s70 1) (GEQ s73 1) (GEQ s72 1) (GEQ s75 1) (GEQ s74 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1540 reset in 904 ms.
Stack based approach found an accepted trace after 35 steps with 0 reset with depth 36 and stack size 36 in 0 ms.
FORMULA SharedMemory-COL-000020-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000020-LTLFireability-10 finished in 2112 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(!p0) U (G(!p1) U p2)))))'
Support contains 440 out of 461 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 461/461 places, 820/820 transitions.
Applied a total of 0 rules in 37 ms. Remains 461 /461 variables (removed 0) and now considering 820/820 (removed 0) transitions.
[2024-05-28 12:39:56] [INFO ] Invariant cache hit.
[2024-05-28 12:39:56] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-28 12:39:56] [INFO ] Invariant cache hit.
[2024-05-28 12:39:56] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
[2024-05-28 12:39:56] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-28 12:39:56] [INFO ] Invariant cache hit.
[2024-05-28 12:39:56] [INFO ] Dead Transitions using invariants and state equation in 296 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 753 ms. Remains : 461/461 places, 820/820 transitions.
Stuttering acceptance computed with spot in 408 ms :[(NOT p2), (AND (NOT p2) p1 p0), (AND p1 (NOT p2)), (AND p0 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (NOT p2), (AND p0 (NOT p2))]
Running random walk in product with property : SharedMemory-COL-000020-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR p2 (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={2} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=0 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={1, 2} source=0 dest: 5}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1, 2} source=0 dest: 6}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 2} source=0 dest: 7}], [{ cond=(AND p2 p1 p0), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1, 2} source=1 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={2} source=1 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={1} source=1 dest: 5}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={1, 2} source=1 dest: 5}, { cond=(AND p2 p1 (NOT p0)), acceptance={0} source=1 dest: 7}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 2} source=1 dest: 7}], [{ cond=(AND (NOT p2) p1 p0), acceptance={0, 1, 2} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={2} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={1, 2} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1, 2} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={1, 2} source=2 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 2} source=2 dest: 7}], [{ cond=(AND (NOT p2) p1 p0), acceptance={0, 1, 2} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={2} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 2} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={1, 2} source=3 dest: 5}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1, 2} source=3 dest: 6}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 2} source=3 dest: 7}], [{ cond=(AND (NOT p2) p1 p0), acceptance={0, 1, 2} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={2} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={1, 2} source=4 dest: 5}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1, 2} source=4 dest: 6}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 2} source=4 dest: 7}], [{ cond=(OR (AND p2 p1) (AND p1 (NOT p0))), acceptance={0, 1} source=5 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1, 2} source=5 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={2} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={1, 2} source=5 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1, 2} source=5 dest: 4}, { cond=(OR (AND p2 (NOT p1)) (AND (NOT p1) (NOT p0))), acceptance={1} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={1, 2} source=5 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 2} source=5 dest: 7}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=6 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1, 2} source=6 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={2} source=6 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=6 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={1} source=6 dest: 5}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={1, 2} source=6 dest: 5}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=6 dest: 6}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1, 2} source=6 dest: 6}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 2} source=6 dest: 7}], [{ cond=(OR (AND p2 p0) (AND (NOT p1) p0)), acceptance={0, 1} source=7 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1, 2} source=7 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={2} source=7 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 2} source=7 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={1, 2} source=7 dest: 5}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1, 2} source=7 dest: 6}, { cond=(OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 2} source=7 dest: 7}]], initial=0, aps=[p2:(OR (GEQ s252 1) (GEQ s128 1) (GEQ s376 1) (GEQ s314 1) (GEQ s190 1) (GEQ s438 1) (GEQ s143 1) (GEQ s391 1) (GEQ s267 1) (GEQ s81 1) (GEQ s329 1) (GEQ ...], nbAcceptance=3, 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]]
Product exploration explored 100000 steps with 1027 reset in 6078 ms.
Stack based approach found an accepted trace after 5861 steps with 59 reset with depth 3 and stack size 3 in 347 ms.
FORMULA SharedMemory-COL-000020-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000020-LTLFireability-11 finished in 7628 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((G(p1)||p0))))))'
Support contains 61 out of 461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 461/461 places, 820/820 transitions.
Applied a total of 0 rules in 10 ms. Remains 461 /461 variables (removed 0) and now considering 820/820 (removed 0) transitions.
[2024-05-28 12:40:03] [INFO ] Invariant cache hit.
[2024-05-28 12:40:03] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-28 12:40:03] [INFO ] Invariant cache hit.
[2024-05-28 12:40:03] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
[2024-05-28 12:40:03] [INFO ] Invariant cache hit.
[2024-05-28 12:40:04] [INFO ] Dead Transitions using invariants and state equation in 296 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 665 ms. Remains : 461/461 places, 820/820 transitions.
Stuttering acceptance computed with spot in 311 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SharedMemory-COL-000020-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (OR (LT s31 1) (LT s49 1) (LT s460 1)) (OR (LT s24 1) (LT s59 1) (LT s460 1)) (OR (LT s32 1) (LT s46 1) (LT s460 1)) (OR (LT s33 1) (LT s43 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 920 ms.
Product exploration explored 100000 steps with 25000 reset in 873 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 p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 7450 steps, including 2 resets, run visited all 2 properties in 340 ms. (steps per millisecond=21 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 138 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 61 out of 461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 461/461 places, 820/820 transitions.
Applied a total of 0 rules in 8 ms. Remains 461 /461 variables (removed 0) and now considering 820/820 (removed 0) transitions.
[2024-05-28 12:40:07] [INFO ] Invariant cache hit.
[2024-05-28 12:40:07] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-28 12:40:07] [INFO ] Invariant cache hit.
[2024-05-28 12:40:07] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
[2024-05-28 12:40:07] [INFO ] Invariant cache hit.
[2024-05-28 12:40:08] [INFO ] Dead Transitions using invariants and state equation in 296 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 744 ms. Remains : 461/461 places, 820/820 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 p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 5739 steps, including 1 resets, run visited all 2 properties in 219 ms. (steps per millisecond=26 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 144 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 488 ms.
Product exploration explored 100000 steps with 25000 reset in 509 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 61 out of 461 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 461/461 places, 820/820 transitions.
Applied a total of 0 rules in 56 ms. Remains 461 /461 variables (removed 0) and now considering 820/820 (removed 0) transitions.
[2024-05-28 12:40:10] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-28 12:40:10] [INFO ] Invariant cache hit.
[2024-05-28 12:40:11] [INFO ] Dead Transitions using invariants and state equation in 293 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 371 ms. Remains : 461/461 places, 820/820 transitions.
Built C files in :
/tmp/ltsmin5305194587600328132
[2024-05-28 12:40:11] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5305194587600328132
Running compilation step : cd /tmp/ltsmin5305194587600328132;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1499 ms.
Running link step : cd /tmp/ltsmin5305194587600328132;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin5305194587600328132;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4857050688894951707.hoa' '--buchi-type=spotba'
LTSmin run took 986 ms.
FORMULA SharedMemory-COL-000020-LTLFireability-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SharedMemory-COL-000020-LTLFireability-12 finished in 10127 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U p1)&&X((F(G(p1))&&G(p0)))))'
Support contains 60 out of 461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 461/461 places, 820/820 transitions.
Applied a total of 0 rules in 23 ms. Remains 461 /461 variables (removed 0) and now considering 820/820 (removed 0) transitions.
[2024-05-28 12:40:13] [INFO ] Invariant cache hit.
[2024-05-28 12:40:13] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-28 12:40:13] [INFO ] Invariant cache hit.
[2024-05-28 12:40:14] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2024-05-28 12:40:14] [INFO ] Invariant cache hit.
[2024-05-28 12:40:14] [INFO ] Dead Transitions using invariants and state equation in 306 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 713 ms. Remains : 461/461 places, 820/820 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SharedMemory-COL-000020-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(OR p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (GEQ s65 1) (GEQ s64 1) (GEQ s67 1) (GEQ s66 1) (GEQ s69 1) (GEQ s68 1) (GEQ s71 1) (GEQ s70 1) (GEQ s73 1) (GEQ s72 1) (GEQ s75 1) (GEQ s74 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 1 ms.
FORMULA SharedMemory-COL-000020-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-COL-000020-LTLFireability-13 finished in 915 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(G(p1)&&X(F(!p0))))))'
Support contains 61 out of 461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 461/461 places, 820/820 transitions.
Applied a total of 0 rules in 9 ms. Remains 461 /461 variables (removed 0) and now considering 820/820 (removed 0) transitions.
[2024-05-28 12:40:14] [INFO ] Invariant cache hit.
[2024-05-28 12:40:14] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-28 12:40:14] [INFO ] Invariant cache hit.
[2024-05-28 12:40:14] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2024-05-28 12:40:14] [INFO ] Invariant cache hit.
[2024-05-28 12:40:15] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 634 ms. Remains : 461/461 places, 820/820 transitions.
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SharedMemory-COL-000020-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 5}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 3}, { cond=(NOT p1), acceptance={0} source=1 dest: 5}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 0}]], initial=6, aps=[p0:(AND (OR (LT s31 1) (LT s49 1) (LT s460 1)) (OR (LT s24 1) (LT s59 1) (LT s460 1)) (OR (LT s32 1) (LT s46 1) (LT s460 1)) (OR (LT s33 1) (LT s43 1) (LT...], 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, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA SharedMemory-COL-000020-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-COL-000020-LTLFireability-14 finished in 918 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(p1)))'
Support contains 60 out of 461 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 461/461 places, 820/820 transitions.
Applied a total of 0 rules in 20 ms. Remains 461 /461 variables (removed 0) and now considering 820/820 (removed 0) transitions.
[2024-05-28 12:40:15] [INFO ] Invariant cache hit.
[2024-05-28 12:40:15] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-28 12:40:15] [INFO ] Invariant cache hit.
[2024-05-28 12:40:15] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
[2024-05-28 12:40:15] [INFO ] Invariant cache hit.
[2024-05-28 12:40:16] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 714 ms. Remains : 461/461 places, 820/820 transitions.
Stuttering acceptance computed with spot in 231 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : SharedMemory-COL-000020-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (GEQ s65 1) (GEQ s64 1) (GEQ s67 1) (GEQ s66 1) (GEQ s69 1) (GEQ s68 1) (GEQ s71 1) (GEQ s70 1) (GEQ s73 1) (GEQ s72 1) (GEQ s75 1) (GEQ s74 1) (GE...], 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 590 ms.
Product exploration explored 100000 steps with 50000 reset in 604 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 p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 17 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SharedMemory-COL-000020-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SharedMemory-COL-000020-LTLFireability-15 finished in 2195 ms.
All properties solved by simple procedures.
Total runtime 42144 ms.
BK_STOP 1716900018665
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="SharedMemory-COL-000020"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is SharedMemory-COL-000020, 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 r351-tall-171679102400448"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SharedMemory-COL-000020.tgz
mv SharedMemory-COL-000020 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 ;