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.r042-smll-165252095700420.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 DES-PT-02a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-smll-165252095700420
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 280K
-rw-r--r-- 1 mcc users 5.7K Apr 29 15:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 29 15:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 29 15:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 29 15:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 9 07:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 9 07:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 33K 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 DES-PT-02a-LTLFireability-00
FORMULA_NAME DES-PT-02a-LTLFireability-01
FORMULA_NAME DES-PT-02a-LTLFireability-02
FORMULA_NAME DES-PT-02a-LTLFireability-03
FORMULA_NAME DES-PT-02a-LTLFireability-04
FORMULA_NAME DES-PT-02a-LTLFireability-05
FORMULA_NAME DES-PT-02a-LTLFireability-06
FORMULA_NAME DES-PT-02a-LTLFireability-07
FORMULA_NAME DES-PT-02a-LTLFireability-08
FORMULA_NAME DES-PT-02a-LTLFireability-09
FORMULA_NAME DES-PT-02a-LTLFireability-10
FORMULA_NAME DES-PT-02a-LTLFireability-11
FORMULA_NAME DES-PT-02a-LTLFireability-12
FORMULA_NAME DES-PT-02a-LTLFireability-13
FORMULA_NAME DES-PT-02a-LTLFireability-14
FORMULA_NAME DES-PT-02a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652713319644

