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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 272K
-rw-r--r-- 1 mcc users 7.2K Apr 30 02:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 30 02:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 30 02:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 30 02:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 9 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 9 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 6 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 16K 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 FMS-PT-10000-LTLFireability-00
FORMULA_NAME FMS-PT-10000-LTLFireability-01
FORMULA_NAME FMS-PT-10000-LTLFireability-02
FORMULA_NAME FMS-PT-10000-LTLFireability-03
FORMULA_NAME FMS-PT-10000-LTLFireability-04
FORMULA_NAME FMS-PT-10000-LTLFireability-05
FORMULA_NAME FMS-PT-10000-LTLFireability-06
FORMULA_NAME FMS-PT-10000-LTLFireability-07
FORMULA_NAME FMS-PT-10000-LTLFireability-08
FORMULA_NAME FMS-PT-10000-LTLFireability-09
FORMULA_NAME FMS-PT-10000-LTLFireability-10
FORMULA_NAME FMS-PT-10000-LTLFireability-11
FORMULA_NAME FMS-PT-10000-LTLFireability-12
FORMULA_NAME FMS-PT-10000-LTLFireability-13
FORMULA_NAME FMS-PT-10000-LTLFireability-14
FORMULA_NAME FMS-PT-10000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652694718736

Running Version 202205111006
[2022-05-16 09:51:59] [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 09:51:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 09:52:00] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2022-05-16 09:52:00] [INFO ] Transformed 22 places.
[2022-05-16 09:52:00] [INFO ] Transformed 20 transitions.
[2022-05-16 09:52:00] [INFO ] Parsed PT model containing 22 places and 20 transitions in 141 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA FMS-PT-10000-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 13 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 8 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:00] [INFO ] Computed 6 place invariants in 7 ms
[2022-05-16 09:52:00] [INFO ] Implicit Places using invariants in 116 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:00] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 09:52:00] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:00] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-16 09:52:00] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Support contains 13 out of 22 places after structural reductions.
[2022-05-16 09:52:00] [INFO ] Flatten gal took : 15 ms
[2022-05-16 09:52:00] [INFO ] Flatten gal took : 4 ms
[2022-05-16 09:52:00] [INFO ] Input system was already deterministic with 20 transitions.
Incomplete random walk after 10001 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:01] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 09:52:01] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 09:52:01] [INFO ] After 16ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2022-05-16 09:52:01] [INFO ] After 21ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-16 09:52:01] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-16 09:52:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-16 09:52:01] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-16 09:52:01] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-05-16 09:52:01] [INFO ] After 95ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 30007 steps, including 0 resets, run visited all 4 properties in 202 ms. (steps per millisecond=148 )
Parikh walk visited 4 properties in 203 ms.
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((X(F(p0))&&G(p1))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:01] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 09:52:01] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:01] [INFO ] Computed 6 place invariants in 13 ms
[2022-05-16 09:52:02] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:02] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 09:52:02] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 436 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : FMS-PT-10000-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(GEQ s14 1), p0:(LT s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA FMS-PT-10000-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-10000-LTLFireability-00 finished in 677 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(!(p0 U G(!(F(X(p1))||p0))))&&p2)))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:02] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 09:52:02] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:02] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 09:52:02] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:02] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 09:52:02] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FMS-PT-10000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={0} source=1 dest: 0}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s19 1), p2:(LT s12 1), p1:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 259 ms.
Product exploration explored 100000 steps with 33333 reset in 115 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p1)))))
Knowledge based reduction with 6 factoid took 152 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA FMS-PT-10000-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FMS-PT-10000-LTLFireability-01 finished in 808 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))&&!(G(!(G(p0)||G(p1))) U G(p2))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:03] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 09:52:03] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:03] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 09:52:03] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:03] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 09:52:03] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (OR (NOT p0) p2), (OR (NOT p0) p2), (NOT p0)]
Running random walk in product with property : FMS-PT-10000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(AND (GEQ s2 1) (GEQ s18 1)), p0:(GEQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FMS-PT-10000-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-10000-LTLFireability-02 finished in 247 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:03] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 09:52:03] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:03] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 09:52:03] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:03] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 09:52:03] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-10000-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:(GEQ s19 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 FMS-PT-10000-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-10000-LTLFireability-03 finished in 232 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)&&X(p1))) U (G(p1)||G(p2))))'
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 3 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:03] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 09:52:03] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:03] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 09:52:03] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:03] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 09:52:03] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 371 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (OR (AND (NOT p1) p2) (AND (NOT p0) p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) p2), true, (AND p1 (NOT p2))]
Running random walk in product with property : FMS-PT-10000-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=p2, acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 6}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 7}], [{ cond=(OR (AND p1 (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 2}, { cond=(OR p1 p2), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 8}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p1 p2), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=6 dest: 1}, { cond=p2, acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 3}, { cond=(AND p1 p2), acceptance={} source=6 dest: 6}], [{ cond=true, acceptance={0, 1} source=7 dest: 7}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=8 dest: 7}, { cond=(AND p1 p2), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(AND (GEQ s8 1) (GEQ s10 1)), p2:(GEQ s4 1), p0:(AND (GEQ s2 1) (GEQ s18 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24571 reset in 263 ms.
Product exploration explored 100000 steps with 24242 reset in 182 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (OR p1 p2)), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X p2)), (X (X (OR p1 p2))), true, (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) p2 (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (NOT p1)), (X p1), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Knowledge based reduction with 18 factoid took 1581 ms. Reduced automaton from 9 states, 27 edges and 3 AP to 9 states, 27 edges and 3 AP.
Stuttering acceptance computed with spot in 413 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (OR (AND (NOT p1) p2) (AND (NOT p0) p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) p2), true, (AND p1 (NOT p2))]
Incomplete random walk after 10001 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:07] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 09:52:07] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 09:52:07] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-16 09:52:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-16 09:52:07] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-16 09:52:07] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-05-16 09:52:07] [INFO ] After 110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Finished Parikh walk after 34713 steps, including 0 resets, run visited all 3 properties in 113 ms. (steps per millisecond=307 )
Parikh walk visited 6 properties in 723 ms.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (OR p1 p2)), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X p2)), (X (X (OR p1 p2))), true, (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) p2 (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (NOT p1)), (X p1), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (F (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (F p1), (F (NOT (OR p1 p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F p0), (F (NOT p2)), (F (AND p1 p2)), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) p2))), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 18 factoid took 2486 ms. Reduced automaton from 9 states, 27 edges and 3 AP to 9 states, 27 edges and 3 AP.
Stuttering acceptance computed with spot in 420 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (OR (AND (NOT p1) p2) (AND (NOT p0) p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) p2), true, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 389 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (OR (AND (NOT p1) p2) (AND (NOT p0) p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) p2), true, (AND p1 (NOT p2))]
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:11] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 09:52:11] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:11] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 09:52:12] [INFO ] Implicit Places using invariants and state equation in 629 ms returned []
Implicit Place search using SMT with State Equation took 706 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:12] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-16 09:52:12] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (OR p1 p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p2)), (X (X (OR p1 p2))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))]
False Knowledge obtained : [(X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (NOT p1)), (X p1), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
Knowledge based reduction with 18 factoid took 2045 ms. Reduced automaton from 9 states, 27 edges and 3 AP to 9 states, 27 edges and 3 AP.
Stuttering acceptance computed with spot in 414 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (OR (AND (NOT p1) p2) (AND (NOT p0) p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) p2), true, (AND p1 (NOT p2))]
Incomplete random walk after 10001 steps, including 0 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :4
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:15] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 09:52:15] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-16 09:52:15] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-16 09:52:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-16 09:52:15] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-16 09:52:15] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-05-16 09:52:15] [INFO ] After 95ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Finished Parikh walk after 35020 steps, including 0 resets, run visited all 3 properties in 414 ms. (steps per millisecond=84 )
Parikh walk visited 6 properties in 2014 ms.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (OR p1 p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p2)), (X (X (OR p1 p2))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))]
False Knowledge obtained : [(X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (NOT p1)), (X p1), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (F (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (F p1), (F (NOT (OR p1 p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F p0), (F (NOT p2)), (F (AND p1 p2)), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) p2))), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 18 factoid took 2227 ms. Reduced automaton from 9 states, 27 edges and 3 AP to 9 states, 27 edges and 3 AP.
Stuttering acceptance computed with spot in 336 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (OR (AND (NOT p1) p2) (AND (NOT p0) p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) p2), true, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 325 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (OR (AND (NOT p1) p2) (AND (NOT p0) p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) p2), true, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 335 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (OR (AND (NOT p1) p2) (AND (NOT p0) p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) p2), true, (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 24481 reset in 120 ms.
Product exploration explored 100000 steps with 24637 reset in 127 ms.
Applying partial POR strategy [false, true, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 370 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (OR (AND (NOT p1) p2) (AND (NOT p0) p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) p2), true, (AND p1 (NOT p2))]
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 22 transition count 20
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 22 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 22 transition count 20
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 6 rules in 15 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2022-05-16 09:52:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:21] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 09:52:21] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/22 places, 20/20 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Product exploration explored 100000 steps with 25240 reset in 312 ms.
Product exploration explored 100000 steps with 25127 reset in 199 ms.
Built C files in :
/tmp/ltsmin5262188854974739267
[2022-05-16 09:52:22] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5262188854974739267
Running compilation step : cd /tmp/ltsmin5262188854974739267;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 190 ms.
Running link step : cd /tmp/ltsmin5262188854974739267;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin5262188854974739267;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased999930528066769763.hoa' '--buchi-type=spotba'
LTSmin run took 2960 ms.
FORMULA FMS-PT-10000-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FMS-PT-10000-LTLFireability-05 finished in 21409 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((X(p1)||p0))&&p2)))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:25] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 09:52:25] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:25] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 09:52:25] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:25] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 09:52:25] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), true, (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : FMS-PT-10000-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p2:(GEQ s9 1), p0:(OR (LT s10 1) (LT s17 1)), p1:(LT s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 42869 reset in 76 ms.
Product exploration explored 100000 steps with 42851 reset in 85 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 p2 p0 p1), (X p2), true, (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0))))]
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p1)))))
Knowledge based reduction with 4 factoid took 207 ms. Reduced automaton from 4 states, 5 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA FMS-PT-10000-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FMS-PT-10000-LTLFireability-06 finished in 681 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(!((X(G(p0))||p1) U X(p1)))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:25] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 09:52:25] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:25] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 09:52:26] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:26] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 09:52:26] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 172 ms :[p1, (AND p0 p1), p1, (AND p1 p0)]
Running random walk in product with property : FMS-PT-10000-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LT s0 1), p0:(GEQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 5376 reset in 100 ms.
Stack based approach found an accepted trace after 212 steps with 14 reset with depth 10 and stack size 10 in 0 ms.
FORMULA FMS-PT-10000-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-10000-LTLFireability-07 finished in 445 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 7 places and 0 transitions.
Graph (trivial) has 9 edges and 15 vertex of which 6 / 15 are part of one of the 2 SCC in 17 ms
Free SCC test removed 4 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 13 place count 11 transition count 15
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 21 place count 9 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 23 place count 7 transition count 9
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 24 place count 7 transition count 8
Applied a total of 24 rules in 32 ms. Remains 7 /22 variables (removed 15) and now considering 8/20 (removed 12) transitions.
// Phase 1: matrix 8 rows 7 cols
[2022-05-16 09:52:26] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 09:52:26] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 8 rows 7 cols
[2022-05-16 09:52:26] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 09:52:26] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2022-05-16 09:52:26] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 8 rows 7 cols
[2022-05-16 09:52:26] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 09:52:26] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/22 places, 8/20 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/22 places, 8/20 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : FMS-PT-10000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s3 1) (OR (GEQ s1 1) (LT s2 1) (LT s5 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-10000-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-10000-LTLFireability-08 finished in 247 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X((X(p0)||!p0)))))'
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:26] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 09:52:26] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:26] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 09:52:26] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:26] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 09:52:26] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p0), false, false, false]
Running random walk in product with property : FMS-PT-10000-LTLFireability-09 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=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 14 steps with 0 reset in 0 ms.
FORMULA FMS-PT-10000-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-10000-LTLFireability-09 finished in 296 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(X(G(p1))))||p0)))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:26] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 09:52:26] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:26] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 09:52:27] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:27] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 09:52:27] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 222 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : FMS-PT-10000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (GEQ s9 1) (GEQ s12 1)), p1:(GEQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 132 ms.
Product exploration explored 100000 steps with 0 reset in 231 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 551 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10001 steps, including 0 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:28] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 09:52:28] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-16 09:52:28] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 09:52:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 09:52:28] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 09:52:28] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-16 09:52:28] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 45542 steps, including 0 resets, run visited all 1 properties in 42 ms. (steps per millisecond=1084 )
Parikh walk visited 1 properties in 42 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 202 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 191 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:29] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 09:52:29] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:29] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 09:52:29] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:29] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 09:52:30] [INFO ] Dead Transitions using invariants and state equation in 1223 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 191 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10001 steps, including 0 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 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 20 rows 22 cols
[2022-05-16 09:52:30] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 09:52:30] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 09:52:30] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 09:52:30] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-16 09:52:30] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 09:52:30] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-16 09:52:31] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 44415 steps, including 0 resets, run visited all 1 properties in 72 ms. (steps per millisecond=616 )
Parikh walk visited 1 properties in 71 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 159 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 163 ms.
Product exploration explored 100000 steps with 0 reset in 200 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 20
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 4 place count 22 transition count 20
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 22 transition count 20
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 21 transition count 19
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 21 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 21 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 21 transition count 24
Deduced a syphon composed of 9 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 21 transition count 22
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 14 rules in 25 ms. Remains 21 /22 variables (removed 1) and now considering 22/20 (removed -2) transitions.
[2022-05-16 09:52:32] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-16 09:52:32] [INFO ] Flow matrix only has 21 transitions (discarded 1 similar events)
// Phase 1: matrix 21 rows 21 cols
[2022-05-16 09:52:32] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 09:52:32] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/22 places, 22/20 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/22 places, 22/20 transitions.
Product exploration explored 100000 steps with 0 reset in 124 ms.
Product exploration explored 100000 steps with 0 reset in 148 ms.
Built C files in :
/tmp/ltsmin9059680423109109935
[2022-05-16 09:52:32] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9059680423109109935
Running compilation step : cd /tmp/ltsmin9059680423109109935;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 169 ms.
Running link step : cd /tmp/ltsmin9059680423109109935;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin9059680423109109935;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11716565477716144908.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 4 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:47] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 09:52:47] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:47] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 09:52:48] [INFO ] Implicit Places using invariants and state equation in 851 ms returned []
Implicit Place search using SMT with State Equation took 915 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:52:48] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 09:52:48] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Built C files in :
/tmp/ltsmin8341531435513900088
[2022-05-16 09:52:48] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8341531435513900088
Running compilation step : cd /tmp/ltsmin8341531435513900088;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 101 ms.
Running link step : cd /tmp/ltsmin8341531435513900088;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin8341531435513900088;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9191377504233448136.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 09:53:04] [INFO ] Flatten gal took : 4 ms
[2022-05-16 09:53:04] [INFO ] Flatten gal took : 2 ms
[2022-05-16 09:53:04] [INFO ] Time to serialize gal into /tmp/LTL7339093943324944883.gal : 1 ms
[2022-05-16 09:53:04] [INFO ] Time to serialize properties into /tmp/LTL5710368440011403564.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7339093943324944883.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5710368440011403564.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7339093...266
Read 1 LTL properties
Checking formula 0 : !((G(((X(X(X(G("(P12M3>=1)")))))||("(P2>=1)"))||("(P12M3>=1)"))))
Formula 0 simplified : !G("(P2>=1)" | "(P12M3>=1)" | XXXG"(P12M3>=1)")
Detected timeout of ITS tools.
[2022-05-16 09:53:19] [INFO ] Flatten gal took : 7 ms
[2022-05-16 09:53:19] [INFO ] Applying decomposition
[2022-05-16 09:53:19] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6725248382807805114.txt' '-o' '/tmp/graph6725248382807805114.bin' '-w' '/tmp/graph6725248382807805114.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6725248382807805114.bin' '-l' '-1' '-v' '-w' '/tmp/graph6725248382807805114.weights' '-q' '0' '-e' '0.001'
[2022-05-16 09:53:19] [INFO ] Decomposing Gal with order
[2022-05-16 09:53:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 09:53:19] [INFO ] Removed a total of 1 redundant transitions.
[2022-05-16 09:53:19] [INFO ] Flatten gal took : 43 ms
[2022-05-16 09:53:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 09:53:19] [INFO ] Time to serialize gal into /tmp/LTL470666342664040013.gal : 5 ms
[2022-05-16 09:53:19] [INFO ] Time to serialize properties into /tmp/LTL1759702725116342653.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL470666342664040013.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1759702725116342653.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4706663...244
Read 1 LTL properties
Checking formula 0 : !((G(((X(X(X(G("(i2.u6.P12M3>=1)")))))||("(i3.u4.P2>=1)"))||("(i2.u6.P12M3>=1)"))))
Formula 0 simplified : !G("(i2.u6.P12M3>=1)" | "(i3.u4.P2>=1)" | XXXG"(i2.u6.P12M3>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18283211469364510284
[2022-05-16 09:53:34] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18283211469364510284
Running compilation step : cd /tmp/ltsmin18283211469364510284;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 77 ms.
Running link step : cd /tmp/ltsmin18283211469364510284;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin18283211469364510284;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X(X(X([]((LTLAPp1==true)))))||(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FMS-PT-10000-LTLFireability-10 finished in 82530 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(X(p1)))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:53:49] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 09:53:49] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:53:49] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 09:53:49] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:53:49] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 09:53:49] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FMS-PT-10000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}]], initial=0, aps=[p0:(GEQ s0 1), p1:(GEQ s19 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 5902 reset in 84 ms.
Stack based approach found an accepted trace after 283 steps with 14 reset with depth 7 and stack size 7 in 1 ms.
FORMULA FMS-PT-10000-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-10000-LTLFireability-11 finished in 377 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F((G(X(p0))&&p1)))||X(X(p1))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:53:49] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 09:53:49] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:53:49] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 09:53:49] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:53:49] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 09:53:49] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : FMS-PT-10000-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}, { cond=p1, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LT s4 1), p0:(LT s12 1)], 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]]
Product exploration explored 100000 steps with 0 reset in 140 ms.
Stack based approach found an accepted trace after 101 steps with 0 reset with depth 102 and stack size 102 in 0 ms.
FORMULA FMS-PT-10000-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-10000-LTLFireability-12 finished in 460 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((G(p0)&&p1)) U p2)))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:53:50] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 09:53:50] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:53:50] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 09:53:50] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 09:53:50] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 09:53:50] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p2), (NOT p2), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : FMS-PT-10000-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) (NOT p0))), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(OR (GEQ s3 1) (AND (GEQ s8 1) (GEQ s10 1))), p1:(GEQ s19 1), p0:(AND (GEQ s8 1) (GEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 144 ms.
Stack based approach found an accepted trace after 65 steps with 2 reset with depth 60 and stack size 60 in 0 ms.
FORMULA FMS-PT-10000-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-10000-LTLFireability-13 finished in 407 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 8 places and 0 transitions.
Graph (trivial) has 11 edges and 14 vertex of which 6 / 14 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 12 rules applied. Total rules applied 17 place count 10 transition count 12
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 25 place count 6 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 25 place count 6 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 5 transition count 7
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 28 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 31 place count 3 transition count 5
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 32 place count 3 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 33 place count 2 transition count 4
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 34 place count 2 transition count 3
Applied a total of 34 rules in 3 ms. Remains 2 /22 variables (removed 20) and now considering 3/20 (removed 17) transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 09:53:50] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 09:53:50] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 09:53:50] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 09:53:50] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2022-05-16 09:53:50] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 09:53:50] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 09:53:50] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/22 places, 3/20 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/22 places, 3/20 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : FMS-PT-10000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-10000-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-10000-LTLFireability-14 finished in 112 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 10 edges and 16 vertex of which 6 / 16 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 13 place count 12 transition count 14
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 21 place count 9 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 22 place count 8 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 22 place count 8 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 27 place count 5 transition count 7
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 28 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 28 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 31 place count 3 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 32 place count 3 transition count 4
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 34 place count 2 transition count 3
Applied a total of 34 rules in 3 ms. Remains 2 /22 variables (removed 20) and now considering 3/20 (removed 17) transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 09:53:50] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 09:53:50] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 09:53:50] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 09:53:50] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2022-05-16 09:53:50] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 09:53:50] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 09:53:50] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/22 places, 3/20 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/22 places, 3/20 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-10000-LTLFireability-15 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:(GEQ s0 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 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-10000-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-10000-LTLFireability-15 finished in 139 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(X(G(p1))))||p0)))'
Found a SL insensitive property : FMS-PT-10000-LTLFireability-10
Stuttering acceptance computed with spot in 135 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 10 edges and 16 vertex of which 6 / 16 are part of one of the 2 SCC in 1 ms
Free SCC test removed 4 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 12 place count 12 transition count 15
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 18 place count 10 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 18 place count 10 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 9 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 8 transition count 9
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 8 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 23 place count 8 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 7 transition count 7
Applied a total of 25 rules in 12 ms. Remains 7 /22 variables (removed 15) and now considering 7/20 (removed 13) transitions.
// Phase 1: matrix 7 rows 7 cols
[2022-05-16 09:53:51] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 09:53:51] [INFO ] Implicit Places using invariants in 23 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 6/22 places, 7/20 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 5 transition count 6
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 6
Applied a total of 2 rules in 1 ms. Remains 5 /6 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 5 cols
[2022-05-16 09:53:51] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 09:53:51] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 6 rows 5 cols
[2022-05-16 09:53:51] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 09:53:51] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 5/22 places, 6/20 transitions.
Finished structural reductions, in 2 iterations. Remains : 5/22 places, 6/20 transitions.
Running random walk in product with property : FMS-PT-10000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (GEQ s0 1) (GEQ s1 1)), p1:(GEQ s1 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, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 53445 steps with 0 reset in 49 ms.
Treatment of property FMS-PT-10000-LTLFireability-10 finished in 365 ms.
FORMULA FMS-PT-10000-LTLFireability-10 FALSE TECHNIQUES SL_INSENSITIVE
[2022-05-16 09:53:51] [INFO ] Flatten gal took : 1 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 111431 ms.

BK_STOP 1652694831392

--------------------
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="FMS-PT-10000"
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 FMS-PT-10000, 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 r078-tall-165260110500596"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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