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-171690585400032.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-35, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r439-smll-171690585400032
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 9.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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 28K Apr 23 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 02:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 12 02:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 02:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 111K Apr 12 02:58 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-35-LTLCardinality-00
FORMULA_NAME TCPcondis-PT-35-LTLCardinality-01
FORMULA_NAME TCPcondis-PT-35-LTLCardinality-02
FORMULA_NAME TCPcondis-PT-35-LTLCardinality-03
FORMULA_NAME TCPcondis-PT-35-LTLCardinality-04
FORMULA_NAME TCPcondis-PT-35-LTLCardinality-05
FORMULA_NAME TCPcondis-PT-35-LTLCardinality-06
FORMULA_NAME TCPcondis-PT-35-LTLCardinality-07
FORMULA_NAME TCPcondis-PT-35-LTLCardinality-08
FORMULA_NAME TCPcondis-PT-35-LTLCardinality-09
FORMULA_NAME TCPcondis-PT-35-LTLCardinality-10
FORMULA_NAME TCPcondis-PT-35-LTLCardinality-11
FORMULA_NAME TCPcondis-PT-35-LTLCardinality-12
FORMULA_NAME TCPcondis-PT-35-LTLCardinality-13
FORMULA_NAME TCPcondis-PT-35-LTLCardinality-14
FORMULA_NAME TCPcondis-PT-35-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716988269623

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TCPcondis-PT-35
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-29 13:11:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 13:11:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 13:11:12] [WARNING] Skipping unknown tool specific annotation : Tina
[2024-05-29 13:11:12] [WARNING] Unknown XML tag in source file: size
[2024-05-29 13:11:12] [WARNING] Unknown XML tag in source file: color
[2024-05-29 13:11:12] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2024-05-29 13:11:12] [INFO ] Transformed 30 places.
[2024-05-29 13:11:12] [INFO ] Transformed 32 transitions.
[2024-05-29 13:11:12] [INFO ] Parsed PT model containing 30 places and 32 transitions and 108 arcs in 293 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA TCPcondis-PT-35-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-35-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-35-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 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 13 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 13:11:13] [INFO ] Computed 9 invariants in 6 ms
[2024-05-29 13:11:13] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-29 13:11:13] [INFO ] Invariant cache hit.
[2024-05-29 13:11:13] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2024-05-29 13:11:13] [INFO ] Invariant cache hit.
[2024-05-29 13:11:13] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 394 ms. Remains : 30/30 places, 32/32 transitions.
Support contains 26 out of 30 places after structural reductions.
[2024-05-29 13:11:13] [INFO ] Flatten gal took : 28 ms
[2024-05-29 13:11:13] [INFO ] Flatten gal took : 10 ms
[2024-05-29 13:11:13] [INFO ] Input system was already deterministic with 32 transitions.
Incomplete random walk after 10025 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 28) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 13:11:13] [INFO ] Invariant cache hit.
[2024-05-29 13:11:13] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
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' '!((!X((p0 U p1)) U G(X(G((X(p2) U p3))))))'
Support contains 5 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 13:11:14] [INFO ] Invariant cache hit.
[2024-05-29 13:11:14] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-29 13:11:14] [INFO ] Invariant cache hit.
[2024-05-29 13:11:14] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2024-05-29 13:11:14] [INFO ] Invariant cache hit.
[2024-05-29 13:11:14] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 195 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 602 ms :[(NOT p3), (NOT p3), (OR (NOT p2) (NOT p3)), (NOT p3), (NOT p3), (AND p1 (NOT p2)), true, p1]
Running random walk in product with property : TCPcondis-PT-35-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=1 dest: 4}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 6}], [{ cond=(NOT p3), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) p1), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=p1, acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(LEQ 3 s7), p3:(GT 3 s18), p0:(LEQ s6 s4), p2:(LEQ 3 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1037 steps with 6 reset in 17 ms.
FORMULA TCPcondis-PT-35-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-35-LTLCardinality-00 finished in 902 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((p0&&(((p1||G(p0)) U p2)||G(p1)))))'
Support contains 5 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 13:11:15] [INFO ] Invariant cache hit.
[2024-05-29 13:11:15] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-29 13:11:15] [INFO ] Invariant cache hit.
[2024-05-29 13:11:15] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2024-05-29 13:11:15] [INFO ] Invariant cache hit.
[2024-05-29 13:11:15] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 164 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 263 ms :[true, (OR (NOT p0) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-35-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={0} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(LEQ s19 s12), p2:(LEQ s7 s28), p1:(LEQ 1 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 259 ms.
Product exploration explored 100000 steps with 50000 reset in 324 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p0)), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 33 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA TCPcondis-PT-35-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-35-LTLCardinality-01 finished in 1070 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(G(p0)))))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-29 13:11:16] [INFO ] Invariant cache hit.
[2024-05-29 13:11:16] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-29 13:11:16] [INFO ] Invariant cache hit.
[2024-05-29 13:11:16] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2024-05-29 13:11:16] [INFO ] Invariant cache hit.
[2024-05-29 13:11:16] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 217 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 184 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-35-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(GT s21 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA TCPcondis-PT-35-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-35-LTLCardinality-02 finished in 416 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((p0&&X(G(p1))))))))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-29 13:11:16] [INFO ] Invariant cache hit.
[2024-05-29 13:11:16] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-29 13:11:16] [INFO ] Invariant cache hit.
[2024-05-29 13:11:16] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2024-05-29 13:11:16] [INFO ] Invariant cache hit.
[2024-05-29 13:11:17] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 194 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 282 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : TCPcondis-PT-35-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 4}]], initial=5, aps=[p0:(GT 1 s28), p1:(GT 2 s27)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 32 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-35-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-35-LTLCardinality-05 finished in 491 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(p0)||G(p1)||(p1&&F(p2))))'
Support contains 8 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
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 26 transition count 27
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 9 place count 26 transition count 26
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 25 transition count 26
Applied a total of 11 rules in 15 ms. Remains 25 /30 variables (removed 5) and now considering 26/32 (removed 6) transitions.
// Phase 1: matrix 26 rows 25 cols
[2024-05-29 13:11:17] [INFO ] Computed 9 invariants in 3 ms
[2024-05-29 13:11:17] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-29 13:11:17] [INFO ] Invariant cache hit.
[2024-05-29 13:11:17] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2024-05-29 13:11:17] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 13:11:17] [INFO ] Invariant cache hit.
[2024-05-29 13:11:17] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/30 places, 26/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 165 ms. Remains : 25/30 places, 26/32 transitions.
Stuttering acceptance computed with spot in 322 ms :[true, (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : TCPcondis-PT-35-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 6}]], initial=2, aps=[p2:(GT s4 s5), p0:(OR (LEQ s23 s13) (LEQ s1 s10)), p1:(LEQ s20 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 2674 reset in 421 ms.
Product exploration explored 100000 steps with 2719 reset in 534 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 p2) p0 p1), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), true, (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2))))]
False Knowledge obtained : [(X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Knowledge based reduction with 11 factoid took 813 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter insensitive) to 9 states, 37 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 418 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10006 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 13) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :1
Finished Best-First random walk after 171 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=85 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), true, (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2))))]
False Knowledge obtained : [(X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F p2), (F (AND p1 (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p1 p0 p2)), (F (NOT (AND p1 p0 (NOT p2)))), (F (AND (NOT p1) p0 (NOT p2))), (F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p0) p2)), (F (AND p1 (NOT p0) p2)), (F (AND (NOT p1) p0 p2)), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 11 factoid took 1307 ms. Reduced automaton from 9 states, 37 edges and 3 AP (stutter insensitive) to 9 states, 37 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 410 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 475 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1))]
Support contains 8 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 26/26 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 26/26 (removed 0) transitions.
[2024-05-29 13:11:22] [INFO ] Invariant cache hit.
[2024-05-29 13:11:22] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-29 13:11:22] [INFO ] Invariant cache hit.
[2024-05-29 13:11:22] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-05-29 13:11:22] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 13:11:22] [INFO ] Invariant cache hit.
[2024-05-29 13:11:22] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 152 ms. Remains : 25/25 places, 26/26 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0 p2))), (X (AND p0 (NOT p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (AND p0 (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 p0 (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Knowledge based reduction with 19 factoid took 1674 ms. Reduced automaton from 9 states, 37 edges and 3 AP (stutter insensitive) to 9 states, 37 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 447 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0))]
Incomplete random walk after 10030 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=167 ) properties (out of 13) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :2
Finished Best-First random walk after 126 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=63 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0 p2))), (X (AND p0 (NOT p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (AND p0 (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 p0 (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F p2), (F (AND p0 (NOT p2) (NOT p1))), (F (AND (NOT p2) (NOT p1))), (F (AND p0 p2 p1)), (F (AND p0 p2 (NOT p1))), (F (AND (NOT p0) (NOT p2) p1)), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p0) p2 (NOT p1))), (F (NOT (AND p0 (NOT p2) p1))), (F (AND (NOT p0) p2 p1)), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p2) p1)))]
Knowledge based reduction with 19 factoid took 2454 ms. Reduced automaton from 9 states, 37 edges and 3 AP (stutter insensitive) to 9 states, 37 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 353 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 385 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 393 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 2747 reset in 339 ms.
Stack based approach found an accepted trace after 2125 steps with 63 reset with depth 35 and stack size 35 in 18 ms.
FORMULA TCPcondis-PT-35-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-35-LTLCardinality-06 finished in 11343 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 3 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 0 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 11 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 13:11:28] [INFO ] Computed 9 invariants in 3 ms
[2024-05-29 13:11:28] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-29 13:11:28] [INFO ] Invariant cache hit.
[2024-05-29 13:11:28] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-05-29 13:11:28] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 13:11:28] [INFO ] Invariant cache hit.
[2024-05-29 13:11:28] [INFO ] Dead Transitions using invariants and state equation in 46 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 167 ms. Remains : 22/30 places, 22/32 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-35-LTLCardinality-07 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:(OR (LEQ 3 s16) (AND (GT 3 s16) (GT s2 s15)))], 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 9486 reset in 147 ms.
Product exploration explored 100000 steps with 9558 reset in 167 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Finished random walk after 73 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=73 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
[2024-05-29 13:11:29] [INFO ] Invariant cache hit.
[2024-05-29 13:11:29] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-29 13:11:29] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-29 13:11:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 13:11:29] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-29 13:11:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 13:11:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-29 13:11:29] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-29 13:11:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 13:11:29] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-29 13:11:29] [INFO ] Computed and/alt/rep : 20/74/20 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-29 13:11:30] [INFO ] Added : 18 causal constraints over 4 iterations in 50 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 22 /22 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-29 13:11:30] [INFO ] Invariant cache hit.
[2024-05-29 13:11:30] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-29 13:11:30] [INFO ] Invariant cache hit.
[2024-05-29 13:11:30] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2024-05-29 13:11:30] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 13:11:30] [INFO ] Invariant cache hit.
[2024-05-29 13:11:30] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 181 ms. Remains : 22/22 places, 22/22 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Finished random walk after 180 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=180 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
[2024-05-29 13:11:30] [INFO ] Invariant cache hit.
[2024-05-29 13:11:30] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-29 13:11:30] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-29 13:11:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 13:11:30] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-29 13:11:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 13:11:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-29 13:11:30] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-29 13:11:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 13:11:31] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-29 13:11:31] [INFO ] Computed and/alt/rep : 20/74/20 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-29 13:11:31] [INFO ] Added : 18 causal constraints over 4 iterations in 37 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9556 reset in 165 ms.
Product exploration explored 100000 steps with 9593 reset in 156 ms.
Built C files in :
/tmp/ltsmin5278304323313873616
[2024-05-29 13:11:31] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2024-05-29 13:11:31] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:11:31] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2024-05-29 13:11:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:11:31] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2024-05-29 13:11:31] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:11:31] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5278304323313873616
Running compilation step : cd /tmp/ltsmin5278304323313873616;'/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 303 ms.
Running link step : cd /tmp/ltsmin5278304323313873616;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin5278304323313873616;'/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/stateBased9542737539520786585.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-29 13:11:46] [INFO ] Invariant cache hit.
[2024-05-29 13:11:46] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-29 13:11:46] [INFO ] Invariant cache hit.
[2024-05-29 13:11:46] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2024-05-29 13:11:46] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 13:11:46] [INFO ] Invariant cache hit.
[2024-05-29 13:11:46] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 146 ms. Remains : 22/22 places, 22/22 transitions.
Built C files in :
/tmp/ltsmin291942928806403268
[2024-05-29 13:11:46] [INFO ] Computing symmetric may disable matrix : 22 transitions.
[2024-05-29 13:11:46] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:11:46] [INFO ] Computing symmetric may enable matrix : 22 transitions.
[2024-05-29 13:11:46] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:11:46] [INFO ] Computing Do-Not-Accords matrix : 22 transitions.
[2024-05-29 13:11:46] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:11:46] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin291942928806403268
Running compilation step : cd /tmp/ltsmin291942928806403268;'/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 118 ms.
Running link step : cd /tmp/ltsmin291942928806403268;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin291942928806403268;'/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/stateBased5363832748923790664.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 13:12:01] [INFO ] Flatten gal took : 10 ms
[2024-05-29 13:12:01] [INFO ] Flatten gal took : 4 ms
[2024-05-29 13:12:01] [INFO ] Time to serialize gal into /tmp/LTL135727275086124556.gal : 2 ms
[2024-05-29 13:12:01] [INFO ] Time to serialize properties into /tmp/LTL6190080998958664805.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/LTL135727275086124556.gal' '-t' 'CGAL' '-hoa' '/tmp/aut219439757664450154.hoa' '-atoms' '/tmp/LTL6190080998958664805.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...315
Loading property file /tmp/LTL6190080998958664805.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut219439757664450154.hoa
Detected timeout of ITS tools.
[2024-05-29 13:12:16] [INFO ] Flatten gal took : 6 ms
[2024-05-29 13:12:17] [INFO ] Flatten gal took : 6 ms
[2024-05-29 13:12:17] [INFO ] Time to serialize gal into /tmp/LTL16462248434003746527.gal : 2 ms
[2024-05-29 13:12:17] [INFO ] Time to serialize properties into /tmp/LTL507639896248826681.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/LTL16462248434003746527.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL507639896248826681.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 : !((G(F("((xFINWAIT1>=3)||((xFINWAIT1<3)&&(ESTAB>xFINACK)))"))))
Formula 0 simplified : FG!"((xFINWAIT1>=3)||((xFINWAIT1<3)&&(ESTAB>xFINACK)))"
Detected timeout of ITS tools.
[2024-05-29 13:12:32] [INFO ] Flatten gal took : 5 ms
[2024-05-29 13:12:32] [INFO ] Applying decomposition
[2024-05-29 13:12:32] [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/graph11718578781701372162.txt' '-o' '/tmp/graph11718578781701372162.bin' '-w' '/tmp/graph11718578781701372162.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11718578781701372162.bin' '-l' '-1' '-v' '-w' '/tmp/graph11718578781701372162.weights' '-q' '0' '-e' '0.001'
[2024-05-29 13:12:32] [INFO ] Decomposing Gal with order
[2024-05-29 13:12:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 13:12:32] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-29 13:12:32] [INFO ] Flatten gal took : 43 ms
[2024-05-29 13:12:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2024-05-29 13:12:32] [INFO ] Time to serialize gal into /tmp/LTL8994201862500795944.gal : 2 ms
[2024-05-29 13:12:32] [INFO ] Time to serialize properties into /tmp/LTL14649556603956887322.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/LTL8994201862500795944.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14649556603956887322.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...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((gi0.gu4.xFINWAIT1>=3)||((gi0.gu4.xFINWAIT1<3)&&(gu1.ESTAB>gu1.xFINACK)))"))))
Formula 0 simplified : FG!"((gi0.gu4.xFINWAIT1>=3)||((gi0.gu4.xFINWAIT1<3)&&(gu1.ESTAB>gu1.xFINACK)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12159220347830938092
[2024-05-29 13:12:47] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12159220347830938092
Running compilation step : cd /tmp/ltsmin12159220347830938092;'/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 178 ms.
Running link step : cd /tmp/ltsmin12159220347830938092;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin12159220347830938092;'/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' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property TCPcondis-PT-35-LTLCardinality-07 finished in 93704 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)))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2024-05-29 13:13:02] [INFO ] Computed 9 invariants in 10 ms
[2024-05-29 13:13:02] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-29 13:13:02] [INFO ] Invariant cache hit.
[2024-05-29 13:13:02] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2024-05-29 13:13:02] [INFO ] Invariant cache hit.
[2024-05-29 13:13:02] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 169 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-35-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LEQ 1 s2) (LEQ s13 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 405 reset in 222 ms.
Product exploration explored 100000 steps with 430 reset in 244 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Finished random walk after 1765 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=882 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
[2024-05-29 13:13:03] [INFO ] Invariant cache hit.
[2024-05-29 13:13:03] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-29 13:13:03] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 3 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA TCPcondis-PT-35-LTLCardinality-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-35-LTLCardinality-08 finished in 1329 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((p0&&X(F(p1)))))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-05-29 13:13:03] [INFO ] Invariant cache hit.
[2024-05-29 13:13:03] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-29 13:13:03] [INFO ] Invariant cache hit.
[2024-05-29 13:13:03] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-05-29 13:13:03] [INFO ] Invariant cache hit.
[2024-05-29 13:13:03] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 196 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : TCPcondis-PT-35-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(LEQ s20 s18), p0:(LEQ s18 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 77 ms.
Product exploration explored 100000 steps with 33333 reset in 87 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 15 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA TCPcondis-PT-35-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-35-LTLCardinality-09 finished in 527 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)) U G(p1)))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 28 transition count 30
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 27 transition count 29
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 27 transition count 29
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 27 transition count 27
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 8 place count 27 transition count 26
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 26 transition count 26
Applied a total of 10 rules in 14 ms. Remains 26 /30 variables (removed 4) and now considering 26/32 (removed 6) transitions.
// Phase 1: matrix 26 rows 26 cols
[2024-05-29 13:13:04] [INFO ] Computed 9 invariants in 1 ms
[2024-05-29 13:13:04] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-29 13:13:04] [INFO ] Invariant cache hit.
[2024-05-29 13:13:04] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-05-29 13:13:04] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 13:13:04] [INFO ] Invariant cache hit.
[2024-05-29 13:13:04] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/30 places, 26/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 180 ms. Remains : 26/30 places, 26/32 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-35-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT s18 s1), p0:(LEQ 1 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 33274 reset in 156 ms.
Product exploration explored 100000 steps with 33326 reset in 167 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) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 97 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p0)]
Finished random walk after 1513 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=504 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 183 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p0)]
[2024-05-29 13:13:05] [INFO ] Invariant cache hit.
[2024-05-29 13:13:05] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-29 13:13:05] [INFO ] [Real]Absence check using 2 positive and 7 generalized place invariants in 5 ms returned sat
[2024-05-29 13:13:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 13:13:05] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-29 13:13:05] [INFO ] Computed and/alt/rep : 24/82/24 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-29 13:13:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 13:13:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 14 ms returned sat
[2024-05-29 13:13:05] [INFO ] [Nat]Absence check using 2 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-29 13:13:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 13:13:05] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-29 13:13:05] [INFO ] Computed and/alt/rep : 24/82/24 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-29 13:13:05] [INFO ] Added : 21 causal constraints over 5 iterations in 45 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 26/26 transitions.
Applied a total of 0 rules in 3 ms. Remains 26 /26 variables (removed 0) and now considering 26/26 (removed 0) transitions.
[2024-05-29 13:13:05] [INFO ] Invariant cache hit.
[2024-05-29 13:13:05] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-29 13:13:05] [INFO ] Invariant cache hit.
[2024-05-29 13:13:05] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-05-29 13:13:05] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 13:13:05] [INFO ] Invariant cache hit.
[2024-05-29 13:13:05] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 132 ms. Remains : 26/26 places, 26/26 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 122 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (NOT p0)]
Finished random walk after 1657 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=552 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 136 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p0)]
[2024-05-29 13:13:06] [INFO ] Invariant cache hit.
[2024-05-29 13:13:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-29 13:13:06] [INFO ] [Real]Absence check using 2 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-29 13:13:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 13:13:06] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-29 13:13:06] [INFO ] Computed and/alt/rep : 24/82/24 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-29 13:13:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 13:13:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-29 13:13:06] [INFO ] [Nat]Absence check using 2 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-29 13:13:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 13:13:06] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-29 13:13:06] [INFO ] Computed and/alt/rep : 24/82/24 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-29 13:13:06] [INFO ] Added : 21 causal constraints over 5 iterations in 38 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 33431 reset in 86 ms.
Product exploration explored 100000 steps with 33279 reset in 99 ms.
Built C files in :
/tmp/ltsmin8818979674825502610
[2024-05-29 13:13:06] [INFO ] Computing symmetric may disable matrix : 26 transitions.
[2024-05-29 13:13:06] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:13:06] [INFO ] Computing symmetric may enable matrix : 26 transitions.
[2024-05-29 13:13:06] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:13:06] [INFO ] Computing Do-Not-Accords matrix : 26 transitions.
[2024-05-29 13:13:06] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:13:06] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8818979674825502610
Running compilation step : cd /tmp/ltsmin8818979674825502610;'/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 150 ms.
Running link step : cd /tmp/ltsmin8818979674825502610;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin8818979674825502610;'/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/stateBased9753902130319285671.hoa' '--buchi-type=spotba'
LTSmin run took 207 ms.
FORMULA TCPcondis-PT-35-LTLCardinality-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-35-LTLCardinality-10 finished in 2931 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((G(p0)||(p1&&G(p2)))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 4 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 13:13:07] [INFO ] Computed 9 invariants in 2 ms
[2024-05-29 13:13:07] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-29 13:13:07] [INFO ] Invariant cache hit.
[2024-05-29 13:13:07] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2024-05-29 13:13:07] [INFO ] Invariant cache hit.
[2024-05-29 13:13:07] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 217 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 249 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : TCPcondis-PT-35-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p0 p2), acceptance={} source=5 dest: 5}]], initial=1, aps=[p2:(GT 3 s15), p0:(GT 1 s24), p1:(LEQ s14 s25)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-35-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-35-LTLCardinality-11 finished in 486 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)))'
Support contains 3 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 0 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 10 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 13:13:07] [INFO ] Computed 9 invariants in 1 ms
[2024-05-29 13:13:07] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-29 13:13:07] [INFO ] Invariant cache hit.
[2024-05-29 13:13:07] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-05-29 13:13:07] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 13:13:07] [INFO ] Invariant cache hit.
[2024-05-29 13:13:07] [INFO ] Dead Transitions using invariants and state equation in 35 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 147 ms. Remains : 22/30 places, 22/32 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-35-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GT 2 s9) (GT s5 s15))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 350 ms.
Stack based approach found an accepted trace after 2824 steps with 0 reset with depth 2825 and stack size 2825 in 14 ms.
FORMULA TCPcondis-PT-35-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-35-LTLCardinality-12 finished in 572 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)&&F(p1))))'
Support contains 3 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
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 28 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 6 place count 28 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 8 place count 27 transition count 27
Applied a total of 8 rules in 10 ms. Remains 27 /30 variables (removed 3) and now considering 27/32 (removed 5) transitions.
// Phase 1: matrix 27 rows 27 cols
[2024-05-29 13:13:08] [INFO ] Computed 9 invariants in 2 ms
[2024-05-29 13:13:08] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-29 13:13:08] [INFO ] Invariant cache hit.
[2024-05-29 13:13:08] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2024-05-29 13:13:08] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 13:13:08] [INFO ] Invariant cache hit.
[2024-05-29 13:13:08] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/30 places, 27/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 196 ms. Remains : 27/30 places, 27/32 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : TCPcondis-PT-35-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 3 s0), p1:(LEQ s22 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 820 reset in 212 ms.
Product exploration explored 100000 steps with 835 reset in 205 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 129 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 793 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=396 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 196 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2024-05-29 13:13:09] [INFO ] Invariant cache hit.
[2024-05-29 13:13:09] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-29 13:13:09] [INFO ] Invariant cache hit.
[2024-05-29 13:13:09] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-05-29 13:13:09] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 13:13:09] [INFO ] Invariant cache hit.
[2024-05-29 13:13:09] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 143 ms. Remains : 27/27 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 p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 93 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 1729 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=864 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 174 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 826 reset in 189 ms.
Product exploration explored 100000 steps with 791 reset in 210 ms.
Built C files in :
/tmp/ltsmin7401146800844428432
[2024-05-29 13:13:11] [INFO ] Computing symmetric may disable matrix : 27 transitions.
[2024-05-29 13:13:11] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:13:11] [INFO ] Computing symmetric may enable matrix : 27 transitions.
[2024-05-29 13:13:11] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:13:11] [INFO ] Computing Do-Not-Accords matrix : 27 transitions.
[2024-05-29 13:13:11] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:13:11] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7401146800844428432
Running compilation step : cd /tmp/ltsmin7401146800844428432;'/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 221 ms.
Running link step : cd /tmp/ltsmin7401146800844428432;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin7401146800844428432;'/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/stateBased12721943824361927440.hoa' '--buchi-type=spotba'
LTSmin run took 342 ms.
FORMULA TCPcondis-PT-35-LTLCardinality-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-35-LTLCardinality-13 finished in 3664 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((F(G(p0)) U p1))))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 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 13:13:11] [INFO ] Computed 9 invariants in 1 ms
[2024-05-29 13:13:11] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-29 13:13:11] [INFO ] Invariant cache hit.
[2024-05-29 13:13:11] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2024-05-29 13:13:11] [INFO ] Invariant cache hit.
[2024-05-29 13:13:12] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 165 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-35-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GT 3 s23), p0:(LEQ 3 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 131 ms.
Product exploration explored 100000 steps with 33333 reset in 149 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 19 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA TCPcondis-PT-35-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-35-LTLCardinality-15 finished in 685 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)))'
[2024-05-29 13:13:12] [INFO ] Flatten gal took : 8 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14600338909309278031
[2024-05-29 13:13:12] [INFO ] Computing symmetric may disable matrix : 32 transitions.
[2024-05-29 13:13:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:13:12] [INFO ] Computing symmetric may enable matrix : 32 transitions.
[2024-05-29 13:13:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:13:12] [INFO ] Computing Do-Not-Accords matrix : 32 transitions.
[2024-05-29 13:13:12] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:13:12] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14600338909309278031
Running compilation step : cd /tmp/ltsmin14600338909309278031;'/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 13:13:12] [INFO ] Applying decomposition
[2024-05-29 13:13:12] [INFO ] Flatten gal took : 6 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/graph14700629449455115657.txt' '-o' '/tmp/graph14700629449455115657.bin' '-w' '/tmp/graph14700629449455115657.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14700629449455115657.bin' '-l' '-1' '-v' '-w' '/tmp/graph14700629449455115657.weights' '-q' '0' '-e' '0.001'
[2024-05-29 13:13:12] [INFO ] Decomposing Gal with order
[2024-05-29 13:13:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 13:13:12] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-29 13:13:12] [INFO ] Flatten gal took : 11 ms
[2024-05-29 13:13:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 3 ms.
[2024-05-29 13:13:12] [INFO ] Time to serialize gal into /tmp/LTLCardinality9178850354366184468.gal : 3 ms
[2024-05-29 13:13:12] [INFO ] Time to serialize properties into /tmp/LTLCardinality5254392401074433865.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/LTLCardinality9178850354366184468.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5254392401074433865.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...297
Read 1 LTL properties
Checking formula 0 : !((G(F("((gi1.gu4.xFINWAIT1>=3)||((gi1.gu4.xFINWAIT1<3)&&(gu2.ESTAB>gu2.xFINACK)))"))))
Formula 0 simplified : FG!"((gi1.gu4.xFINWAIT1>=3)||((gi1.gu4.xFINWAIT1<3)&&(gu2.ESTAB>gu2.xFINACK)))"
Compilation finished in 222 ms.
Running link step : cd /tmp/ltsmin14600338909309278031;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin14600338909309278031;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
LTSmin run took 56295 ms.
FORMULA TCPcondis-PT-35-LTLCardinality-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 176744 ms.

BK_STOP 1716988450248

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-35"
export BK_EXAMINATION="LTLCardinality"
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-35, examination is LTLCardinality"
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-171690585400032"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/TCPcondis-PT-35.tgz
mv TCPcondis-PT-35 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;