Running Version 202205111006
[2022-05-16 15:02:02] [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 15:02:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 15:02:02] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2022-05-16 15:02:02] [INFO ] Transformed 123 places.
[2022-05-16 15:02:02] [INFO ] Transformed 80 transitions.
[2022-05-16 15:02:02] [INFO ] Found NUPN structural information;
[2022-05-16 15:02:02] [INFO ] Parsed PT model containing 123 places and 80 transitions in 389 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-02a-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-02a-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-02a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 66/66 transitions.
Applied a total of 0 rules in 28 ms. Remains 123 /123 variables (removed 0) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 123 cols
[2022-05-16 15:02:02] [INFO ] Computed 59 place invariants in 25 ms
[2022-05-16 15:02:03] [INFO ] Implicit Places using invariants in 621 ms returned []
// Phase 1: matrix 66 rows 123 cols
[2022-05-16 15:02:03] [INFO ] Computed 59 place invariants in 7 ms
[2022-05-16 15:02:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 15:02:03] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 1049 ms to find 0 implicit places.
// Phase 1: matrix 66 rows 123 cols
[2022-05-16 15:02:03] [INFO ] Computed 59 place invariants in 10 ms
[2022-05-16 15:02:04] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 66/66 transitions.
Support contains 60 out of 123 places after structural reductions.
[2022-05-16 15:02:04] [INFO ] Flatten gal took : 57 ms
[2022-05-16 15:02:04] [INFO ] Flatten gal took : 29 ms
[2022-05-16 15:02:04] [INFO ] Input system was already deterministic with 66 transitions.
Incomplete random walk after 10000 steps, including 244 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 26) seen :25
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 66 rows 123 cols
[2022-05-16 15:02:04] [INFO ] Computed 59 place invariants in 7 ms
[2022-05-16 15:02:04] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2022-05-16 15:02:05] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 22 ms returned sat
[2022-05-16 15:02:05] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 15:02:05] [INFO ] [Nat]Absence check using 34 positive place invariants in 21 ms returned sat
[2022-05-16 15:02:05] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 9 ms returned sat
[2022-05-16 15:02:05] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 15:02:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 15:02:05] [INFO ] After 16ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 15:02:05] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-05-16 15:02:05] [INFO ] After 269ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 123 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 123/123 places, 66/66 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 123 transition count 64
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 122 transition count 63
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 122 transition count 63
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 122 transition count 63
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 121 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 120 transition count 62
Applied a total of 12 rules in 55 ms. Remains 120 /123 variables (removed 3) and now considering 62/66 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 120/123 places, 62/66 transitions.
Finished random walk after 3283 steps, including 55 resets, run visited all 1 properties in 33 ms. (steps per millisecond=99 )
Computed a total of 26 stabilizing places and 20 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((X(p1) U p2)||G(p3)||p0) U p4))'
Support contains 9 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 66/66 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 122 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 122 transition count 65
Applied a total of 2 rules in 9 ms. Remains 122 /123 variables (removed 1) and now considering 65/66 (removed 1) transitions.
// Phase 1: matrix 65 rows 122 cols
[2022-05-16 15:02:05] [INFO ] Computed 59 place invariants in 3 ms
[2022-05-16 15:02:06] [INFO ] Implicit Places using invariants in 158 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 160 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/123 places, 65/66 transitions.
Applied a total of 0 rules in 2 ms. Remains 121 /121 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 121/123 places, 65/66 transitions.
Stuttering acceptance computed with spot in 531 ms :[(NOT p4), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), true, (NOT p3)]
Running random walk in product with property : DES-PT-02a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p4), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p4)), acceptance={0} source=0 dest: 1}, { cond=(AND p3 (NOT p2) (NOT p0) (NOT p4)), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND p3 (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p3 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 3}, { cond=p3, acceptance={} source=4 dest: 4}]], initial=0, aps=[p4:(AND (EQ s99 1) (EQ s104 1)), p3:(AND (EQ s14 1) (EQ s35 1)), p2:(AND (EQ s19 1) (EQ s112 1)), p0:(OR (AND (EQ s99 1) (EQ s104 1)) (AND (EQ s19 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 DES-PT-02a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02a-LTLFireability-01 finished in 781 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 66/66 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 122 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 122 transition count 65
Applied a total of 2 rules in 5 ms. Remains 122 /123 variables (removed 1) and now considering 65/66 (removed 1) transitions.
// Phase 1: matrix 65 rows 122 cols
[2022-05-16 15:02:06] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-16 15:02:06] [INFO ] Implicit Places using invariants in 184 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 185 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/123 places, 65/66 transitions.
Applied a total of 0 rules in 3 ms. Remains 121 /121 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 121/123 places, 65/66 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-02a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s55 1) (EQ s72 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 DES-PT-02a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02a-LTLFireability-02 finished in 307 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(F(p1)))))'
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 66/66 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 122 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 122 transition count 65
Applied a total of 2 rules in 5 ms. Remains 122 /123 variables (removed 1) and now considering 65/66 (removed 1) transitions.
// Phase 1: matrix 65 rows 122 cols
[2022-05-16 15:02:06] [INFO ] Computed 59 place invariants in 5 ms
[2022-05-16 15:02:07] [INFO ] Implicit Places using invariants in 177 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 182 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/123 places, 65/66 transitions.
Applied a total of 0 rules in 2 ms. Remains 121 /121 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 121/123 places, 65/66 transitions.
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : DES-PT-02a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s14 1) (EQ s35 1)), p1:(AND (EQ s20 1) (EQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 1 ms.
FORMULA DES-PT-02a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02a-LTLFireability-03 finished in 394 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(p0)&&G(p1)&&G(p2)))))'
Support contains 14 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 66/66 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 122 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 122 transition count 65
Applied a total of 2 rules in 4 ms. Remains 122 /123 variables (removed 1) and now considering 65/66 (removed 1) transitions.
// Phase 1: matrix 65 rows 122 cols
[2022-05-16 15:02:07] [INFO ] Computed 59 place invariants in 8 ms
[2022-05-16 15:02:07] [INFO ] Implicit Places using invariants in 147 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 150 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/123 places, 65/66 transitions.
Applied a total of 0 rules in 2 ms. Remains 121 /121 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 121/123 places, 65/66 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-02a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s49 1) (EQ s66 1)), p1:(OR (EQ s29 0) (EQ s34 0) (EQ s36 0)), p2:(OR (EQ s43 0) (EQ s48 0) (EQ s50 0) (EQ s52 0) (EQ s54 0) (EQ s56 0) (EQ s58...], 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 DES-PT-02a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02a-LTLFireability-04 finished in 289 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 6 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 66/66 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 122 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 122 transition count 65
Applied a total of 2 rules in 6 ms. Remains 122 /123 variables (removed 1) and now considering 65/66 (removed 1) transitions.
// Phase 1: matrix 65 rows 122 cols
[2022-05-16 15:02:07] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-16 15:02:07] [INFO ] Implicit Places using invariants in 124 ms returned []
// Phase 1: matrix 65 rows 122 cols
[2022-05-16 15:02:07] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-16 15:02:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 15:02:07] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
// Phase 1: matrix 65 rows 122 cols
[2022-05-16 15:02:07] [INFO ] Computed 59 place invariants in 3 ms
[2022-05-16 15:02:08] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 122/123 places, 65/66 transitions.
Finished structural reductions, in 1 iterations. Remains : 122/123 places, 65/66 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-02a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s9 1) (EQ s11 1) (EQ s15 1) (EQ s16 1) (EQ s18 1) (EQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 25046 reset in 673 ms.
Product exploration explored 100000 steps with 25032 reset in 633 ms.
Computed a total of 25 stabilizing places and 19 stable transitions
Computed a total of 25 stabilizing places and 19 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 179 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
// Phase 1: matrix 65 rows 122 cols
[2022-05-16 15:02:10] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-16 15:02:10] [INFO ] [Real]Absence check using 34 positive place invariants in 18 ms returned sat
[2022-05-16 15:02:10] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 31 ms returned sat
[2022-05-16 15:02:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 15:02:10] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2022-05-16 15:02:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 15:02:10] [INFO ] [Nat]Absence check using 34 positive place invariants in 20 ms returned sat
[2022-05-16 15:02:10] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 23 ms returned sat
[2022-05-16 15:02:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 15:02:10] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2022-05-16 15:02:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 15:02:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2022-05-16 15:02:10] [INFO ] Computed and/alt/rep : 62/189/62 causal constraints (skipped 2 transitions) in 13 ms.
[2022-05-16 15:02:10] [INFO ] Added : 53 causal constraints over 11 iterations in 326 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 65/65 transitions.
Applied a total of 0 rules in 19 ms. Remains 122 /122 variables (removed 0) and now considering 65/65 (removed 0) transitions.
// Phase 1: matrix 65 rows 122 cols
[2022-05-16 15:02:11] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-16 15:02:11] [INFO ] Implicit Places using invariants in 140 ms returned []
// Phase 1: matrix 65 rows 122 cols
[2022-05-16 15:02:11] [INFO ] Computed 59 place invariants in 3 ms
[2022-05-16 15:02:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 15:02:11] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2022-05-16 15:02:11] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 65 rows 122 cols
[2022-05-16 15:02:11] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-16 15:02:11] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 122/122 places, 65/65 transitions.
Computed a total of 25 stabilizing places and 19 stable transitions
Computed a total of 25 stabilizing places and 19 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 154 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 171 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
// Phase 1: matrix 65 rows 122 cols
[2022-05-16 15:02:12] [INFO ] Computed 59 place invariants in 3 ms
[2022-05-16 15:02:12] [INFO ] [Real]Absence check using 34 positive place invariants in 19 ms returned sat
[2022-05-16 15:02:12] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 30 ms returned sat
[2022-05-16 15:02:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 15:02:12] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2022-05-16 15:02:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 15:02:12] [INFO ] [Nat]Absence check using 34 positive place invariants in 22 ms returned sat
[2022-05-16 15:02:12] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 24 ms returned sat
[2022-05-16 15:02:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 15:02:12] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2022-05-16 15:02:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 15:02:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2022-05-16 15:02:12] [INFO ] Computed and/alt/rep : 62/189/62 causal constraints (skipped 2 transitions) in 14 ms.
[2022-05-16 15:02:12] [INFO ] Added : 53 causal constraints over 11 iterations in 252 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Product exploration explored 100000 steps with 24948 reset in 445 ms.
Product exploration explored 100000 steps with 24929 reset in 478 ms.
Built C files in :
/tmp/ltsmin10544298056624502501
[2022-05-16 15:02:13] [INFO ] Computing symmetric may disable matrix : 65 transitions.
[2022-05-16 15:02:13] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 15:02:13] [INFO ] Computing symmetric may enable matrix : 65 transitions.
[2022-05-16 15:02:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 15:02:13] [INFO ] Computing Do-Not-Accords matrix : 65 transitions.
[2022-05-16 15:02:13] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 15:02:13] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10544298056624502501
Running compilation step : cd /tmp/ltsmin10544298056624502501;'/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 622 ms.
Running link step : cd /tmp/ltsmin10544298056624502501;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin10544298056624502501;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4699352407702547509.hoa' '--buchi-type=spotba'
LTSmin run took 138 ms.
FORMULA DES-PT-02a-LTLFireability-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-02a-LTLFireability-05 finished in 7181 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((!(F(!(F(p0)||!p1)) U p0)&&p2))))'
Support contains 4 out of 123 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 66/66 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 122 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 122 transition count 65
Applied a total of 2 rules in 14 ms. Remains 122 /123 variables (removed 1) and now considering 65/66 (removed 1) transitions.
// Phase 1: matrix 65 rows 122 cols
[2022-05-16 15:02:14] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-16 15:02:15] [INFO ] Implicit Places using invariants in 201 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 203 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 121/123 places, 65/66 transitions.
Applied a total of 0 rules in 10 ms. Remains 121 /121 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 121/123 places, 65/66 transitions.
Stuttering acceptance computed with spot in 53 ms :[(OR (NOT p2) p0)]
Running random walk in product with property : DES-PT-02a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p2) p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p2:(OR (EQ s63 0) (EQ s79 0)), p0:(AND (EQ s14 1) (EQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2528 reset in 525 ms.
Product exploration explored 100000 steps with 2530 reset in 466 ms.
Computed a total of 24 stabilizing places and 19 stable transitions
Computed a total of 24 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p2 (NOT p0)), (X (AND p2 (NOT p0))), (X (NOT (OR (NOT p2) p0))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (OR (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 184 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p2) p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p2 (NOT p0)), (X (AND p2 (NOT p0))), (X (NOT (OR (NOT p2) p0))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (OR (NOT p2) p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p2))), (F (OR p0 (NOT p2)))]
Knowledge based reduction with 5 factoid took 226 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 33 ms :[(OR (NOT p2) p0)]
Stuttering acceptance computed with spot in 40 ms :[(OR (NOT p2) p0)]
Support contains 4 out of 121 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 65/65 transitions.
Applied a total of 0 rules in 5 ms. Remains 121 /121 variables (removed 0) and now considering 65/65 (removed 0) transitions.
// Phase 1: matrix 65 rows 121 cols
[2022-05-16 15:02:16] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 15:02:16] [INFO ] Implicit Places using invariants in 157 ms returned []
// Phase 1: matrix 65 rows 121 cols
[2022-05-16 15:02:16] [INFO ] Computed 58 place invariants in 6 ms
[2022-05-16 15:02:17] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
[2022-05-16 15:02:17] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 65 rows 121 cols
[2022-05-16 15:02:17] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 15:02:17] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 121/121 places, 65/65 transitions.
Computed a total of 24 stabilizing places and 19 stable transitions
Computed a total of 24 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p0) p2), (X (AND (NOT p0) p2)), (X (NOT (OR p0 (NOT p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (OR p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 246 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 48 ms :[(OR (NOT p2) p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) p2), (X (AND (NOT p0) p2)), (X (NOT (OR p0 (NOT p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (OR p0 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p2))), (F (OR p0 (NOT p2)))]
Knowledge based reduction with 5 factoid took 306 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 49 ms :[(OR (NOT p2) p0)]
Stuttering acceptance computed with spot in 57 ms :[(OR (NOT p2) p0)]
Stuttering acceptance computed with spot in 63 ms :[(OR (NOT p2) p0)]
Product exploration explored 100000 steps with 2514 reset in 415 ms.
Product exploration explored 100000 steps with 2511 reset in 480 ms.
Built C files in :
/tmp/ltsmin5121146459114522938
[2022-05-16 15:02:18] [INFO ] Computing symmetric may disable matrix : 65 transitions.
[2022-05-16 15:02:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 15:02:18] [INFO ] Computing symmetric may enable matrix : 65 transitions.
[2022-05-16 15:02:18] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 15:02:18] [INFO ] Computing Do-Not-Accords matrix : 65 transitions.
[2022-05-16 15:02:18] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 15:02:18] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5121146459114522938
Running compilation step : cd /tmp/ltsmin5121146459114522938;'/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 225 ms.
Running link step : cd /tmp/ltsmin5121146459114522938;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin5121146459114522938;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16219325816887325820.hoa' '--buchi-type=spotba'
LTSmin run took 183 ms.
FORMULA DES-PT-02a-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-02a-LTLFireability-06 finished in 4585 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(!((G(p0)||p1) U p0)))||X(p1))))'
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 66/66 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 122 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 122 transition count 65
Applied a total of 2 rules in 3 ms. Remains 122 /123 variables (removed 1) and now considering 65/66 (removed 1) transitions.
// Phase 1: matrix 65 rows 122 cols
[2022-05-16 15:02:19] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-16 15:02:19] [INFO ] Implicit Places using invariants in 167 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 169 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/123 places, 65/66 transitions.
Applied a total of 0 rules in 3 ms. Remains 121 /121 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 121/123 places, 65/66 transitions.
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), p0]
Running random walk in product with property : DES-PT-02a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s110 1) (EQ s115 1)), p0:(AND (EQ s12 1) (EQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 521 ms.
Product exploration explored 100000 steps with 33333 reset in 378 ms.
Computed a total of 24 stabilizing places and 19 stable transitions
Computed a total of 24 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p1) p0))))
Knowledge based reduction with 2 factoid took 65 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DES-PT-02a-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-02a-LTLFireability-08 finished in 1361 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(!p0) U p1))))'
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 66/66 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 122 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 122 transition count 65
Applied a total of 2 rules in 8 ms. Remains 122 /123 variables (removed 1) and now considering 65/66 (removed 1) transitions.
// Phase 1: matrix 65 rows 122 cols
[2022-05-16 15:02:20] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-16 15:02:20] [INFO ] Implicit Places using invariants in 134 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 135 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 121/123 places, 65/66 transitions.
Applied a total of 0 rules in 5 ms. Remains 121 /121 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 121/123 places, 65/66 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : DES-PT-02a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s97 1) (EQ s100 1)), p0:(AND (EQ s12 1) (EQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 9028 reset in 462 ms.
Product exploration explored 100000 steps with 9062 reset in 520 ms.
Computed a total of 24 stabilizing places and 19 stable transitions
Computed a total of 24 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 364 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p0)]
Finished random walk after 51 steps, including 1 resets, run visited all 3 properties in 3 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (AND p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 469 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p0)]
// Phase 1: matrix 65 rows 121 cols
[2022-05-16 15:02:23] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 15:02:23] [INFO ] [Real]Absence check using 33 positive place invariants in 18 ms returned sat
[2022-05-16 15:02:23] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 30 ms returned sat
[2022-05-16 15:02:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 15:02:23] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2022-05-16 15:02:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 15:02:23] [INFO ] [Nat]Absence check using 33 positive place invariants in 19 ms returned sat
[2022-05-16 15:02:23] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 45 ms returned sat
[2022-05-16 15:02:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 15:02:24] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2022-05-16 15:02:24] [INFO ] Computed and/alt/rep : 62/189/62 causal constraints (skipped 2 transitions) in 10 ms.
[2022-05-16 15:02:24] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 4 ms to minimize.
[2022-05-16 15:02:24] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 2 ms to minimize.
[2022-05-16 15:02:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 172 ms
[2022-05-16 15:02:24] [INFO ] Added : 55 causal constraints over 11 iterations in 404 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 65/65 transitions.
Applied a total of 0 rules in 12 ms. Remains 121 /121 variables (removed 0) and now considering 65/65 (removed 0) transitions.
// Phase 1: matrix 65 rows 121 cols
[2022-05-16 15:02:24] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 15:02:24] [INFO ] Implicit Places using invariants in 190 ms returned []
// Phase 1: matrix 65 rows 121 cols
[2022-05-16 15:02:24] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 15:02:24] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
[2022-05-16 15:02:24] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 65 rows 121 cols
[2022-05-16 15:02:24] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 15:02:25] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 121/121 places, 65/65 transitions.
Computed a total of 24 stabilizing places and 19 stable transitions
Computed a total of 24 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 375 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p0)]
Finished random walk after 181 steps, including 4 resets, run visited all 3 properties in 4 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p1), (F (AND p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 392 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p0)]
// Phase 1: matrix 65 rows 121 cols
[2022-05-16 15:02:26] [INFO ] Computed 58 place invariants in 0 ms
[2022-05-16 15:02:26] [INFO ] [Real]Absence check using 33 positive place invariants in 11 ms returned sat
[2022-05-16 15:02:26] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 19 ms returned sat
[2022-05-16 15:02:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 15:02:26] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2022-05-16 15:02:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 15:02:26] [INFO ] [Nat]Absence check using 33 positive place invariants in 14 ms returned sat
[2022-05-16 15:02:26] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 30 ms returned sat
[2022-05-16 15:02:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 15:02:26] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2022-05-16 15:02:26] [INFO ] Computed and/alt/rep : 62/189/62 causal constraints (skipped 2 transitions) in 10 ms.
[2022-05-16 15:02:27] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 3 ms to minimize.
[2022-05-16 15:02:27] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2022-05-16 15:02:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 145 ms
[2022-05-16 15:02:27] [INFO ] Added : 55 causal constraints over 11 iterations in 382 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 9099 reset in 457 ms.
Product exploration explored 100000 steps with 9063 reset in 377 ms.
Built C files in :
/tmp/ltsmin3418338689153363222
[2022-05-16 15:02:28] [INFO ] Computing symmetric may disable matrix : 65 transitions.
[2022-05-16 15:02:28] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 15:02:28] [INFO ] Computing symmetric may enable matrix : 65 transitions.
[2022-05-16 15:02:28] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 15:02:28] [INFO ] Computing Do-Not-Accords matrix : 65 transitions.
[2022-05-16 15:02:28] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 15:02:28] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3418338689153363222
Running compilation step : cd /tmp/ltsmin3418338689153363222;'/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 241 ms.
Running link step : cd /tmp/ltsmin3418338689153363222;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin3418338689153363222;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16044941444995462154.hoa' '--buchi-type=spotba'
LTSmin run took 982 ms.
FORMULA DES-PT-02a-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-02a-LTLFireability-09 finished in 8636 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(((X(p0)||p1)&&G(p2)))||F(p3)))'
Support contains 12 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 66/66 transitions.
Applied a total of 0 rules in 1 ms. Remains 123 /123 variables (removed 0) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 123 cols
[2022-05-16 15:02:29] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-16 15:02:29] [INFO ] Implicit Places using invariants in 196 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 197 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/123 places, 66/66 transitions.
Applied a total of 0 rules in 1 ms. Remains 122 /122 variables (removed 0) and now considering 66/66 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 122/123 places, 66/66 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p3)]
Running random walk in product with property : DES-PT-02a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p3) p2 p1 p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p3) p2 (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p2)) (AND (NOT p3) (NOT p0))), acceptance={} source=1 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p3:(OR (AND (EQ s19 1) (EQ s112 1)) (AND (EQ s45 1) (EQ s115 1))), p2:(AND (EQ s29 1) (EQ s34 1) (EQ s36 1)), p1:(AND (EQ s44 1) (EQ s46 1) (EQ s103 1)), ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 18162 reset in 511 ms.
Product exploration explored 100000 steps with 18185 reset in 533 ms.
Computed a total of 25 stabilizing places and 20 stable transitions
Computed a total of 25 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p3) p2 p1 p0))), (X (NOT (AND (NOT p3) p2 (NOT p1) p0))), (X (OR (AND (NOT p3) (NOT p2)) (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p3) p2 (NOT p1)))), (X (AND (NOT p3) (NOT p2))), (X (NOT p3)), (X (NOT (AND (NOT p3) p2 p1))), (X (X (NOT (AND (NOT p3) p2 p1 p0)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1) p0)))), (X (X (OR (AND (NOT p3) (NOT p2)) (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) p2 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 686 ms. Reduced automaton from 3 states, 7 edges and 4 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 82 ms :[(NOT p3), (NOT p3)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p3) p2 p1 p0))), (X (NOT (AND (NOT p3) p2 (NOT p1) p0))), (X (OR (AND (NOT p3) (NOT p2)) (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p3) p2 (NOT p1)))), (X (AND (NOT p3) (NOT p2))), (X (NOT p3)), (X (NOT (AND (NOT p3) p2 p1))), (X (X (NOT (AND (NOT p3) p2 p1 p0)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1) p0)))), (X (X (OR (AND (NOT p3) (NOT p2)) (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) p2 p1))))]
False Knowledge obtained : [(F p3)]
Knowledge based reduction with 15 factoid took 714 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 37 ms :[(NOT p3)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p3)]
// Phase 1: matrix 66 rows 122 cols
[2022-05-16 15:02:32] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 15:02:32] [INFO ] [Real]Absence check using 33 positive place invariants in 15 ms returned sat
[2022-05-16 15:02:32] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 39 ms returned sat
[2022-05-16 15:02:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 15:02:32] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2022-05-16 15:02:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 15:02:33] [INFO ] [Nat]Absence check using 33 positive place invariants in 21 ms returned sat
[2022-05-16 15:02:33] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 30 ms returned sat
[2022-05-16 15:02:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 15:02:33] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2022-05-16 15:02:33] [INFO ] Computed and/alt/rep : 63/195/63 causal constraints (skipped 2 transitions) in 10 ms.
[2022-05-16 15:02:33] [INFO ] Added : 60 causal constraints over 12 iterations in 282 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 4 out of 122 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 66/66 transitions.
Applied a total of 0 rules in 10 ms. Remains 122 /122 variables (removed 0) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 122 cols
[2022-05-16 15:02:33] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 15:02:33] [INFO ] Implicit Places using invariants in 192 ms returned []
// Phase 1: matrix 66 rows 122 cols
[2022-05-16 15:02:33] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 15:02:34] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
[2022-05-16 15:02:34] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 66 rows 122 cols
[2022-05-16 15:02:34] [INFO ] Computed 58 place invariants in 4 ms
[2022-05-16 15:02:34] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 122/122 places, 66/66 transitions.
Computed a total of 25 stabilizing places and 20 stable transitions
Computed a total of 25 stabilizing places and 20 stable transitions
Knowledge obtained : [(NOT p3), (X (NOT p3)), (X (X (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 39 ms :[(NOT p3)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p3), (X (NOT p3)), (X (X (NOT p3)))]
False Knowledge obtained : [(F p3)]
Knowledge based reduction with 3 factoid took 164 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 44 ms :[(NOT p3)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p3)]
// Phase 1: matrix 66 rows 122 cols
[2022-05-16 15:02:34] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 15:02:34] [INFO ] [Real]Absence check using 33 positive place invariants in 16 ms returned sat
[2022-05-16 15:02:34] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 29 ms returned sat
[2022-05-16 15:02:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 15:02:35] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2022-05-16 15:02:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 15:02:35] [INFO ] [Nat]Absence check using 33 positive place invariants in 20 ms returned sat
[2022-05-16 15:02:35] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 43 ms returned sat
[2022-05-16 15:02:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 15:02:35] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2022-05-16 15:02:35] [INFO ] Computed and/alt/rep : 63/195/63 causal constraints (skipped 2 transitions) in 10 ms.
[2022-05-16 15:02:35] [INFO ] Added : 60 causal constraints over 12 iterations in 248 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 37 ms :[(NOT p3)]
Product exploration explored 100000 steps with 18155 reset in 463 ms.
Product exploration explored 100000 steps with 18154 reset in 506 ms.
Built C files in :
/tmp/ltsmin2852827516693247866
[2022-05-16 15:02:36] [INFO ] Computing symmetric may disable matrix : 66 transitions.
[2022-05-16 15:02:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 15:02:36] [INFO ] Computing symmetric may enable matrix : 66 transitions.
[2022-05-16 15:02:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 15:02:36] [INFO ] Computing Do-Not-Accords matrix : 66 transitions.
[2022-05-16 15:02:36] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 15:02:36] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2852827516693247866
Running compilation step : cd /tmp/ltsmin2852827516693247866;'/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 275 ms.
Running link step : cd /tmp/ltsmin2852827516693247866;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin2852827516693247866;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14964598294904597126.hoa' '--buchi-type=spotba'
LTSmin run took 66 ms.
FORMULA DES-PT-02a-LTLFireability-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-02a-LTLFireability-11 finished in 7720 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((!G(p0) U p1)||G(p2)))'
Support contains 6 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 66/66 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 122 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 122 transition count 65
Applied a total of 2 rules in 12 ms. Remains 122 /123 variables (removed 1) and now considering 65/66 (removed 1) transitions.
// Phase 1: matrix 65 rows 122 cols
[2022-05-16 15:02:37] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-16 15:02:37] [INFO ] Implicit Places using invariants in 163 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 164 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 121/123 places, 65/66 transitions.
Applied a total of 0 rules in 9 ms. Remains 121 /121 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 121/123 places, 65/66 transitions.
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) (NOT p2)), p0, (NOT p1), (AND p0 (NOT p2))]
Running random walk in product with property : DES-PT-02a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s65 1) (EQ s81 1)), p2:(AND (EQ s57 1) (EQ s74 1)), p0:(AND (EQ s17 1) (EQ s101 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 332 steps with 23 reset in 2 ms.
FORMULA DES-PT-02a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02a-LTLFireability-12 finished in 389 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 66/66 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 122 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 122 transition count 65
Applied a total of 2 rules in 3 ms. Remains 122 /123 variables (removed 1) and now considering 65/66 (removed 1) transitions.
// Phase 1: matrix 65 rows 122 cols
[2022-05-16 15:02:37] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-16 15:02:37] [INFO ] Implicit Places using invariants in 218 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 221 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/123 places, 65/66 transitions.
Applied a total of 0 rules in 1 ms. Remains 121 /121 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 121/123 places, 65/66 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-02a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s3 1) (EQ s116 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]]
Stuttering criterion allowed to conclude after 47 steps with 2 reset in 1 ms.
FORMULA DES-PT-02a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02a-LTLFireability-13 finished in 357 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((X(G(F(p0)))&&p0))||F(p1))))'
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 66/66 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 122 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 122 transition count 65
Applied a total of 2 rules in 11 ms. Remains 122 /123 variables (removed 1) and now considering 65/66 (removed 1) transitions.
// Phase 1: matrix 65 rows 122 cols
[2022-05-16 15:02:37] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-16 15:02:38] [INFO ] Implicit Places using invariants in 220 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 221 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 121/123 places, 65/66 transitions.
Applied a total of 0 rules in 8 ms. Remains 121 /121 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 121/123 places, 65/66 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-02a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s71 0) (EQ s87 0)), p1:(OR (EQ s4 0) (EQ s116 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2530 reset in 366 ms.
Product exploration explored 100000 steps with 2581 reset in 425 ms.
Computed a total of 24 stabilizing places and 19 stable transitions
Computed a total of 24 stabilizing places and 19 stable transitions
Detected a total of 24/121 stabilizing places and 19/65 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1632 steps, including 43 resets, run visited all 1 properties in 10 ms. (steps per millisecond=163 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 207 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 65/65 transitions.
Applied a total of 0 rules in 6 ms. Remains 121 /121 variables (removed 0) and now considering 65/65 (removed 0) transitions.
// Phase 1: matrix 65 rows 121 cols
[2022-05-16 15:02:39] [INFO ] Computed 58 place invariants in 0 ms
[2022-05-16 15:02:39] [INFO ] Implicit Places using invariants in 212 ms returned []
// Phase 1: matrix 65 rows 121 cols
[2022-05-16 15:02:39] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 15:02:40] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
[2022-05-16 15:02:40] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 65 rows 121 cols
[2022-05-16 15:02:40] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 15:02:40] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 121/121 places, 65/65 transitions.
Computed a total of 24 stabilizing places and 19 stable transitions
Computed a total of 24 stabilizing places and 19 stable transitions
Detected a total of 24/121 stabilizing places and 19/65 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 197 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1567 steps, including 38 resets, run visited all 1 properties in 9 ms. (steps per millisecond=174 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 207 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2532 reset in 365 ms.
Product exploration explored 100000 steps with 2544 reset in 427 ms.
Built C files in :
/tmp/ltsmin6087106727678793266
[2022-05-16 15:02:41] [INFO ] Computing symmetric may disable matrix : 65 transitions.
[2022-05-16 15:02:41] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 15:02:41] [INFO ] Computing symmetric may enable matrix : 65 transitions.
[2022-05-16 15:02:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 15:02:41] [INFO ] Computing Do-Not-Accords matrix : 65 transitions.
[2022-05-16 15:02:41] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 15:02:41] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6087106727678793266
Running compilation step : cd /tmp/ltsmin6087106727678793266;'/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 357 ms.
Running link step : cd /tmp/ltsmin6087106727678793266;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin6087106727678793266;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2978730016199787668.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 65/65 transitions.
Applied a total of 0 rules in 7 ms. Remains 121 /121 variables (removed 0) and now considering 65/65 (removed 0) transitions.
// Phase 1: matrix 65 rows 121 cols
[2022-05-16 15:02:57] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 15:02:57] [INFO ] Implicit Places using invariants in 206 ms returned []
// Phase 1: matrix 65 rows 121 cols
[2022-05-16 15:02:57] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 15:02:57] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
[2022-05-16 15:02:57] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 65 rows 121 cols
[2022-05-16 15:02:57] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 15:02:57] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 121/121 places, 65/65 transitions.
Built C files in :
/tmp/ltsmin14027739231852835786
[2022-05-16 15:02:57] [INFO ] Computing symmetric may disable matrix : 65 transitions.
[2022-05-16 15:02:57] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 15:02:57] [INFO ] Computing symmetric may enable matrix : 65 transitions.
[2022-05-16 15:02:57] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 15:02:57] [INFO ] Computing Do-Not-Accords matrix : 65 transitions.
[2022-05-16 15:02:57] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 15:02:57] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14027739231852835786
Running compilation step : cd /tmp/ltsmin14027739231852835786;'/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 398 ms.
Running link step : cd /tmp/ltsmin14027739231852835786;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin14027739231852835786;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10536291130547756086.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 15:03:12] [INFO ] Flatten gal took : 14 ms
[2022-05-16 15:03:12] [INFO ] Flatten gal took : 13 ms
[2022-05-16 15:03:12] [INFO ] Time to serialize gal into /tmp/LTL12679481765633263781.gal : 4 ms
[2022-05-16 15:03:12] [INFO ] Time to serialize properties into /tmp/LTL2677177419873142604.ltl : 1 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/LTL12679481765633263781.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2677177419873142604.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/LTL1267948...267
Read 1 LTL properties
Checking formula 0 : !((G((F((X(G(F("((p72==0)||(p88==0))"))))&&("((p72==0)||(p88==0))")))||(F("((p4==0)||(p118==0))")))))
Formula 0 simplified : !G(F("((p72==0)||(p88==0))" & XGF"((p72==0)||(p88==0))") | F"((p4==0)||(p118==0))")
Detected timeout of ITS tools.
[2022-05-16 15:03:27] [INFO ] Flatten gal took : 10 ms
[2022-05-16 15:03:27] [INFO ] Applying decomposition
[2022-05-16 15:03:27] [INFO ] Flatten gal took : 14 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/graph8867112234148584192.txt' '-o' '/tmp/graph8867112234148584192.bin' '-w' '/tmp/graph8867112234148584192.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8867112234148584192.bin' '-l' '-1' '-v' '-w' '/tmp/graph8867112234148584192.weights' '-q' '0' '-e' '0.001'
[2022-05-16 15:03:28] [INFO ] Decomposing Gal with order
[2022-05-16 15:03:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 15:03:28] [INFO ] Removed a total of 16 redundant transitions.
[2022-05-16 15:03:28] [INFO ] Flatten gal took : 90 ms
[2022-05-16 15:03:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2022-05-16 15:03:28] [INFO ] Time to serialize gal into /tmp/LTL1919685887632879904.gal : 8 ms
[2022-05-16 15:03:28] [INFO ] Time to serialize properties into /tmp/LTL7580815488330754425.ltl : 1 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/LTL1919685887632879904.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7580815488330754425.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/LTL1919685...245
Read 1 LTL properties
Checking formula 0 : !((G((F((X(G(F("((i8.u29.p72==0)||(i8.u37.p88==0))"))))&&("((i8.u29.p72==0)||(i8.u37.p88==0))")))||(F("((u48.p4==0)||(u48.p118==0))"))...158
Formula 0 simplified : !G(F("((i8.u29.p72==0)||(i8.u37.p88==0))" & XGF"((i8.u29.p72==0)||(i8.u37.p88==0))") | F"((u48.p4==0)||(u48.p118==0))")
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t25, u48.t5, i0.t59, i0.u0.t10, i0.u6.t64, i1.t63, i1.t57, i1.t0, i1.u1.t9, i2.u2...303
Computing Next relation with stutter on 2450 deadlock states
1180 unique states visited
0 strongly connected components in search stack
2351 transitions explored
103 items max in DFS search stack
668 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.71387,128336,1,0,190098,793,1574,260009,374,2715,360396
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DES-PT-02a-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property DES-PT-02a-LTLFireability-14 finished in 57607 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X((X(p0)&&!((p1 U p2) U p0))))))'
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 66/66 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 122 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 122 transition count 65
Applied a total of 2 rules in 9 ms. Remains 122 /123 variables (removed 1) and now considering 65/66 (removed 1) transitions.
// Phase 1: matrix 65 rows 122 cols
[2022-05-16 15:03:35] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-16 15:03:35] [INFO ] Implicit Places using invariants in 163 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 165 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 121/123 places, 65/66 transitions.
Applied a total of 0 rules in 5 ms. Remains 121 /121 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 121/123 places, 65/66 transitions.
Stuttering acceptance computed with spot in 277 ms :[true, true, (NOT p0), p0, (AND p0 p2), p2, (AND (NOT p0) p2)]
Running random walk in product with property : DES-PT-02a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={0} source=1 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={0, 1} source=3 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND p2 p0), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=4 dest: 5}], [{ cond=(AND p2 p0), acceptance={0, 1} source=5 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=5 dest: 5}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1} source=5 dest: 6}], [{ cond=(AND p2 (NOT p0)), acceptance={0, 1} source=6 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={0} source=6 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s10 1), p2:(AND (EQ s12 1) (EQ s31 1)), p1:(AND (EQ s23 1) (EQ s33 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 50759 steps with 8598 reset in 257 ms.
FORMULA DES-PT-02a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02a-LTLFireability-15 finished in 740 ms.
All properties solved by simple procedures.
Total runtime 94177 ms.

BK_STOP 1652713416422

--------------------
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="DES-PT-02a"
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 DES-PT-02a, 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 r042-smll-165252095700420"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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