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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 272K
-rw-r--r-- 1 mcc users 8.2K Apr 29 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 29 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 29 12:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 29 12:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 09:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 09:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 09:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 09:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rwxr-xr-x 1 mcc users 24K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME TCPcondis-PT-15-LTLFireability-00
FORMULA_NAME TCPcondis-PT-15-LTLFireability-01
FORMULA_NAME TCPcondis-PT-15-LTLFireability-02
FORMULA_NAME TCPcondis-PT-15-LTLFireability-03
FORMULA_NAME TCPcondis-PT-15-LTLFireability-04
FORMULA_NAME TCPcondis-PT-15-LTLFireability-05
FORMULA_NAME TCPcondis-PT-15-LTLFireability-06
FORMULA_NAME TCPcondis-PT-15-LTLFireability-07
FORMULA_NAME TCPcondis-PT-15-LTLFireability-08
FORMULA_NAME TCPcondis-PT-15-LTLFireability-09
FORMULA_NAME TCPcondis-PT-15-LTLFireability-10
FORMULA_NAME TCPcondis-PT-15-LTLFireability-11
FORMULA_NAME TCPcondis-PT-15-LTLFireability-12
FORMULA_NAME TCPcondis-PT-15-LTLFireability-13
FORMULA_NAME TCPcondis-PT-15-LTLFireability-14
FORMULA_NAME TCPcondis-PT-15-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653138878764

