Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r439-smll-171690585400043.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is TCPcondis-PT-50, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r439-smll-171690585400043
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 03:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 12 03:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 03:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 12 03:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rwxr-xr-x 1 mcc users 24K May 18 16:43 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-50-LTLFireability-00
FORMULA_NAME TCPcondis-PT-50-LTLFireability-01
FORMULA_NAME TCPcondis-PT-50-LTLFireability-02
FORMULA_NAME TCPcondis-PT-50-LTLFireability-03
FORMULA_NAME TCPcondis-PT-50-LTLFireability-04
FORMULA_NAME TCPcondis-PT-50-LTLFireability-05
FORMULA_NAME TCPcondis-PT-50-LTLFireability-06
FORMULA_NAME TCPcondis-PT-50-LTLFireability-07
FORMULA_NAME TCPcondis-PT-50-LTLFireability-08
FORMULA_NAME TCPcondis-PT-50-LTLFireability-09
FORMULA_NAME TCPcondis-PT-50-LTLFireability-10
FORMULA_NAME TCPcondis-PT-50-LTLFireability-11
FORMULA_NAME TCPcondis-PT-50-LTLFireability-12
FORMULA_NAME TCPcondis-PT-50-LTLFireability-13
FORMULA_NAME TCPcondis-PT-50-LTLFireability-14
FORMULA_NAME TCPcondis-PT-50-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716992169801

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TCPcondis-PT-50
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 14:16:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 14:16:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 14:16:13] [WARNING] Skipping unknown tool specific annotation : Tina
[2024-05-29 14:16:13] [WARNING] Unknown XML tag in source file: size
[2024-05-29 14:16:13] [WARNING] Unknown XML tag in source file: color
[2024-05-29 14:16:13] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2024-05-29 14:16:13] [INFO ] Transformed 30 places.
[2024-05-29 14:16:13] [INFO ] Transformed 32 transitions.
[2024-05-29 14:16:13] [INFO ] Parsed PT model containing 30 places and 32 transitions and 108 arcs in 157 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA TCPcondis-PT-50-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-50-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-50-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-50-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-50-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 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 14 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2024-05-29 14:16:13] [INFO ] Computed 9 invariants in 9 ms
[2024-05-29 14:16:13] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-05-29 14:16:13] [INFO ] Invariant cache hit.
[2024-05-29 14:16:13] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
[2024-05-29 14:16:13] [INFO ] Invariant cache hit.
[2024-05-29 14:16:13] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 467 ms. Remains : 30/30 places, 32/32 transitions.
Support contains 20 out of 30 places after structural reductions.
[2024-05-29 14:16:14] [INFO ] Flatten gal took : 42 ms
[2024-05-29 14:16:14] [INFO ] Flatten gal took : 16 ms
[2024-05-29 14:16:14] [INFO ] Input system was already deterministic with 32 transitions.
Finished random walk after 6430 steps, including 1 resets, run visited all 18 properties in 65 ms. (steps per millisecond=98 )
Parikh walk visited 0 properties in 1 ms.
FORMULA TCPcondis-PT-50-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA TCPcondis-PT-50-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X(G((p0||X(G(p1)))))) U G(p2)))'
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 2 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-29 14:16:14] [INFO ] Invariant cache hit.
[2024-05-29 14:16:15] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-29 14:16:15] [INFO ] Invariant cache hit.
[2024-05-29 14:16:15] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-05-29 14:16:15] [INFO ] Invariant cache hit.
[2024-05-29 14:16:15] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 305 ms. Remains : 30/30 places, 32/32 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 509 ms :[(NOT p2), true, (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 p0), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(LT s18 1), p0:(LT s24 1), p1:(LT s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 2 ms.
FORMULA TCPcondis-PT-50-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-50-LTLFireability-01 finished in 923 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G((X(p1)||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.
[2024-05-29 14:16:15] [INFO ] Invariant cache hit.
[2024-05-29 14:16:15] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-29 14:16:15] [INFO ] Invariant cache hit.
[2024-05-29 14:16:16] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2024-05-29 14:16:16] [INFO ] Invariant cache hit.
[2024-05-29 14:16:16] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 298 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 358 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p1:(OR (LT s6 1) (LT s20 1)), p0:(OR (LT s6 1) (LT s20 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, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 74 steps with 0 reset in 4 ms.
FORMULA TCPcondis-PT-50-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-50-LTLFireability-03 finished in 684 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)||G(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 2 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-29 14:16:16] [INFO ] Invariant cache hit.
[2024-05-29 14:16:16] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-29 14:16:16] [INFO ] Invariant cache hit.
[2024-05-29 14:16:16] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2024-05-29 14:16:16] [INFO ] Invariant cache hit.
[2024-05-29 14:16:16] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 253 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (GEQ s6 1) (GEQ s19 1)), p0:(AND (GEQ s10 1) (GEQ s28 1)), p2:(OR (LT s8 1) (LT s20 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 15381 reset in 555 ms.
Product exploration explored 100000 steps with 15515 reset in 280 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0) p2)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 343 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter sensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false]
Incomplete random walk after 10047 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=245 ) properties (out of 8) seen :4
Finished Best-First random walk after 9052 steps, including 2 resets, run visited all 4 properties in 34 ms. (steps per millisecond=266 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0) p2)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F (AND p0 p1 p2))]
Knowledge based reduction with 8 factoid took 498 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 312 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false]
Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false]
Support contains 6 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 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 8 place count 27 transition count 25
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 12 place count 25 transition count 25
Applied a total of 12 rules in 27 ms. Remains 25 /30 variables (removed 5) and now considering 25/32 (removed 7) transitions.
// Phase 1: matrix 25 rows 25 cols
[2024-05-29 14:16:19] [INFO ] Computed 9 invariants in 2 ms
[2024-05-29 14:16:19] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-29 14:16:19] [INFO ] Invariant cache hit.
[2024-05-29 14:16:19] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2024-05-29 14:16:19] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 14:16:19] [INFO ] Invariant cache hit.
[2024-05-29 14:16:19] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/30 places, 25/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 225 ms. Remains : 25/30 places, 25/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 p1) p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
Knowledge based reduction with 15 factoid took 461 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 309 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :4
Finished Best-First random walk after 392 steps, including 0 resets, run visited all 4 properties in 6 ms. (steps per millisecond=65 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F (AND p0 p1 p2))]
Knowledge based reduction with 15 factoid took 665 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 287 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false]
Stuttering acceptance computed with spot in 319 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false]
Stuttering acceptance computed with spot in 325 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, false, false, false]
Product exploration explored 100000 steps with 19450 reset in 475 ms.
Stack based approach found an accepted trace after 35626 steps with 6870 reset with depth 14 and stack size 14 in 163 ms.
FORMULA TCPcondis-PT-50-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-50-LTLFireability-04 finished in 6342 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p1)||p0))))'
Support contains 7 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
[2024-05-29 14:16:22] [INFO ] Computed 9 invariants in 1 ms
[2024-05-29 14:16:22] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-29 14:16:22] [INFO ] Invariant cache hit.
[2024-05-29 14:16:23] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2024-05-29 14:16:23] [INFO ] Invariant cache hit.
[2024-05-29 14:16:23] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 210 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 316 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s2 1) (GEQ s20 1)) (AND (GEQ s11 1) (GEQ s27 1)) (AND (GEQ s9 1) (GEQ s25 1))), p1:(OR (LT s15 1) (AND (GEQ s11 1) (GEQ s27 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 14169 reset in 130 ms.
Product exploration explored 100000 steps with 14259 reset in 211 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 p1)), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 133 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 102 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=102 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 191 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-29 14:16:24] [INFO ] Invariant cache hit.
[2024-05-29 14:16:24] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-29 14:16:24] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 6 ms returned sat
[2024-05-29 14:16:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 14:16:24] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-29 14:16:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 14:16:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-29 14:16:24] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-29 14:16:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 14:16:24] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-29 14:16:24] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-29 14:16:24] [INFO ] Added : 9 causal constraints over 3 iterations in 45 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 7 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.
[2024-05-29 14:16:24] [INFO ] Invariant cache hit.
[2024-05-29 14:16:24] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-29 14:16:24] [INFO ] Invariant cache hit.
[2024-05-29 14:16:24] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2024-05-29 14:16:24] [INFO ] Invariant cache hit.
[2024-05-29 14:16:24] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 167 ms. 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 p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 164 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 51 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=51 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 197 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-29 14:16:25] [INFO ] Invariant cache hit.
[2024-05-29 14:16:25] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-29 14:16:25] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 5 ms returned sat
[2024-05-29 14:16:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 14:16:25] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-29 14:16:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 14:16:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-29 14:16:26] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 5 ms returned sat
[2024-05-29 14:16:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 14:16:26] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-29 14:16:26] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-29 14:16:26] [INFO ] Added : 9 causal constraints over 3 iterations in 59 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 14296 reset in 200 ms.
Product exploration explored 100000 steps with 14083 reset in 223 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 7 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
Deduced a syphon composed of 3 places in 1 ms
Applied a total of 3 rules in 9 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-29 14:16:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2024-05-29 14:16:27] [INFO ] Computed 9 invariants in 3 ms
[2024-05-29 14:16:27] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/30 places, 32/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 80 ms. Remains : 30/30 places, 32/32 transitions.
Built C files in :
/tmp/ltsmin12828449457236634277
[2024-05-29 14:16:27] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12828449457236634277
Running compilation step : cd /tmp/ltsmin12828449457236634277;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 427 ms.
Running link step : cd /tmp/ltsmin12828449457236634277;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin12828449457236634277;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3246350404580870821.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 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
[2024-05-29 14:16:42] [INFO ] Computed 9 invariants in 1 ms
[2024-05-29 14:16:42] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-29 14:16:42] [INFO ] Invariant cache hit.
[2024-05-29 14:16:42] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2024-05-29 14:16:42] [INFO ] Invariant cache hit.
[2024-05-29 14:16:42] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 162 ms. Remains : 30/30 places, 32/32 transitions.
Built C files in :
/tmp/ltsmin9294869553606479274
[2024-05-29 14:16:42] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9294869553606479274
Running compilation step : cd /tmp/ltsmin9294869553606479274;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 193 ms.
Running link step : cd /tmp/ltsmin9294869553606479274;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin9294869553606479274;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3051540837349413582.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 14:16:57] [INFO ] Flatten gal took : 7 ms
[2024-05-29 14:16:57] [INFO ] Flatten gal took : 6 ms
[2024-05-29 14:16:57] [INFO ] Time to serialize gal into /tmp/LTL6409581280531290832.gal : 2 ms
[2024-05-29 14:16:57] [INFO ] Time to serialize properties into /tmp/LTL9470101914629353460.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6409581280531290832.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7266835326181683150.hoa' '-atoms' '/tmp/LTL9470101914629353460.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL9470101914629353460.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7266835326181683150.hoa
Detected timeout of ITS tools.
[2024-05-29 14:17:12] [INFO ] Flatten gal took : 8 ms
[2024-05-29 14:17:12] [INFO ] Flatten gal took : 4 ms
[2024-05-29 14:17:12] [INFO ] Time to serialize gal into /tmp/LTL12193321223001864112.gal : 3 ms
[2024-05-29 14:17:12] [INFO ] Time to serialize properties into /tmp/LTL11567722192151484263.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12193321223001864112.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11567722192151484263.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(F(((X("((xCLOSED<1)||((SYNACK>=1)&&(xSYNRCVD>=1)))"))||("((CLOSING>=1)&&(xFINACK>=1))"))||("(((SYNACK>=1)&&(xSYNRCVD>=1))||((LIST...180
Formula 0 simplified : XG(!"(((SYNACK>=1)&&(xSYNRCVD>=1))||((LISTEN>=1)&&(xSYN>=1)))" & !"((CLOSING>=1)&&(xFINACK>=1))" & X!"((xCLOSED<1)||((SYNACK>=1)&&(x...170
Detected timeout of ITS tools.
[2024-05-29 14:17:27] [INFO ] Flatten gal took : 5 ms
[2024-05-29 14:17:27] [INFO ] Applying decomposition
[2024-05-29 14:17:27] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7257209401670317448.txt' '-o' '/tmp/graph7257209401670317448.bin' '-w' '/tmp/graph7257209401670317448.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7257209401670317448.bin' '-l' '-1' '-v' '-w' '/tmp/graph7257209401670317448.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:17:27] [INFO ] Decomposing Gal with order
[2024-05-29 14:17:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:17:27] [INFO ] Removed a total of 24 redundant transitions.
[2024-05-29 14:17:27] [INFO ] Flatten gal took : 49 ms
[2024-05-29 14:17:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 14:17:27] [INFO ] Time to serialize gal into /tmp/LTL8570475370103007453.gal : 3 ms
[2024-05-29 14:17:27] [INFO ] Time to serialize properties into /tmp/LTL10093396279295781591.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8570475370103007453.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10093396279295781591.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F(((X("((u6.xCLOSED<1)||((i3.i1.u5.SYNACK>=1)&&(i3.i1.u5.xSYNRCVD>=1)))"))||("((u4.CLOSING>=1)&&(i0.u0.xFINACK>=1))"))||("(((i3.i...234
Formula 0 simplified : XG(!"(((i3.i1.u5.SYNACK>=1)&&(i3.i1.u5.xSYNRCVD>=1))||((u4.LISTEN>=1)&&(u6.xSYN>=1)))" & !"((u4.CLOSING>=1)&&(i0.u0.xFINACK>=1))" & ...224
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11348938200513895465
[2024-05-29 14:17:43] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11348938200513895465
Running compilation step : cd /tmp/ltsmin11348938200513895465;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 128 ms.
Running link step : cd /tmp/ltsmin11348938200513895465;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin11348938200513895465;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((X((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property TCPcondis-PT-50-LTLFireability-08 finished in 95271 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(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.
[2024-05-29 14:17:58] [INFO ] Invariant cache hit.
[2024-05-29 14:17:58] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-29 14:17:58] [INFO ] Invariant cache hit.
[2024-05-29 14:17:58] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2024-05-29 14:17:58] [INFO ] Invariant cache hit.
[2024-05-29 14:17:58] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 151 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (GEQ s6 1) (GEQ s19 1)), p0:(AND (GEQ s13 1) (GEQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 15474 reset in 116 ms.
Product exploration explored 100000 steps with 15418 reset in 125 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 191 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Incomplete random walk after 10037 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=836 ) properties (out of 4) seen :3
Finished Best-First random walk after 105 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=105 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 319 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
[2024-05-29 14:17:59] [INFO ] Invariant cache hit.
[2024-05-29 14:17:59] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-29 14:17:59] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-29 14:17:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 14:17:59] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-29 14:17:59] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-29 14:17:59] [INFO ] Added : 1 causal constraints over 1 iterations in 24 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT 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 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 12 ms. Remains 23 /30 variables (removed 7) and now considering 23/32 (removed 9) transitions.
// Phase 1: matrix 23 rows 23 cols
[2024-05-29 14:17:59] [INFO ] Computed 9 invariants in 2 ms
[2024-05-29 14:17:59] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-29 14:17:59] [INFO ] Invariant cache hit.
[2024-05-29 14:17:59] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2024-05-29 14:17:59] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 14:17:59] [INFO ] Invariant cache hit.
[2024-05-29 14:18:00] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/30 places, 23/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 190 ms. Remains : 23/30 places, 23/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 p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 7 factoid took 323 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Incomplete random walk after 10048 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=913 ) properties (out of 4) seen :3
Finished Best-First random walk after 144 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=72 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 427 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
[2024-05-29 14:18:01] [INFO ] Invariant cache hit.
[2024-05-29 14:18:01] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-29 14:18:01] [INFO ] [Real]Absence check using 2 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-29 14:18:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 14:18:01] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-29 14:18:01] [INFO ] Computed and/alt/rep : 21/75/21 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-29 14:18:01] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 19554 reset in 208 ms.
Stack based approach found an accepted trace after 3597 steps with 700 reset with depth 16 and stack size 16 in 9 ms.
FORMULA TCPcondis-PT-50-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-50-LTLFireability-09 finished in 3807 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(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 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 24 transition count 26
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 24 transition count 26
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 24 transition count 24
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 14 place count 24 transition count 22
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 22 transition count 22
Applied a total of 18 rules in 13 ms. Remains 22 /30 variables (removed 8) and now considering 22/32 (removed 10) transitions.
// Phase 1: matrix 22 rows 22 cols
[2024-05-29 14:18:01] [INFO ] Computed 9 invariants in 2 ms
[2024-05-29 14:18:02] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-29 14:18:02] [INFO ] Invariant cache hit.
[2024-05-29 14:18:02] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2024-05-29 14:18:02] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 14:18:02] [INFO ] Invariant cache hit.
[2024-05-29 14:18:02] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/30 places, 22/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 201 ms. Remains : 22/30 places, 22/32 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2700 reset in 302 ms.
Stack based approach found an accepted trace after 12901 steps with 1572 reset with depth 11 and stack size 11 in 29 ms.
FORMULA TCPcondis-PT-50-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-50-LTLFireability-11 finished in 651 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (F(G(p0))||G(!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 14 ms. Remains 25 /30 variables (removed 5) and now considering 25/32 (removed 7) transitions.
// Phase 1: matrix 25 rows 25 cols
[2024-05-29 14:18:02] [INFO ] Computed 9 invariants in 1 ms
[2024-05-29 14:18:02] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-29 14:18:02] [INFO ] Invariant cache hit.
[2024-05-29 14:18:02] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-05-29 14:18:02] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 14:18:02] [INFO ] Invariant cache hit.
[2024-05-29 14:18:02] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/30 places, 25/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 210 ms. Remains : 25/30 places, 25/32 transitions.
Stuttering acceptance computed with spot in 155 ms :[false, false, (NOT p0)]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 318 ms.
Product exploration explored 100000 steps with 0 reset in 375 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 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter insensitive) to 3 states, 6 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[false, false, (NOT p0)]
Finished random walk after 102 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=102 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter insensitive) to 3 states, 6 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[false, false, (NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[false, false, (NOT p0)]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-29 14:18:04] [INFO ] Invariant cache hit.
[2024-05-29 14:18:04] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-29 14:18:04] [INFO ] Invariant cache hit.
[2024-05-29 14:18:04] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2024-05-29 14:18:04] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 14:18:04] [INFO ] Invariant cache hit.
[2024-05-29 14:18:04] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 211 ms. Remains : 25/25 places, 25/25 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter insensitive) to 3 states, 6 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 150 ms :[false, false, (NOT p0)]
Finished random walk after 51 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=51 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter insensitive) to 3 states, 6 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[false, false, (NOT p0)]
Stuttering acceptance computed with spot in 190 ms :[false, false, (NOT p0)]
Stuttering acceptance computed with spot in 147 ms :[false, false, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 316 ms.
Product exploration explored 100000 steps with 0 reset in 364 ms.
Built C files in :
/tmp/ltsmin3606490994745099618
[2024-05-29 14:18:05] [INFO ] Computing symmetric may disable matrix : 25 transitions.
[2024-05-29 14:18:05] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:18:05] [INFO ] Computing symmetric may enable matrix : 25 transitions.
[2024-05-29 14:18:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:18:05] [INFO ] Computing Do-Not-Accords matrix : 25 transitions.
[2024-05-29 14:18:05] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:18:05] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3606490994745099618
Running compilation step : cd /tmp/ltsmin3606490994745099618;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 198 ms.
Running link step : cd /tmp/ltsmin3606490994745099618;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin3606490994745099618;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10670774103755941289.hoa' '--buchi-type=spotba'
LTSmin run took 528 ms.
FORMULA TCPcondis-PT-50-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-50-LTLFireability-12 finished in 4191 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1)||G((!p2 U p3)))))'
Support contains 7 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 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 27 transition count 28
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 7 place count 27 transition count 27
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 9 place count 26 transition count 27
Applied a total of 9 rules in 12 ms. Remains 26 /30 variables (removed 4) and now considering 27/32 (removed 5) transitions.
// Phase 1: matrix 27 rows 26 cols
[2024-05-29 14:18:06] [INFO ] Computed 9 invariants in 2 ms
[2024-05-29 14:18:06] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-29 14:18:06] [INFO ] Invariant cache hit.
[2024-05-29 14:18:06] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2024-05-29 14:18:06] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 14:18:06] [INFO ] Invariant cache hit.
[2024-05-29 14:18:06] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/30 places, 27/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 169 ms. Remains : 26/30 places, 27/32 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 p1 p3) (AND p0 p1 (NOT p2))), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p0 (NOT p1) p3) (AND p0 (NOT p1) (NOT p2))), acceptance={1} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) (NOT p2))), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={2} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={0, 2} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={1, 2} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(AND p0 p1 (NOT p3) (NOT p2)), acceptance={2} source=0 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3) (NOT p2)), acceptance={0, 2} source=0 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={1, 2} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1, 2} source=0 dest: 1}], [{ cond=(AND p0 p1 (NOT p3) p2), acceptance={2} source=1 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={0, 2} source=1 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={1, 2} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={0, 1, 2} source=1 dest: 0}, { cond=(AND p0 p1 (NOT p3) (NOT p2)), acceptance={2} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3) (NOT p2)), acceptance={0, 2} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={1, 2} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1, 2} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s21 1)), p1:(OR (LT s10 1) (LT s11 1) (LT s25 1)), p3:(GEQ s0 1), p2:(LT s17 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 100 reset in 672 ms.
Product exploration explored 100000 steps with 98 reset in 508 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 p3 p2), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (NOT (OR (AND p0 p1 p3) (AND p0 p1 (NOT p2))))), (X (OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), (X (NOT (OR (AND p0 (NOT p1) p3) (AND p0 (NOT p1) (NOT p2))))), (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) (NOT p2))))), (X (NOT (AND p0 (NOT p1) (NOT p3) p2))), (X (NOT (AND p0 p1 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (OR (AND p0 p1 p3) (AND p0 p1 (NOT p2)))))), (X (X (OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (NOT (OR (AND p0 (NOT p1) p3) (AND p0 (NOT p1) (NOT p2)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) (NOT p2)))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND p0 p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 178 ms. Reduced automaton from 2 states, 20 edges and 4 AP (stutter insensitive) to 2 states, 20 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Incomplete random walk after 10014 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=182 ) properties (out of 12) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :1
Finished Best-First random walk after 9283 steps, including 2 resets, run visited all 2 properties in 32 ms. (steps per millisecond=290 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1 p3 p2), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (NOT (OR (AND p0 p1 p3) (AND p0 p1 (NOT p2))))), (X (OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), (X (NOT (OR (AND p0 (NOT p1) p3) (AND p0 (NOT p1) (NOT p2))))), (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) (NOT p2))))), (X (NOT (AND p0 (NOT p1) (NOT p3) p2))), (X (NOT (AND p0 p1 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (OR (AND p0 p1 p3) (AND p0 p1 (NOT p2)))))), (X (X (OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (NOT (OR (AND p0 (NOT p1) p3) (AND p0 (NOT p1) (NOT p2)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) (NOT p2)))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND p0 p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p3) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p3) p2)), (F (AND (NOT p0) p1 (NOT p3) (NOT p2))), (F (AND p0 p1 (NOT p3) p2)), (F (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1) (NOT p3) p2)), (F (AND (NOT p0) p1 (NOT p3) p2)), (F (OR (AND p0 p1 p3) (AND p0 p1 (NOT p2)))), (F (OR (AND p0 (NOT p1) p3) (AND p0 (NOT p1) (NOT p2)))), (F (NOT (OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 (NOT p2))))), (F (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))), (F (AND p0 (NOT p1) (NOT p3) (NOT p2)))]
Knowledge based reduction with 25 factoid took 1100 ms. Reduced automaton from 2 states, 20 edges and 4 AP (stutter insensitive) to 2 states, 20 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Support contains 7 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 27/27 transitions.
Applied a total of 0 rules in 2 ms. Remains 26 /26 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2024-05-29 14:18:10] [INFO ] Invariant cache hit.
[2024-05-29 14:18:10] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-29 14:18:10] [INFO ] Invariant cache hit.
[2024-05-29 14:18:10] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2024-05-29 14:18:10] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 14:18:10] [INFO ] Invariant cache hit.
[2024-05-29 14:18:10] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 199 ms. Remains : 26/26 places, 27/27 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 p3 p2), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (NOT (OR (AND p0 p1 p3) (AND p0 p1 (NOT p2))))), (X (OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), (X (NOT (OR (AND p0 (NOT p1) p3) (AND p0 (NOT p1) (NOT p2))))), (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) (NOT p2))))), (X (NOT (AND p0 (NOT p1) (NOT p3) p2))), (X (NOT (AND p0 p1 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (OR (AND p0 p1 p3) (AND p0 p1 (NOT p2)))))), (X (X (OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (NOT (OR (AND p0 (NOT p1) p3) (AND p0 (NOT p1) (NOT p2)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) (NOT p2)))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND p0 p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 300 ms. Reduced automaton from 2 states, 20 edges and 4 AP (stutter insensitive) to 2 states, 20 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Incomplete random walk after 10049 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=304 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :1
Finished Best-First random walk after 2873 steps, including 0 resets, run visited all 3 properties in 20 ms. (steps per millisecond=143 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1 p3 p2), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (NOT (OR (AND p0 p1 p3) (AND p0 p1 (NOT p2))))), (X (OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), (X (NOT (OR (AND p0 (NOT p1) p3) (AND p0 (NOT p1) (NOT p2))))), (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) (NOT p2))))), (X (NOT (AND p0 (NOT p1) (NOT p3) p2))), (X (NOT (AND p0 p1 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (OR (AND p0 p1 p3) (AND p0 p1 (NOT p2)))))), (X (X (OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (NOT (OR (AND p0 (NOT p1) p3) (AND p0 (NOT p1) (NOT p2)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) (NOT p2)))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND p0 p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p3) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p3) p2)), (F (AND (NOT p0) p1 (NOT p3) (NOT p2))), (F (AND p0 p1 (NOT p3) p2)), (F (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1) (NOT p3) p2)), (F (AND (NOT p0) p1 (NOT p3) p2)), (F (OR (AND p0 p1 p3) (AND p0 p1 (NOT p2)))), (F (OR (AND p0 (NOT p1) p3) (AND p0 (NOT p1) (NOT p2)))), (F (NOT (OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 (NOT p2))))), (F (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))), (F (AND p0 (NOT p1) (NOT p3) (NOT p2)))]
Knowledge based reduction with 25 factoid took 926 ms. Reduced automaton from 2 states, 20 edges and 4 AP (stutter insensitive) to 2 states, 20 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 95 reset in 702 ms.
Product exploration explored 100000 steps with 104 reset in 513 ms.
Built C files in :
/tmp/ltsmin6967892176993060021
[2024-05-29 14:18:13] [INFO ] Computing symmetric may disable matrix : 27 transitions.
[2024-05-29 14:18:13] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:18:13] [INFO ] Computing symmetric may enable matrix : 27 transitions.
[2024-05-29 14:18:13] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:18:13] [INFO ] Computing Do-Not-Accords matrix : 27 transitions.
[2024-05-29 14:18:13] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:18:13] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6967892176993060021
Running compilation step : cd /tmp/ltsmin6967892176993060021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 128 ms.
Running link step : cd /tmp/ltsmin6967892176993060021;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin6967892176993060021;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased350375330478857558.hoa' '--buchi-type=spotba'
LTSmin run took 594 ms.
FORMULA TCPcondis-PT-50-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-50-LTLFireability-14 finished in 7270 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(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 8 ms. Remains 23 /30 variables (removed 7) and now considering 23/32 (removed 9) transitions.
// Phase 1: matrix 23 rows 23 cols
[2024-05-29 14:18:14] [INFO ] Computed 9 invariants in 2 ms
[2024-05-29 14:18:14] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-29 14:18:14] [INFO ] Invariant cache hit.
[2024-05-29 14:18:14] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2024-05-29 14:18:14] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 14:18:14] [INFO ] Invariant cache hit.
[2024-05-29 14:18:14] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/30 places, 23/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 177 ms. Remains : 23/30 places, 23/32 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1882 reset in 257 ms.
Stack based approach found an accepted trace after 2942 steps with 50 reset with depth 26 and stack size 26 in 10 ms.
FORMULA TCPcondis-PT-50-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-50-LTLFireability-15 finished in 550 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p1)||p0))))'
Found a Shortening insensitive property : TCPcondis-PT-50-LTLFireability-08
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 7 out of 30 places. Attempting structural reductions.
Starting structural reductions in LI_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
Applied a total of 6 rules in 4 ms. Remains 27 /30 variables (removed 3) and now considering 29/32 (removed 3) transitions.
// Phase 1: matrix 29 rows 27 cols
[2024-05-29 14:18:14] [INFO ] Computed 9 invariants in 1 ms
[2024-05-29 14:18:14] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-29 14:18:14] [INFO ] Invariant cache hit.
[2024-05-29 14:18:15] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2024-05-29 14:18:15] [INFO ] Invariant cache hit.
[2024-05-29 14:18:15] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 27/30 places, 29/32 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 183 ms. Remains : 27/30 places, 29/32 transitions.
Running random walk in product with property : TCPcondis-PT-50-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s17 1)) (AND (GEQ s10 1) (GEQ s24 1)) (AND (GEQ s8 1) (GEQ s22 1))), p1:(OR (LT s13 1) (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, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 14210 reset in 202 ms.
Product exploration explored 100000 steps with 14279 reset in 218 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 p1)), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 177 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 51 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=51 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 204 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-29 14:18:16] [INFO ] Invariant cache hit.
[2024-05-29 14:18:16] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-29 14:18:16] [INFO ] [Real]Absence check using 5 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-29 14:18:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 14:18:16] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-29 14:18:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 14:18:16] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-29 14:18:16] [INFO ] [Nat]Absence check using 5 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-29 14:18:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 14:18:16] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-29 14:18:16] [INFO ] Computed and/alt/rep : 25/96/25 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-29 14:18:16] [INFO ] Added : 16 causal constraints over 4 iterations in 48 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 7 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2024-05-29 14:18:16] [INFO ] Invariant cache hit.
[2024-05-29 14:18:16] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-29 14:18:16] [INFO ] Invariant cache hit.
[2024-05-29 14:18:16] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2024-05-29 14:18:16] [INFO ] Invariant cache hit.
[2024-05-29 14:18:16] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 182 ms. Remains : 27/27 places, 29/29 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 p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 167 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 51 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=51 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 189 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-29 14:18:17] [INFO ] Invariant cache hit.
[2024-05-29 14:18:17] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-29 14:18:17] [INFO ] [Real]Absence check using 5 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-29 14:18:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 14:18:17] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-29 14:18:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 14:18:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-29 14:18:17] [INFO ] [Nat]Absence check using 5 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-29 14:18:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 14:18:17] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-29 14:18:17] [INFO ] Computed and/alt/rep : 25/96/25 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-29 14:18:17] [INFO ] Added : 16 causal constraints over 4 iterations in 45 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 14194 reset in 190 ms.
Product exploration explored 100000 steps with 14138 reset in 215 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 7 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 3 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2024-05-29 14:18:18] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 14:18:18] [INFO ] Invariant cache hit.
[2024-05-29 14:18:18] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70 ms. Remains : 27/27 places, 29/29 transitions.
Built C files in :
/tmp/ltsmin14202411038685257226
[2024-05-29 14:18:18] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14202411038685257226
Running compilation step : cd /tmp/ltsmin14202411038685257226;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 186 ms.
Running link step : cd /tmp/ltsmin14202411038685257226;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin14202411038685257226;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13255325253013045597.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2024-05-29 14:18:33] [INFO ] Invariant cache hit.
[2024-05-29 14:18:33] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-29 14:18:33] [INFO ] Invariant cache hit.
[2024-05-29 14:18:34] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-05-29 14:18:34] [INFO ] Invariant cache hit.
[2024-05-29 14:18:34] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 128 ms. Remains : 27/27 places, 29/29 transitions.
Built C files in :
/tmp/ltsmin14895593758058563025
[2024-05-29 14:18:34] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14895593758058563025
Running compilation step : cd /tmp/ltsmin14895593758058563025;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 139 ms.
Running link step : cd /tmp/ltsmin14895593758058563025;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin14895593758058563025;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8935716300859867330.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 14:18:49] [INFO ] Flatten gal took : 4 ms
[2024-05-29 14:18:49] [INFO ] Flatten gal took : 3 ms
[2024-05-29 14:18:49] [INFO ] Time to serialize gal into /tmp/LTL8487156616507777070.gal : 2 ms
[2024-05-29 14:18:49] [INFO ] Time to serialize properties into /tmp/LTL17906369567186649750.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8487156616507777070.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3221893679049057410.hoa' '-atoms' '/tmp/LTL17906369567186649750.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17906369567186649750.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3221893679049057410.hoa
Detected timeout of ITS tools.
[2024-05-29 14:19:04] [INFO ] Flatten gal took : 4 ms
[2024-05-29 14:19:04] [INFO ] Flatten gal took : 2 ms
[2024-05-29 14:19:04] [INFO ] Time to serialize gal into /tmp/LTL5387206403101523125.gal : 1 ms
[2024-05-29 14:19:04] [INFO ] Time to serialize properties into /tmp/LTL8128679895578038181.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5387206403101523125.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8128679895578038181.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F(((X("((xCLOSED<1)||((SYNACK>=1)&&(xSYNRCVD>=1)))"))||("((CLOSING>=1)&&(xFINACK>=1))"))||("(((SYNACK>=1)&&(xSYNRCVD>=1))||((LIST...180
Formula 0 simplified : XG(!"(((SYNACK>=1)&&(xSYNRCVD>=1))||((LISTEN>=1)&&(xSYN>=1)))" & !"((CLOSING>=1)&&(xFINACK>=1))" & X!"((xCLOSED<1)||((SYNACK>=1)&&(x...170
Detected timeout of ITS tools.
[2024-05-29 14:19:19] [INFO ] Flatten gal took : 3 ms
[2024-05-29 14:19:19] [INFO ] Applying decomposition
[2024-05-29 14:19:19] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16651319484971778298.txt' '-o' '/tmp/graph16651319484971778298.bin' '-w' '/tmp/graph16651319484971778298.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16651319484971778298.bin' '-l' '-1' '-v' '-w' '/tmp/graph16651319484971778298.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:19:19] [INFO ] Decomposing Gal with order
[2024-05-29 14:19:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:19:19] [INFO ] Removed a total of 23 redundant transitions.
[2024-05-29 14:19:19] [INFO ] Flatten gal took : 7 ms
[2024-05-29 14:19:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2024-05-29 14:19:19] [INFO ] Time to serialize gal into /tmp/LTL11638276583323035859.gal : 1 ms
[2024-05-29 14:19:19] [INFO ] Time to serialize properties into /tmp/LTL11665833411050411763.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11638276583323035859.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11665833411050411763.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(F(((X("((u4.xCLOSED<1)||((i3.u3.SYNACK>=1)&&(i3.u3.xSYNRCVD>=1)))"))||("((u0.CLOSING>=1)&&(i1.u2.xFINACK>=1))"))||("(((i3.u3.SYNA...222
Formula 0 simplified : XG(!"(((i3.u3.SYNACK>=1)&&(i3.u3.xSYNRCVD>=1))||((u0.LISTEN>=1)&&(u4.xSYN>=1)))" & !"((u0.CLOSING>=1)&&(i1.u2.xFINACK>=1))" & X!"((u...212
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7126854827157783241
[2024-05-29 14:19:34] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7126854827157783241
Running compilation step : cd /tmp/ltsmin7126854827157783241;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 129 ms.
Running link step : cd /tmp/ltsmin7126854827157783241;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin7126854827157783241;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((X((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property TCPcondis-PT-50-LTLFireability-08 finished in 94869 ms.
[2024-05-29 14:19:49] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10112826768771406037
[2024-05-29 14:19:49] [INFO ] Computing symmetric may disable matrix : 32 transitions.
[2024-05-29 14:19:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:19:49] [INFO ] Computing symmetric may enable matrix : 32 transitions.
[2024-05-29 14:19:49] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:19:49] [INFO ] Computing Do-Not-Accords matrix : 32 transitions.
[2024-05-29 14:19:49] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 14:19:49] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10112826768771406037
[2024-05-29 14:19:49] [INFO ] Applying decomposition
Running compilation step : cd /tmp/ltsmin10112826768771406037;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-29 14:19:49] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9278010846815252746.txt' '-o' '/tmp/graph9278010846815252746.bin' '-w' '/tmp/graph9278010846815252746.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9278010846815252746.bin' '-l' '-1' '-v' '-w' '/tmp/graph9278010846815252746.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:19:49] [INFO ] Decomposing Gal with order
[2024-05-29 14:19:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:19:49] [INFO ] Removed a total of 24 redundant transitions.
[2024-05-29 14:19:49] [INFO ] Flatten gal took : 7 ms
[2024-05-29 14:19:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-29 14:19:49] [INFO ] Time to serialize gal into /tmp/LTLFireability1258880971673830409.gal : 2 ms
[2024-05-29 14:19:49] [INFO ] Time to serialize properties into /tmp/LTLFireability5138525837282348469.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1258880971673830409.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5138525837282348469.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F(("(((u4.CLOSING>=1)&&(i0.i1.u7.xFINACK>=1))||((i2.i1.u5.SYNACK>=1)&&(i2.i1.u5.xSYNRCVD>=1)))")||(("((u4.LISTEN>=1)&&(u9.xSYN>=1...237
Formula 0 simplified : XG(!"(((u4.CLOSING>=1)&&(i0.i1.u7.xFINACK>=1))||((i2.i1.u5.SYNACK>=1)&&(i2.i1.u5.xSYNRCVD>=1)))" & !"((u4.LISTEN>=1)&&(u9.xSYN>=1))"...227
Compilation finished in 214 ms.
Running link step : cd /tmp/ltsmin10112826768771406037;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin10112826768771406037;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((X((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-29 14:41:01] [INFO ] Flatten gal took : 8 ms
[2024-05-29 14:41:01] [INFO ] Time to serialize gal into /tmp/LTLFireability18395045151182531766.gal : 5 ms
[2024-05-29 14:41:01] [INFO ] Time to serialize properties into /tmp/LTLFireability3557429092160967749.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability18395045151182531766.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3557429092160967749.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((X(F(("(((CLOSING>=1)&&(xFINACK>=1))||((SYNACK>=1)&&(xSYNRCVD>=1)))")||(("((LISTEN>=1)&&(xSYN>=1))")||(X("((xCLOSED<1)||((SYNACK>=1)...180
Formula 0 simplified : XG(!"(((CLOSING>=1)&&(xFINACK>=1))||((SYNACK>=1)&&(xSYNRCVD>=1)))" & !"((LISTEN>=1)&&(xSYN>=1))" & X!"((xCLOSED<1)||((SYNACK>=1)&&(x...170
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: LTL layer: formula: X(<>((X((LTLAPp1==true))||(LTLAPp0==true))))
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: "X(<>((X((LTLAPp1==true))||(LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.019: buchi has 3 states
pins2lts-mc-linux64( 0/ 8), 0.022: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.082: DFS-FIFO for weak LTL, using special progress label 35
pins2lts-mc-linux64( 0/ 8), 0.082: There are 36 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.082: State length is 31, there are 35 groups
pins2lts-mc-linux64( 0/ 8), 0.082: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.082: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.082: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.082: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.314: ~95 levels ~960 states ~7992 transitions
pins2lts-mc-linux64( 3/ 8), 0.403: ~168 levels ~1920 states ~12528 transitions
pins2lts-mc-linux64( 3/ 8), 0.445: ~208 levels ~3840 states ~15448 transitions
pins2lts-mc-linux64( 3/ 8), 0.488: ~208 levels ~7680 states ~19592 transitions
pins2lts-mc-linux64( 3/ 8), 0.561: ~208 levels ~15360 states ~28192 transitions
pins2lts-mc-linux64( 3/ 8), 0.699: ~208 levels ~30720 states ~52712 transitions
pins2lts-mc-linux64( 3/ 8), 1.007: ~208 levels ~61440 states ~107552 transitions
pins2lts-mc-linux64( 3/ 8), 1.467: ~208 levels ~122880 states ~223008 transitions
pins2lts-mc-linux64( 3/ 8), 2.359: ~208 levels ~245760 states ~469056 transitions
pins2lts-mc-linux64( 3/ 8), 3.850: ~208 levels ~491520 states ~979352 transitions
pins2lts-mc-linux64( 3/ 8), 6.502: ~208 levels ~983040 states ~2020944 transitions
pins2lts-mc-linux64( 3/ 8), 10.435: ~208 levels ~1966080 states ~4118960 transitions
pins2lts-mc-linux64( 3/ 8), 15.933: ~208 levels ~3932160 states ~8353616 transitions
pins2lts-mc-linux64( 3/ 8), 23.312: ~208 levels ~7864320 states ~16864496 transitions
pins2lts-mc-linux64( 3/ 8), 35.675: ~209 levels ~15728640 states ~35231952 transitions
pins2lts-mc-linux64( 3/ 8), 58.780: ~209 levels ~31457280 states ~72337696 transitions
pins2lts-mc-linux64( 3/ 8), 106.776: ~209 levels ~62914560 states ~151008128 transitions
pins2lts-mc-linux64( 3/ 8), 206.225: ~211 levels ~125829120 states ~316548728 transitions
pins2lts-mc-linux64( 3/ 8), 407.278: ~211 levels ~251658240 states ~657217176 transitions
pins2lts-mc-linux64( 3/ 8), 790.273: ~211 levels ~503316480 states ~1294363928 transitions
pins2lts-mc-linux64( 3/ 8), 1645.178: ~211 levels ~1006632960 states ~2652762416 transitions
pins2lts-mc-linux64( 3/ 8), 1933.144: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1933.170:
pins2lts-mc-linux64( 0/ 8), 1933.170: mean standard work distribution: 264.6% (states) 264.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 1933.171:
pins2lts-mc-linux64( 0/ 8), 1933.171: Explored 134216270 states 355557237 transitions, fanout: 2.649
pins2lts-mc-linux64( 0/ 8), 1933.171: Total exploration time 1933.080 sec (1933.020 sec minimum, 1933.043 sec on average)
pins2lts-mc-linux64( 0/ 8), 1933.171: States per second: 69431, Transitions per second: 183933
pins2lts-mc-linux64( 0/ 8), 1933.171:
pins2lts-mc-linux64( 0/ 8), 1933.171: Progress states detected: 4
pins2lts-mc-linux64( 0/ 8), 1933.171: Redundant explorations: -0.0007
pins2lts-mc-linux64( 0/ 8), 1933.171:
pins2lts-mc-linux64( 0/ 8), 1933.171: Queue width: 8B, total height: 227, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 1933.171: Tree memory: 1084.3MB, 8.5 B/state, compr.: 6.7%
pins2lts-mc-linux64( 0/ 8), 1933.171: Tree fill ratio (roots/leafs): 99.0%/23.0%
pins2lts-mc-linux64( 0/ 8), 1933.171: Stored 33 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1933.171: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1933.171: Est. total memory use: 1084.3MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10112826768771406037;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((X((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10112826768771406037;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((X((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-29 15:02:14] [INFO ] Flatten gal took : 3 ms
[2024-05-29 15:02:14] [INFO ] Input system was already deterministic with 32 transitions.
[2024-05-29 15:02:14] [INFO ] Transformed 30 places.
[2024-05-29 15:02:14] [INFO ] Transformed 32 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-29 15:02:14] [INFO ] Time to serialize gal into /tmp/LTLFireability14426634050118048399.gal : 1 ms
[2024-05-29 15:02:14] [INFO ] Time to serialize properties into /tmp/LTLFireability16757109619414705534.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14426634050118048399.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16757109619414705534.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F(("(((CLOSING>=1)&&(xFINACK>=1))||((SYNACK>=1)&&(xSYNRCVD>=1)))")||(("((LISTEN>=1)&&(xSYN>=1))")||(X("((xCLOSED<1)||((SYNACK>=1)...180
Formula 0 simplified : XG(!"(((CLOSING>=1)&&(xFINACK>=1))||((SYNACK>=1)&&(xSYNRCVD>=1)))" & !"((LISTEN>=1)&&(xSYN>=1))" & X!"((xCLOSED<1)||((SYNACK>=1)&&(x...170
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 3731428 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16039936 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-50"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is TCPcondis-PT-50, 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 r439-smll-171690585400043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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