About the Execution of ITS-Tools for CSRepetitions-COL-04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1422.292 | 27663.00 | 48544.00 | 811.20 | FFFTFFFFFTFTFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918700588.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is CSRepetitions-COL-04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918700588
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 7.4K Apr 30 05:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 30 05:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 30 05:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 30 05:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K May 9 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 07:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 9 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 07:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 14K May 10 09:33 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 CSRepetitions-COL-04-LTLFireability-00
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-01
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-02
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-03
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-04
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-05
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-06
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-07
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-08
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-09
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-10
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-11
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-12
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-13
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-14
FORMULA_NAME CSRepetitions-COL-04-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652664325241
Running Version 202205111006
[2022-05-16 01:25:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 01:25:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 01:25:27] [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.
[2022-05-16 01:25:27] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-16 01:25:27] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 563 ms
[2022-05-16 01:25:27] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 117 PT places and 176.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2022-05-16 01:25:27] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 15 arcs in 10 ms.
[2022-05-16 01:25:27] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Initial state reduction rules removed 2 formulas.
FORMULA CSRepetitions-COL-04-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-04-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 9 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 51 steps, including 1 resets, run visited all 7 properties in 13 ms. (steps per millisecond=3 )
[2022-05-16 01:25:27] [INFO ] Flatten gal took : 14 ms
[2022-05-16 01:25:27] [INFO ] Flatten gal took : 1 ms
Transition Send_Answer forces synchronizations/join behavior on parameter c of sort Client
Symmetric sort wr.t. initial and guards and successors and join/free detected :Server
Symmetric sort wr.t. initial detected :Server
Symmetric sort wr.t. initial and guards detected :Server
Applying symmetric unfolding of full symmetric sort :Server domain size was 4
[2022-05-16 01:25:27] [INFO ] Unfolded HLPN to a Petri net with 66 places and 80 transitions 240 arcs in 9 ms.
[2022-05-16 01:25:27] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Support contains 66 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 5 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:27] [INFO ] Computed 17 place invariants in 13 ms
[2022-05-16 01:25:28] [INFO ] Implicit Places using invariants in 130 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:28] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-16 01:25:28] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:25:28] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:28] [INFO ] Computed 17 place invariants in 6 ms
[2022-05-16 01:25:28] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 80/80 transitions.
Support contains 66 out of 66 places after structural reductions.
[2022-05-16 01:25:28] [INFO ] Flatten gal took : 12 ms
[2022-05-16 01:25:28] [INFO ] Flatten gal took : 15 ms
[2022-05-16 01:25:28] [INFO ] Input system was already deterministic with 80 transitions.
Finished random walk after 38 steps, including 1 resets, run visited all 8 properties in 5 ms. (steps per millisecond=7 )
FORMULA CSRepetitions-COL-04-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1) U G(!p2)))'
Support contains 49 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 6 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:28] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:25:28] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:28] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:25:28] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:25:28] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2022-05-16 01:25:28] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:28] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-16 01:25:28] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 280 ms :[p2, (NOT p0), (NOT p1), (AND (NOT p0) p2 p1)]
Running random walk in product with property : CSRepetitions-COL-04-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(OR (AND (GEQ s0 1) (GEQ s16 1)) (AND (GEQ s0 1) (GEQ s5 1)) (AND (GEQ s0 1) (GEQ s4 1)) (AND (GEQ s0 1) (GEQ s7 1)) (AND (GEQ s0 1) (GEQ s6 1)) (AND (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 69166 steps with 1747 reset in 420 ms.
FORMULA CSRepetitions-COL-04-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-04-LTLFireability-00 finished in 925 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(G(p0))||(G(p1)&&p0)))))'
Support contains 49 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:29] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-16 01:25:29] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:29] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:25:29] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:25:29] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:29] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:25:29] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 222 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-04-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p0:(OR (AND (GEQ s18 1) (GEQ s33 1)) (AND (GEQ s23 1) (GEQ s33 1)) (AND (GEQ s30 1) (GEQ s33 1)) (AND (GEQ s31 1) (GEQ s33 1)) (AND (GEQ s21 1) (GEQ s33 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-04-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-04-LTLFireability-02 finished in 399 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(X(G(X(p1))))))'
Support contains 48 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:30] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:25:30] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:30] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-16 01:25:30] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:25:30] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:30] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:25:30] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-COL-04-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (GEQ s34 1) (GEQ s35 1) (GEQ s36 1) (GEQ s37 1) (GEQ s39 1) (GEQ s38 1) (GEQ s41 1) (GEQ s40 1) (GEQ s43 1) (GEQ s42 1) (GEQ s45 1) (GEQ s44 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, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 209 ms.
Product exploration explored 100000 steps with 50000 reset in 270 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 72 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA CSRepetitions-COL-04-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-04-LTLFireability-03 finished in 850 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G((G(p0)||G(F(p1)))))))'
Support contains 48 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:30] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:25:30] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:30] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-16 01:25:30] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:25:30] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:30] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-16 01:25:31] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : CSRepetitions-COL-04-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s32 1) (GEQ s17 1) (GEQ s18 1) (GEQ s19 1) (GEQ s20 1) (GEQ s21 1) (GEQ s22 1) (GEQ s23 1) (GEQ s24 1) (GEQ s25 1) (GEQ s26 1) (GEQ s27 1) (GE...], 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 183 steps with 12 reset in 4 ms.
FORMULA CSRepetitions-COL-04-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-04-LTLFireability-04 finished in 317 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||G(p1))))'
Support contains 17 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:31] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:25:31] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:31] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:25:31] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:25:31] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:31] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:25:31] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 788 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-COL-04-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(OR (AND (GEQ s18 1) (GEQ s33 1)) (AND (GEQ s23 1) (GEQ s33 1)) (AND (GEQ s30 1) (GEQ s33 1)) (AND (GEQ s31 1) (GEQ s33 1)) (AND (GEQ s21 1) (GEQ s33 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 3 ms.
FORMULA CSRepetitions-COL-04-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-04-LTLFireability-05 finished in 963 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(X(p0)) U X(p0))))'
Support contains 16 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:32] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-16 01:25:32] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:32] [INFO ] Computed 17 place invariants in 6 ms
[2022-05-16 01:25:32] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:25:32] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:32] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-16 01:25:32] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-04-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s32 1) (GEQ s17 1) (GEQ s18 1) (GEQ s19 1) (GEQ s20 1) (GEQ s21 1) (GEQ s22 1) (GEQ s23 1) (GEQ s24 1) (GEQ s25 1) (GEQ s26 1) (GEQ s27 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-04-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-04-LTLFireability-06 finished in 267 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 17 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 6 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:32] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-16 01:25:32] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:32] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-16 01:25:32] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:25:32] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2022-05-16 01:25:32] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:32] [INFO ] Computed 17 place invariants in 7 ms
[2022-05-16 01:25:32] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-04-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s16 1)) (AND (GEQ s0 1) (GEQ s5 1)) (AND (GEQ s0 1) (GEQ s4 1)) (AND (GEQ s0 1) (GEQ s7 1)) (AND (GEQ s0 1) (GEQ s6 1)) (AND (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 192 steps with 16 reset in 1 ms.
FORMULA CSRepetitions-COL-04-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-04-LTLFireability-07 finished in 225 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p1 U (!X(X(p2))&&X(p1)))||p0)))'
Support contains 65 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:32] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:25:32] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:32] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-16 01:25:32] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:25:32] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:32] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-16 01:25:32] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Running random walk in product with property : CSRepetitions-COL-04-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1 p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s18 1) (GEQ s33 1)) (AND (GEQ s23 1) (GEQ s33 1)) (AND (GEQ s30 1) (GEQ s33 1)) (AND (GEQ s31 1) (GEQ s33 1)) (AND (GEQ s21 1) (GEQ s33 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 14973 reset in 374 ms.
Product exploration explored 100000 steps with 14921 reset in 421 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 5 factoid took 254 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 119 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2)]
Finished random walk after 43 steps, including 1 resets, run visited all 4 properties in 5 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) p1 p2)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 338 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 107 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 113 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2)]
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:34] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-16 01:25:34] [INFO ] [Real]Absence check using 17 positive place invariants in 28 ms returned sat
[2022-05-16 01:25:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:25:34] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-16 01:25:34] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:25:34] [INFO ] [Real]Added 16 Read/Feed constraints in 15 ms returned sat
[2022-05-16 01:25:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 01:25:35] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-16 01:25:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 01:25:35] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-05-16 01:25:35] [INFO ] [Nat]Added 16 Read/Feed constraints in 1 ms returned sat
[2022-05-16 01:25:35] [INFO ] Computed and/alt/rep : 64/80/64 causal constraints (skipped 0 transitions) in 15 ms.
[2022-05-16 01:25:35] [INFO ] Added : 13 causal constraints over 3 iterations in 75 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:35] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:25:35] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-16 01:25:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:25:35] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-05-16 01:25:35] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:25:35] [INFO ] [Real]Added 16 Read/Feed constraints in 7 ms returned sat
[2022-05-16 01:25:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 01:25:35] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2022-05-16 01:25:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 01:25:35] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-05-16 01:25:35] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2022-05-16 01:25:35] [INFO ] Computed and/alt/rep : 64/80/64 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 01:25:35] [INFO ] Added : 4 causal constraints over 1 iterations in 26 ms. Result :sat
Could not prove EG (AND (NOT p0) p2)
Support contains 65 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:35] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-16 01:25:35] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:35] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-16 01:25:35] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:25:35] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:35] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-16 01:25:35] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 80/80 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 p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 5 factoid took 252 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 87 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2)]
Finished random walk after 24 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) p1 p2)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 860 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 96 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 112 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2)]
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:37] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:25:37] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-16 01:25:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:25:37] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-05-16 01:25:37] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:25:37] [INFO ] [Real]Added 16 Read/Feed constraints in 2 ms returned sat
[2022-05-16 01:25:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 01:25:37] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-16 01:25:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 01:25:37] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-05-16 01:25:37] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2022-05-16 01:25:37] [INFO ] Computed and/alt/rep : 64/80/64 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 01:25:37] [INFO ] Added : 13 causal constraints over 3 iterations in 34 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:37] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-16 01:25:37] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-16 01:25:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:25:37] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-05-16 01:25:37] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:25:37] [INFO ] [Real]Added 16 Read/Feed constraints in 4 ms returned sat
[2022-05-16 01:25:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 01:25:37] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-16 01:25:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 01:25:37] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-05-16 01:25:37] [INFO ] [Nat]Added 16 Read/Feed constraints in 1 ms returned sat
[2022-05-16 01:25:37] [INFO ] Computed and/alt/rep : 64/80/64 causal constraints (skipped 0 transitions) in 12 ms.
[2022-05-16 01:25:37] [INFO ] Added : 4 causal constraints over 1 iterations in 32 ms. Result :sat
Could not prove EG (AND (NOT p0) p2)
Stuttering acceptance computed with spot in 109 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2)]
Product exploration explored 100000 steps with 14946 reset in 339 ms.
Product exploration explored 100000 steps with 14903 reset in 347 ms.
Built C files in :
/tmp/ltsmin1548326906162683449
[2022-05-16 01:25:38] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1548326906162683449
Running compilation step : cd /tmp/ltsmin1548326906162683449;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 243 ms.
Running link step : cd /tmp/ltsmin1548326906162683449;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1548326906162683449;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7100843096380717718.hoa' '--buchi-type=spotba'
LTSmin run took 3063 ms.
FORMULA CSRepetitions-COL-04-LTLFireability-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CSRepetitions-COL-04-LTLFireability-09 finished in 9407 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(p0) U X(F(p0)))&&F(p0)&&p0)))'
Support contains 17 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 6 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:42] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:25:42] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:42] [INFO ] Computed 17 place invariants in 6 ms
[2022-05-16 01:25:42] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:25:42] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:42] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:25:42] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : CSRepetitions-COL-04-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s16 1)) (AND (GEQ s0 1) (GEQ s5 1)) (AND (GEQ s0 1) (GEQ s4 1)) (AND (GEQ s0 1) (GEQ s7 1)) (AND (GEQ s0 1) (GEQ s6 1)) (AND (...], 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 33333 reset in 178 ms.
Product exploration explored 100000 steps with 33333 reset in 184 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 : [(NOT p0), (X p0), (X (X p0)), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 4 factoid took 81 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA CSRepetitions-COL-04-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-04-LTLFireability-11 finished in 731 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G((G(p0)||F(p1)||!p0)))))'
Support contains 48 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 6 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:42] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:25:42] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:42] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:25:42] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:25:42] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2022-05-16 01:25:42] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:42] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-16 01:25:42] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 66 ms :[false, false]
Running random walk in product with property : CSRepetitions-COL-04-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=1 dest: 1}]], initial=0, aps=[p1:(AND (OR (LT s10 1) (LT s59 1)) (OR (LT s13 1) (LT s62 1)) (OR (LT s15 1) (LT s64 1)) (OR (LT s16 1) (LT s65 1)) (OR (LT s2 1) (LT s51 1)) (OR (LT s5 1...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3350 reset in 297 ms.
Product exploration explored 100000 steps with 3374 reset in 417 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 p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 200 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 80 ms :[false, false]
Finished random walk after 89 steps, including 1 resets, run visited all 3 properties in 7 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 230 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 85 ms :[false, false]
Stuttering acceptance computed with spot in 67 ms :[false, false]
Support contains 48 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 9 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:44] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:25:44] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:44] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-16 01:25:44] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:25:44] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2022-05-16 01:25:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:44] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:25:44] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 80/80 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 p1 p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 207 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 62 ms :[false, false]
Finished random walk after 71 steps, including 1 resets, run visited all 3 properties in 6 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 216 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 66 ms :[false, false]
Stuttering acceptance computed with spot in 85 ms :[false, false]
Stuttering acceptance computed with spot in 64 ms :[false, false]
Product exploration explored 100000 steps with 3404 reset in 290 ms.
Stack based approach found an accepted trace after 18884 steps with 633 reset with depth 45 and stack size 45 in 55 ms.
FORMULA CSRepetitions-COL-04-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-04-LTLFireability-12 finished in 2859 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p1)||p0))))'
Support contains 49 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 5 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:45] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-16 01:25:45] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:45] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:25:45] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:25:45] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2022-05-16 01:25:45] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:45] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:25:45] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-COL-04-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p1:(AND (OR (AND (GEQ s18 1) (GEQ s33 1)) (AND (GEQ s23 1) (GEQ s33 1)) (AND (GEQ s30 1) (GEQ s33 1)) (AND (GEQ s31 1) (GEQ s33 1)) (AND (GEQ s21 1) (GEQ ...], nbAcceptance=2, 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 24 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-COL-04-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-04-LTLFireability-13 finished in 176 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 17 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 6 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:45] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-16 01:25:45] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:45] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:25:45] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:25:45] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2022-05-16 01:25:45] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:45] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-16 01:25:45] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-COL-04-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s16 1)) (AND (GEQ s0 1) (GEQ s5 1)) (AND (GEQ s0 1) (GEQ s4 1)) (AND (GEQ s0 1) (GEQ s7 1)) (AND (GEQ s0 1) (GEQ s6 1)) (AND (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 189 ms.
Product exploration explored 100000 steps with 50000 reset in 209 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 : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA CSRepetitions-COL-04-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-04-LTLFireability-14 finished in 638 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(X((F(!p0) U X(X(X(p1)))))))))'
Support contains 33 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 7 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:46] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:25:46] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:46] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:25:46] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:25:46] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2022-05-16 01:25:46] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:46] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-16 01:25:46] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 544 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false]
Running random walk in product with property : CSRepetitions-COL-04-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={0} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 6}, { cond=p0, acceptance={} source=3 dest: 7}], [{ cond=p0, acceptance={0} source=4 dest: 7}, { cond=p0, acceptance={} source=4 dest: 8}], [{ cond=p0, acceptance={0} source=5 dest: 9}, { cond=p0, acceptance={} source=5 dest: 10}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=8 dest: 9}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 10}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=9 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=9 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=10 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=10 dest: 11}], [{ cond=(AND p0 p1), acceptance={0} source=11 dest: 2}, { cond=(AND p0 p1), acceptance={} source=11 dest: 11}]], initial=0, aps=[p0:(OR (GEQ s34 1) (GEQ s35 1) (GEQ s36 1) (GEQ s37 1) (GEQ s39 1) (GEQ s38 1) (GEQ s41 1) (GEQ s40 1) (GEQ s43 1) (GEQ s42 1) (GEQ s45 1) (GEQ s44 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 13983 reset in 201 ms.
Product exploration explored 100000 steps with 13952 reset in 211 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 242 ms. Reduced automaton from 12 states, 25 edges and 2 AP to 12 states, 25 edges and 2 AP.
Stuttering acceptance computed with spot in 470 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false]
Finished random walk after 38 steps, including 0 resets, run visited all 4 properties in 6 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (AND p1 p0)), (F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F p1)]
Knowledge based reduction with 4 factoid took 320 ms. Reduced automaton from 12 states, 25 edges and 2 AP to 12 states, 25 edges and 2 AP.
Stuttering acceptance computed with spot in 459 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false]
Stuttering acceptance computed with spot in 446 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false]
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:49] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-16 01:25:49] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2022-05-16 01:25:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:25:49] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-16 01:25:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 01:25:49] [INFO ] [Nat]Absence check using 17 positive place invariants in 2 ms returned sat
[2022-05-16 01:25:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 01:25:49] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-16 01:25:49] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:25:49] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2022-05-16 01:25:49] [INFO ] Computed and/alt/rep : 64/80/64 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-16 01:25:49] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 33 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:49] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-16 01:25:49] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:49] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-16 01:25:49] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:25:49] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2022-05-16 01:25:49] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:49] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-16 01:25:49] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 80/80 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 (NOT p1)), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 220 ms. Reduced automaton from 12 states, 25 edges and 2 AP to 12 states, 25 edges and 2 AP.
Stuttering acceptance computed with spot in 430 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false]
Finished random walk after 36 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=36 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (AND p1 p0)), (F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F p1)]
Knowledge based reduction with 4 factoid took 328 ms. Reduced automaton from 12 states, 25 edges and 2 AP to 12 states, 25 edges and 2 AP.
Stuttering acceptance computed with spot in 421 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false]
Stuttering acceptance computed with spot in 434 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false]
// Phase 1: matrix 80 rows 66 cols
[2022-05-16 01:25:51] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-16 01:25:51] [INFO ] [Real]Absence check using 17 positive place invariants in 2 ms returned sat
[2022-05-16 01:25:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:25:51] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-16 01:25:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 01:25:51] [INFO ] [Nat]Absence check using 17 positive place invariants in 2 ms returned sat
[2022-05-16 01:25:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 01:25:51] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-16 01:25:51] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 01:25:51] [INFO ] [Nat]Added 16 Read/Feed constraints in 1 ms returned sat
[2022-05-16 01:25:51] [INFO ] Computed and/alt/rep : 64/80/64 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 01:25:51] [INFO ] Added : 0 causal constraints over 0 iterations in 18 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 516 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false]
Product exploration explored 100000 steps with 13863 reset in 222 ms.
Stack based approach found an accepted trace after 53748 steps with 7508 reset with depth 7 and stack size 7 in 108 ms.
FORMULA CSRepetitions-COL-04-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-04-LTLFireability-15 finished in 6344 ms.
All properties solved by simple procedures.
Total runtime 25853 ms.
BK_STOP 1652664352904
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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="CSRepetitions-COL-04"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is CSRepetitions-COL-04, 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 r024-tall-165251918700588"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-COL-04.tgz
mv CSRepetitions-COL-04 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 ;