fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r073-smll-167814399000011
Last Updated
May 14, 2023

About the Execution of LTSMin+red for CSRepetitions-COL-03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
407.151 16095.00 28797.00 509.00 FFFTFFFFFFTFTFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r073-smll-167814399000011.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is CSRepetitions-COL-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r073-smll-167814399000011
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 11K Feb 25 11:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 25 11:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 11:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 11:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Feb 25 11:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 11:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 11:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 14K Mar 5 18:22 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-03-LTLCardinality-00
FORMULA_NAME CSRepetitions-COL-03-LTLCardinality-01
FORMULA_NAME CSRepetitions-COL-03-LTLCardinality-02
FORMULA_NAME CSRepetitions-COL-03-LTLCardinality-03
FORMULA_NAME CSRepetitions-COL-03-LTLCardinality-04
FORMULA_NAME CSRepetitions-COL-03-LTLCardinality-05
FORMULA_NAME CSRepetitions-COL-03-LTLCardinality-06
FORMULA_NAME CSRepetitions-COL-03-LTLCardinality-07
FORMULA_NAME CSRepetitions-COL-03-LTLCardinality-08
FORMULA_NAME CSRepetitions-COL-03-LTLCardinality-09
FORMULA_NAME CSRepetitions-COL-03-LTLCardinality-10
FORMULA_NAME CSRepetitions-COL-03-LTLCardinality-11
FORMULA_NAME CSRepetitions-COL-03-LTLCardinality-12
FORMULA_NAME CSRepetitions-COL-03-LTLCardinality-13
FORMULA_NAME CSRepetitions-COL-03-LTLCardinality-14
FORMULA_NAME CSRepetitions-COL-03-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678218772849

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CSRepetitions-COL-03
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-07 19:52:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-07 19:52:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 19:52:55] [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.
[2023-03-07 19:52:56] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-07 19:52:56] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 998 ms
[2023-03-07 19:52:56] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 58 PT places and 81.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
[2023-03-07 19:52:57] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 15 arcs in 5 ms.
[2023-03-07 19:52:57] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 2 formulas.
FORMULA CSRepetitions-COL-03-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-03-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 1 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 1 stable transitions
Finished random walk after 46 steps, including 0 resets, run visited all 23 properties in 14 ms. (steps per millisecond=3 )
[2023-03-07 19:52:57] [INFO ] Flatten gal took : 23 ms
[2023-03-07 19:52:57] [INFO ] Flatten gal took : 3 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 3
[2023-03-07 19:52:57] [INFO ] Unfolded HLPN to a Petri net with 38 places and 45 transitions 135 arcs in 11 ms.
[2023-03-07 19:52:57] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Support contains 29 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 9 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 38 cols
[2023-03-07 19:52:57] [INFO ] Computed 10 place invariants in 5 ms
[2023-03-07 19:52:57] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-07 19:52:57] [INFO ] Invariant cache hit.
[2023-03-07 19:52:57] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:52:57] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2023-03-07 19:52:57] [INFO ] Invariant cache hit.
[2023-03-07 19:52:57] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 411 ms. Remains : 38/38 places, 45/45 transitions.
Support contains 29 out of 38 places after structural reductions.
[2023-03-07 19:52:57] [INFO ] Flatten gal took : 11 ms
[2023-03-07 19:52:57] [INFO ] Flatten gal took : 9 ms
[2023-03-07 19:52:57] [INFO ] Input system was already deterministic with 45 transitions.
Finished random walk after 27 steps, including 0 resets, run visited all 23 properties in 7 ms. (steps per millisecond=3 )
FORMULA CSRepetitions-COL-03-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 9 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||((!p1&&X(p2)) U (G((!p1&&X(p2)))||(X(p2)&&p3))))))'
Support contains 20 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:52:58] [INFO ] Invariant cache hit.
[2023-03-07 19:52:58] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-07 19:52:58] [INFO ] Invariant cache hit.
[2023-03-07 19:52:58] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:52:58] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2023-03-07 19:52:58] [INFO ] Invariant cache hit.
[2023-03-07 19:52:58] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 216 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 684 ms :[true, (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND p1 (NOT p3))), (OR (NOT p2) (AND (NOT p0) p1 (NOT p3)))]
Running random walk in product with property : CSRepetitions-COL-03-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p3) p1), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p3), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p3) p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p3) (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p3 p2), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p3) p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p3 p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ 2 s19), p3:(AND (GT 3 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9)) (NOT (AND (LEQ s0 (ADD s29 s30 s31 s32 s33 s34 s35 s36 s37)) (LEQ s19 s0)))), p1:(AND (LEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 30 steps with 1 reset in 5 ms.
FORMULA CSRepetitions-COL-03-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-LTLCardinality-00 finished in 995 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 9 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:52:59] [INFO ] Invariant cache hit.
[2023-03-07 19:52:59] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-07 19:52:59] [INFO ] Invariant cache hit.
[2023-03-07 19:52:59] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:52:59] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2023-03-07 19:52:59] [INFO ] Invariant cache hit.
[2023-03-07 19:52:59] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 294 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-03-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ 2 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9))], 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 31783 reset in 582 ms.
Stack based approach found an accepted trace after 62828 steps with 19919 reset with depth 6 and stack size 6 in 210 ms.
FORMULA CSRepetitions-COL-03-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-03-LTLCardinality-01 finished in 1271 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 9 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 27 rules applied. Total rules applied 27 place count 20 transition count 36
Applied a total of 27 rules in 17 ms. Remains 20 /38 variables (removed 18) and now considering 36/45 (removed 9) transitions.
// Phase 1: matrix 36 rows 20 cols
[2023-03-07 19:53:00] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-07 19:53:00] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-07 19:53:00] [INFO ] Invariant cache hit.
[2023-03-07 19:53:00] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-07 19:53:00] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-07 19:53:00] [INFO ] Invariant cache hit.
[2023-03-07 19:53:00] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/38 places, 36/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 152 ms. Remains : 20/38 places, 36/45 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-COL-03-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19))], 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 22 steps with 2 reset in 1 ms.
FORMULA CSRepetitions-COL-03-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-LTLCardinality-02 finished in 217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&(p1 U p2)))))'
Support contains 20 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 38 cols
[2023-03-07 19:53:00] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-07 19:53:00] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-07 19:53:00] [INFO ] Invariant cache hit.
[2023-03-07 19:53:00] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:00] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2023-03-07 19:53:00] [INFO ] Invariant cache hit.
[2023-03-07 19:53:00] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 202 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 223 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (OR (NOT p2) (NOT p0))]
Running random walk in product with property : CSRepetitions-COL-03-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=4, aps=[p2:(LEQ s19 (ADD s20 s21 s22 s23 s24 s25 s26 s27 s28)), p1:(GT 2 (ADD s20 s21 s22 s23 s24 s25 s26 s27 s28)), p0:(OR (LEQ (ADD s29 s30 s31 s32 s33 s34 s35 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 268 ms.
Product exploration explored 100000 steps with 33333 reset in 494 ms.
Computed a total of 0 stabilizing places and 9 stable transitions
Computed a total of 0 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (OR (NOT p0) (AND (NOT p2) (NOT p1))))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (OR (NOT p0) (AND (NOT p2) (NOT p1))))))
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-COL-03-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-03-LTLCardinality-03 finished in 1305 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((!p1||F(p0)))))))'
Support contains 10 out of 38 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:02] [INFO ] Invariant cache hit.
[2023-03-07 19:53:02] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-07 19:53:02] [INFO ] Invariant cache hit.
[2023-03-07 19:53:02] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:02] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2023-03-07 19:53:02] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-07 19:53:02] [INFO ] Invariant cache hit.
[2023-03-07 19:53:02] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 175 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-03-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s0 (ADD s29 s30 s31 s32 s33 s34 s35 s36 s37))], 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 9386 reset in 221 ms.
Stack based approach found an accepted trace after 128 steps with 12 reset with depth 8 and stack size 8 in 0 ms.
FORMULA CSRepetitions-COL-03-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-03-LTLCardinality-04 finished in 495 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0))) U (p1||F(p2))))'
Support contains 20 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:02] [INFO ] Invariant cache hit.
[2023-03-07 19:53:02] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-07 19:53:02] [INFO ] Invariant cache hit.
[2023-03-07 19:53:02] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:02] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2023-03-07 19:53:02] [INFO ] Invariant cache hit.
[2023-03-07 19:53:02] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 189 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : CSRepetitions-COL-03-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GT 1 (ADD s20 s21 s22 s23 s24 s25 s26 s27 s28)), p2:(GT 3 s19), p0:(AND (LEQ 2 (ADD s20 s21 s22 s23 s24 s25 s26 s27 s28)) (LEQ s0 (ADD s29 s30 s31 s32...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 78 steps with 6 reset in 0 ms.
FORMULA CSRepetitions-COL-03-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-LTLCardinality-05 finished in 428 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 27 rules applied. Total rules applied 27 place count 20 transition count 36
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 35 place count 12 transition count 28
Iterating global reduction 0 with 8 rules applied. Total rules applied 43 place count 12 transition count 28
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 51 place count 4 transition count 12
Iterating global reduction 0 with 8 rules applied. Total rules applied 59 place count 4 transition count 12
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 67 place count 4 transition count 4
Applied a total of 67 rules in 9 ms. Remains 4 /38 variables (removed 34) and now considering 4/45 (removed 41) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-07 19:53:02] [INFO ] Computed 1 place invariants in 9 ms
[2023-03-07 19:53:02] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-07 19:53:02] [INFO ] Invariant cache hit.
[2023-03-07 19:53:03] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-07 19:53:03] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-07 19:53:03] [INFO ] Invariant cache hit.
[2023-03-07 19:53:03] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/38 places, 4/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96 ms. Remains : 4/38 places, 4/45 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-COL-03-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s0 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 6364 reset in 95 ms.
Stack based approach found an accepted trace after 13 steps with 1 reset with depth 7 and stack size 7 in 0 ms.
FORMULA CSRepetitions-COL-03-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-03-LTLCardinality-06 finished in 245 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 10 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 38 cols
[2023-03-07 19:53:03] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-07 19:53:03] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-07 19:53:03] [INFO ] Invariant cache hit.
[2023-03-07 19:53:03] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:03] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2023-03-07 19:53:03] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-07 19:53:03] [INFO ] Invariant cache hit.
[2023-03-07 19:53:03] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 199 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-COL-03-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s20 s21 s22 s23 s24 s25 s26 s27 s28) s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-03-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-LTLCardinality-07 finished in 251 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(X(p1))))))'
Support contains 19 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:03] [INFO ] Invariant cache hit.
[2023-03-07 19:53:03] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-07 19:53:03] [INFO ] Invariant cache hit.
[2023-03-07 19:53:03] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:03] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2023-03-07 19:53:03] [INFO ] Invariant cache hit.
[2023-03-07 19:53:03] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 256 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-COL-03-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}]], initial=0, aps=[p0:(LEQ s19 (ADD s20 s21 s22 s23 s24 s25 s26 s27 s28)), p1:(GT s19 (ADD s29 s30 s31 s32 s33 s34 s35 s36 s37))], 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 4704 reset in 546 ms.
Stack based approach found an accepted trace after 33915 steps with 1624 reset with depth 36 and stack size 36 in 182 ms.
FORMULA CSRepetitions-COL-03-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-03-LTLCardinality-08 finished in 1201 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U !p1) U G(p2)))'
Support contains 19 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 4 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:04] [INFO ] Invariant cache hit.
[2023-03-07 19:53:04] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-07 19:53:04] [INFO ] Invariant cache hit.
[2023-03-07 19:53:04] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:04] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2023-03-07 19:53:04] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-07 19:53:04] [INFO ] Invariant cache hit.
[2023-03-07 19:53:04] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 312 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 325 ms :[(NOT p2), true, (NOT p0), p1, (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : CSRepetitions-COL-03-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 (NOT p1)) (AND p2 p0)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 3}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND p2 p1 p0), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ 2 s19), p1:(GT 2 (ADD s20 s21 s22 s23 s24 s25 s26 s27 s28)), p0:(GT s19 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 37 steps with 1 reset in 1 ms.
FORMULA CSRepetitions-COL-03-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-03-LTLCardinality-09 finished in 688 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((!((F(p0)&&p1) U G((G(p1)&&p0)))||p2))))'
Support contains 20 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:05] [INFO ] Invariant cache hit.
[2023-03-07 19:53:05] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-07 19:53:05] [INFO ] Invariant cache hit.
[2023-03-07 19:53:05] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:05] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2023-03-07 19:53:05] [INFO ] Invariant cache hit.
[2023-03-07 19:53:05] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 226 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p2) p1 p0), (AND (NOT p2) p1 p0), (AND (NOT p2) p1 p0)]
Running random walk in product with property : CSRepetitions-COL-03-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1 p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(GT (ADD s20 s21 s22 s23 s24 s25 s26 s27 s28) s19), p1:(LEQ 1 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9)), p0:(LEQ s19 s0)], 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 274 ms.
Product exploration explored 100000 steps with 50000 reset in 329 ms.
Computed a total of 0 stabilizing places and 9 stable transitions
Computed a total of 0 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) p1)))
Knowledge based reduction with 5 factoid took 115 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-COL-03-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-03-LTLCardinality-10 finished in 1163 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U p1)))'
Support contains 19 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 38 /38 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-07 19:53:06] [INFO ] Invariant cache hit.
[2023-03-07 19:53:06] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-07 19:53:06] [INFO ] Invariant cache hit.
[2023-03-07 19:53:06] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-07 19:53:06] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-03-07 19:53:06] [INFO ] Invariant cache hit.
[2023-03-07 19:53:06] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 143 ms. Remains : 38/38 places, 45/45 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-03-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9) (ADD s20 s21 s22 s23 s24 s25 s26 s27 s28)), p0:(LEQ 1 s19)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 139 ms.
Product exploration explored 100000 steps with 50000 reset in 229 ms.
Computed a total of 0 stabilizing places and 9 stable transitions
Computed a total of 0 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 7 factoid took 312 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-COL-03-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-03-LTLCardinality-12 finished in 974 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(X(F(p1)))))))'
Support contains 11 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 45/45 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 27 rules applied. Total rules applied 27 place count 20 transition count 36
Applied a total of 27 rules in 5 ms. Remains 20 /38 variables (removed 18) and now considering 36/45 (removed 9) transitions.
// Phase 1: matrix 36 rows 20 cols
[2023-03-07 19:53:07] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-07 19:53:07] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-07 19:53:07] [INFO ] Invariant cache hit.
[2023-03-07 19:53:07] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-07 19:53:07] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-07 19:53:07] [INFO ] Invariant cache hit.
[2023-03-07 19:53:07] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/38 places, 36/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 20/38 places, 36/45 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-COL-03-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19) s10), p1:(GT 2 s0)], 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 17384 reset in 174 ms.
Stack based approach found an accepted trace after 3461 steps with 569 reset with depth 4 and stack size 4 in 5 ms.
FORMULA CSRepetitions-COL-03-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-03-LTLCardinality-15 finished in 406 ms.
All properties solved by simple procedures.
Total runtime 12218 ms.
ITS solved all properties within timeout

BK_STOP 1678218788944

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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-03"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is CSRepetitions-COL-03, 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 r073-smll-167814399000011"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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