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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 8.1K Apr 30 05:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 30 05:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 30 05:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 30 05:42 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.8K May 9 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 9 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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 13K 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-02-LTLFireability-00
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-01
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-02
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-03
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-04
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-05
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-06
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-07
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-08
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-09
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-10
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-11
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-12
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-13
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-14
FORMULA_NAME CSRepetitions-COL-02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652663594273

Running Version 202205111006
[2022-05-16 01:13:15] [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:13:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 01:13:15] [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:13:15] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-16 01:13:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 510 ms
[2022-05-16 01:13:16] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 23 PT places and 28.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2022-05-16 01:13:16] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 15 arcs in 8 ms.
[2022-05-16 01:13:16] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA CSRepetitions-COL-02-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-02-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 7 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10003 steps, including 478 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 216 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 6 cols
[2022-05-16 01:13:16] [INFO ] Computed 2 place invariants in 12 ms
[2022-05-16 01:13:16] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
[2022-05-16 01:13:16] [INFO ] Flatten gal took : 13 ms
[2022-05-16 01:13:16] [INFO ] Flatten gal took : 2 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 2
[2022-05-16 01:13:16] [INFO ] Unfolded HLPN to a Petri net with 18 places and 20 transitions 60 arcs in 6 ms.
[2022-05-16 01:13:16] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA CSRepetitions-COL-02-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-02-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 4 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 18 cols
[2022-05-16 01:13:16] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 01:13:16] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 20 rows 18 cols
[2022-05-16 01:13:16] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-16 01:13:16] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 01:13:16] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 18 cols
[2022-05-16 01:13:16] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-16 01:13:16] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 18/18 places, 20/20 transitions.
Support contains 18 out of 18 places after structural reductions.
[2022-05-16 01:13:16] [INFO ] Flatten gal took : 4 ms
[2022-05-16 01:13:16] [INFO ] Flatten gal took : 5 ms
[2022-05-16 01:13:16] [INFO ] Input system was already deterministic with 20 transitions.
Incomplete random walk after 10000 steps, including 597 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10000 steps, including 146 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 145 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 20 rows 18 cols
[2022-05-16 01:13:16] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-16 01:13:16] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 12 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 8 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 18 cols
[2022-05-16 01:13:17] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 01:13:17] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 20 rows 18 cols
[2022-05-16 01:13:17] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 01:13:17] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 01:13:17] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 18 cols
[2022-05-16 01:13:17] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 01:13:17] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 18/18 places, 20/20 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-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 s2 1) (GEQ s15 1)) (AND (GEQ s4 1) (GEQ s17 1)) (AND (GEQ s1 1) (GEQ s14 1)) (AND (GEQ s3 1) (GEQ s16 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 32 steps with 4 reset in 2 ms.
FORMULA CSRepetitions-COL-02-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-02-LTLFireability-01 finished in 324 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 5 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 20/20 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 10 transition count 16
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 7 transition count 13
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 7 transition count 13
Applied a total of 18 rules in 8 ms. Remains 7 /18 variables (removed 11) and now considering 13/20 (removed 7) transitions.
// Phase 1: matrix 13 rows 7 cols
[2022-05-16 01:13:17] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 01:13:17] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 13 rows 7 cols
[2022-05-16 01:13:17] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 01:13:17] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2022-05-16 01:13:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 7 cols
[2022-05-16 01:13:17] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 01:13:17] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/18 places, 13/20 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/18 places, 13/20 transitions.
Stuttering acceptance computed with spot in 72 ms :[p0, p0]
Running random walk in product with property : CSRepetitions-COL-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 s1 1) (GEQ s5 1)) (AND (GEQ s2 1) (GEQ s5 1)) (AND (GEQ s4 1) (GEQ s5 1)) (AND (GEQ s3 1) (GEQ s5 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]]
Product exploration explored 100000 steps with 17545 reset in 305 ms.
Stack based approach found an accepted trace after 108 steps with 16 reset with depth 5 and stack size 5 in 3 ms.
FORMULA CSRepetitions-COL-02-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-02-LTLFireability-02 finished in 477 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 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 18 cols
[2022-05-16 01:13:17] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-16 01:13:17] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 20 rows 18 cols
[2022-05-16 01:13:17] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 01:13:18] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 01:13:18] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 18 cols
[2022-05-16 01:13:18] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 01:13:18] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 18/18 places, 20/20 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-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 s5 1) (GEQ s6 1) (GEQ s7 1) (GEQ s8 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-COL-02-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-02-LTLFireability-03 finished in 214 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 13 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 5 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 18 cols
[2022-05-16 01:13:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 01:13:18] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 20 rows 18 cols
[2022-05-16 01:13:18] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-16 01:13:18] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 01:13:18] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2022-05-16 01:13:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 20 rows 18 cols
[2022-05-16 01:13:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 01:13:18] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 18/18 places, 20/20 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p3), true, (AND p2 p1), (OR p0 (AND p1 p2))]
Running random walk in product with property : CSRepetitions-COL-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 s2 1) (GEQ s15 1)) (AND (GEQ s4 1) (GEQ s17 1)) (AND (GEQ s1 1) (GEQ s14 1)) (AND (GEQ s3 1) (GEQ s16 1))), p3:(OR (AND (GEQ s0 1) (GEQ s...], 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 10 steps with 2 reset in 0 ms.
FORMULA CSRepetitions-COL-02-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-02-LTLFireability-04 finished in 281 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 8 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 18 cols
[2022-05-16 01:13:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 01:13:18] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 20 rows 18 cols
[2022-05-16 01:13:18] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 01:13:18] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 01:13:18] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2022-05-16 01:13:18] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 20 rows 18 cols
[2022-05-16 01:13:18] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 01:13:18] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 18/18 places, 20/20 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-COL-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 s2 1) (GEQ s15 1)) (AND (GEQ s4 1) (GEQ s17 1)) (AND (GEQ s1 1) (GEQ s14 1)) (AND (GEQ s3 1) (GEQ s16 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 12 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-COL-02-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-02-LTLFireability-06 finished in 144 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 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 18 cols
[2022-05-16 01:13:18] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 01:13:18] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 20 rows 18 cols
[2022-05-16 01:13:18] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 01:13:18] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 01:13:18] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2022-05-16 01:13:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 20 rows 18 cols
[2022-05-16 01:13:18] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 01:13:18] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 18/18 places, 20/20 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-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 s10 1) (GEQ s11 1) (GEQ s12 1) (GEQ s13 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 12 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-02-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-02-LTLFireability-07 finished in 201 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(F((((F(G(p0))&&p1) U G(p0))&&X(p1)))))))'
Support contains 9 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 18 cols
[2022-05-16 01:13:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 01:13:18] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 20 rows 18 cols
[2022-05-16 01:13:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 01:13:18] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 01:13:18] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 18 cols
[2022-05-16 01:13:18] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 01:13:18] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 18/18 places, 20/20 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-02-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 3}, { cond=(OR p0 p1), acceptance={0} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(AND p0 p1), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s4 1)) (AND (GEQ s0 1) (GEQ s1 1)) (AND (GEQ s0 1) (GEQ s3 1)) (AND (GEQ s0 1) (GEQ s2 1))), p1:(OR (GEQ s10 1) (GEQ s11 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 31 steps with 1 reset in 1 ms.
FORMULA CSRepetitions-COL-02-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-02-LTLFireability-08 finished in 334 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)||p1))||!(!p0 U G(F(!p1)))))'
Support contains 9 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 18 cols
[2022-05-16 01:13:19] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 01:13:19] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 20 rows 18 cols
[2022-05-16 01:13:19] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 01:13:19] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 01:13:19] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2022-05-16 01:13:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 20 rows 18 cols
[2022-05-16 01:13:19] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 01:13:19] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 18/18 places, 20/20 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-COL-02-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (OR (LT s0 1) (LT s4 1)) (OR (LT s0 1) (LT s1 1)) (OR (LT s0 1) (LT s3 1)) (OR (LT s0 1) (LT s2 1))), p0:(AND (OR (LT s2 1) (LT s15 1)) (OR (LT s4...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 8406 reset in 176 ms.
Stack based approach found an accepted trace after 514 steps with 43 reset with depth 23 and stack size 23 in 1 ms.
FORMULA CSRepetitions-COL-02-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-02-LTLFireability-09 finished in 360 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||(G(X(G(!p0)))&&X(X(X(p1)))))))'
Support contains 9 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 18 cols
[2022-05-16 01:13:19] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 01:13:19] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 20 rows 18 cols
[2022-05-16 01:13:19] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 01:13:19] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 01:13:19] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 18 cols
[2022-05-16 01:13:19] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-16 01:13:19] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 18/18 places, 20/20 transitions.
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p0), (OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : CSRepetitions-COL-02-LTLFireability-10 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=(OR p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(NOT p0), acceptance={} source=5 dest: 2}], [{ cond=p0, acceptance={} source=6 dest: 0}, { cond=(NOT p0), acceptance={} source=6 dest: 5}]], initial=3, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s4 1)) (AND (GEQ s0 1) (GEQ s1 1)) (AND (GEQ s0 1) (GEQ s3 1)) (AND (GEQ s0 1) (GEQ s2 1))), p1:(OR (GEQ s5 1) (GEQ s6 1) (GEQ...], 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 1 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-02-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-02-LTLFireability-10 finished in 376 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 8 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 18 cols
[2022-05-16 01:13:19] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 01:13:19] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 20 rows 18 cols
[2022-05-16 01:13:19] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 01:13:19] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 01:13:19] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 18 cols
[2022-05-16 01:13:19] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 01:13:19] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 18/18 places, 20/20 transitions.
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-02-LTLFireability-11 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 (AND (GEQ s2 1) (GEQ s15 1)) (AND (GEQ s4 1) (GEQ s17 1)) (AND (GEQ s1 1) (GEQ s14 1)) (AND (GEQ s3 1) (GEQ s16 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-COL-02-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-02-LTLFireability-11 finished in 150 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(G(p0) U G(!p0))))'
Support contains 4 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 20/20 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 10 transition count 16
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 7 transition count 13
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 7 transition count 13
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 21 place count 5 transition count 12
Applied a total of 21 rules in 5 ms. Remains 5 /18 variables (removed 13) and now considering 12/20 (removed 8) transitions.
// Phase 1: matrix 12 rows 5 cols
[2022-05-16 01:13:19] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 01:13:20] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 12 rows 5 cols
[2022-05-16 01:13:20] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 01:13:20] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2022-05-16 01:13:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 5 cols
[2022-05-16 01:13:20] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 01:13:20] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/18 places, 12/20 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/18 places, 12/20 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-COL-02-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 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]]
Product exploration explored 100000 steps with 50000 reset in 70 ms.
Product exploration explored 100000 steps with 50000 reset in 88 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)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA CSRepetitions-COL-02-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-02-LTLFireability-13 finished in 353 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(!((G(p0)||!p0) U X(p1)))))'
Support contains 5 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 18 cols
[2022-05-16 01:13:20] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 01:13:20] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 20 rows 18 cols
[2022-05-16 01:13:20] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 01:13:20] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 01:13:20] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 18 cols
[2022-05-16 01:13:20] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 01:13:20] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 18/18 places, 20/20 transitions.
Stuttering acceptance computed with spot in 162 ms :[p1, p1, p1, (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : CSRepetitions-COL-02-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (GEQ s5 1) (GEQ s6 1) (GEQ s7 1) (GEQ s8 1)), p1:(OR (AND (GEQ s5 1) (GEQ s9 1)) (AND (GEQ s6 1) (GEQ s9 1)) (AND (GEQ s8 1) (GEQ s9 1)) (AND (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 19002 reset in 133 ms.
Stack based approach found an accepted trace after 6844 steps with 1282 reset with depth 10 and stack size 10 in 8 ms.
FORMULA CSRepetitions-COL-02-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-02-LTLFireability-14 finished in 423 ms.
All properties solved by simple procedures.
Total runtime 5378 ms.

BK_STOP 1652663600818

--------------------
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-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-COL-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-165251918700572"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-COL-02.tgz
mv CSRepetitions-COL-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 ;