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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 5.3K Apr 30 02:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Apr 30 02:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Apr 30 02:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Apr 30 02:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 08:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 61K May 10 09:34 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 JoinFreeModules-PT-0020-LTLFireability-00
FORMULA_NAME JoinFreeModules-PT-0020-LTLFireability-01
FORMULA_NAME JoinFreeModules-PT-0020-LTLFireability-02
FORMULA_NAME JoinFreeModules-PT-0020-LTLFireability-03
FORMULA_NAME JoinFreeModules-PT-0020-LTLFireability-04
FORMULA_NAME JoinFreeModules-PT-0020-LTLFireability-05
FORMULA_NAME JoinFreeModules-PT-0020-LTLFireability-06
FORMULA_NAME JoinFreeModules-PT-0020-LTLFireability-07
FORMULA_NAME JoinFreeModules-PT-0020-LTLFireability-08
FORMULA_NAME JoinFreeModules-PT-0020-LTLFireability-09
FORMULA_NAME JoinFreeModules-PT-0020-LTLFireability-10
FORMULA_NAME JoinFreeModules-PT-0020-LTLFireability-11
FORMULA_NAME JoinFreeModules-PT-0020-LTLFireability-12
FORMULA_NAME JoinFreeModules-PT-0020-LTLFireability-13
FORMULA_NAME JoinFreeModules-PT-0020-LTLFireability-14
FORMULA_NAME JoinFreeModules-PT-0020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652747920063