Running Version 202205111006
[2022-05-21 13:14:39] [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-21 13:14:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 13:14:40] [WARNING] Skipping unknown tool specific annotation : Tina
[2022-05-21 13:14:40] [WARNING] Unknown XML tag in source file: size
[2022-05-21 13:14:40] [WARNING] Unknown XML tag in source file: color
[2022-05-21 13:14:40] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2022-05-21 13:14:40] [INFO ] Transformed 30 places.
[2022-05-21 13:14:40] [INFO ] Transformed 32 transitions.
[2022-05-21 13:14:40] [INFO ] Parsed PT model containing 30 places and 32 transitions in 167 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA TCPcondis-PT-15-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-15-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 9 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:14:40] [INFO ] Computed 9 place invariants in 9 ms
[2022-05-21 13:14:40] [INFO ] Implicit Places using invariants in 126 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:14:40] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:14:40] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:14:40] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-21 13:14:40] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Support contains 28 out of 30 places after structural reductions.
[2022-05-21 13:14:40] [INFO ] Flatten gal took : 18 ms
[2022-05-21 13:14:40] [INFO ] Flatten gal took : 6 ms
[2022-05-21 13:14:40] [INFO ] Input system was already deterministic with 32 transitions.
Incomplete random walk after 10004 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 24) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:14:40] [INFO ] Computed 9 place invariants in 3 ms
[2022-05-21 13:14:40] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(!G((X(X(p0))||X(p1))) U p2))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:14:41] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:14:41] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:14:41] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-21 13:14:41] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:14:41] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-21 13:14:41] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 305 ms :[true, p2, (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) p2)]
Running random walk in product with property : TCPcondis-PT-15-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={} source=1 dest: 0}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p2 p1), acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(AND (GEQ s9 1) (GEQ s25 1)), p0:(AND (GEQ s13 1) (GEQ s25 1) (GEQ s26 1)), p1:(AND (GEQ s7 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 3 ms.
FORMULA TCPcondis-PT-15-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-15-LTLFireability-00 finished in 509 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(p0))))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:14:41] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:14:41] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:14:41] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:14:41] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:14:41] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:14:41] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-15-LTLFireability-01 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:(OR (LT s13 1) (LT s25 1) (LT s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 191 ms.
Product exploration explored 100000 steps with 33333 reset in 112 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 153 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA TCPcondis-PT-15-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-15-LTLFireability-01 finished in 749 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(X(p0)))||(X(X(p0))&&G(p1))))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:14:42] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:14:42] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:14:42] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-21 13:14:42] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:14:42] [INFO ] Computed 9 place invariants in 5 ms
[2022-05-21 13:14:42] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-15-LTLFireability-02 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 (GEQ s10 1) (GEQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 10775 reset in 123 ms.
Product exploration explored 100000 steps with 10565 reset in 228 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 83 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 721 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=721 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 103 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:14:43] [INFO ] Computed 9 place invariants in 1 ms
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 1 factoid took 82 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 1 edges and 0 AP.
FORMULA TCPcondis-PT-15-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-15-LTLFireability-02 finished in 1209 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((X(G(X(p0)))&&F(p0))))))'
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 26 transition count 28
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 26 transition count 28
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 26 transition count 26
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 10 place count 26 transition count 25
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 25 transition count 25
Applied a total of 12 rules in 17 ms. Remains 25 /30 variables (removed 5) and now considering 25/32 (removed 7) transitions.
// Phase 1: matrix 25 rows 25 cols
[2022-05-21 13:14:43] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:14:43] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-21 13:14:43] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:14:43] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2022-05-21 13:14:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-21 13:14:43] [INFO ] Computed 9 place invariants in 4 ms
[2022-05-21 13:14:43] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/30 places, 25/32 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/30 places, 25/32 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-15-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s11 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 0 reset in 202 ms.
Stack based approach found an accepted trace after 6823 steps with 0 reset with depth 6824 and stack size 6824 in 18 ms.
FORMULA TCPcondis-PT-15-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-15-LTLFireability-04 finished in 403 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((!p0 U F(!p0))) U !(p1 U p2)))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 28 transition count 30
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 27 transition count 29
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 27 transition count 29
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 27 transition count 27
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 8 place count 27 transition count 26
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 26 transition count 26
Applied a total of 10 rules in 7 ms. Remains 26 /30 variables (removed 4) and now considering 26/32 (removed 6) transitions.
// Phase 1: matrix 26 rows 26 cols
[2022-05-21 13:14:44] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:14:44] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 26 rows 26 cols
[2022-05-21 13:14:44] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:14:44] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2022-05-21 13:14:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 26 rows 26 cols
[2022-05-21 13:14:44] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:14:44] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/30 places, 26/32 transitions.
Finished structural reductions, in 1 iterations. Remains : 26/30 places, 26/32 transitions.
Stuttering acceptance computed with spot in 61 ms :[p2, p0]
Running random walk in product with property : TCPcondis-PT-15-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 0}, { cond=(AND p2 p0), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s0 1), p2:(GEQ s14 1), p0:(AND (GEQ s8 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 893 reset in 185 ms.
Stack based approach found an accepted trace after 3159 steps with 23 reset with depth 48 and stack size 48 in 10 ms.
FORMULA TCPcondis-PT-15-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-15-LTLFireability-05 finished in 384 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!(((p0 U X(X(X(p1)))) U p0) U !F(p2)))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:14:44] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:14:44] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:14:44] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:14:44] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:14:44] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:14:44] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 421 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p1 (NOT p2)), (AND p0 (NOT p2) p1), (AND p1 (NOT p2)), (AND p0 (NOT p2) p1), (AND (NOT p2) p1), (AND p1 (NOT p2))]
Running random walk in product with property : TCPcondis-PT-15-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 6}, { cond=p0, acceptance={} source=4 dest: 7}], [{ cond=(NOT p0), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 9}, { cond=p0, acceptance={} source=5 dest: 10}], [{ cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 6}, { cond=(AND p0 p1), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=7 dest: 9}, { cond=(AND p0 p1), acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 4}, { cond=(AND p0 p1), acceptance={} source=8 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={} source=9 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=10 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=10 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=10 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s20 1)), p2:(GEQ s3 1), p1:(AND (GEQ s3 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 9345 reset in 105 ms.
Product exploration explored 100000 steps with 9393 reset in 127 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 252 ms. Reduced automaton from 11 states, 23 edges and 3 AP to 11 states, 23 edges and 3 AP.
Stuttering acceptance computed with spot in 472 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p1 (NOT p2)), (AND p0 (NOT p2) p1), (AND p1 (NOT p2)), (AND p0 (NOT p2) p1), (AND (NOT p2) p1), (AND p1 (NOT p2))]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:14:46] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:14:46] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p0))), (G (NOT (AND (NOT p2) p1))), (G (NOT (AND (NOT p2) p1 (NOT p0))))]
False Knowledge obtained : [(F (AND p1 p0)), (F (AND p1 (NOT p0))), (F p0), (F (NOT (AND (NOT p2) (NOT p0)))), (F p2)]
Knowledge based reduction with 7 factoid took 435 ms. Reduced automaton from 11 states, 23 edges and 3 AP to 10 states, 19 edges and 3 AP.
Stuttering acceptance computed with spot in 371 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Stuttering acceptance computed with spot in 376 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:14:47] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:14:47] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 13:14:47] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-21 13:14:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 13:14:47] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-21 13:14:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 13:14:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 13:14:47] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-21 13:14:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 13:14:47] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-21 13:14:47] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-21 13:14:47] [INFO ] Added : 24 causal constraints over 6 iterations in 38 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:14:47] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:14:47] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:14:47] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:14:47] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:14:47] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:14:47] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 227 ms. Reduced automaton from 10 states, 19 edges and 3 AP to 10 states, 19 edges and 3 AP.
Stuttering acceptance computed with spot in 442 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Finished random walk after 5429 steps, including 1 resets, run visited all 4 properties in 12 ms. (steps per millisecond=452 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p1 p0)), (F p0), (F (AND p1 (NOT p0))), (F p2)]
Knowledge based reduction with 5 factoid took 274 ms. Reduced automaton from 10 states, 19 edges and 3 AP to 10 states, 19 edges and 3 AP.
Stuttering acceptance computed with spot in 385 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Stuttering acceptance computed with spot in 393 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:14:49] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:14:49] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-21 13:14:49] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-21 13:14:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 13:14:49] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-21 13:14:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 13:14:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 13:14:49] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-21 13:14:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 13:14:49] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-21 13:14:49] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-21 13:14:49] [INFO ] Added : 24 causal constraints over 6 iterations in 30 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 373 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Product exploration explored 100000 steps with 9488 reset in 107 ms.
Product exploration explored 100000 steps with 9395 reset in 138 ms.
Applying partial POR strategy [false, false, true, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 339 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1), (AND p0 (NOT p2) p1)]
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 30 transition count 32
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 29 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 29 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 29 transition count 29
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 7 place count 29 transition count 31
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 29 transition count 31
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 9 rules in 8 ms. Remains 29 /30 variables (removed 1) and now considering 31/32 (removed 1) transitions.
[2022-05-21 13:14:50] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 31 rows 29 cols
[2022-05-21 13:14:50] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:14:50] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/30 places, 31/32 transitions.
Finished structural reductions, in 1 iterations. Remains : 29/30 places, 31/32 transitions.
Product exploration explored 100000 steps with 12061 reset in 196 ms.
Product exploration explored 100000 steps with 12152 reset in 191 ms.
Built C files in :
/tmp/ltsmin2751105982214434848
[2022-05-21 13:14:51] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2751105982214434848
Running compilation step : cd /tmp/ltsmin2751105982214434848;'/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 395 ms.
Running link step : cd /tmp/ltsmin2751105982214434848;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin2751105982214434848;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12359073307157084691.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:15:06] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:15:06] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:15:06] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:15:06] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:15:06] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:15:06] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Built C files in :
/tmp/ltsmin12388161167084396666
[2022-05-21 13:15:06] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12388161167084396666
Running compilation step : cd /tmp/ltsmin12388161167084396666;'/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 104 ms.
Running link step : cd /tmp/ltsmin12388161167084396666;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin12388161167084396666;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14774216989381817727.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-21 13:15:21] [INFO ] Flatten gal took : 7 ms
[2022-05-21 13:15:21] [INFO ] Flatten gal took : 4 ms
[2022-05-21 13:15:21] [INFO ] Time to serialize gal into /tmp/LTL18210514785535316889.gal : 1 ms
[2022-05-21 13:15:21] [INFO ] Time to serialize properties into /tmp/LTL2777302730182881551.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/LTL18210514785535316889.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2777302730182881551.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/LTL1821051...267
Read 1 LTL properties
Checking formula 0 : !((X(F(!(((("((CLOSING>=1)&&(xFINACK>=1))")U(X(X(X("((ESTAB>=1)&&(xFIN>=1))")))))U("((CLOSING>=1)&&(xFINACK>=1))"))U(!(F("(ESTAB>=1)")...162
Formula 0 simplified : !XF!((("((CLOSING>=1)&&(xFINACK>=1))" U XXX"((ESTAB>=1)&&(xFIN>=1))") U "((CLOSING>=1)&&(xFINACK>=1))") U !F"(ESTAB>=1)")
Detected timeout of ITS tools.
[2022-05-21 13:15:36] [INFO ] Flatten gal took : 6 ms
[2022-05-21 13:15:36] [INFO ] Applying decomposition
[2022-05-21 13:15:36] [INFO ] Flatten gal took : 5 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/graph17198733311779531753.txt' '-o' '/tmp/graph17198733311779531753.bin' '-w' '/tmp/graph17198733311779531753.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17198733311779531753.bin' '-l' '-1' '-v' '-w' '/tmp/graph17198733311779531753.weights' '-q' '0' '-e' '0.001'
[2022-05-21 13:15:36] [INFO ] Decomposing Gal with order
[2022-05-21 13:15:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 13:15:36] [INFO ] Removed a total of 24 redundant transitions.
[2022-05-21 13:15:36] [INFO ] Flatten gal took : 34 ms
[2022-05-21 13:15:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2022-05-21 13:15:36] [INFO ] Time to serialize gal into /tmp/LTL7962665627855559031.gal : 1 ms
[2022-05-21 13:15:36] [INFO ] Time to serialize properties into /tmp/LTL17353148546578459990.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/LTL7962665627855559031.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17353148546578459990.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/LTL7962665...246
Read 1 LTL properties
Checking formula 0 : !((X(F(!(((("((u0.CLOSING>=1)&&(u0.xFINACK>=1))")U(X(X(X("((i1.u1.ESTAB>=1)&&(i4.u6.xFIN>=1))")))))U("((u0.CLOSING>=1)&&(u0.xFINACK>=1...192
Formula 0 simplified : !XF!((("((u0.CLOSING>=1)&&(u0.xFINACK>=1))" U XXX"((i1.u1.ESTAB>=1)&&(i4.u6.xFIN>=1))") U "((u0.CLOSING>=1)&&(u0.xFINACK>=1))") U !F...174
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4906976776382846916
[2022-05-21 13:15:51] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4906976776382846916
Running compilation step : cd /tmp/ltsmin4906976776382846916;'/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 135 ms.
Running link step : cd /tmp/ltsmin4906976776382846916;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin4906976776382846916;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(!((((LTLAPp0==true) U X(X(X((LTLAPp1==true))))) U (LTLAPp0==true)) U !<>((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property TCPcondis-PT-15-LTLFireability-06 finished in 82312 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 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:16:06] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:16:06] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:16:06] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:16:06] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:16:06] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:16:06] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-15-LTLFireability-07 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 (GEQ s5 1) (GEQ s23 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 1 ms.
FORMULA TCPcondis-PT-15-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-15-LTLFireability-07 finished in 217 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U p1))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 26 transition count 28
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 26 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 26 transition count 27
Applied a total of 9 rules in 4 ms. Remains 26 /30 variables (removed 4) and now considering 27/32 (removed 5) transitions.
// Phase 1: matrix 27 rows 26 cols
[2022-05-21 13:16:06] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:16:06] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 27 rows 26 cols
[2022-05-21 13:16:06] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:16:06] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2022-05-21 13:16:06] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 27 rows 26 cols
[2022-05-21 13:16:06] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:16:07] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/30 places, 27/32 transitions.
Finished structural reductions, in 1 iterations. Remains : 26/30 places, 27/32 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : TCPcondis-PT-15-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s21 1), p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 251 steps with 1 reset in 2 ms.
FORMULA TCPcondis-PT-15-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-15-LTLFireability-08 finished in 250 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(F(X((X(G(p0))||F(p1))))))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 26 transition count 28
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 26 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 26 transition count 27
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 9 place count 26 transition count 26
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 25 transition count 26
Applied a total of 11 rules in 6 ms. Remains 25 /30 variables (removed 5) and now considering 26/32 (removed 6) transitions.
// Phase 1: matrix 26 rows 25 cols
[2022-05-21 13:16:07] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:16:07] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 26 rows 25 cols
[2022-05-21 13:16:07] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:16:07] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2022-05-21 13:16:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 26 rows 25 cols
[2022-05-21 13:16:07] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:16:07] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/30 places, 26/32 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/30 places, 26/32 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TCPcondis-PT-15-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s0 1), p1:(OR (LT s9 1) (LT s10 1) (LT s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4465 reset in 170 ms.
Product exploration explored 100000 steps with 4432 reset in 182 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 235 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 6935 steps, including 2 resets, run visited all 2 properties in 5 ms. (steps per millisecond=1387 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 436 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 26/26 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 26/26 (removed 0) transitions.
// Phase 1: matrix 26 rows 25 cols
[2022-05-21 13:16:08] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:16:08] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 26 rows 25 cols
[2022-05-21 13:16:08] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:16:08] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2022-05-21 13:16:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 26 rows 25 cols
[2022-05-21 13:16:08] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:16:08] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 26/26 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 239 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2501 ) properties (out of 2) seen :1
Finished Best-First random walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 234 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4489 reset in 142 ms.
Product exploration explored 100000 steps with 4397 reset in 150 ms.
Built C files in :
/tmp/ltsmin1756208675585038048
[2022-05-21 13:16:10] [INFO ] Computing symmetric may disable matrix : 26 transitions.
[2022-05-21 13:16:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 13:16:10] [INFO ] Computing symmetric may enable matrix : 26 transitions.
[2022-05-21 13:16:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 13:16:10] [INFO ] Computing Do-Not-Accords matrix : 26 transitions.
[2022-05-21 13:16:10] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 13:16:10] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1756208675585038048
Running compilation step : cd /tmp/ltsmin1756208675585038048;'/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 94 ms.
Running link step : cd /tmp/ltsmin1756208675585038048;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin1756208675585038048;'/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/stateBased12109268082409432212.hoa' '--buchi-type=spotba'
LTSmin run took 77 ms.
FORMULA TCPcondis-PT-15-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-15-LTLFireability-09 finished in 3149 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 25 transition count 27
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 25 transition count 27
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 25 transition count 25
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 12 place count 25 transition count 23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 23 transition count 23
Applied a total of 16 rules in 4 ms. Remains 23 /30 variables (removed 7) and now considering 23/32 (removed 9) transitions.
// Phase 1: matrix 23 rows 23 cols
[2022-05-21 13:16:10] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:16:10] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 23 rows 23 cols
[2022-05-21 13:16:10] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:16:10] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2022-05-21 13:16:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 23 rows 23 cols
[2022-05-21 13:16:10] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:16:10] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/30 places, 23/32 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/30 places, 23/32 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-15-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1867 reset in 166 ms.
Stack based approach found an accepted trace after 3099 steps with 51 reset with depth 43 and stack size 43 in 5 ms.
FORMULA TCPcondis-PT-15-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-15-LTLFireability-10 finished in 298 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F((G((G(p1)&&p0))||F((G(p2)&&p1)))))))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 25 transition count 27
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 25 transition count 27
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 25 transition count 25
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 12 place count 25 transition count 23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 23 transition count 23
Applied a total of 16 rules in 8 ms. Remains 23 /30 variables (removed 7) and now considering 23/32 (removed 9) transitions.
// Phase 1: matrix 23 rows 23 cols
[2022-05-21 13:16:10] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:16:10] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 23 rows 23 cols
[2022-05-21 13:16:10] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:16:10] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2022-05-21 13:16:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 23 rows 23 cols
[2022-05-21 13:16:10] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-21 13:16:10] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/30 places, 23/32 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/30 places, 23/32 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : TCPcondis-PT-15-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(OR (NOT p1) (AND (NOT p0) (NOT p2))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 p0 p2), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0) p2), acceptance={1} source=1 dest: 2}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p1 p0 p2), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p1) p2) (AND (NOT p0) p2)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s1 1), p2:(AND (GEQ s4 1) (GEQ s14 1)), p0:(AND (GEQ s9 1) (GEQ s21 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 212 ms.
Stack based approach found an accepted trace after 9945 steps with 0 reset with depth 9946 and stack size 3066 in 34 ms.
FORMULA TCPcondis-PT-15-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-15-LTLFireability-12 finished in 514 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((F(p0)||X(p1)||p2))&&X(p1))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:16:11] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:16:11] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:16:11] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:16:11] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:16:11] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:16:11] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 449 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-15-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(LT s29 1), p2:(LT s15 1), p0:(OR (LT s4 1) (LT s18 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, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4840 reset in 150 ms.
Product exploration explored 100000 steps with 4919 reset in 154 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), true, (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 264 ms. Reduced automaton from 7 states, 9 edges and 3 AP to 5 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10004 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :2
Finished Best-First random walk after 66 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=66 )
Knowledge obtained : [(AND p1 (NOT p2) p0), true, (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 4 factoid took 246 ms. Reduced automaton from 5 states, 6 edges and 3 AP to 5 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:16:13] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:16:13] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:16:13] [INFO ] Computed 9 place invariants in 4 ms
[2022-05-21 13:16:13] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:16:13] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:16:13] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), true, (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 5 states, 6 edges and 3 AP to 5 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 9853 steps, including 2 resets, run visited all 3 properties in 16 ms. (steps per millisecond=615 )
Knowledge obtained : [(AND p0 (NOT p2) p1), true, (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 3 factoid took 177 ms. Reduced automaton from 5 states, 6 edges and 3 AP to 5 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 2596 reset in 161 ms.
Product exploration explored 100000 steps with 2691 reset in 155 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 298 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 32
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 29 transition count 31
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 29 transition count 31
Deduced a syphon composed of 2 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 29 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 29 transition count 30
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 29 transition count 30
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 7 rules in 9 ms. Remains 29 /30 variables (removed 1) and now considering 30/32 (removed 2) transitions.
[2022-05-21 13:16:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 29 cols
[2022-05-21 13:16:14] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:16:14] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/30 places, 30/32 transitions.
Finished structural reductions, in 1 iterations. Remains : 29/30 places, 30/32 transitions.
Product exploration explored 100000 steps with 2619 reset in 160 ms.
Product exploration explored 100000 steps with 2627 reset in 166 ms.
Built C files in :
/tmp/ltsmin9247054035025790470
[2022-05-21 13:16:15] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9247054035025790470
Running compilation step : cd /tmp/ltsmin9247054035025790470;'/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 100 ms.
Running link step : cd /tmp/ltsmin9247054035025790470;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin9247054035025790470;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2248077855843538330.hoa' '--buchi-type=spotba'
LTSmin run took 1876 ms.
FORMULA TCPcondis-PT-15-LTLFireability-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-15-LTLFireability-13 finished in 6206 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(F(p0)) U X(p1))&&X((G(p2)||p3))))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:16:17] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:16:17] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:16:17] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 13:16:17] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:16:17] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:16:17] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p0), (NOT p2), (NOT p1)]
Running random walk in product with property : TCPcondis-PT-15-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(OR (AND p3 (NOT p1) (NOT p0)) (AND p2 (NOT p1) (NOT p0))), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=1 dest: 4}, { cond=(OR (AND p3 (NOT p1)) (AND p2 (NOT p1))), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p3:(LT s15 1), p2:(OR (LT s1 1) (LT s5 1) (LT s17 1)), p1:(AND (GEQ s12 1) (GEQ s26 1)), p0:(GEQ s1 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, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 281 steps with 0 reset in 2 ms.
FORMULA TCPcondis-PT-15-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-15-LTLFireability-14 finished in 311 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(((F(p0)||p0) U p1))&&G(X(p2))))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:16:17] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:16:17] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:16:17] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:16:17] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2022-05-21 13:16:17] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 13:16:17] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : TCPcondis-PT-15-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 3}], [{ cond=(AND p1 p0 p2), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(AND p1 p2), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=5 dest: 2}, { cond=(NOT p2), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=5 dest: 5}]], initial=4, aps=[p2:(AND (GEQ s7 1) (GEQ s19 1)), p0:(AND (GEQ s4 1) (GEQ s22 1)), p1:(AND (GEQ s13 1) (GEQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-15-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-15-LTLFireability-15 finished in 327 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!(((p0 U X(X(X(p1)))) U p0) U !F(p2)))))'
[2022-05-21 13:16:18] [INFO ] Flatten gal took : 3 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8144503054502518210
[2022-05-21 13:16:18] [INFO ] Computing symmetric may disable matrix : 32 transitions.
[2022-05-21 13:16:18] [INFO ] Applying decomposition
[2022-05-21 13:16:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 13:16:18] [INFO ] Computing symmetric may enable matrix : 32 transitions.
[2022-05-21 13:16:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 13:16:18] [INFO ] Flatten gal took : 2 ms
[2022-05-21 13:16:18] [INFO ] Computing Do-Not-Accords matrix : 32 transitions.
[2022-05-21 13:16:18] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 13:16:18] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8144503054502518210
Running compilation step : cd /tmp/ltsmin8144503054502518210;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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'
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/graph1854854325936887493.txt' '-o' '/tmp/graph1854854325936887493.bin' '-w' '/tmp/graph1854854325936887493.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1854854325936887493.bin' '-l' '-1' '-v' '-w' '/tmp/graph1854854325936887493.weights' '-q' '0' '-e' '0.001'
[2022-05-21 13:16:18] [INFO ] Decomposing Gal with order
[2022-05-21 13:16:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 13:16:18] [INFO ] Removed a total of 24 redundant transitions.
[2022-05-21 13:16:18] [INFO ] Flatten gal took : 6 ms
[2022-05-21 13:16:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-21 13:16:18] [INFO ] Time to serialize gal into /tmp/LTLFireability8049258197116775097.gal : 1 ms
[2022-05-21 13:16:18] [INFO ] Time to serialize properties into /tmp/LTLFireability3360065357037522027.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8049258197116775097.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3360065357037522027.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/LTLFireabi...267
Read 1 LTL properties
Checking formula 0 : !((X(F(!(((("((u0.CLOSING>=1)&&(i1.u2.xFINACK>=1))")U(X(X(X("((i1.u9.ESTAB>=1)&&(i3.i0.u3.xFIN>=1))")))))U("((u0.CLOSING>=1)&&(i1.u2.x...201
Formula 0 simplified : !XF!((("((u0.CLOSING>=1)&&(i1.u2.xFINACK>=1))" U XXX"((i1.u9.ESTAB>=1)&&(i3.i0.u3.xFIN>=1))") U "((u0.CLOSING>=1)&&(i1.u2.xFINACK>=1...183
Compilation finished in 105 ms.
Running link step : cd /tmp/ltsmin8144503054502518210;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin8144503054502518210;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(!((((LTLAPp0==true) U X(X(X((LTLAPp1==true))))) U (LTLAPp0==true)) U !<>((LTLAPp2==true)))))' '--buchi-type=spotba'
LTSmin run took 92674 ms.
FORMULA TCPcondis-PT-15-LTLFireability-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 190998 ms.

BK_STOP 1653139071009

--------------------
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="TCPcondis-PT-15"
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 TCPcondis-PT-15, 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 r258-tall-165303545700460"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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