fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r087-tall-171620521500122
Last Updated
July 7, 2024

About the Execution of 2023-gold for CSRepetitions-COL-04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7171.848 1616697.00 2449553.00 7402.80 FTFFTFFFFFTFFFTF normal

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.r087-tall-171620521500122.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 CSRepetitions-COL-04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620521500122
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 10K Apr 12 09:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 12 09:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 12 09:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 09:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 09:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 09:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 09:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 12 09:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 14K May 18 16:42 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 CSRepetitions-COL-04-LTLCardinality-00
FORMULA_NAME CSRepetitions-COL-04-LTLCardinality-01
FORMULA_NAME CSRepetitions-COL-04-LTLCardinality-02
FORMULA_NAME CSRepetitions-COL-04-LTLCardinality-03
FORMULA_NAME CSRepetitions-COL-04-LTLCardinality-04
FORMULA_NAME CSRepetitions-COL-04-LTLCardinality-05
FORMULA_NAME CSRepetitions-COL-04-LTLCardinality-06
FORMULA_NAME CSRepetitions-COL-04-LTLCardinality-07
FORMULA_NAME CSRepetitions-COL-04-LTLCardinality-08
FORMULA_NAME CSRepetitions-COL-04-LTLCardinality-09
FORMULA_NAME CSRepetitions-COL-04-LTLCardinality-10
FORMULA_NAME CSRepetitions-COL-04-LTLCardinality-11
FORMULA_NAME CSRepetitions-COL-04-LTLCardinality-12
FORMULA_NAME CSRepetitions-COL-04-LTLCardinality-13
FORMULA_NAME CSRepetitions-COL-04-LTLCardinality-14
FORMULA_NAME CSRepetitions-COL-04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716243530000

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=CSRepetitions-COL-04
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-20 22:18:51] [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-20 22:18:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 22:18:51] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-20 22:18:51] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-20 22:18:52] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 394 ms
[2024-05-20 22:18:52] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 117 PT places and 176.0 transition bindings in 13 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2024-05-20 22:18:52] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 15 arcs in 4 ms.
[2024-05-20 22:18:52] [INFO ] Skeletonized 16 HLPN properties in 4 ms.
Initial state reduction rules removed 1 formulas.
FORMULA CSRepetitions-COL-04-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 1 stable transitions
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 1 stable transitions
Finished random walk after 3179 steps, including 68 resets, run visited all 22 properties in 29 ms. (steps per millisecond=109 )
Parikh walk visited 0 properties in 1 ms.
[2024-05-20 22:18:52] [INFO ] Flatten gal took : 13 ms
[2024-05-20 22:18:52] [INFO ] Flatten gal took : 2 ms
Transition Send_Answer forces synchronizations/join behavior on parameter c of sort Client
Symmetric sort wr.t. initial and guards and successors and join/free detected :Server
Symmetric sort wr.t. initial detected :Server
Symmetric sort wr.t. initial and guards detected :Server
Applying symmetric unfolding of full symmetric sort :Server domain size was 4
[2024-05-20 22:18:52] [INFO ] Unfolded HLPN to a Petri net with 66 places and 80 transitions 240 arcs in 8 ms.
[2024-05-20 22:18:52] [INFO ] Unfolded 15 HLPN properties in 0 ms.
Support contains 50 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 6 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2024-05-20 22:18:52] [INFO ] Computed 17 invariants in 7 ms
[2024-05-20 22:18:52] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-20 22:18:52] [INFO ] Invariant cache hit.
[2024-05-20 22:18:52] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-20 22:18:52] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-05-20 22:18:52] [INFO ] Invariant cache hit.
[2024-05-20 22:18:52] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 251 ms. Remains : 66/66 places, 80/80 transitions.
Support contains 50 out of 66 places after structural reductions.
[2024-05-20 22:18:52] [INFO ] Flatten gal took : 9 ms
[2024-05-20 22:18:52] [INFO ] Flatten gal took : 24 ms
[2024-05-20 22:18:52] [INFO ] Input system was already deterministic with 80 transitions.
Incomplete random walk after 10000 steps, including 262 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 22) seen :21
Finished Best-First random walk after 186 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=186 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 0 stabilizing places and 16 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(G(p0)))'
Support contains 17 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-20 22:18:53] [INFO ] Invariant cache hit.
[2024-05-20 22:18:53] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-20 22:18:53] [INFO ] Invariant cache hit.
[2024-05-20 22:18:53] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-20 22:18:53] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2024-05-20 22:18:53] [INFO ] Invariant cache hit.
[2024-05-20 22:18:53] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 188 ms. Remains : 66/66 places, 80/80 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 545 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-04-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s0 (ADD s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-COL-04-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-04-LTLCardinality-00 finished in 776 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||F(p1)))))'
Support contains 17 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-20 22:18:54] [INFO ] Invariant cache hit.
[2024-05-20 22:18:54] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-20 22:18:54] [INFO ] Invariant cache hit.
[2024-05-20 22:18:54] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-20 22:18:54] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2024-05-20 22:18:54] [INFO ] Invariant cache hit.
[2024-05-20 22:18:54] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 170 ms. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CSRepetitions-COL-04-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16)), p1:(LEQ (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16) s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2471 reset in 354 ms.
Product exploration explored 100000 steps with 2470 reset in 275 ms.
Computed a total of 0 stabilizing places and 16 stable transitions
Computed a total of 0 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 85 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 267 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-20 22:18:55] [INFO ] Invariant cache hit.
[2024-05-20 22:18:55] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 22:18:55] [INFO ] After 41ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 12 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-COL-04-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-04-LTLCardinality-01 finished in 1250 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 U X((p1&&F(p2)&&G(F(!p2)))))))'
Support contains 50 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-20 22:18:55] [INFO ] Invariant cache hit.
[2024-05-20 22:18:55] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-20 22:18:55] [INFO ] Invariant cache hit.
[2024-05-20 22:18:55] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-20 22:18:55] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-05-20 22:18:55] [INFO ] Invariant cache hit.
[2024-05-20 22:18:55] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156 ms. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 743 ms :[true, true, true, true, (NOT p2), p2, p2]
Running random walk in product with property : CSRepetitions-COL-04-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p1 p2), acceptance={} source=1 dest: 5}, { cond=p1, acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p1 p2), acceptance={} source=2 dest: 5}, { cond=p1, acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=p2, acceptance={0} source=5 dest: 5}], [{ cond=p2, acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GT (ADD s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65) s33), p1:(LEQ (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16) s0...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 48 steps with 1 reset in 1 ms.
FORMULA CSRepetitions-COL-04-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-04-LTLCardinality-02 finished in 921 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(p0)&&F(G(p1))))'
Support contains 17 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 8 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-20 22:18:56] [INFO ] Invariant cache hit.
[2024-05-20 22:18:56] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-20 22:18:56] [INFO ] Invariant cache hit.
[2024-05-20 22:18:56] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-20 22:18:56] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2024-05-20 22:18:56] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-20 22:18:56] [INFO ] Invariant cache hit.
[2024-05-20 22:18:56] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 182 ms. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CSRepetitions-COL-04-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 (ADD s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49)), p1:(LEQ 2 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-04-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-04-LTLCardinality-03 finished in 300 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)) U (p1||X(!p2))))'
Support contains 33 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-20 22:18:56] [INFO ] Invariant cache hit.
[2024-05-20 22:18:56] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-20 22:18:56] [INFO ] Invariant cache hit.
[2024-05-20 22:18:56] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-20 22:18:56] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2024-05-20 22:18:56] [INFO ] Invariant cache hit.
[2024-05-20 22:18:56] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131 ms. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) p2), (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-04-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 2 (ADD s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65)), p2:(GT (ADD s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 261 ms.
Product exploration explored 100000 steps with 50000 reset in 209 ms.
Computed a total of 0 stabilizing places and 16 stable transitions
Computed a total of 0 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 35 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-COL-04-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-04-LTLCardinality-04 finished in 762 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) U (!p1||(!p1 U G(p2)))))'
Support contains 33 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-20 22:18:57] [INFO ] Invariant cache hit.
[2024-05-20 22:18:57] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-20 22:18:57] [INFO ] Invariant cache hit.
[2024-05-20 22:18:57] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-20 22:18:57] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-05-20 22:18:57] [INFO ] Invariant cache hit.
[2024-05-20 22:18:57] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131 ms. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 146 ms :[(AND p1 (NOT p2)), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Running random walk in product with property : CSRepetitions-COL-04-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GT s0 (ADD s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65)), p2:(LEQ 3 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16)),...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-04-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-04-LTLCardinality-05 finished in 296 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(F(p0))||G(p1))))'
Support contains 17 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 34 transition count 64
Applied a total of 48 rules in 8 ms. Remains 34 /66 variables (removed 32) and now considering 64/80 (removed 16) transitions.
// Phase 1: matrix 64 rows 34 cols
[2024-05-20 22:18:57] [INFO ] Computed 1 invariants in 1 ms
[2024-05-20 22:18:57] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-20 22:18:57] [INFO ] Invariant cache hit.
[2024-05-20 22:18:57] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-20 22:18:57] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-20 22:18:57] [INFO ] Invariant cache hit.
[2024-05-20 22:18:57] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/66 places, 64/80 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 121 ms. Remains : 34/66 places, 64/80 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-COL-04-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT 1 (ADD s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33)), p0:(GT (ADD s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s...], 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 8432 reset in 199 ms.
Stack based approach found an accepted trace after 12735 steps with 1081 reset with depth 6 and stack size 6 in 23 ms.
FORMULA CSRepetitions-COL-04-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-04-LTLCardinality-06 finished in 425 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((X(p1)||p0)))'
Support contains 32 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2024-05-20 22:18:57] [INFO ] Computed 17 invariants in 4 ms
[2024-05-20 22:18:58] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-20 22:18:58] [INFO ] Invariant cache hit.
[2024-05-20 22:18:58] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-20 22:18:58] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2024-05-20 22:18:58] [INFO ] Invariant cache hit.
[2024-05-20 22:18:58] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 153 ms. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-COL-04-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ 2 (ADD s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65)) (LEQ (ADD s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48...], 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 4360 reset in 268 ms.
Stack based approach found an accepted trace after 7545 steps with 327 reset with depth 10 and stack size 10 in 34 ms.
FORMULA CSRepetitions-COL-04-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-04-LTLCardinality-07 finished in 549 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 U (p1||G(!p0))))))'
Support contains 18 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-20 22:18:58] [INFO ] Invariant cache hit.
[2024-05-20 22:18:58] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-20 22:18:58] [INFO ] Invariant cache hit.
[2024-05-20 22:18:58] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-20 22:18:58] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-05-20 22:18:58] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-20 22:18:58] [INFO ] Invariant cache hit.
[2024-05-20 22:18:58] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 147 ms. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : CSRepetitions-COL-04-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GT (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16) s0) (GT 3 s33)), p0:(LEQ (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 ...], 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 4149 reset in 286 ms.
Product exploration explored 100000 steps with 4168 reset in 302 ms.
Computed a total of 0 stabilizing places and 16 stable transitions
Computed a total of 0 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 95 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 67 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 7 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 127 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 73 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 64 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
[2024-05-20 22:18:59] [INFO ] Invariant cache hit.
[2024-05-20 22:18:59] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2024-05-20 22:18:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 22:18:59] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-20 22:18:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:18:59] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2024-05-20 22:18:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-20 22:18:59] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-20 22:18:59] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-20 22:18:59] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-20 22:19:00] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 3 ms to minimize.
[2024-05-20 22:19:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2024-05-20 22:19:00] [INFO ] Computed and/alt/rep : 64/80/64 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-20 22:19:00] [INFO ] Added : 4 causal constraints over 1 iterations in 36 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
Support contains 18 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-20 22:19:00] [INFO ] Invariant cache hit.
[2024-05-20 22:19:00] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-20 22:19:00] [INFO ] Invariant cache hit.
[2024-05-20 22:19:00] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-20 22:19:00] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2024-05-20 22:19:00] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-20 22:19:00] [INFO ] Invariant cache hit.
[2024-05-20 22:19:00] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 191 ms. Remains : 66/66 places, 80/80 transitions.
Computed a total of 0 stabilizing places and 16 stable transitions
Computed a total of 0 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 83 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 73 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 119 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 65 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 57 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
[2024-05-20 22:19:00] [INFO ] Invariant cache hit.
[2024-05-20 22:19:00] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2024-05-20 22:19:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 22:19:00] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-20 22:19:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:19:00] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2024-05-20 22:19:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-20 22:19:00] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-20 22:19:00] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-20 22:19:00] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2024-05-20 22:19:00] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-20 22:19:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2024-05-20 22:19:00] [INFO ] Computed and/alt/rep : 64/80/64 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-20 22:19:00] [INFO ] Added : 4 causal constraints over 1 iterations in 42 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
Stuttering acceptance computed with spot in 62 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 4143 reset in 272 ms.
Stack based approach found an accepted trace after 29418 steps with 1217 reset with depth 7 and stack size 7 in 78 ms.
FORMULA CSRepetitions-COL-04-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-04-LTLCardinality-08 finished in 2880 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(p0) U p1) U X(X(G((!p0||G(p1)))))))'
Support contains 17 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-20 22:19:01] [INFO ] Invariant cache hit.
[2024-05-20 22:19:01] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-20 22:19:01] [INFO ] Invariant cache hit.
[2024-05-20 22:19:01] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-20 22:19:01] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-05-20 22:19:01] [INFO ] Invariant cache hit.
[2024-05-20 22:19:01] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 132 ms. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1), (NOT p0), (AND (NOT p1) p0)]
Running random walk in product with property : CSRepetitions-COL-04-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(OR p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={1} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 5}, { cond=(AND p1 p0), acceptance={1} source=5 dest: 5}]], initial=2, aps=[p1:(LEQ s33 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16)), p0:(LEQ 3 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 17071 reset in 265 ms.
Product exploration explored 100000 steps with 17074 reset in 305 ms.
Computed a total of 0 stabilizing places and 16 stable transitions
Computed a total of 0 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (OR p1 (NOT p0))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (OR p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 113 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 338 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1), (NOT p0), (AND (NOT p1) p0)]
Finished random walk after 3072 steps, including 85 resets, run visited all 7 properties in 13 ms. (steps per millisecond=236 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (OR p1 (NOT p0))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (OR p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F p0), (F p1), (F (NOT (OR (NOT p0) p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 13 factoid took 340 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1), (NOT p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1), (NOT p0), (AND (NOT p1) p0)]
Support contains 17 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-20 22:19:03] [INFO ] Invariant cache hit.
[2024-05-20 22:19:03] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-20 22:19:03] [INFO ] Invariant cache hit.
[2024-05-20 22:19:03] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-20 22:19:03] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2024-05-20 22:19:03] [INFO ] Invariant cache hit.
[2024-05-20 22:19:03] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 141 ms. Remains : 66/66 places, 80/80 transitions.
Computed a total of 0 stabilizing places and 16 stable transitions
Computed a total of 0 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (OR (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (OR (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 109 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1), (NOT p0), (AND (NOT p1) p0)]
Finished random walk after 1251 steps, including 32 resets, run visited all 7 properties in 8 ms. (steps per millisecond=156 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (OR (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (OR (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F p0), (F p1), (F (NOT (OR (NOT p0) p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 13 factoid took 352 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1), (NOT p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1), (NOT p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1), (NOT p0), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 17144 reset in 250 ms.
Product exploration explored 100000 steps with 16978 reset in 266 ms.
Applying partial POR strategy [false, true, false, true, true, false]
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1), (NOT p0), (AND (NOT p1) p0)]
Support contains 17 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 8 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-20 22:19:06] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-20 22:19:06] [INFO ] Invariant cache hit.
[2024-05-20 22:19:06] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 80 ms. Remains : 66/66 places, 80/80 transitions.
Built C files in :
/tmp/ltsmin12550983482065333673
[2024-05-20 22:19:06] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12550983482065333673
Running compilation step : cd /tmp/ltsmin12550983482065333673;'/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 249 ms.
Running link step : cd /tmp/ltsmin12550983482065333673;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin12550983482065333673;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1170494895499356303.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 17 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-20 22:19:21] [INFO ] Invariant cache hit.
[2024-05-20 22:19:21] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-20 22:19:21] [INFO ] Invariant cache hit.
[2024-05-20 22:19:21] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-20 22:19:21] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2024-05-20 22:19:21] [INFO ] Invariant cache hit.
[2024-05-20 22:19:21] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 139 ms. Remains : 66/66 places, 80/80 transitions.
Built C files in :
/tmp/ltsmin11194903522598305699
[2024-05-20 22:19:21] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11194903522598305699
Running compilation step : cd /tmp/ltsmin11194903522598305699;'/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 158 ms.
Running link step : cd /tmp/ltsmin11194903522598305699;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin11194903522598305699;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8548040775778810084.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-20 22:19:36] [INFO ] Flatten gal took : 5 ms
[2024-05-20 22:19:36] [INFO ] Flatten gal took : 4 ms
[2024-05-20 22:19:36] [INFO ] Time to serialize gal into /tmp/LTL3379888339121596769.gal : 2 ms
[2024-05-20 22:19:36] [INFO ] Time to serialize properties into /tmp/LTL16381578254236886544.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3379888339121596769.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5307528140897246835.hoa' '-atoms' '/tmp/LTL16381578254236886544.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16381578254236886544.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5307528140897246835.hoa
Reverse transition relation is NOT exact ! Due to transitions t32, t33, t34, t35, t36, t37, t38, t39, t40, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50...400
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2024-05-20 22:19:51] [INFO ] Flatten gal took : 5 ms
[2024-05-20 22:19:51] [INFO ] Flatten gal took : 4 ms
[2024-05-20 22:19:51] [INFO ] Time to serialize gal into /tmp/LTL11686906772555849531.gal : 2 ms
[2024-05-20 22:19:51] [INFO ] Time to serialize properties into /tmp/LTL8547799055138058096.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/LTL11686906772555849531.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8547799055138058096.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 : !((((F("(((((Client_Sending_0+Client_Sending_1)+(Client_Sending_2+Client_Sending_3))+((Client_Sending_4+Client_Sending_5)+(Client_Send...1342
Formula 0 simplified : (G!"(((((Client_Sending_0+Client_Sending_1)+(Client_Sending_2+Client_Sending_3))+((Client_Sending_4+Client_Sending_5)+(Client_Sendin...1330
Reverse transition relation is NOT exact ! Due to transitions t32, t33, t34, t35, t36, t37, t38, t39, t40, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50...400
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2024-05-20 22:20:06] [INFO ] Flatten gal took : 7 ms
[2024-05-20 22:20:06] [INFO ] Applying decomposition
[2024-05-20 22:20:06] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4060387042003293160.txt' '-o' '/tmp/graph4060387042003293160.bin' '-w' '/tmp/graph4060387042003293160.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4060387042003293160.bin' '-l' '-1' '-v' '-w' '/tmp/graph4060387042003293160.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:20:06] [INFO ] Decomposing Gal with order
[2024-05-20 22:20:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:20:06] [INFO ] Removed a total of 15 redundant transitions.
[2024-05-20 22:20:06] [INFO ] Flatten gal took : 20 ms
[2024-05-20 22:20:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 3 ms.
[2024-05-20 22:20:06] [INFO ] Time to serialize gal into /tmp/LTL18087109086904575146.gal : 2 ms
[2024-05-20 22:20:06] [INFO ] Time to serialize properties into /tmp/LTL18297875053830850273.ltl : 3 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/LTL18087109086904575146.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18297875053830850273.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((((F("(((((gu1.Client_Sending_0+gu1.Client_Sending_1)+(gu1.Client_Sending_2+gu1.Client_Sending_3))+((gu1.Client_Sending_4+gu1.Client...1606
Formula 0 simplified : (G!"(((((gu1.Client_Sending_0+gu1.Client_Sending_1)+(gu1.Client_Sending_2+gu1.Client_Sending_3))+((gu1.Client_Sending_4+gu1.Client_S...1594
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9010933938674024715
[2024-05-20 22:20:21] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9010933938674024715
Running compilation step : cd /tmp/ltsmin9010933938674024715;'/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/ltsmin9010933938674024715;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin9010933938674024715;'/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)) U (LTLAPp1==true)) U X(X([]((!(LTLAPp0==true)||[]((LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CSRepetitions-COL-04-LTLCardinality-09 finished in 95576 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||X((p1 U (p2||G(p1)))))) U X(!p1)))'
Support contains 17 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-20 22:20:37] [INFO ] Invariant cache hit.
[2024-05-20 22:20:37] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-20 22:20:37] [INFO ] Invariant cache hit.
[2024-05-20 22:20:37] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-20 22:20:37] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-05-20 22:20:37] [INFO ] Invariant cache hit.
[2024-05-20 22:20:37] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 145 ms. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 192 ms :[p1, false, p1, (AND (NOT p1) (NOT p2)), true, (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : CSRepetitions-COL-04-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 3}, { cond=p1, acceptance={0} source=2 dest: 5}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ 1 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16)), p1:(GT 1 s33), p2:(AND (GT 2 s33) (GT 1 s33))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 142 ms.
Product exploration explored 100000 steps with 50000 reset in 154 ms.
Computed a total of 0 stabilizing places and 16 stable transitions
Computed a total of 0 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 20 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-COL-04-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-04-LTLCardinality-10 finished in 742 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)))'
Support contains 1 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-20 22:20:37] [INFO ] Invariant cache hit.
[2024-05-20 22:20:37] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-20 22:20:37] [INFO ] Invariant cache hit.
[2024-05-20 22:20:37] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-20 22:20:37] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-05-20 22:20:37] [INFO ] Invariant cache hit.
[2024-05-20 22:20:37] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127 ms. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-04-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 2 s33)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 70 steps with 1 reset in 0 ms.
FORMULA CSRepetitions-COL-04-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-04-LTLCardinality-11 finished in 221 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(!p0))'
Support contains 16 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 34 transition count 64
Applied a total of 48 rules in 13 ms. Remains 34 /66 variables (removed 32) and now considering 64/80 (removed 16) transitions.
// Phase 1: matrix 64 rows 34 cols
[2024-05-20 22:20:37] [INFO ] Computed 1 invariants in 1 ms
[2024-05-20 22:20:37] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-20 22:20:37] [INFO ] Invariant cache hit.
[2024-05-20 22:20:38] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-20 22:20:38] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-20 22:20:38] [INFO ] Invariant cache hit.
[2024-05-20 22:20:38] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/66 places, 64/80 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 124 ms. Remains : 34/66 places, 64/80 transitions.
Stuttering acceptance computed with spot in 36 ms :[p0]
Running random walk in product with property : CSRepetitions-COL-04-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 (ADD s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 148 steps with 22 reset in 1 ms.
FORMULA CSRepetitions-COL-04-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-04-LTLCardinality-12 finished in 179 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(p0) U p1))'
Support contains 18 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 6 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 66 cols
[2024-05-20 22:20:38] [INFO ] Computed 17 invariants in 3 ms
[2024-05-20 22:20:38] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-20 22:20:38] [INFO ] Invariant cache hit.
[2024-05-20 22:20:38] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-20 22:20:38] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2024-05-20 22:20:38] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-20 22:20:38] [INFO ] Invariant cache hit.
[2024-05-20 22:20:38] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 146 ms. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-04-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LEQ 2 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16)) (LEQ 2 s33) (LEQ 3 s0)), p0:(LEQ 2 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s1...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4857 steps with 1568 reset in 12 ms.
FORMULA CSRepetitions-COL-04-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-04-LTLCardinality-13 finished in 247 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)||F(p1))))'
Support contains 32 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-20 22:20:38] [INFO ] Invariant cache hit.
[2024-05-20 22:20:38] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-20 22:20:38] [INFO ] Invariant cache hit.
[2024-05-20 22:20:38] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-20 22:20:38] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-05-20 22:20:38] [INFO ] Invariant cache hit.
[2024-05-20 22:20:38] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116 ms. Remains : 66/66 places, 80/80 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-COL-04-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ 3 (ADD s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49)), p0:(LEQ 3 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 152 ms.
Product exploration explored 100000 steps with 50000 reset in 156 ms.
Computed a total of 0 stabilizing places and 16 stable transitions
Computed a total of 0 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 21 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-COL-04-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-04-LTLCardinality-14 finished in 569 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(p0) U p1) U X(X(G((!p0||G(p1)))))))'
Found a Lengthening insensitive property : CSRepetitions-COL-04-LTLCardinality-09
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1), (NOT p0), (AND (NOT p1) p0)]
Support contains 17 out of 66 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-20 22:20:39] [INFO ] Invariant cache hit.
[2024-05-20 22:20:39] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-20 22:20:39] [INFO ] Invariant cache hit.
[2024-05-20 22:20:39] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-20 22:20:39] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-05-20 22:20:39] [INFO ] Invariant cache hit.
[2024-05-20 22:20:39] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 127 ms. Remains : 66/66 places, 80/80 transitions.
Running random walk in product with property : CSRepetitions-COL-04-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(OR p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={1} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 5}, { cond=(AND p1 p0), acceptance={1} source=5 dest: 5}]], initial=2, aps=[p1:(LEQ s33 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16)), p0:(LEQ 3 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 17221 reset in 254 ms.
Product exploration explored 100000 steps with 17114 reset in 264 ms.
Computed a total of 0 stabilizing places and 16 stable transitions
Computed a total of 0 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (OR p1 (NOT p0))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (OR p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 124 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1), (NOT p0), (AND (NOT p1) p0)]
Finished random walk after 3132 steps, including 83 resets, run visited all 7 properties in 14 ms. (steps per millisecond=223 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (OR p1 (NOT p0))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (OR p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F p0), (F p1), (F (NOT (OR (NOT p0) p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 13 factoid took 359 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1), (NOT p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1), (NOT p0), (AND (NOT p1) p0)]
Support contains 17 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-20 22:20:41] [INFO ] Invariant cache hit.
[2024-05-20 22:20:41] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-20 22:20:41] [INFO ] Invariant cache hit.
[2024-05-20 22:20:41] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-20 22:20:41] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-05-20 22:20:41] [INFO ] Invariant cache hit.
[2024-05-20 22:20:41] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 142 ms. Remains : 66/66 places, 80/80 transitions.
Computed a total of 0 stabilizing places and 16 stable transitions
Computed a total of 0 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (OR (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (OR (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 120 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1), (NOT p0), (AND (NOT p1) p0)]
Finished random walk after 57 steps, including 1 resets, run visited all 7 properties in 3 ms. (steps per millisecond=19 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (OR (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (OR (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F p0), (F p1), (F (NOT (OR (NOT p0) p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 13 factoid took 426 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1), (NOT p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 274 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1), (NOT p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1), (NOT p0), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 17132 reset in 238 ms.
Product exploration explored 100000 steps with 16628 reset in 255 ms.
Applying partial POR strategy [false, true, false, true, true, false]
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1), (NOT p0), (AND (NOT p1) p0)]
Support contains 17 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-20 22:20:43] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-20 22:20:43] [INFO ] Invariant cache hit.
[2024-05-20 22:20:43] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52 ms. Remains : 66/66 places, 80/80 transitions.
Built C files in :
/tmp/ltsmin12437402405758952181
[2024-05-20 22:20:43] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12437402405758952181
Running compilation step : cd /tmp/ltsmin12437402405758952181;'/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 161 ms.
Running link step : cd /tmp/ltsmin12437402405758952181;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin12437402405758952181;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9356297296283749035.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 17 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-20 22:20:58] [INFO ] Invariant cache hit.
[2024-05-20 22:20:58] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-20 22:20:58] [INFO ] Invariant cache hit.
[2024-05-20 22:20:58] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-20 22:20:59] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-05-20 22:20:59] [INFO ] Invariant cache hit.
[2024-05-20 22:20:59] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140 ms. Remains : 66/66 places, 80/80 transitions.
Built C files in :
/tmp/ltsmin17432114974209815096
[2024-05-20 22:20:59] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17432114974209815096
Running compilation step : cd /tmp/ltsmin17432114974209815096;'/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 154 ms.
Running link step : cd /tmp/ltsmin17432114974209815096;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin17432114974209815096;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2544175185408908670.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-20 22:21:14] [INFO ] Flatten gal took : 6 ms
[2024-05-20 22:21:14] [INFO ] Flatten gal took : 3 ms
[2024-05-20 22:21:14] [INFO ] Time to serialize gal into /tmp/LTL18215697550327558029.gal : 1 ms
[2024-05-20 22:21:14] [INFO ] Time to serialize properties into /tmp/LTL662887256947381604.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/LTL18215697550327558029.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15200976285884484419.hoa' '-atoms' '/tmp/LTL662887256947381604.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL662887256947381604.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15200976285884484419.hoa
Reverse transition relation is NOT exact ! Due to transitions t32, t33, t34, t35, t36, t37, t38, t39, t40, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50...400
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2024-05-20 22:21:29] [INFO ] Flatten gal took : 4 ms
[2024-05-20 22:21:29] [INFO ] Flatten gal took : 4 ms
[2024-05-20 22:21:29] [INFO ] Time to serialize gal into /tmp/LTL9782376943200428467.gal : 2 ms
[2024-05-20 22:21:29] [INFO ] Time to serialize properties into /tmp/LTL3646168608703553845.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9782376943200428467.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3646168608703553845.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 : !((((F("(((((Client_Sending_0+Client_Sending_1)+(Client_Sending_2+Client_Sending_3))+((Client_Sending_4+Client_Sending_5)+(Client_Send...1342
Formula 0 simplified : (G!"(((((Client_Sending_0+Client_Sending_1)+(Client_Sending_2+Client_Sending_3))+((Client_Sending_4+Client_Sending_5)+(Client_Sendin...1330
Reverse transition relation is NOT exact ! Due to transitions t32, t33, t34, t35, t36, t37, t38, t39, t40, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50...400
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2024-05-20 22:21:44] [INFO ] Flatten gal took : 3 ms
[2024-05-20 22:21:44] [INFO ] Applying decomposition
[2024-05-20 22:21:44] [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/graph11799793748475202327.txt' '-o' '/tmp/graph11799793748475202327.bin' '-w' '/tmp/graph11799793748475202327.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11799793748475202327.bin' '-l' '-1' '-v' '-w' '/tmp/graph11799793748475202327.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:21:44] [INFO ] Decomposing Gal with order
[2024-05-20 22:21:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:21:44] [INFO ] Removed a total of 15 redundant transitions.
[2024-05-20 22:21:44] [INFO ] Flatten gal took : 11 ms
[2024-05-20 22:21:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 2 ms.
[2024-05-20 22:21:44] [INFO ] Time to serialize gal into /tmp/LTL16605626279542780808.gal : 1 ms
[2024-05-20 22:21:44] [INFO ] Time to serialize properties into /tmp/LTL7974480919882783288.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16605626279542780808.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7974480919882783288.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 : !((((F("(((((gu1.Client_Sending_0+gu1.Client_Sending_1)+(gu1.Client_Sending_2+gu1.Client_Sending_3))+((gu1.Client_Sending_4+gu1.Client...1606
Formula 0 simplified : (G!"(((((gu1.Client_Sending_0+gu1.Client_Sending_1)+(gu1.Client_Sending_2+gu1.Client_Sending_3))+((gu1.Client_Sending_4+gu1.Client_S...1594
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11818433088769538274
[2024-05-20 22:21:59] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11818433088769538274
Running compilation step : cd /tmp/ltsmin11818433088769538274;'/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 147 ms.
Running link step : cd /tmp/ltsmin11818433088769538274;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin11818433088769538274;'/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)) U (LTLAPp1==true)) U X(X([]((!(LTLAPp0==true)||[]((LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CSRepetitions-COL-04-LTLCardinality-09 finished in 95580 ms.
[2024-05-20 22:22:14] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3965116379452285948
[2024-05-20 22:22:14] [INFO ] Computing symmetric may disable matrix : 80 transitions.
[2024-05-20 22:22:14] [INFO ] Applying decomposition
[2024-05-20 22:22:14] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 22:22:14] [INFO ] Computing symmetric may enable matrix : 80 transitions.
[2024-05-20 22:22:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 22:22:14] [INFO ] Flatten gal took : 3 ms
[2024-05-20 22:22:14] [INFO ] Computing Do-Not-Accords matrix : 80 transitions.
[2024-05-20 22:22:14] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 22:22:14] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3965116379452285948
Running compilation step : cd /tmp/ltsmin3965116379452285948;'/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'
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/graph8017899293143338892.txt' '-o' '/tmp/graph8017899293143338892.bin' '-w' '/tmp/graph8017899293143338892.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8017899293143338892.bin' '-l' '-1' '-v' '-w' '/tmp/graph8017899293143338892.weights' '-q' '0' '-e' '0.001'
[2024-05-20 22:22:14] [INFO ] Decomposing Gal with order
[2024-05-20 22:22:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:22:14] [INFO ] Removed a total of 15 redundant transitions.
[2024-05-20 22:22:14] [INFO ] Flatten gal took : 24 ms
[2024-05-20 22:22:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 4 ms.
[2024-05-20 22:22:15] [INFO ] Time to serialize gal into /tmp/LTLCardinality6974746830141072707.gal : 704 ms
[2024-05-20 22:22:15] [INFO ] Time to serialize properties into /tmp/LTLCardinality9630502843021949578.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/LTLCardinality6974746830141072707.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9630502843021949578.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 : !((((F("(((((gu1.Client_Sending_0+gu1.Client_Sending_1)+(gu1.Client_Sending_2+gu1.Client_Sending_3))+((gu1.Client_Sending_4+gu1.Client...1606
Compilation finished in 792 ms.
Running link step : cd /tmp/ltsmin3965116379452285948;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Formula 0 simplified : (G!"(((((gu1.Client_Sending_0+gu1.Client_Sending_1)+(gu1.Client_Sending_2+gu1.Client_Sending_3))+((gu1.Client_Sending_4+gu1.Client_S...1594
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin3965116379452285948;'/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)) U (LTLAPp1==true)) U X(X([]((!(LTLAPp0==true)||[]((LTLAPp1==true)))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: LTL layer: formula: ((<>((LTLAPp0==true)) U (LTLAPp1==true)) U X(X([]((!(LTLAPp0==true)||[]((LTLAPp1==true)))))))
pins2lts-mc-linux64( 0/ 8), 0.003: "((<>((LTLAPp0==true)) U (LTLAPp1==true)) U X(X([]((!(LTLAPp0==true)||[]((LTLAPp1==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.018: buchi has 7 states
pins2lts-mc-linux64( 0/ 8), 0.026: There are 83 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.028: State length is 67, there are 96 groups
pins2lts-mc-linux64( 0/ 8), 0.028: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.028: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.028: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.028: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.066: [Blue] ~13 levels ~960 states ~2480 transitions
pins2lts-mc-linux64( 7/ 8), 0.069: [Blue] ~13 levels ~1920 states ~3416 transitions
pins2lts-mc-linux64( 7/ 8), 0.080: [Blue] ~13 levels ~3840 states ~5392 transitions
pins2lts-mc-linux64( 7/ 8), 0.128: [Blue] ~13 levels ~7680 states ~10024 transitions
pins2lts-mc-linux64( 0/ 8), 0.211: [Blue] ~13 levels ~15360 states ~18392 transitions
pins2lts-mc-linux64( 0/ 8), 0.317: [Blue] ~13 levels ~30720 states ~37064 transitions
pins2lts-mc-linux64( 0/ 8), 0.537: [Blue] ~13 levels ~61440 states ~78632 transitions
pins2lts-mc-linux64( 0/ 8), 1.101: [Blue] ~1974 levels ~122880 states ~340176 transitions
pins2lts-mc-linux64( 0/ 8), 1.881: [Blue] ~13382 levels ~245760 states ~1390128 transitions
pins2lts-mc-linux64( 0/ 8), 2.587: [Blue] ~34188 levels ~491520 states ~3453112 transitions
pins2lts-mc-linux64( 0/ 8), 3.810: [Blue] ~76562 levels ~983040 states ~7716568 transitions
pins2lts-mc-linux64( 0/ 8), 6.306: [Blue] ~158144 levels ~1966080 states ~16370320 transitions
pins2lts-mc-linux64( 0/ 8), 11.664: [Blue] ~309600 levels ~3932160 states ~33567904 transitions
pins2lts-mc-linux64( 5/ 8), 23.342: [Blue] ~630758 levels ~7864320 states ~69010336 transitions
pins2lts-mc-linux64( 0/ 8), 46.551: [Blue] ~1177622 levels ~15728640 states ~139776384 transitions
pins2lts-mc-linux64( 2/ 8), 95.147: [Blue] ~2407943 levels ~31457280 states ~285461768 transitions
pins2lts-mc-linux64( 5/ 8), 180.782: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 180.849:
pins2lts-mc-linux64( 0/ 8), 180.849: Explored 54232976 states 504423149 transitions, fanout: 9.301
pins2lts-mc-linux64( 0/ 8), 180.849: Total exploration time 180.790 sec (180.730 sec minimum, 180.769 sec on average)
pins2lts-mc-linux64( 0/ 8), 180.849: States per second: 299978, Transitions per second: 2790106
pins2lts-mc-linux64( 0/ 8), 180.849:
pins2lts-mc-linux64( 0/ 8), 180.849: State space has 134217175 states, 13634 are accepting
pins2lts-mc-linux64( 0/ 8), 180.849: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 180.849: blue states: 54232976 (40.41%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 180.849: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 180.849: all-red states: 13785 (0.01%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 180.849:
pins2lts-mc-linux64( 0/ 8), 180.849: Total memory used for local state coloring: 502.8MB
pins2lts-mc-linux64( 0/ 8), 180.849:
pins2lts-mc-linux64( 0/ 8), 180.849: Queue width: 8B, total height: 32949203, memory: 251.38MB
pins2lts-mc-linux64( 0/ 8), 180.849: Tree memory: 1266.7MB, 9.9 B/state, compr.: 3.7%
pins2lts-mc-linux64( 0/ 8), 180.849: Tree fill ratio (roots/leafs): 99.0%/94.0%
pins2lts-mc-linux64( 0/ 8), 180.849: Stored 82 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 180.849: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 180.849: Est. total memory use: 1518.0MB (~1275.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3965116379452285948;'/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)) U (LTLAPp1==true)) U X(X([]((!(LTLAPp0==true)||[]((LTLAPp1==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3965116379452285948;'/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)) U (LTLAPp1==true)) U X(X([]((!(LTLAPp0==true)||[]((LTLAPp1==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Reverse transition relation is NOT exact ! Due to transitions gi0.gu0.t48, gi0.gu0.t49, gi0.gu0.t50, gi0.gu0.t51, gi0.gu0.t52, gi0.gu0.t53, gi0.gu0.t54, gi...528
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2024-05-20 22:43:22] [INFO ] Applying decomposition
[2024-05-20 22:43:22] [INFO ] Flatten gal took : 4 ms
[2024-05-20 22:43:22] [INFO ] Decomposing Gal with order
[2024-05-20 22:43:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 22:43:22] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-20 22:43:22] [INFO ] Flatten gal took : 8 ms
[2024-05-20 22:43:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-20 22:43:22] [INFO ] Time to serialize gal into /tmp/LTLCardinality16870788848379069293.gal : 1 ms
[2024-05-20 22:43:22] [INFO ] Time to serialize properties into /tmp/LTLCardinality12433970686324318575.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16870788848379069293.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12433970686324318575.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...299
Read 1 LTL properties
Checking formula 0 : !((((F("(((((gClient0.Client_Sending_0+gClient1.Client_Sending_1)+(gClient2.Client_Sending_2+gClient3.Client_Sending_3))+((gClient4.Cl...1974
Formula 0 simplified : (G!"(((((gClient0.Client_Sending_0+gClient1.Client_Sending_1)+(gClient2.Client_Sending_2+gClient3.Client_Sending_3))+((gClient4.Clie...1962
Reverse transition relation is NOT exact ! Due to transitions gClient0.t32, gClient0.t48, gClient1.t33, gClient1.t49, gClient2.t34, gClient2.t50, gClient3....700
Computing Next relation with stutter on 1 deadlock states
18 unique states visited
2 strongly connected components in search stack
22 transitions explored
13 items max in DFS search stack
13241 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,132.435,2223548,1,0,375,9.84627e+06,48,262,7207,1.59045e+07,314
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CSRepetitions-COL-04-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1611760 ms.

BK_STOP 1716245146697

--------------------
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="CSRepetitions-COL-04"
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 CSRepetitions-COL-04, 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 r087-tall-171620521500122"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-COL-04.tgz
mv CSRepetitions-COL-04 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 ;