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-167814399100092.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-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r073-smll-167814399100092
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 409K Feb 25 12:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.4M Feb 25 12:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 721K Feb 25 12:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.9M Feb 25 12:31 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 216K Feb 25 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 550K Feb 25 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 240K Feb 25 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 779K Feb 25 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 735K Feb 25 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.5M Feb 25 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 189K Feb 25 13:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 679K Feb 25 13:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 15:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.2M 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-PT-10-LTLFireability-00
FORMULA_NAME CSRepetitions-PT-10-LTLFireability-01
FORMULA_NAME CSRepetitions-PT-10-LTLFireability-02
FORMULA_NAME CSRepetitions-PT-10-LTLFireability-03
FORMULA_NAME CSRepetitions-PT-10-LTLFireability-04
FORMULA_NAME CSRepetitions-PT-10-LTLFireability-05
FORMULA_NAME CSRepetitions-PT-10-LTLFireability-06
FORMULA_NAME CSRepetitions-PT-10-LTLFireability-07
FORMULA_NAME CSRepetitions-PT-10-LTLFireability-08
FORMULA_NAME CSRepetitions-PT-10-LTLFireability-09
FORMULA_NAME CSRepetitions-PT-10-LTLFireability-10
FORMULA_NAME CSRepetitions-PT-10-LTLFireability-11
FORMULA_NAME CSRepetitions-PT-10-LTLFireability-12
FORMULA_NAME CSRepetitions-PT-10-LTLFireability-13
FORMULA_NAME CSRepetitions-PT-10-LTLFireability-14
FORMULA_NAME CSRepetitions-PT-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678272191181

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CSRepetitions-PT-10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 10:43:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 10:43:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 10:43:14] [INFO ] Load time of PNML (sax parser for PT used): 242 ms
[2023-03-08 10:43:14] [INFO ] Transformed 1311 places.
[2023-03-08 10:43:14] [INFO ] Transformed 2300 transitions.
[2023-03-08 10:43:14] [INFO ] Parsed PT model containing 1311 places and 2300 transitions and 8700 arcs in 355 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 74 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA CSRepetitions-PT-10-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-10-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-10-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-10-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-10-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1311 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 42 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
// Phase 1: matrix 2300 rows 1311 cols
[2023-03-08 10:43:15] [INFO ] Computed 110 place invariants in 71 ms
[2023-03-08 10:43:15] [INFO ] Implicit Places using invariants in 639 ms returned []
[2023-03-08 10:43:15] [INFO ] Invariant cache hit.
[2023-03-08 10:43:17] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 10:43:17] [INFO ] Implicit Places using invariants and state equation in 1361 ms returned []
Implicit Place search using SMT with State Equation took 2043 ms to find 0 implicit places.
[2023-03-08 10:43:17] [INFO ] Invariant cache hit.
[2023-03-08 10:43:19] [INFO ] Dead Transitions using invariants and state equation in 2224 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4319 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Support contains 1311 out of 1311 places after structural reductions.
[2023-03-08 10:43:20] [INFO ] Flatten gal took : 400 ms
[2023-03-08 10:43:21] [INFO ] Flatten gal took : 295 ms
[2023-03-08 10:43:21] [INFO ] Input system was already deterministic with 2300 transitions.
Finished random walk after 3581 steps, including 19 resets, run visited all 23 properties in 270 ms. (steps per millisecond=13 )
Computed a total of 0 stabilizing places and 100 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' '!(X((p0 U p1)))'
Support contains 1310 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 12 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 10:43:23] [INFO ] Invariant cache hit.
[2023-03-08 10:43:23] [INFO ] Implicit Places using invariants in 261 ms returned []
[2023-03-08 10:43:23] [INFO ] Invariant cache hit.
[2023-03-08 10:43:24] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 10:43:24] [INFO ] Implicit Places using invariants and state equation in 1246 ms returned []
Implicit Place search using SMT with State Equation took 1510 ms to find 0 implicit places.
[2023-03-08 10:43:24] [INFO ] Invariant cache hit.
[2023-03-08 10:43:26] [INFO ] Dead Transitions using invariants and state equation in 1658 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3184 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Stuttering acceptance computed with spot in 279 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : CSRepetitions-PT-10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (AND (GEQ s55 1) (GEQ s686 1)) (AND (GEQ s508 1) (GEQ s663 1)) (AND (GEQ s3 1) (GEQ s331 1)) (AND (GEQ s151 1) (GEQ s1186 1)) (AND (GEQ s1124 1) (G...], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA CSRepetitions-PT-10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-10-LTLFireability-00 finished in 3563 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||X(p1))))))'
Support contains 211 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 191 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 10:43:26] [INFO ] Invariant cache hit.
[2023-03-08 10:43:27] [INFO ] Implicit Places using invariants in 1135 ms returned []
[2023-03-08 10:43:27] [INFO ] Invariant cache hit.
[2023-03-08 10:43:29] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 10:43:30] [INFO ] Implicit Places using invariants and state equation in 3030 ms returned []
Implicit Place search using SMT with State Equation took 4187 ms to find 0 implicit places.
[2023-03-08 10:43:31] [INFO ] Invariant cache hit.
[2023-03-08 10:43:32] [INFO ] Dead Transitions using invariants and state equation in 1739 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6144 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(AND (OR (LT s156 1) (LT s342 1)) (OR (LT s342 1) (LT s1124 1)) (OR (LT s342 1) (LT s1193 1)) (OR (LT s342 1) (LT s925 1)) (OR (LT s98 1) (LT s342 1)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 21703 reset in 4628 ms.
Product exploration explored 100000 steps with 22140 reset in 4433 ms.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 243 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p0 p1), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 129 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 211 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 88 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 10:43:43] [INFO ] Invariant cache hit.
[2023-03-08 10:43:44] [INFO ] Implicit Places using invariants in 1080 ms returned []
[2023-03-08 10:43:44] [INFO ] Invariant cache hit.
[2023-03-08 10:43:45] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 10:43:47] [INFO ] Implicit Places using invariants and state equation in 3275 ms returned []
Implicit Place search using SMT with State Equation took 4387 ms to find 0 implicit places.
[2023-03-08 10:43:47] [INFO ] Invariant cache hit.
[2023-03-08 10:43:49] [INFO ] Dead Transitions using invariants and state equation in 1730 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6222 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 152 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 233 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 21522 reset in 4078 ms.
Product exploration explored 100000 steps with 21995 reset in 4197 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 211 out of 1311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 315 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 10:43:59] [INFO ] Redundant transitions in 297 ms returned []
[2023-03-08 10:43:59] [INFO ] Invariant cache hit.
[2023-03-08 10:44:02] [INFO ] Dead Transitions using invariants and state equation in 2460 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3135 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Support contains 211 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 64 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 10:44:02] [INFO ] Invariant cache hit.
[2023-03-08 10:44:03] [INFO ] Implicit Places using invariants in 1238 ms returned []
[2023-03-08 10:44:03] [INFO ] Invariant cache hit.
[2023-03-08 10:44:04] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 10:44:07] [INFO ] Implicit Places using invariants and state equation in 3450 ms returned []
Implicit Place search using SMT with State Equation took 4694 ms to find 0 implicit places.
[2023-03-08 10:44:07] [INFO ] Invariant cache hit.
[2023-03-08 10:44:09] [INFO ] Dead Transitions using invariants and state equation in 2453 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7214 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Treatment of property CSRepetitions-PT-10-LTLFireability-01 finished in 43327 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((F(!p0)&&G(F(p1)))))'
Support contains 1200 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 10 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 10:44:10] [INFO ] Invariant cache hit.
[2023-03-08 10:44:10] [INFO ] Implicit Places using invariants in 443 ms returned []
[2023-03-08 10:44:10] [INFO ] Invariant cache hit.
[2023-03-08 10:44:11] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 10:44:11] [INFO ] Implicit Places using invariants and state equation in 1496 ms returned []
Implicit Place search using SMT with State Equation took 1942 ms to find 0 implicit places.
[2023-03-08 10:44:11] [INFO ] Invariant cache hit.
[2023-03-08 10:44:13] [INFO ] Dead Transitions using invariants and state equation in 2038 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4006 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, (NOT p1), (NOT p1)]
Running random walk in product with property : CSRepetitions-PT-10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s55 1) (GEQ s686 1)) (AND (GEQ s508 1) (GEQ s663 1)) (AND (GEQ s3 1) (GEQ s331 1)) (AND (GEQ s151 1) (GEQ s1186 1)) (AND (GEQ s1124 1) (G...], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 1190 reset in 2043 ms.
Product exploration explored 100000 steps with 1215 reset in 2114 ms.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 334 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 289 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (NOT p1)]
Support contains 100 out of 1311 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 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 151 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 10:44:20] [INFO ] Invariant cache hit.
[2023-03-08 10:44:20] [INFO ] Implicit Places using invariants in 436 ms returned []
[2023-03-08 10:44:20] [INFO ] Invariant cache hit.
[2023-03-08 10:44:21] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 10:44:22] [INFO ] Implicit Places using invariants and state equation in 1472 ms returned []
Implicit Place search using SMT with State Equation took 1910 ms to find 0 implicit places.
[2023-03-08 10:44:22] [INFO ] Redundant transitions in 189 ms returned []
[2023-03-08 10:44:22] [INFO ] Invariant cache hit.
[2023-03-08 10:44:24] [INFO ] Dead Transitions using invariants and state equation in 1860 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4133 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [p1, (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [p1, (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1153 reset in 1954 ms.
Product exploration explored 100000 steps with 1146 reset in 2026 ms.
Support contains 100 out of 1311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 0 with 300 rules applied. Total rules applied 300 place count 1111 transition count 2200
Discarding 990 places :
Symmetric choice reduction at 0 with 990 rule applications. Total rules 1290 place count 121 transition count 1210
Iterating global reduction 0 with 990 rules applied. Total rules applied 2280 place count 121 transition count 1210
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 2310 place count 101 transition count 1200
Ensure Unique test removed 900 transitions
Reduce isomorphic transitions removed 900 transitions.
Iterating post reduction 0 with 900 rules applied. Total rules applied 3210 place count 101 transition count 300
Applied a total of 3210 rules in 256 ms. Remains 101 /1311 variables (removed 1210) and now considering 300/2300 (removed 2000) transitions.
// Phase 1: matrix 300 rows 101 cols
[2023-03-08 10:44:29] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-08 10:44:29] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-08 10:44:29] [INFO ] Invariant cache hit.
[2023-03-08 10:44:29] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2023-03-08 10:44:29] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-08 10:44:29] [INFO ] Invariant cache hit.
[2023-03-08 10:44:29] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/1311 places, 300/2300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 718 ms. Remains : 101/1311 places, 300/2300 transitions.
Treatment of property CSRepetitions-PT-10-LTLFireability-03 finished in 19969 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((G(!(((p1 U p2)&&F(p3))||p0)) U p1)))'
Support contains 1301 out of 1311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 75 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
// Phase 1: matrix 2300 rows 1311 cols
[2023-03-08 10:44:30] [INFO ] Computed 110 place invariants in 32 ms
[2023-03-08 10:44:30] [INFO ] Implicit Places using invariants in 641 ms returned []
[2023-03-08 10:44:30] [INFO ] Invariant cache hit.
[2023-03-08 10:44:31] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 10:44:32] [INFO ] Implicit Places using invariants and state equation in 1443 ms returned []
Implicit Place search using SMT with State Equation took 2089 ms to find 0 implicit places.
[2023-03-08 10:44:32] [INFO ] Redundant transitions in 125 ms returned []
[2023-03-08 10:44:32] [INFO ] Invariant cache hit.
[2023-03-08 10:44:34] [INFO ] Dead Transitions using invariants and state equation in 1963 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4264 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Stuttering acceptance computed with spot in 269 ms :[(NOT p1), true, p3, (OR p0 (AND p2 p3)), (NOT p1), p2]
Running random walk in product with property : CSRepetitions-PT-10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR p1 (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p1) p2 p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2 (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p3))), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p3))), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p3, acceptance={} source=2 dest: 1}, { cond=(NOT p3), acceptance={} source=2 dest: 2}], [{ cond=(OR p0 (AND p2 p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2) p3), acceptance={} source=3 dest: 5}], [{ cond=(OR (AND (NOT p1) p0) (AND (NOT p1) p2 p3)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2 (NOT p3)), acceptance={0} source=4 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p3))), acceptance={0} source=4 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p3))), acceptance={0} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (GEQ s968 1) (GEQ s1033 1) (GEQ s70 1) (GEQ s1179 1) (GEQ s964 1) (GEQ s1305 1) (GEQ s407 1) (GEQ s147 1) (GEQ s1281 1) (GEQ s793 1) (GEQ s1159 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 208 steps with 0 reset in 5 ms.
FORMULA CSRepetitions-PT-10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-10-LTLFireability-06 finished in 4648 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(F((p0&&(F(!p0) U (G(!p2)||p1))))))'
Support contains 1101 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 25 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 10:44:34] [INFO ] Invariant cache hit.
[2023-03-08 10:44:35] [INFO ] Implicit Places using invariants in 487 ms returned []
[2023-03-08 10:44:35] [INFO ] Invariant cache hit.
[2023-03-08 10:44:36] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 10:44:36] [INFO ] Implicit Places using invariants and state equation in 1537 ms returned []
Implicit Place search using SMT with State Equation took 2029 ms to find 0 implicit places.
[2023-03-08 10:44:36] [INFO ] Invariant cache hit.
[2023-03-08 10:44:38] [INFO ] Dead Transitions using invariants and state equation in 1776 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3833 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2)]
Running random walk in product with property : CSRepetitions-PT-10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s55 1) (GEQ s686 1)) (AND (GEQ s508 1) (GEQ s663 1)) (AND (GEQ s3 1) (GEQ s331 1)) (AND (GEQ s151 1) (GEQ s1186 1)) (AND (GEQ s1124 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 55030 steps with 2447 reset in 10001 ms.
Product exploration timeout after 55370 steps with 2501 reset in 10001 ms.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 464 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 53 resets, run finished after 945 ms. (steps per millisecond=10 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3295 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 10:45:07] [INFO ] Invariant cache hit.
[2023-03-08 10:45:13] [INFO ] After 656ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p2)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2))), (F p0), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 8 factoid took 610 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2023-03-08 10:45:16] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 1100 out of 1311 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 13 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 10:45:31] [INFO ] Invariant cache hit.
[2023-03-08 10:45:32] [INFO ] Implicit Places using invariants in 319 ms returned []
[2023-03-08 10:45:32] [INFO ] Invariant cache hit.
[2023-03-08 10:45:33] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 10:45:33] [INFO ] Implicit Places using invariants and state equation in 1545 ms returned []
Implicit Place search using SMT with State Equation took 1871 ms to find 0 implicit places.
[2023-03-08 10:45:33] [INFO ] Invariant cache hit.
[2023-03-08 10:45:36] [INFO ] Dead Transitions using invariants and state equation in 2315 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4200 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 31 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=7 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2023-03-08 10:45:40] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration timeout after 96670 steps with 4349 reset in 10001 ms.
Product exploration timeout after 97820 steps with 4369 reset in 10001 ms.
Support contains 1100 out of 1311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 170 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 10:46:15] [INFO ] Invariant cache hit.
[2023-03-08 10:46:16] [INFO ] Implicit Places using invariants in 581 ms returned []
[2023-03-08 10:46:16] [INFO ] Invariant cache hit.
[2023-03-08 10:46:17] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 10:46:17] [INFO ] Implicit Places using invariants and state equation in 1815 ms returned []
Implicit Place search using SMT with State Equation took 2410 ms to find 0 implicit places.
[2023-03-08 10:46:18] [INFO ] Redundant transitions in 136 ms returned []
[2023-03-08 10:46:18] [INFO ] Invariant cache hit.
[2023-03-08 10:46:19] [INFO ] Dead Transitions using invariants and state equation in 1693 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4437 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Treatment of property CSRepetitions-PT-10-LTLFireability-07 finished in 105527 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((X(p1)||p0))||G(p2))))'
Support contains 5 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 71 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 10:46:20] [INFO ] Invariant cache hit.
[2023-03-08 10:46:22] [INFO ] Implicit Places using invariants in 1858 ms returned []
[2023-03-08 10:46:22] [INFO ] Invariant cache hit.
[2023-03-08 10:46:23] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 10:46:26] [INFO ] Implicit Places using invariants and state equation in 4087 ms returned []
Implicit Place search using SMT with State Equation took 5962 ms to find 0 implicit places.
[2023-03-08 10:46:26] [INFO ] Invariant cache hit.
[2023-03-08 10:46:27] [INFO ] Dead Transitions using invariants and state equation in 1684 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7720 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Stuttering acceptance computed with spot in 252 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : CSRepetitions-PT-10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=3, aps=[p1:(GEQ s912 1), p0:(OR (LT s542 1) (LT s1044 1)), p2:(AND (GEQ s342 1) (GEQ s785 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1160 steps with 5 reset in 23 ms.
FORMULA CSRepetitions-PT-10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-10-LTLFireability-09 finished in 8033 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((X(F((G(!p1)||(!p1&&F(p2)))))||p0))))'
Support contains 4 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 92 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 10:46:28] [INFO ] Invariant cache hit.
[2023-03-08 10:46:29] [INFO ] Implicit Places using invariants in 1409 ms returned []
[2023-03-08 10:46:29] [INFO ] Invariant cache hit.
[2023-03-08 10:46:31] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 10:46:33] [INFO ] Implicit Places using invariants and state equation in 4258 ms returned []
Implicit Place search using SMT with State Equation took 5686 ms to find 0 implicit places.
[2023-03-08 10:46:33] [INFO ] Invariant cache hit.
[2023-03-08 10:46:35] [INFO ] Dead Transitions using invariants and state equation in 1820 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7611 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND p1 (NOT p2))]
Running random walk in product with property : CSRepetitions-PT-10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s45 1) (LT s342 1)), p1:(OR (AND (GEQ s342 1) (GEQ s783 1)) (AND (GEQ s45 1) (GEQ s342 1))), p2:(GEQ s820 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 593 reset in 1941 ms.
Product exploration explored 100000 steps with 586 reset in 2023 ms.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 576 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND p1 (NOT p2))]
Finished random walk after 48 steps, including 0 resets, run visited all 4 properties in 8 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p0 (NOT p1) p2), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (AND p1 (NOT p2))), (F (NOT p0)), (F (AND (NOT p1) (NOT p2))), (F p1)]
Knowledge based reduction with 2 factoid took 351 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND p1 (NOT p2))]
Support contains 4 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 100 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 10:46:41] [INFO ] Invariant cache hit.
[2023-03-08 10:46:42] [INFO ] Implicit Places using invariants in 1149 ms returned []
[2023-03-08 10:46:42] [INFO ] Invariant cache hit.
[2023-03-08 10:46:43] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 10:46:46] [INFO ] Implicit Places using invariants and state equation in 3983 ms returned []
Implicit Place search using SMT with State Equation took 5156 ms to find 0 implicit places.
[2023-03-08 10:46:46] [INFO ] Invariant cache hit.
[2023-03-08 10:46:48] [INFO ] Dead Transitions using invariants and state equation in 1759 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7035 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 350 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND p1 (NOT p2))]
Finished random walk after 143 steps, including 0 resets, run visited all 4 properties in 6 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND p0 (NOT p1) p2), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (AND p1 (NOT p2))), (F (NOT p0)), (F (AND (NOT p1) (NOT p2))), (F p1)]
Knowledge based reduction with 2 factoid took 359 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 594 reset in 1792 ms.
Product exploration explored 100000 steps with 601 reset in 1803 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND p1 (NOT p2))]
Support contains 4 out of 1311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 164 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 10:46:54] [INFO ] Redundant transitions in 138 ms returned []
[2023-03-08 10:46:54] [INFO ] Invariant cache hit.
[2023-03-08 10:46:56] [INFO ] Dead Transitions using invariants and state equation in 2104 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2478 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Support contains 4 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 99 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 10:46:56] [INFO ] Invariant cache hit.
[2023-03-08 10:46:57] [INFO ] Implicit Places using invariants in 1245 ms returned []
[2023-03-08 10:46:57] [INFO ] Invariant cache hit.
[2023-03-08 10:46:58] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 10:47:01] [INFO ] Implicit Places using invariants and state equation in 3961 ms returned []
Implicit Place search using SMT with State Equation took 5233 ms to find 0 implicit places.
[2023-03-08 10:47:01] [INFO ] Invariant cache hit.
[2023-03-08 10:47:03] [INFO ] Dead Transitions using invariants and state equation in 2052 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7387 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Treatment of property CSRepetitions-PT-10-LTLFireability-10 finished in 35721 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)))'
Support contains 2 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 96 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 10:47:03] [INFO ] Invariant cache hit.
[2023-03-08 10:47:05] [INFO ] Implicit Places using invariants in 1203 ms returned []
[2023-03-08 10:47:05] [INFO ] Invariant cache hit.
[2023-03-08 10:47:06] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 10:47:09] [INFO ] Implicit Places using invariants and state equation in 4052 ms returned []
Implicit Place search using SMT with State Equation took 5272 ms to find 0 implicit places.
[2023-03-08 10:47:09] [INFO ] Invariant cache hit.
[2023-03-08 10:47:10] [INFO ] Dead Transitions using invariants and state equation in 1758 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7133 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s342 1) (GEQ s916 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-10-LTLFireability-12 finished in 7235 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((G((!p0||G(p1))) U X(!p1)))))'
Support contains 3 out of 1311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 0 with 297 rules applied. Total rules applied 297 place count 1113 transition count 2201
Discarding 980 places :
Symmetric choice reduction at 0 with 980 rule applications. Total rules 1277 place count 133 transition count 1221
Iterating global reduction 0 with 980 rules applied. Total rules applied 2257 place count 133 transition count 1221
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 2346 place count 44 transition count 242
Iterating global reduction 0 with 89 rules applied. Total rules applied 2435 place count 44 transition count 242
Ensure Unique test removed 89 transitions
Reduce isomorphic transitions removed 89 transitions.
Iterating post reduction 0 with 89 rules applied. Total rules applied 2524 place count 44 transition count 153
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 2544 place count 34 transition count 143
Applied a total of 2544 rules in 313 ms. Remains 34 /1311 variables (removed 1277) and now considering 143/2300 (removed 2157) transitions.
[2023-03-08 10:47:11] [INFO ] Flow matrix only has 53 transitions (discarded 90 similar events)
// Phase 1: matrix 53 rows 34 cols
[2023-03-08 10:47:11] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-08 10:47:11] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-08 10:47:11] [INFO ] Flow matrix only has 53 transitions (discarded 90 similar events)
[2023-03-08 10:47:11] [INFO ] Invariant cache hit.
[2023-03-08 10:47:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 10:47:11] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2023-03-08 10:47:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 10:47:11] [INFO ] Flow matrix only has 53 transitions (discarded 90 similar events)
[2023-03-08 10:47:11] [INFO ] Invariant cache hit.
[2023-03-08 10:47:11] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/1311 places, 143/2300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 616 ms. Remains : 34/1311 places, 143/2300 transitions.
Stuttering acceptance computed with spot in 482 ms :[p1, false, p1, p1, false, false, false, false, false]
Running random walk in product with property : CSRepetitions-PT-10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0, 1} source=0 dest: 0}, { cond=(OR (NOT p0) p1), acceptance={0, 2} source=0 dest: 1}, { cond=(OR (NOT p0) p1), acceptance={0, 1, 2} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1, 2} source=0 dest: 3}, { cond=(AND p0 p1), acceptance={1, 2} source=0 dest: 4}], [{ cond=p1, acceptance={0, 2} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={1, 2} source=1 dest: 4}, { cond=p1, acceptance={0} source=1 dest: 5}, { cond=(AND p0 p1), acceptance={1} source=1 dest: 6}], [{ cond=p1, acceptance={0, 2} source=2 dest: 1}, { cond=p1, acceptance={0, 1, 2} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={1, 2} source=2 dest: 4}], [{ cond=p1, acceptance={0, 1} source=3 dest: 0}, { cond=p1, acceptance={0, 2} source=3 dest: 1}, { cond=p1, acceptance={0, 1, 2} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={1, 2} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={1, 2} source=4 dest: 4}, { cond=p1, acceptance={1} source=4 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={2} source=4 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={1, 2} source=4 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 2} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1, 2} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={0, 1} source=6 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 2} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=6 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1, 2} source=6 dest: 3}, { cond=(AND p0 p1), acceptance={1, 2} source=6 dest: 4}, { cond=p1, acceptance={1} source=6 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={2} source=6 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={1, 2} source=6 dest: 8}], [{ cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 5}, { cond=(AND p0 p1), acceptance={1} source=7 dest: 6}], [{ cond=(AND p0 p1), acceptance={1, 2} source=8 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={2} source=8 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={1, 2} source=8 dest: 8}]], initial=0, aps=[p0:(AND (GEQ s12 1) (GEQ s29 1)), p1:(LT s20 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 42147 steps with 6270 reset in 179 ms.
FORMULA CSRepetitions-PT-10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-10-LTLFireability-13 finished in 1309 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) U (G(X(X(G(p1)))) U p2)))'
Support contains 5 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 130 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
// Phase 1: matrix 2300 rows 1311 cols
[2023-03-08 10:47:12] [INFO ] Computed 110 place invariants in 44 ms
[2023-03-08 10:47:13] [INFO ] Implicit Places using invariants in 1433 ms returned []
[2023-03-08 10:47:13] [INFO ] Invariant cache hit.
[2023-03-08 10:47:15] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 10:47:18] [INFO ] Implicit Places using invariants and state equation in 4038 ms returned []
Implicit Place search using SMT with State Equation took 5486 ms to find 0 implicit places.
[2023-03-08 10:47:18] [INFO ] Invariant cache hit.
[2023-03-08 10:47:19] [INFO ] Dead Transitions using invariants and state equation in 1680 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7313 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Stuttering acceptance computed with spot in 324 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (AND p0 (NOT p1)), (NOT p1), true, (AND (NOT p1) p0), p0]
Running random walk in product with property : CSRepetitions-PT-10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 4}, { cond=(NOT p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (GEQ s342 1) (GEQ s521 1)), p0:(AND (GEQ s146 1) (GEQ s180 1)), p1:(GEQ s834 1)], 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]]
Entered a terminal (fully accepting) state of product in 1531 steps with 7 reset in 27 ms.
FORMULA CSRepetitions-PT-10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-10-LTLFireability-14 finished in 7687 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) U p1)&&G(p2))))'
Support contains 5 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 112 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 10:47:20] [INFO ] Invariant cache hit.
[2023-03-08 10:47:21] [INFO ] Implicit Places using invariants in 1112 ms returned []
[2023-03-08 10:47:21] [INFO ] Invariant cache hit.
[2023-03-08 10:47:22] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 10:47:25] [INFO ] Implicit Places using invariants and state equation in 3930 ms returned []
Implicit Place search using SMT with State Equation took 5066 ms to find 0 implicit places.
[2023-03-08 10:47:25] [INFO ] Invariant cache hit.
[2023-03-08 10:47:26] [INFO ] Dead Transitions using invariants and state equation in 1670 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6870 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Stuttering acceptance computed with spot in 227 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : CSRepetitions-PT-10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND p2 p1), acceptance={} source=1 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(OR (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p2:(GEQ s226 1), p1:(AND (GEQ s342 1) (GEQ s1002 1) (GEQ s226 1)), p0:(AND (GEQ s180 1) (GEQ s638 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-10-LTLFireability-15 finished in 7121 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||X(p1))))))'
Found a Shortening insensitive property : CSRepetitions-PT-10-LTLFireability-01
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 211 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 120 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 10:47:27] [INFO ] Invariant cache hit.
[2023-03-08 10:47:28] [INFO ] Implicit Places using invariants in 1055 ms returned []
[2023-03-08 10:47:28] [INFO ] Invariant cache hit.
[2023-03-08 10:47:29] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 10:47:31] [INFO ] Implicit Places using invariants and state equation in 3112 ms returned []
Implicit Place search using SMT with State Equation took 4195 ms to find 0 implicit places.
[2023-03-08 10:47:31] [INFO ] Invariant cache hit.
[2023-03-08 10:47:33] [INFO ] Dead Transitions using invariants and state equation in 1650 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 5978 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Running random walk in product with property : CSRepetitions-PT-10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(AND (OR (LT s156 1) (LT s342 1)) (OR (LT s342 1) (LT s1124 1)) (OR (LT s342 1) (LT s1193 1)) (OR (LT s342 1) (LT s925 1)) (OR (LT s98 1) (LT s342 1)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 21804 reset in 4695 ms.
Product exploration explored 100000 steps with 21634 reset in 4682 ms.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 28 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND p0 p1), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 176 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 211 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 83 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 10:47:44] [INFO ] Invariant cache hit.
[2023-03-08 10:47:45] [INFO ] Implicit Places using invariants in 1009 ms returned []
[2023-03-08 10:47:45] [INFO ] Invariant cache hit.
[2023-03-08 10:47:46] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 10:47:48] [INFO ] Implicit Places using invariants and state equation in 3128 ms returned []
Implicit Place search using SMT with State Equation took 4167 ms to find 0 implicit places.
[2023-03-08 10:47:48] [INFO ] Invariant cache hit.
[2023-03-08 10:47:49] [INFO ] Dead Transitions using invariants and state equation in 1781 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6034 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 202 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 304 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 24 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 21851 reset in 4315 ms.
Product exploration explored 100000 steps with 21534 reset in 4357 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 211 out of 1311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 119 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 10:48:00] [INFO ] Redundant transitions in 136 ms returned []
[2023-03-08 10:48:00] [INFO ] Invariant cache hit.
[2023-03-08 10:48:02] [INFO ] Dead Transitions using invariants and state equation in 1684 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1957 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Support contains 211 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 74 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 10:48:02] [INFO ] Invariant cache hit.
[2023-03-08 10:48:03] [INFO ] Implicit Places using invariants in 916 ms returned []
[2023-03-08 10:48:03] [INFO ] Invariant cache hit.
[2023-03-08 10:48:04] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 10:48:06] [INFO ] Implicit Places using invariants and state equation in 3104 ms returned []
Implicit Place search using SMT with State Equation took 4063 ms to find 0 implicit places.
[2023-03-08 10:48:06] [INFO ] Invariant cache hit.
[2023-03-08 10:48:07] [INFO ] Dead Transitions using invariants and state equation in 1547 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5686 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Treatment of property CSRepetitions-PT-10-LTLFireability-01 finished in 40684 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((F(!p0)&&G(F(p1)))))'
Found a Shortening insensitive property : CSRepetitions-PT-10-LTLFireability-03
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, (NOT p1), (NOT p1)]
Support contains 1200 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 29 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 10:48:08] [INFO ] Invariant cache hit.
[2023-03-08 10:48:08] [INFO ] Implicit Places using invariants in 300 ms returned []
[2023-03-08 10:48:08] [INFO ] Invariant cache hit.
[2023-03-08 10:48:09] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 10:48:09] [INFO ] Implicit Places using invariants and state equation in 1470 ms returned []
Implicit Place search using SMT with State Equation took 1801 ms to find 0 implicit places.
[2023-03-08 10:48:10] [INFO ] Invariant cache hit.
[2023-03-08 10:48:11] [INFO ] Dead Transitions using invariants and state equation in 1657 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3499 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Running random walk in product with property : CSRepetitions-PT-10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s55 1) (GEQ s686 1)) (AND (GEQ s508 1) (GEQ s663 1)) (AND (GEQ s3 1) (GEQ s331 1)) (AND (GEQ s151 1) (GEQ s1186 1)) (AND (GEQ s1124 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1112 reset in 1938 ms.
Product exploration explored 100000 steps with 1134 reset in 2012 ms.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 255 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Finished random walk after 26 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 251 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Support contains 100 out of 1311 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 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 58 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 10:48:17] [INFO ] Invariant cache hit.
[2023-03-08 10:48:17] [INFO ] Implicit Places using invariants in 269 ms returned []
[2023-03-08 10:48:17] [INFO ] Invariant cache hit.
[2023-03-08 10:48:18] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 10:48:19] [INFO ] Implicit Places using invariants and state equation in 1481 ms returned []
Implicit Place search using SMT with State Equation took 1780 ms to find 0 implicit places.
[2023-03-08 10:48:19] [INFO ] Redundant transitions in 137 ms returned []
[2023-03-08 10:48:19] [INFO ] Invariant cache hit.
[2023-03-08 10:48:20] [INFO ] Dead Transitions using invariants and state equation in 1655 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3639 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [p1, (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [p1, (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 285 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1153 reset in 1843 ms.
Product exploration explored 100000 steps with 1145 reset in 1920 ms.
Support contains 100 out of 1311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 0 with 300 rules applied. Total rules applied 300 place count 1111 transition count 2200
Discarding 990 places :
Symmetric choice reduction at 0 with 990 rule applications. Total rules 1290 place count 121 transition count 1210
Iterating global reduction 0 with 990 rules applied. Total rules applied 2280 place count 121 transition count 1210
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 2310 place count 101 transition count 1200
Ensure Unique test removed 900 transitions
Reduce isomorphic transitions removed 900 transitions.
Iterating post reduction 0 with 900 rules applied. Total rules applied 3210 place count 101 transition count 300
Applied a total of 3210 rules in 199 ms. Remains 101 /1311 variables (removed 1210) and now considering 300/2300 (removed 2000) transitions.
// Phase 1: matrix 300 rows 101 cols
[2023-03-08 10:48:25] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-08 10:48:25] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-08 10:48:25] [INFO ] Invariant cache hit.
[2023-03-08 10:48:26] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2023-03-08 10:48:26] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 10:48:26] [INFO ] Invariant cache hit.
[2023-03-08 10:48:26] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/1311 places, 300/2300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 695 ms. Remains : 101/1311 places, 300/2300 transitions.
Treatment of property CSRepetitions-PT-10-LTLFireability-03 finished in 18581 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(F((p0&&(F(!p0) U (G(!p2)||p1))))))'
Found a Shortening insensitive property : CSRepetitions-PT-10-LTLFireability-07
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2)]
Support contains 1101 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 24 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
// Phase 1: matrix 2300 rows 1311 cols
[2023-03-08 10:48:26] [INFO ] Computed 110 place invariants in 23 ms
[2023-03-08 10:48:27] [INFO ] Implicit Places using invariants in 511 ms returned []
[2023-03-08 10:48:27] [INFO ] Invariant cache hit.
[2023-03-08 10:48:28] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 10:48:28] [INFO ] Implicit Places using invariants and state equation in 1444 ms returned []
Implicit Place search using SMT with State Equation took 1964 ms to find 0 implicit places.
[2023-03-08 10:48:28] [INFO ] Invariant cache hit.
[2023-03-08 10:48:30] [INFO ] Dead Transitions using invariants and state equation in 1689 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3692 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Running random walk in product with property : CSRepetitions-PT-10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s55 1) (GEQ s686 1)) (AND (GEQ s508 1) (GEQ s663 1)) (AND (GEQ s3 1) (GEQ s331 1)) (AND (GEQ s151 1) (GEQ s1186 1)) (AND (GEQ s1124 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 56800 steps with 2550 reset in 10001 ms.
Product exploration timeout after 56570 steps with 2537 reset in 10001 ms.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 262 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 56 resets, run finished after 922 ms. (steps per millisecond=10 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3853 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 10:48:59] [INFO ] Invariant cache hit.
[2023-03-08 10:49:02] [INFO ] After 494ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p2)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2))), (F p0), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 8 factoid took 518 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
[2023-03-08 10:49:06] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 1100 out of 1311 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 10 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 10:49:21] [INFO ] Invariant cache hit.
[2023-03-08 10:49:21] [INFO ] Implicit Places using invariants in 280 ms returned []
[2023-03-08 10:49:21] [INFO ] Invariant cache hit.
[2023-03-08 10:49:22] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 10:49:23] [INFO ] Implicit Places using invariants and state equation in 1473 ms returned []
Implicit Place search using SMT with State Equation took 1755 ms to find 0 implicit places.
[2023-03-08 10:49:23] [INFO ] Invariant cache hit.
[2023-03-08 10:49:24] [INFO ] Dead Transitions using invariants and state equation in 1872 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3638 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 31 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=7 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2023-03-08 10:49:28] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration timeout after 97320 steps with 4344 reset in 10001 ms.
Product exploration explored 100000 steps with 4538 reset in 9955 ms.
Support contains 1100 out of 1311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 63 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2023-03-08 10:50:04] [INFO ] Invariant cache hit.
[2023-03-08 10:50:04] [INFO ] Implicit Places using invariants in 296 ms returned []
[2023-03-08 10:50:04] [INFO ] Invariant cache hit.
[2023-03-08 10:50:05] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 10:50:05] [INFO ] Implicit Places using invariants and state equation in 1464 ms returned []
Implicit Place search using SMT with State Equation took 1780 ms to find 0 implicit places.
[2023-03-08 10:50:05] [INFO ] Redundant transitions in 137 ms returned []
[2023-03-08 10:50:05] [INFO ] Invariant cache hit.
[2023-03-08 10:50:07] [INFO ] Dead Transitions using invariants and state equation in 2040 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4036 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Treatment of property CSRepetitions-PT-10-LTLFireability-07 finished in 101936 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((X(F((G(!p1)||(!p1&&F(p2)))))||p0))))'
Found a Lengthening insensitive property : CSRepetitions-PT-10-LTLFireability-10
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND p1 (NOT p2))]
Support contains 4 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 1 ms
Reduce places removed 194 places and 0 transitions.
Iterating global reduction 0 with 291 rules applied. Total rules applied 291 place count 1117 transition count 2203
Discarding 960 places :
Symmetric choice reduction at 0 with 960 rule applications. Total rules 1251 place count 157 transition count 1243
Iterating global reduction 0 with 960 rules applied. Total rules applied 2211 place count 157 transition count 1243
Discarding 88 places :
Symmetric choice reduction at 0 with 88 rule applications. Total rules 2299 place count 69 transition count 275
Iterating global reduction 0 with 88 rules applied. Total rules applied 2387 place count 69 transition count 275
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 0 with 88 rules applied. Total rules applied 2475 place count 69 transition count 187
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 2495 place count 59 transition count 177
Applied a total of 2495 rules in 169 ms. Remains 59 /1311 variables (removed 1252) and now considering 177/2300 (removed 2123) transitions.
[2023-03-08 10:50:08] [INFO ] Flow matrix only has 96 transitions (discarded 81 similar events)
// Phase 1: matrix 96 rows 59 cols
[2023-03-08 10:50:08] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-08 10:50:08] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-08 10:50:08] [INFO ] Flow matrix only has 96 transitions (discarded 81 similar events)
[2023-03-08 10:50:08] [INFO ] Invariant cache hit.
[2023-03-08 10:50:08] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 10:50:08] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2023-03-08 10:50:08] [INFO ] Flow matrix only has 96 transitions (discarded 81 similar events)
[2023-03-08 10:50:08] [INFO ] Invariant cache hit.
[2023-03-08 10:50:09] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 59/1311 places, 177/2300 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 450 ms. Remains : 59/1311 places, 177/2300 transitions.
Running random walk in product with property : CSRepetitions-PT-10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s12 1)), p1:(OR (AND (GEQ s12 1) (GEQ s35 1)) (AND (GEQ s1 1) (GEQ s12 1))), p2:(GEQ s37 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2520 reset in 266 ms.
Stack based approach found an accepted trace after 55 steps with 0 reset with depth 56 and stack size 56 in 0 ms.
Treatment of property CSRepetitions-PT-10-LTLFireability-10 finished in 1001 ms.
FORMULA CSRepetitions-PT-10-LTLFireability-10 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-08 10:50:09] [INFO ] Flatten gal took : 154 ms
[2023-03-08 10:50:09] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 68 ms.
[2023-03-08 10:50:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1311 places, 2300 transitions and 8700 arcs took 12 ms.
Total runtime 415920 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2330/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2330/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 892 seconds
MemTotal: 16393216 kB
MemFree: 11700740 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16068260 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2330/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 892 seconds
MemTotal: 16393216 kB
MemFree: 10664936 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16060392 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2330/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CSRepetitions-PT-10-LTLFireability-01
Could not compute solution for formula : CSRepetitions-PT-10-LTLFireability-03
Could not compute solution for formula : CSRepetitions-PT-10-LTLFireability-07
Could not compute solution for formula : CSRepetitions-PT-10-LTLFireability-10

BK_STOP 1678274399848

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name CSRepetitions-PT-10-LTLFireability-01
ltl formula formula --ltl=/tmp/2330/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1311 places, 2300 transitions and 8700 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.280 real 0.100 user 0.070 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2330/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2330/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2330/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2330/ltl_0_
terminate called after throwing an instance of 'std::runtime_error'
what(): too many children for formula
ltl formula name CSRepetitions-PT-10-LTLFireability-03
ltl formula formula --ltl=/tmp/2330/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1311 places, 2300 transitions and 8700 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2330/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2330/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2330/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.680 real 0.100 user 0.110 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2330/ltl_1_
Killing (15) : 2343 2344 2345 2346 2347
Killing (9) : 2343 2344 2345 2346 2347
ltl formula name CSRepetitions-PT-10-LTLFireability-07
ltl formula formula --ltl=/tmp/2330/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1311 places, 2300 transitions and 8700 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.260 real 0.080 user 0.100 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2330/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2330/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2330/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2330/ltl_2_
Killing (15) : 2412 2413 2414 2415 2416
Killing (9) : 2412 2413 2414 2415 2416
ltl formula name CSRepetitions-PT-10-LTLFireability-10
ltl formula formula --ltl=/tmp/2330/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1311 places, 2300 transitions and 8700 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.250 real 0.090 user 0.070 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2330/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2330/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2330/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2330/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size

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-PT-10"
export BK_EXAMINATION="LTLFireability"
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-PT-10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r073-smll-167814399100092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-PT-10.tgz
mv CSRepetitions-PT-10 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;