Running Version 202205111006
[2022-05-17 00:38:41] [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-17 00:38:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 00:38:41] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2022-05-17 00:38:41] [INFO ] Transformed 101 places.
[2022-05-17 00:38:41] [INFO ] Transformed 161 transitions.
[2022-05-17 00:38:41] [INFO ] Parsed PT model containing 101 places and 161 transitions in 182 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0020-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0020-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 161/161 transitions.
Applied a total of 0 rules in 12 ms. Remains 100 /100 variables (removed 0) and now considering 161/161 (removed 0) transitions.
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:41] [INFO ] Computed 20 place invariants in 14 ms
[2022-05-17 00:38:41] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:41] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-17 00:38:41] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:41] [INFO ] Computed 20 place invariants in 8 ms
[2022-05-17 00:38:41] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-17 00:38:41] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:41] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-17 00:38:41] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 161/161 transitions.
Support contains 27 out of 100 places after structural reductions.
[2022-05-17 00:38:42] [INFO ] Flatten gal took : 35 ms
[2022-05-17 00:38:42] [INFO ] Flatten gal took : 15 ms
[2022-05-17 00:38:42] [INFO ] Input system was already deterministic with 161 transitions.
Finished random walk after 1537 steps, including 0 resets, run visited all 28 properties in 68 ms. (steps per millisecond=22 )
FORMULA JoinFreeModules-PT-0020-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(X(F(G((G(p0)&&(X(G(p1))||G(!p1))))))))'
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 161/161 transitions.
Applied a total of 0 rules in 14 ms. Remains 100 /100 variables (removed 0) and now considering 161/161 (removed 0) transitions.
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:42] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-17 00:38:42] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:42] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-17 00:38:42] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:42] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-17 00:38:42] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-17 00:38:42] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2022-05-17 00:38:42] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:42] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 00:38:43] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 161/161 transitions.
Stuttering acceptance computed with spot in 361 ms :[(NOT p0), (NOT p0), false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : JoinFreeModules-PT-0020-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1, 2} source=0 dest: 0}, { cond=p0, acceptance={1, 2} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 2} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={0, 1, 2} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1, 2} source=1 dest: 0}, { cond=p0, acceptance={1, 2} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 2} source=2 dest: 2}, { cond=p1, acceptance={0, 1} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 2} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={2} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1, 2} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 2} source=3 dest: 2}, { cond=p1, acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0, 1, 2} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={1, 2} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 2} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={0, 1, 2} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 2} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={2} source=4 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0, 1, 2} source=5 dest: 0}, { cond=(AND p0 p1), acceptance={1, 2} source=5 dest: 1}]], initial=0, aps=[p0:(LT s77 1), p1:(LT s7 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA JoinFreeModules-PT-0020-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0020-LTLFireability-00 finished in 727 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 161/161 transitions.
Applied a total of 0 rules in 12 ms. Remains 100 /100 variables (removed 0) and now considering 161/161 (removed 0) transitions.
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:43] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 00:38:43] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:43] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 00:38:43] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:43] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-17 00:38:43] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-17 00:38:43] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2022-05-17 00:38:43] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:43] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-17 00:38:43] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 161/161 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0020-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s75 3), p0:(GEQ s74 5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0020-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0020-LTLFireability-01 finished in 439 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(p0))||G(p1))))'
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 161/161 transitions.
Applied a total of 0 rules in 5 ms. Remains 100 /100 variables (removed 0) and now considering 161/161 (removed 0) transitions.
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:43] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-17 00:38:43] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:43] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 00:38:43] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:43] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 00:38:44] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-17 00:38:44] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:44] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 00:38:44] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 161/161 transitions.
Stuttering acceptance computed with spot in 132 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 : JoinFreeModules-PT-0020-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GEQ s40 5), p1:(GEQ s78 3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0020-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0020-LTLFireability-02 finished in 382 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 161/161 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 161/161 (removed 0) transitions.
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:44] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 00:38:44] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:44] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 00:38:44] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:44] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-17 00:38:44] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-17 00:38:44] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:44] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 00:38:44] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 161/161 transitions.
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0020-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:(AND (LT s85 3) (GEQ s87 2))], 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 48 steps with 0 reset in 2 ms.
FORMULA JoinFreeModules-PT-0020-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0020-LTLFireability-03 finished in 313 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1)||F(p2))))'
Support contains 3 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 161/161 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 161/161 (removed 0) transitions.
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:44] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 00:38:44] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:44] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 00:38:44] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:44] [INFO ] Computed 20 place invariants in 6 ms
[2022-05-17 00:38:44] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-17 00:38:44] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:44] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 00:38:44] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 161/161 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-0020-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(LT s10 3), p2:(LT s27 1), p0:(OR (LT s10 3) (LT s49 5))], 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 400 ms.
Product exploration explored 100000 steps with 50000 reset in 309 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 (NOT p2) p0), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))
Knowledge based reduction with 4 factoid took 171 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA JoinFreeModules-PT-0020-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-0020-LTLFireability-04 finished in 1219 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(F((G(F(p0))&&p1)))))'
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 161/161 transitions.
Applied a total of 0 rules in 11 ms. Remains 100 /100 variables (removed 0) and now considering 161/161 (removed 0) transitions.
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:45] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 00:38:45] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:45] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 00:38:45] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:45] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-17 00:38:45] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-17 00:38:45] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2022-05-17 00:38:45] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:45] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-17 00:38:45] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 161/161 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0020-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s53 4), p1:(LT s32 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0020-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0020-LTLFireability-05 finished in 367 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&X((F(p1)||p2))&&p0)))'
Support contains 3 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 161/161 transitions.
Applied a total of 0 rules in 6 ms. Remains 100 /100 variables (removed 0) and now considering 161/161 (removed 0) transitions.
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:46] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 00:38:46] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:46] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 00:38:46] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:46] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 00:38:46] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-17 00:38:46] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:46] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 00:38:46] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 161/161 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : JoinFreeModules-PT-0020-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s4 5), p1:(LT s53 4), p2:(LT s48 4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0020-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0020-LTLFireability-07 finished in 428 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||G((G(p1) U F(p2)))))'
Support contains 3 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 161/161 transitions.
Applied a total of 0 rules in 12 ms. Remains 100 /100 variables (removed 0) and now considering 161/161 (removed 0) transitions.
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:46] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 00:38:46] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:46] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 00:38:46] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:46] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 00:38:46] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-17 00:38:46] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2022-05-17 00:38:46] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:46] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 00:38:46] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 161/161 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : JoinFreeModules-PT-0020-LTLFireability-10 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) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s81 2) (GEQ s20 5)), p2:(GEQ s3 4)], 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 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0020-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0020-LTLFireability-10 finished in 352 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 161/161 transitions.
Applied a total of 0 rules in 6 ms. Remains 100 /100 variables (removed 0) and now considering 161/161 (removed 0) transitions.
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:46] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 00:38:46] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:46] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 00:38:47] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:47] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-17 00:38:47] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-17 00:38:47] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2022-05-17 00:38:47] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:47] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 00:38:47] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 161/161 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0020-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s28 3)], 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 JoinFreeModules-PT-0020-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0020-LTLFireability-11 finished in 287 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(((G(p0) U X(G(X(G(X(p1))))))&&X(p2)))))'
Support contains 3 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 161/161 transitions.
Applied a total of 0 rules in 7 ms. Remains 100 /100 variables (removed 0) and now considering 161/161 (removed 0) transitions.
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:47] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 00:38:47] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:47] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 00:38:47] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:47] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 00:38:47] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-17 00:38:47] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:47] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 00:38:47] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 161/161 transitions.
Stuttering acceptance computed with spot in 1049 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : JoinFreeModules-PT-0020-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={1} source=2 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=2 dest: 5}], [{ cond=true, acceptance={0, 1} source=3 dest: 6}, { cond=(NOT p0), acceptance={0, 1} source=3 dest: 7}, { cond=p0, acceptance={1} source=3 dest: 8}, { cond=p0, acceptance={0, 1} source=3 dest: 9}], [{ cond=(NOT p0), acceptance={0, 1} source=4 dest: 6}, { cond=(NOT p0), acceptance={0, 1} source=4 dest: 7}, { cond=p0, acceptance={1} source=4 dest: 8}, { cond=p0, acceptance={1} source=4 dest: 10}], [{ cond=(NOT p0), acceptance={0, 1} source=5 dest: 7}, { cond=p0, acceptance={1} source=5 dest: 8}, { cond=p0, acceptance={0, 1} source=5 dest: 9}], [{ cond=(NOT p2), acceptance={0, 1} source=6 dest: 11}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=6 dest: 12}, { cond=(AND p0 (NOT p2)), acceptance={1} source=6 dest: 13}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=6 dest: 14}], [{ cond=true, acceptance={0, 1} source=7 dest: 15}, { cond=(NOT p0), acceptance={0, 1} source=7 dest: 16}, { cond=p0, acceptance={1} source=7 dest: 17}, { cond=p0, acceptance={0, 1} source=7 dest: 18}], [{ cond=(NOT p0), acceptance={0, 1} source=8 dest: 15}, { cond=(NOT p0), acceptance={0, 1} source=8 dest: 16}, { cond=p0, acceptance={1} source=8 dest: 17}, { cond=p0, acceptance={1} source=8 dest: 19}], [{ cond=(NOT p0), acceptance={0, 1} source=9 dest: 16}, { cond=p0, acceptance={1} source=9 dest: 17}, { cond=p0, acceptance={0, 1} source=9 dest: 18}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=10 dest: 11}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=10 dest: 12}, { cond=(AND p0 (NOT p2)), acceptance={1} source=10 dest: 13}, { cond=(AND p0 (NOT p2)), acceptance={1} source=10 dest: 20}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=11 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=11 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=11 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=11 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={0} source=11 dest: 11}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=11 dest: 12}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=11 dest: 13}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=11 dest: 14}], [{ cond=(NOT p1), acceptance={0, 1} source=12 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=12 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={1} source=12 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=12 dest: 9}, { cond=p1, acceptance={0} source=12 dest: 15}, { cond=(AND (NOT p0) p1), acceptance={0} source=12 dest: 16}, { cond=(AND p0 p1), acceptance={} source=12 dest: 17}, { cond=(AND p0 p1), acceptance={0} source=12 dest: 18}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=13 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=13 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={1} source=13 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={1} source=13 dest: 10}, { cond=(AND (NOT p0) p1), acceptance={0} source=13 dest: 15}, { cond=(AND (NOT p0) p1), acceptance={0} source=13 dest: 16}, { cond=(AND p0 p1), acceptance={} source=13 dest: 17}, { cond=(AND p0 p1), acceptance={} source=13 dest: 19}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=14 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={1} source=14 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=14 dest: 9}, { cond=(AND (NOT p0) p1), acceptance={0} source=14 dest: 16}, { cond=(AND p0 p1), acceptance={} source=14 dest: 17}, { cond=(AND p0 p1), acceptance={0} source=14 dest: 18}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=15 dest: 11}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=15 dest: 11}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=15 dest: 12}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=15 dest: 12}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=15 dest: 13}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=15 dest: 13}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=15 dest: 14}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=15 dest: 14}], [{ cond=p1, acceptance={0} source=16 dest: 15}, { cond=(NOT p1), acceptance={0, 1} source=16 dest: 15}, { cond=(AND (NOT p0) p1), acceptance={0} source=16 dest: 16}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=16 dest: 16}, { cond=(AND p0 p1), acceptance={} source=16 dest: 17}, { cond=(AND p0 (NOT p1)), acceptance={1} source=16 dest: 17}, { cond=(AND p0 p1), acceptance={0} source=16 dest: 18}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=16 dest: 18}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=17 dest: 15}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=17 dest: 15}, { cond=(AND (NOT p0) p1), acceptance={0} source=17 dest: 16}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=17 dest: 16}, { cond=(AND p0 p1), acceptance={} source=17 dest: 17}, { cond=(AND p0 (NOT p1)), acceptance={1} source=17 dest: 17}, { cond=(AND p0 p1), acceptance={} source=17 dest: 19}, { cond=(AND p0 (NOT p1)), acceptance={1} source=17 dest: 19}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=18 dest: 16}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=18 dest: 16}, { cond=(AND p0 p1), acceptance={} source=18 dest: 17}, { cond=(AND p0 (NOT p1)), acceptance={1} source=18 dest: 17}, { cond=(AND p0 p1), acceptance={0} source=18 dest: 18}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=18 dest: 18}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=19 dest: 11}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=19 dest: 11}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=19 dest: 12}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=19 dest: 12}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=19 dest: 13}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=19 dest: 13}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=19 dest: 20}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=19 dest: 20}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=20 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=20 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=20 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=20 dest: 21}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=21 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=21 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=21 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=21 dest: 21}]], initial=0, aps=[p0:(GEQ s63 4), p2:(LT s21 2), p1:(GEQ s16 2)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0020-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0020-LTLFireability-12 finished in 1340 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G(F(X(F(G((X(p0)||F(p1)))))))))'
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 161/161 transitions.
Applied a total of 0 rules in 11 ms. Remains 100 /100 variables (removed 0) and now considering 161/161 (removed 0) transitions.
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:48] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-17 00:38:48] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:48] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 00:38:48] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:48] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 00:38:48] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-17 00:38:48] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2022-05-17 00:38:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:48] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 00:38:48] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 161/161 transitions.
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-0020-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s58 3), p1:(GEQ s89 5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0020-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0020-LTLFireability-13 finished in 420 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||(p1 U (p2||G(p1)))))))'
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 161/161 transitions.
Applied a total of 0 rules in 9 ms. Remains 100 /100 variables (removed 0) and now considering 161/161 (removed 0) transitions.
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:48] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 00:38:49] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:49] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 00:38:49] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:49] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 00:38:49] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-17 00:38:49] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2022-05-17 00:38:49] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:49] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 00:38:49] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 161/161 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-0020-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(OR p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p2:(AND (LT s6 2) (LT s43 3)), p1:(LT s43 3), p0:(LT s6 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 670 ms.
Stack based approach found an accepted trace after 477 steps with 0 reset with depth 478 and stack size 478 in 7 ms.
FORMULA JoinFreeModules-PT-0020-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-0020-LTLFireability-14 finished in 1030 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(p0)||!p0))))'
Support contains 1 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 161/161 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 161/161 (removed 0) transitions.
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:49] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 00:38:50] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:50] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 00:38:50] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:50] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 00:38:50] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-17 00:38:50] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
// Phase 1: matrix 161 rows 100 cols
[2022-05-17 00:38:50] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 00:38:50] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 161/161 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p0), false, false]
Running random walk in product with property : JoinFreeModules-PT-0020-LTLFireability-15 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=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(GEQ s84 5)], 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 316 steps with 0 reset in 6 ms.
FORMULA JoinFreeModules-PT-0020-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0020-LTLFireability-15 finished in 408 ms.
All properties solved by simple procedures.
Total runtime 9233 ms.

BK_STOP 1652747930449

--------------------
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="JoinFreeModules-PT-0020"
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 JoinFreeModules-PT-0020, 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 r132-tall-165271820500172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0020.tgz
mv JoinFreeModules-PT-0020 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 ;