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-165251918800620.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-PT-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918800620
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 15K Apr 30 05:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 30 05:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 30 05:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 30 05:43 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 8.1K May 9 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K May 9 07:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 9 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K May 9 07:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K May 9 07:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 26K 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-PT-02-LTLFireability-00
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-01
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-02
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-03
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-04
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-05
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-06
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-07
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-08
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-09
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-10
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-11
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-12
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-13
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-14
FORMULA_NAME CSRepetitions-PT-02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652669671748

Running Version 202205111006
[2022-05-16 02:54:32] [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 02:54:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 02:54:32] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2022-05-16 02:54:32] [INFO ] Transformed 23 places.
[2022-05-16 02:54:32] [INFO ] Transformed 28 transitions.
[2022-05-16 02:54:32] [INFO ] Parsed PT model containing 23 places and 28 transitions in 148 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CSRepetitions-PT-02-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-02-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 7 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:33] [INFO ] Computed 6 place invariants in 6 ms
[2022-05-16 02:54:33] [INFO ] Implicit Places using invariants in 100 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:33] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-16 02:54:33] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 02:54:33] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:33] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-16 02:54:33] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Support contains 23 out of 23 places after structural reductions.
[2022-05-16 02:54:33] [INFO ] Flatten gal took : 17 ms
[2022-05-16 02:54:33] [INFO ] Flatten gal took : 6 ms
[2022-05-16 02:54:33] [INFO ] Input system was already deterministic with 28 transitions.
Incomplete random walk after 10000 steps, including 533 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 23) seen :22
Incomplete Best-First random walk after 10001 steps, including 123 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:33] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-16 02:54:33] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA CSRepetitions-PT-02-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
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' '!(X(F(p0)))'
Support contains 12 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:34] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-16 02:54:34] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:34] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 02:54:34] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 02:54:34] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:34] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 02:54:34] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-02-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s9 1) (GEQ s13 1)) (AND (GEQ s14 1) (GEQ s15 1)) (AND (GEQ s10 1) (GEQ s11 1)) (AND (GEQ s5 1) (GEQ s14 1)) (AND (GEQ s2 1) (GEQ s9 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 16 steps with 1 reset in 3 ms.
FORMULA CSRepetitions-PT-02-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-LTLFireability-01 finished in 339 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(X(G(p0)) U F(G(p0)))))'
Support contains 6 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 15 transition count 24
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 9 transition count 18
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 9 transition count 18
Applied a total of 24 rules in 11 ms. Remains 9 /23 variables (removed 14) and now considering 18/28 (removed 10) transitions.
// Phase 1: matrix 18 rows 9 cols
[2022-05-16 02:54:34] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 02:54:34] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 18 rows 9 cols
[2022-05-16 02:54:34] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 02:54:34] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2022-05-16 02:54:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 18 rows 9 cols
[2022-05-16 02:54:34] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 02:54:34] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/23 places, 18/28 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/23 places, 18/28 transitions.
Stuttering acceptance computed with spot in 59 ms :[p0, p0]
Running random walk in product with property : CSRepetitions-PT-02-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s2 1) (GEQ s4 1)) (AND (GEQ s6 1) (GEQ s7 1)) (AND (GEQ s0 1) (GEQ s6 1)) (AND (GEQ s5 1) (GEQ s6 1)) (AND (GEQ s2 1) (GEQ s6 1)) (AND (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 17035 reset in 256 ms.
Stack based approach found an accepted trace after 437 steps with 75 reset with depth 6 and stack size 6 in 1 ms.
FORMULA CSRepetitions-PT-02-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-02-LTLFireability-02 finished in 411 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:34] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 02:54:34] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:34] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-16 02:54:34] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 02:54:34] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:34] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 02:54:35] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-02-LTLFireability-03 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 s16 1) (GEQ s0 1) (GEQ s19 1) (GEQ s4 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-02-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-LTLFireability-03 finished in 224 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!F((X(G(((p1 U p1)&&p2)))||p0)) U p3))'
Support contains 17 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 6 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:35] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 02:54:35] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:35] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-16 02:54:35] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 02:54:35] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2022-05-16 02:54:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:35] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 02:54:35] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p3), true, (AND p2 p1), (OR p0 (AND p1 p2))]
Running random walk in product with property : CSRepetitions-PT-02-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p3)), acceptance={0} source=0 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p3) p1), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 p1), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s9 1) (GEQ s13 1)) (AND (GEQ s14 1) (GEQ s15 1)) (AND (GEQ s10 1) (GEQ s11 1)) (AND (GEQ s5 1) (GEQ s14 1)) (AND (GEQ s2 1) (GEQ s9 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 13 steps with 3 reset in 1 ms.
FORMULA CSRepetitions-PT-02-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-LTLFireability-04 finished in 323 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 12 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:35] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 02:54:35] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:35] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 02:54:35] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 02:54:35] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2022-05-16 02:54:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:35] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 02:54:35] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-PT-02-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s9 1) (GEQ s13 1)) (AND (GEQ s14 1) (GEQ s15 1)) (AND (GEQ s10 1) (GEQ s11 1)) (AND (GEQ s5 1) (GEQ s14 1)) (AND (GEQ s2 1) (GEQ s9 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-02-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-LTLFireability-06 finished in 150 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(p0))))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:35] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 02:54:35] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:35] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 02:54:35] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 02:54:35] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2022-05-16 02:54:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:35] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 02:54:35] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-02-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 (GEQ s3 1) (GEQ s21 1) (GEQ s6 1) (GEQ s22 1))], 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 26 steps with 1 reset in 1 ms.
FORMULA CSRepetitions-PT-02-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-LTLFireability-07 finished in 196 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((F(F(G(p0)))&&p1))))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:35] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 02:54:35] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:35] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 02:54:35] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 02:54:35] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:35] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-16 02:54:35] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-02-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LT s3 1), p0:(OR (AND (GEQ s1 1) (GEQ s12 1) (GEQ s3 1)) (GEQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-02-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-LTLFireability-08 finished in 241 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(G(F(G(F(p0))))))||G(F(G((F(p1)&&p2))))))'
Support contains 5 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 17 transition count 25
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 13 place count 13 transition count 21
Iterating global reduction 0 with 4 rules applied. Total rules applied 17 place count 13 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 19 place count 12 transition count 20
Applied a total of 19 rules in 11 ms. Remains 12 /23 variables (removed 11) and now considering 20/28 (removed 8) transitions.
// Phase 1: matrix 20 rows 12 cols
[2022-05-16 02:54:36] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 02:54:36] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 20 rows 12 cols
[2022-05-16 02:54:36] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 02:54:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 02:54:36] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2022-05-16 02:54:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 20 rows 12 cols
[2022-05-16 02:54:36] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-16 02:54:36] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/23 places, 20/28 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/23 places, 20/28 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-02-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s4 1)), p2:(GEQ s11 1), p1:(AND (GEQ s5 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 28 steps with 5 reset in 1 ms.
FORMULA CSRepetitions-PT-02-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-LTLFireability-09 finished in 306 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&X(p1)))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:36] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 02:54:36] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:36] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 02:54:36] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 02:54:36] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:36] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 02:54:36] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-02-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s8 1) (GEQ s19 1)), p1:(AND (GEQ s10 1) (GEQ s11 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-02-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-LTLFireability-10 finished in 233 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(X(p0))&&(G(X(X(p1)))||p2))))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:36] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 02:54:36] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:36] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 02:54:36] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 02:54:36] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:36] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 02:54:36] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : CSRepetitions-PT-02-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s22 1), p0:(OR (LT s12 1) (LT s20 1)), p1:(OR (LT s9 1) (LT s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 30605 reset in 106 ms.
Stack based approach found an accepted trace after 1130 steps with 350 reset with depth 10 and stack size 10 in 2 ms.
FORMULA CSRepetitions-PT-02-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-02-LTLFireability-12 finished in 354 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 15 transition count 24
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 9 transition count 18
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 9 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 5 transition count 16
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 6 edges and 5 vertex of which 4 / 5 are part of one of the 1 SCC in 2 ms
Free SCC test removed 3 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 35 place count 2 transition count 12
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 42 place count 2 transition count 5
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 2 transition count 4
Applied a total of 43 rules in 11 ms. Remains 2 /23 variables (removed 21) and now considering 4/28 (removed 24) transitions.
// Phase 1: matrix 4 rows 2 cols
[2022-05-16 02:54:36] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 02:54:36] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 4 rows 2 cols
[2022-05-16 02:54:36] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 02:54:36] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2022-05-16 02:54:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 2 cols
[2022-05-16 02:54:36] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 02:54:36] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/23 places, 4/28 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/23 places, 4/28 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-PT-02-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s0 1)], 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-02-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-LTLFireability-13 finished in 122 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)||G(p1)||X(p2))))'
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:37] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 02:54:37] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:37] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 02:54:37] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 02:54:37] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:37] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 02:54:37] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : CSRepetitions-PT-02-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s10 1) (GEQ s20 1) (GEQ s10 1) (GEQ s18 1)), p1:(AND (GEQ s10 1) (GEQ s18 1)), p2:(AND (GEQ s14 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 32 steps with 4 reset in 0 ms.
FORMULA CSRepetitions-PT-02-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-LTLFireability-14 finished in 193 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((F(X(F(p0)))&&p1)))||G(p2)))'
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 3 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:37] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 02:54:37] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:37] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 02:54:37] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 02:54:37] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
// Phase 1: matrix 28 rows 23 cols
[2022-05-16 02:54:37] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 02:54:37] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Stuttering acceptance computed with spot in 335 ms :[(NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : CSRepetitions-PT-02-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(AND p2 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=p2, acceptance={} source=4 dest: 1}, { cond=(NOT p2), acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 3}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=p2, acceptance={} source=7 dest: 4}, { cond=(NOT p2), acceptance={} source=7 dest: 5}], [{ cond=(NOT p2), acceptance={} source=8 dest: 6}, { cond=p2, acceptance={} source=8 dest: 8}]], initial=7, aps=[p0:(OR (LT s0 1) (GEQ s21 1)), p2:(GEQ s21 1), p1:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 57 steps with 12 reset in 1 ms.
FORMULA CSRepetitions-PT-02-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-02-LTLFireability-15 finished in 465 ms.
All properties solved by simple procedures.
Total runtime 4854 ms.

BK_STOP 1652669677730

--------------------
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-PT-02"
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-PT-02, 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-165251918800620"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-PT-02.tgz
mv CSRepetitions-PT-02 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;