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.r009-oct2-167813598300732.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 BART-COL-040, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813598300732
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 9.4K Feb 26 06:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 26 06:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 04:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 04:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 09:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 26 09:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 07:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 26 07:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 207K 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 BART-COL-040-LTLFireability-00
FORMULA_NAME BART-COL-040-LTLFireability-01
FORMULA_NAME BART-COL-040-LTLFireability-02
FORMULA_NAME BART-COL-040-LTLFireability-03
FORMULA_NAME BART-COL-040-LTLFireability-04
FORMULA_NAME BART-COL-040-LTLFireability-05
FORMULA_NAME BART-COL-040-LTLFireability-06
FORMULA_NAME BART-COL-040-LTLFireability-07
FORMULA_NAME BART-COL-040-LTLFireability-08
FORMULA_NAME BART-COL-040-LTLFireability-09
FORMULA_NAME BART-COL-040-LTLFireability-10
FORMULA_NAME BART-COL-040-LTLFireability-11
FORMULA_NAME BART-COL-040-LTLFireability-12
FORMULA_NAME BART-COL-040-LTLFireability-13
FORMULA_NAME BART-COL-040-LTLFireability-14
FORMULA_NAME BART-COL-040-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678644011865

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=BART-COL-040
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 18:00:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 18:00:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 18:00:15] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-12 18:00:15] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-12 18:00:15] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 801 ms
[2023-03-12 18:00:15] [INFO ] Detected 3 constant HL places corresponding to 10373 PT places.
[2023-03-12 18:00:15] [INFO ] Imported 4 HL places and 7 HL transitions for a total of 20213 PT places and 5.628918048E10 transition bindings in 112 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
[2023-03-12 18:00:16] [INFO ] Built PT skeleton of HLPN with 4 places and 7 transitions 26 arcs in 25 ms.
[2023-03-12 18:00:16] [INFO ] Skeletonized 1 HLPN properties in 1 ms. Removed 15 properties that had guard overlaps.
Computed a total of 4 stabilizing places and 2 stable transitions
All 16 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Domain [distance(41), speed(6), distance(41)] of place NewDistTable breaks symmetries in sort distance
Symmetric sort wr.t. initial and guards and successors and join/free detected :trainid
Symmetric sort wr.t. initial detected :trainid
Symmetric sort wr.t. initial and guards detected :trainid
Applying symmetric unfolding of full symmetric sort :trainid domain size was 40
Arc [2:1*[(MOD (ADD $tsp 1) 6), $ds2]] contains successor/predecessor on variables of sort speed
[2023-03-12 18:00:16] [INFO ] Unfolded HLPN to a Petri net with 10619 places and 323 transitions 601 arcs in 266 ms.
[2023-03-12 18:00:16] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
[2023-03-12 18:00:16] [INFO ] Reduced 35 identical enabling conditions.
Deduced a syphon composed of 10215 places in 2 ms
Reduce places removed 10487 places and 121 transitions.
FORMULA BART-COL-040-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-040-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-040-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 132 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 6 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2023-03-12 18:00:16] [INFO ] Computed 1 place invariants in 23 ms
[2023-03-12 18:00:16] [INFO ] Implicit Places using invariants in 297 ms returned []
[2023-03-12 18:00:16] [INFO ] Invariant cache hit.
[2023-03-12 18:00:17] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
[2023-03-12 18:00:17] [INFO ] Invariant cache hit.
[2023-03-12 18:00:17] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 665 ms. Remains : 132/132 places, 202/202 transitions.
Support contains 132 out of 132 places after structural reductions.
[2023-03-12 18:00:17] [INFO ] Flatten gal took : 67 ms
[2023-03-12 18:00:17] [INFO ] Flatten gal took : 27 ms
[2023-03-12 18:00:17] [INFO ] Input system was already deterministic with 202 transitions.
Finished random walk after 370 steps, including 0 resets, run visited all 7 properties in 28 ms. (steps per millisecond=13 )
FORMULA BART-COL-040-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(!p0)&&p1)) U (G(X((p1&&G(!p0))))||(X((p1&&G(!p0)))&&(!p0||X((p1 U p0)))))))'
Support contains 97 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-12 18:00:18] [INFO ] Invariant cache hit.
[2023-03-12 18:00:18] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-12 18:00:18] [INFO ] Invariant cache hit.
[2023-03-12 18:00:18] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2023-03-12 18:00:18] [INFO ] Invariant cache hit.
[2023-03-12 18:00:18] [INFO ] Dead Transitions using invariants and state equation in 532 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 760 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 482 ms :[true, (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), p0]
Running random walk in product with property : BART-COL-040-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(OR p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(OR p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (GEQ s98 1) (GEQ s49 1) (GEQ s102 1) (GEQ s53 1) (GEQ s106 1) (GEQ s57 1) (GEQ s61 1) (GEQ s65 1) (GEQ s69 1) (GEQ s8 1) (GEQ s73 1) (GEQ s12 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA BART-COL-040-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-040-LTLFireability-01 finished in 1330 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)))'
Support contains 9 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 109 transition count 179
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 109 transition count 179
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 65 place count 90 transition count 160
Iterating global reduction 0 with 19 rules applied. Total rules applied 84 place count 90 transition count 160
Applied a total of 84 rules in 22 ms. Remains 90 /132 variables (removed 42) and now considering 160/202 (removed 42) transitions.
// Phase 1: matrix 160 rows 90 cols
[2023-03-12 18:00:19] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-12 18:00:19] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-12 18:00:19] [INFO ] Invariant cache hit.
[2023-03-12 18:00:19] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2023-03-12 18:00:19] [INFO ] Invariant cache hit.
[2023-03-12 18:00:19] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/132 places, 160/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 257 ms. Remains : 90/132 places, 160/202 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-040-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s42 1) (GEQ s88 1) (GEQ s87 1) (GEQ s86 1) (GEQ s85 1) (GEQ s77 1) (GEQ s78 1) (GEQ s79 1) (GEQ s41 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][false, false]]
Product exploration explored 100000 steps with 1765 reset in 457 ms.
Product exploration explored 100000 steps with 1755 reset in 355 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 195 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 54 ms :[(NOT p0)]
Finished random walk after 165 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=82 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 192 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 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
[2023-03-12 18:00:20] [INFO ] Invariant cache hit.
[2023-03-12 18:00:21] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 18:00:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:00:21] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-12 18:00:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 18:00:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 18:00:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 18:00:21] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2023-03-12 18:00:21] [INFO ] Computed and/alt/rep : 124/228/124 causal constraints (skipped 0 transitions) in 17 ms.
[2023-03-12 18:00:21] [INFO ] Added : 92 causal constraints over 19 iterations in 314 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 9 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 160/160 transitions.
Graph (trivial) has 141 edges and 90 vertex of which 41 / 90 are part of one of the 1 SCC in 3 ms
Free SCC test removed 40 places
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 50 transition count 75
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 25 rules applied. Total rules applied 36 place count 40 transition count 60
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 15 rules applied. Total rules applied 51 place count 34 transition count 51
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 12 rules applied. Total rules applied 63 place count 30 transition count 43
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 12 rules applied. Total rules applied 75 place count 26 transition count 35
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 10 rules applied. Total rules applied 85 place count 22 transition count 29
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 88 place count 19 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 89 place count 19 transition count 28
Applied a total of 89 rules in 29 ms. Remains 19 /90 variables (removed 71) and now considering 28/160 (removed 132) transitions.
// Phase 1: matrix 28 rows 19 cols
[2023-03-12 18:00:21] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-12 18:00:21] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-12 18:00:21] [INFO ] Invariant cache hit.
[2023-03-12 18:00:21] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-12 18:00:21] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 18:00:21] [INFO ] Invariant cache hit.
[2023-03-12 18:00:21] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/90 places, 28/160 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 148 ms. Remains : 19/90 places, 28/160 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 185 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 60 ms :[(NOT p0)]
Finished random walk after 42 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=42 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 253 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 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
[2023-03-12 18:00:22] [INFO ] Invariant cache hit.
[2023-03-12 18:00:22] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 18:00:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:00:22] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-12 18:00:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 18:00:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 18:00:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 18:00:22] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-12 18:00:22] [INFO ] Computed and/alt/rep : 18/25/18 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 18:00:22] [INFO ] Added : 2 causal constraints over 1 iterations in 34 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-COL-040-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-040-LTLFireability-03 finished in 3468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 77 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 132 transition count 178
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 108 transition count 178
Applied a total of 48 rules in 29 ms. Remains 108 /132 variables (removed 24) and now considering 178/202 (removed 24) transitions.
// Phase 1: matrix 178 rows 108 cols
[2023-03-12 18:00:22] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-12 18:00:22] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-12 18:00:22] [INFO ] Invariant cache hit.
[2023-03-12 18:00:22] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2023-03-12 18:00:22] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-12 18:00:22] [INFO ] Invariant cache hit.
[2023-03-12 18:00:22] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/132 places, 178/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 249 ms. Remains : 108/132 places, 178/202 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-040-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s41 1) (GEQ s87 1) (GEQ s86 1) (GEQ s85 1) (GEQ s84 1) (GEQ s53 1) (GEQ s54 1) (GEQ s55 1) (GEQ s40 1) (GEQ s44 1) (GEQ s42 1) (GEQ s1 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4 reset in 220 ms.
Product exploration explored 100000 steps with 5 reset in 265 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 234 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 85 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 177 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 116 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
[2023-03-12 18:00:24] [INFO ] Invariant cache hit.
[2023-03-12 18:00:24] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 18:00:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:00:24] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2023-03-12 18:00:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 18:00:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 18:00:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 18:00:24] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2023-03-12 18:00:24] [INFO ] Computed and/alt/rep : 142/246/142 causal constraints (skipped 0 transitions) in 21 ms.
[2023-03-12 18:00:25] [INFO ] Added : 59 causal constraints over 12 iterations in 188 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 77 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 178/178 transitions.
Applied a total of 0 rules in 9 ms. Remains 108 /108 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2023-03-12 18:00:25] [INFO ] Invariant cache hit.
[2023-03-12 18:00:25] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-12 18:00:25] [INFO ] Invariant cache hit.
[2023-03-12 18:00:25] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-03-12 18:00:25] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-12 18:00:25] [INFO ] Invariant cache hit.
[2023-03-12 18:00:25] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 214 ms. Remains : 108/108 places, 178/178 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 119 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 83 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 231 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 120 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0)]
[2023-03-12 18:00:26] [INFO ] Invariant cache hit.
[2023-03-12 18:00:26] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-12 18:00:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:00:26] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2023-03-12 18:00:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 18:00:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 18:00:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 18:00:26] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2023-03-12 18:00:26] [INFO ] Computed and/alt/rep : 142/246/142 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-12 18:00:26] [INFO ] Added : 59 causal constraints over 12 iterations in 260 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 234 ms.
Product exploration explored 100000 steps with 0 reset in 221 ms.
Support contains 77 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 178/178 transitions.
Applied a total of 0 rules in 4 ms. Remains 108 /108 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2023-03-12 18:00:27] [INFO ] Invariant cache hit.
[2023-03-12 18:00:27] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-12 18:00:27] [INFO ] Invariant cache hit.
[2023-03-12 18:00:27] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2023-03-12 18:00:27] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-12 18:00:27] [INFO ] Invariant cache hit.
[2023-03-12 18:00:27] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 229 ms. Remains : 108/108 places, 178/178 transitions.
Treatment of property BART-COL-040-LTLFireability-04 finished in 5142 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' '!((p0 U G(!p0)))'
Support contains 1 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 132 transition count 138
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 68 transition count 138
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 128 place count 68 transition count 134
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 136 place count 64 transition count 134
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 142 place count 58 transition count 128
Iterating global reduction 2 with 6 rules applied. Total rules applied 148 place count 58 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 149 place count 58 transition count 127
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 153 place count 54 transition count 123
Iterating global reduction 3 with 4 rules applied. Total rules applied 157 place count 54 transition count 123
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 160 place count 51 transition count 120
Iterating global reduction 3 with 3 rules applied. Total rules applied 163 place count 51 transition count 120
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 166 place count 48 transition count 117
Iterating global reduction 3 with 3 rules applied. Total rules applied 169 place count 48 transition count 117
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 171 place count 46 transition count 115
Iterating global reduction 3 with 2 rules applied. Total rules applied 173 place count 46 transition count 115
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 175 place count 44 transition count 113
Iterating global reduction 3 with 2 rules applied. Total rules applied 177 place count 44 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 178 place count 43 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 179 place count 43 transition count 112
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 193 place count 36 transition count 105
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 197 place count 36 transition count 101
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 201 place count 34 transition count 99
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 205 place count 34 transition count 95
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 209 place count 32 transition count 93
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 213 place count 32 transition count 89
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 217 place count 30 transition count 87
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 221 place count 30 transition count 83
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 225 place count 28 transition count 81
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 229 place count 28 transition count 77
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 233 place count 26 transition count 75
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 237 place count 26 transition count 71
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 241 place count 24 transition count 69
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 245 place count 24 transition count 65
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 249 place count 22 transition count 63
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 253 place count 22 transition count 59
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 257 place count 20 transition count 57
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 261 place count 20 transition count 53
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 265 place count 18 transition count 51
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 269 place count 18 transition count 47
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 273 place count 16 transition count 45
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 277 place count 16 transition count 41
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 281 place count 14 transition count 39
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 285 place count 14 transition count 35
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 289 place count 12 transition count 33
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 293 place count 12 transition count 29
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 297 place count 10 transition count 27
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 301 place count 10 transition count 23
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 305 place count 8 transition count 21
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 309 place count 8 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 313 place count 6 transition count 15
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 317 place count 6 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 321 place count 4 transition count 9
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 19 with 5 rules applied. Total rules applied 326 place count 4 transition count 4
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 328 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 1 Pre rules applied. Total rules applied 328 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 330 place count 2 transition count 2
Applied a total of 330 rules in 22 ms. Remains 2 /132 variables (removed 130) and now considering 2/202 (removed 200) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-12 18:00:27] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-12 18:00:27] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-12 18:00:27] [INFO ] Invariant cache hit.
[2023-03-12 18:00:27] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2023-03-12 18:00:28] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 18:00:28] [INFO ] Invariant cache hit.
[2023-03-12 18:00:28] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/132 places, 2/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 147 ms. Remains : 2/132 places, 2/202 transitions.
Stuttering acceptance computed with spot in 111 ms :[p0, true, p0]
Running random walk in product with property : BART-COL-040-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA BART-COL-040-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-040-LTLFireability-06 finished in 271 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((G(p0)&&(p0 U !p1)))))'
Support contains 89 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 123 transition count 193
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 123 transition count 193
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 117 transition count 187
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 117 transition count 187
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 114 transition count 184
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 114 transition count 184
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 111 transition count 181
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 111 transition count 181
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 108 transition count 178
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 108 transition count 178
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 105 transition count 175
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 105 transition count 175
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 103 transition count 173
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 103 transition count 173
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 101 transition count 171
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 101 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 100 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 100 transition count 170
Applied a total of 64 rules in 21 ms. Remains 100 /132 variables (removed 32) and now considering 170/202 (removed 32) transitions.
// Phase 1: matrix 170 rows 100 cols
[2023-03-12 18:00:28] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-12 18:00:28] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-12 18:00:28] [INFO ] Invariant cache hit.
[2023-03-12 18:00:28] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2023-03-12 18:00:28] [INFO ] Invariant cache hit.
[2023-03-12 18:00:28] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 100/132 places, 170/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 243 ms. Remains : 100/132 places, 170/202 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : BART-COL-040-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s86 1) (GEQ s44 1) (GEQ s90 1) (GEQ s48 1) (GEQ s94 1) (GEQ s52 1) (GEQ s56 1) (GEQ s60 1) (GEQ s64 1) (GEQ s8 1) (GEQ s68 1) (GEQ s12 1) (GEQ...], 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 97 reset in 431 ms.
Stack based approach found an accepted trace after 19681 steps with 12 reset with depth 5154 and stack size 5153 in 70 ms.
FORMULA BART-COL-040-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-040-LTLFireability-07 finished in 959 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 98 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 132 transition count 201
Reduce places removed 1 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 9 rules applied. Total rules applied 10 place count 131 transition count 193
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 18 place count 123 transition count 193
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 46 place count 109 transition count 179
Applied a total of 46 rules in 5 ms. Remains 109 /132 variables (removed 23) and now considering 179/202 (removed 23) transitions.
// Phase 1: matrix 179 rows 109 cols
[2023-03-12 18:00:29] [INFO ] Computed 1 place invariants in 4 ms
[2023-03-12 18:00:29] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-12 18:00:29] [INFO ] Invariant cache hit.
[2023-03-12 18:00:29] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2023-03-12 18:00:29] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 18:00:29] [INFO ] Invariant cache hit.
[2023-03-12 18:00:29] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/132 places, 179/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 233 ms. Remains : 109/132 places, 179/202 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-040-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s1 1) (AND (OR (GEQ s91 1) (GEQ s44 1) (GEQ s95 1) (GEQ s48 1) (GEQ s99 1) (GEQ s52 1) (GEQ s56 1) (GEQ s60 1) (GEQ s64 1) (GEQ s5 1) (GEQ s68...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2245 reset in 385 ms.
Product exploration explored 100000 steps with 2257 reset in 391 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 188 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 62 ms :[(NOT p0), (NOT p0)]
Finished random walk after 288 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=144 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 145 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 99 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
[2023-03-12 18:00:30] [INFO ] Invariant cache hit.
[2023-03-12 18:00:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 18:00:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:00:31] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2023-03-12 18:00:31] [INFO ] Computed and/alt/rep : 143/247/143 causal constraints (skipped 0 transitions) in 27 ms.
[2023-03-12 18:00:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 18:00:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 18:00:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 18:00:31] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-12 18:00:31] [INFO ] Computed and/alt/rep : 143/247/143 causal constraints (skipped 0 transitions) in 24 ms.
[2023-03-12 18:00:32] [INFO ] Added : 140 causal constraints over 28 iterations in 669 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 98 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 179/179 transitions.
Applied a total of 0 rules in 2 ms. Remains 109 /109 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2023-03-12 18:00:32] [INFO ] Invariant cache hit.
[2023-03-12 18:00:32] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-12 18:00:32] [INFO ] Invariant cache hit.
[2023-03-12 18:00:32] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2023-03-12 18:00:32] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 18:00:32] [INFO ] Invariant cache hit.
[2023-03-12 18:00:32] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 288 ms. Remains : 109/109 places, 179/179 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 132 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 117 ms :[(NOT p0), (NOT p0)]
Finished random walk after 411 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=137 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 261 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 102 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
[2023-03-12 18:00:33] [INFO ] Invariant cache hit.
[2023-03-12 18:00:33] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 18:00:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:00:33] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-12 18:00:33] [INFO ] Computed and/alt/rep : 143/247/143 causal constraints (skipped 0 transitions) in 17 ms.
[2023-03-12 18:00:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 18:00:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 18:00:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 18:00:34] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2023-03-12 18:00:34] [INFO ] Computed and/alt/rep : 143/247/143 causal constraints (skipped 0 transitions) in 34 ms.
[2023-03-12 18:00:34] [INFO ] Added : 140 causal constraints over 28 iterations in 738 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2071 reset in 332 ms.
Product exploration explored 100000 steps with 2249 reset in 366 ms.
Support contains 98 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 179/179 transitions.
Applied a total of 0 rules in 2 ms. Remains 109 /109 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2023-03-12 18:00:35] [INFO ] Invariant cache hit.
[2023-03-12 18:00:35] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-12 18:00:35] [INFO ] Invariant cache hit.
[2023-03-12 18:00:35] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2023-03-12 18:00:35] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 18:00:35] [INFO ] Invariant cache hit.
[2023-03-12 18:00:35] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 244 ms. Remains : 109/109 places, 179/179 transitions.
Treatment of property BART-COL-040-LTLFireability-09 finished in 6768 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 68 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 132 transition count 199
Reduce places removed 3 places and 0 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Iterating post reduction 1 with 30 rules applied. Total rules applied 33 place count 129 transition count 172
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 60 place count 102 transition count 172
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 101 transition count 171
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 101 transition count 171
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 70 place count 97 transition count 167
Applied a total of 70 rules in 6 ms. Remains 97 /132 variables (removed 35) and now considering 167/202 (removed 35) transitions.
// Phase 1: matrix 167 rows 97 cols
[2023-03-12 18:00:35] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 18:00:35] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-12 18:00:35] [INFO ] Invariant cache hit.
[2023-03-12 18:00:36] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2023-03-12 18:00:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 18:00:36] [INFO ] Invariant cache hit.
[2023-03-12 18:00:36] [INFO ] Dead Transitions using invariants and state equation in 474 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/132 places, 167/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 677 ms. Remains : 97/132 places, 167/202 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : BART-COL-040-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s44 1) (LT s42 1) (LT s1 1) (LT s3 1) (LT s5 1) (LT s7 1) (LT s9 1) (LT s79 1) (LT s11 1) (LT s77 1) (LT s13 1) (LT s83 1) (LT s15 1) (LT s81 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 167 ms.
Stack based approach found an accepted trace after 2259 steps with 0 reset with depth 2260 and stack size 2260 in 4 ms.
FORMULA BART-COL-040-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-040-LTLFireability-10 finished in 905 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)||G(!p1))))'
Support contains 89 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 132 transition count 200
Reduce places removed 2 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 11 rules applied. Total rules applied 13 place count 130 transition count 191
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 22 place count 121 transition count 191
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 22 place count 121 transition count 187
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 30 place count 117 transition count 187
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 36 place count 111 transition count 181
Iterating global reduction 3 with 6 rules applied. Total rules applied 42 place count 111 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 43 place count 111 transition count 180
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 46 place count 108 transition count 177
Iterating global reduction 4 with 3 rules applied. Total rules applied 49 place count 108 transition count 177
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 52 place count 105 transition count 174
Iterating global reduction 4 with 3 rules applied. Total rules applied 55 place count 105 transition count 174
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 58 place count 102 transition count 171
Iterating global reduction 4 with 3 rules applied. Total rules applied 61 place count 102 transition count 171
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 63 place count 100 transition count 169
Iterating global reduction 4 with 2 rules applied. Total rules applied 65 place count 100 transition count 169
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 67 place count 98 transition count 167
Iterating global reduction 4 with 2 rules applied. Total rules applied 69 place count 98 transition count 167
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 70 place count 97 transition count 166
Iterating global reduction 4 with 1 rules applied. Total rules applied 71 place count 97 transition count 166
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 83 place count 91 transition count 160
Applied a total of 83 rules in 9 ms. Remains 91 /132 variables (removed 41) and now considering 160/202 (removed 42) transitions.
// Phase 1: matrix 160 rows 91 cols
[2023-03-12 18:00:36] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 18:00:36] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-12 18:00:36] [INFO ] Invariant cache hit.
[2023-03-12 18:00:36] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-03-12 18:00:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 18:00:36] [INFO ] Invariant cache hit.
[2023-03-12 18:00:36] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/132 places, 160/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 195 ms. Remains : 91/132 places, 160/202 transitions.
Stuttering acceptance computed with spot in 31 ms :[(AND p0 p1)]
Running random walk in product with property : BART-COL-040-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s81 1) (GEQ s40 1) (GEQ s85 1) (GEQ s44 1) (GEQ s89 1) (GEQ s48 1) (GEQ s52 1) (GEQ s56 1) (GEQ s60 1) (GEQ s5 1) (GEQ s64 1) (GEQ s9 1) (GEQ ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 445 ms.
Stack based approach found an accepted trace after 328 steps with 0 reset with depth 329 and stack size 328 in 1 ms.
FORMULA BART-COL-040-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-040-LTLFireability-11 finished in 682 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)||X(G(!p1))))'
Support contains 10 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 109 transition count 179
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 109 transition count 179
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 65 place count 90 transition count 160
Iterating global reduction 0 with 19 rules applied. Total rules applied 84 place count 90 transition count 160
Applied a total of 84 rules in 3 ms. Remains 90 /132 variables (removed 42) and now considering 160/202 (removed 42) transitions.
// Phase 1: matrix 160 rows 90 cols
[2023-03-12 18:00:37] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 18:00:37] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-12 18:00:37] [INFO ] Invariant cache hit.
[2023-03-12 18:00:37] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
[2023-03-12 18:00:37] [INFO ] Invariant cache hit.
[2023-03-12 18:00:38] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/132 places, 160/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 519 ms. Remains : 90/132 places, 160/202 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : BART-COL-040-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s42 1) (GEQ s88 1) (GEQ s87 1) (GEQ s86 1) (GEQ s85 1) (GEQ s77 1) (GEQ s78 1) (GEQ s79 1) (GEQ s41 1)), p1:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1723 reset in 272 ms.
Product exploration explored 100000 steps with 1753 reset in 321 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 542 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0)]
Finished random walk after 247 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=123 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F p0)]
Knowledge based reduction with 4 factoid took 510 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 56 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2023-03-12 18:00:40] [INFO ] Invariant cache hit.
[2023-03-12 18:00:40] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 18:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:00:40] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-12 18:00:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 18:00:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 18:00:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 18:00:40] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2023-03-12 18:00:40] [INFO ] Computed and/alt/rep : 124/228/124 causal constraints (skipped 0 transitions) in 38 ms.
[2023-03-12 18:00:40] [INFO ] Added : 92 causal constraints over 19 iterations in 395 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 9 out of 90 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 : 90/90 places, 160/160 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 90 transition count 149
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 79 transition count 149
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 22 place count 79 transition count 145
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 30 place count 75 transition count 145
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 70 place count 55 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 71 place count 55 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 73 place count 54 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 74 place count 54 transition count 122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 76 place count 53 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 77 place count 53 transition count 120
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 79 place count 52 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 80 place count 52 transition count 118
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 82 place count 51 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 84 place count 51 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 86 place count 50 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 88 place count 50 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 90 place count 49 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 92 place count 49 transition count 109
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 94 place count 48 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 96 place count 48 transition count 106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 98 place count 47 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 100 place count 47 transition count 103
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 102 place count 46 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 104 place count 46 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 106 place count 45 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 108 place count 45 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 110 place count 44 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 112 place count 44 transition count 94
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 114 place count 43 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 116 place count 43 transition count 91
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 118 place count 42 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 120 place count 42 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 122 place count 41 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 124 place count 41 transition count 85
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 126 place count 40 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 128 place count 40 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 130 place count 39 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 132 place count 39 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 134 place count 38 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 136 place count 38 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 138 place count 37 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 140 place count 37 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 142 place count 36 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 144 place count 36 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 22 with 2 rules applied. Total rules applied 146 place count 35 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 148 place count 35 transition count 67
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 150 place count 34 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 152 place count 34 transition count 64
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 24 with 2 rules applied. Total rules applied 154 place count 33 transition count 63
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 156 place count 33 transition count 61
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 25 with 2 rules applied. Total rules applied 158 place count 32 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 159 place count 32 transition count 59
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 26 with 2 rules applied. Total rules applied 161 place count 31 transition count 58
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 162 place count 31 transition count 57
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 27 with 2 rules applied. Total rules applied 164 place count 30 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 165 place count 30 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 28 with 2 rules applied. Total rules applied 167 place count 29 transition count 54
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 169 place count 29 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 29 with 2 rules applied. Total rules applied 171 place count 28 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 173 place count 28 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 30 with 2 rules applied. Total rules applied 175 place count 27 transition count 48
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 177 place count 27 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 31 with 2 rules applied. Total rules applied 179 place count 26 transition count 45
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 181 place count 26 transition count 43
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 32 with 2 rules applied. Total rules applied 183 place count 25 transition count 42
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 32 with 1 rules applied. Total rules applied 184 place count 25 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 33 with 2 rules applied. Total rules applied 186 place count 24 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 33 with 1 rules applied. Total rules applied 187 place count 24 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 34 with 2 rules applied. Total rules applied 189 place count 23 transition count 38
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 34 with 2 rules applied. Total rules applied 191 place count 23 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 35 with 2 rules applied. Total rules applied 193 place count 22 transition count 35
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 35 with 2 rules applied. Total rules applied 195 place count 22 transition count 33
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 36 with 1 rules applied. Total rules applied 196 place count 22 transition count 32
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 36 with 1 rules applied. Total rules applied 197 place count 22 transition count 32
Discarding 1 places :
Symmetric choice reduction at 36 with 1 rule applications. Total rules 198 place count 21 transition count 31
Iterating global reduction 36 with 1 rules applied. Total rules applied 199 place count 21 transition count 31
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 36 with 1 rules applied. Total rules applied 200 place count 21 transition count 30
Applied a total of 200 rules in 51 ms. Remains 21 /90 variables (removed 69) and now considering 30/160 (removed 130) transitions.
// Phase 1: matrix 30 rows 21 cols
[2023-03-12 18:00:40] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 18:00:40] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-12 18:00:40] [INFO ] Invariant cache hit.
[2023-03-12 18:00:41] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-12 18:00:41] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 18:00:41] [INFO ] Invariant cache hit.
[2023-03-12 18:00:41] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/90 places, 30/160 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 200 ms. Remains : 21/90 places, 30/160 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 167 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 44 ms :[(NOT p0)]
Finished random walk after 165 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=165 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 190 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 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0)]
[2023-03-12 18:00:41] [INFO ] Invariant cache hit.
[2023-03-12 18:00:41] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 18:00:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:00:41] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2023-03-12 18:00:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 18:00:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 18:00:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 18:00:42] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-12 18:00:42] [INFO ] Computed and/alt/rep : 20/29/20 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-12 18:00:42] [INFO ] Added : 6 causal constraints over 2 iterations in 17 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 14100 reset in 92 ms.
Stack based approach found an accepted trace after 389 steps with 57 reset with depth 3 and stack size 3 in 0 ms.
FORMULA BART-COL-040-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-040-LTLFireability-12 finished in 4743 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!p0))||(!p1 U G(p2))))'
Support contains 130 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 132 transition count 201
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 131 transition count 201
Applied a total of 2 rules in 4 ms. Remains 131 /132 variables (removed 1) and now considering 201/202 (removed 1) transitions.
// Phase 1: matrix 201 rows 131 cols
[2023-03-12 18:00:42] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-12 18:00:42] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-12 18:00:42] [INFO ] Invariant cache hit.
[2023-03-12 18:00:42] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2023-03-12 18:00:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 18:00:42] [INFO ] Invariant cache hit.
[2023-03-12 18:00:42] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 131/132 places, 201/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 242 ms. Remains : 131/132 places, 201/202 transitions.
Stuttering acceptance computed with spot in 258 ms :[(AND p0 (NOT p2)), p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : BART-COL-040-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(AND p2 p1), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=4 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p2 p1), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p0 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (LT s44 1) (LT s42 1) (LT s1 1) (LT s3 1) (LT s5 1) (LT s7 1) (LT s9 1) (LT s113 1) (LT s11 1) (LT s111 1) (LT s13 1) (LT s117 1) (LT s15 1) (LT s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 212 reset in 272 ms.
Stack based approach found an accepted trace after 84595 steps with 177 reset with depth 563 and stack size 563 in 235 ms.
FORMULA BART-COL-040-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-040-LTLFireability-13 finished in 1041 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)||X(F(p1)))))'
Support contains 98 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2023-03-12 18:00:43] [INFO ] Computed 1 place invariants in 10 ms
[2023-03-12 18:00:43] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-12 18:00:43] [INFO ] Invariant cache hit.
[2023-03-12 18:00:43] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2023-03-12 18:00:43] [INFO ] Invariant cache hit.
[2023-03-12 18:00:43] [INFO ] Dead Transitions using invariants and state equation in 313 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 607 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BART-COL-040-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), 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: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (OR (AND (LT s42 1) (LT s111 1) (LT s110 1) (LT s109 1) (LT s108 1) (LT s77 1) (LT s78 1) (LT s79 1) (LT s41 1) (LT s98 1) (LT s49 1) (LT s102 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 1015 reset in 462 ms.
Product exploration explored 100000 steps with 1061 reset in 438 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 316 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 205 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=68 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F (AND p0 (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F p0)]
Knowledge based reduction with 2 factoid took 369 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 266 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 98 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2023-03-12 18:00:46] [INFO ] Invariant cache hit.
[2023-03-12 18:00:46] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-12 18:00:46] [INFO ] Invariant cache hit.
[2023-03-12 18:00:46] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2023-03-12 18:00:46] [INFO ] Invariant cache hit.
[2023-03-12 18:00:46] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 392 ms. Remains : 132/132 places, 202/202 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 221 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 164 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=82 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F (AND p0 (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F p0)]
Knowledge based reduction with 2 factoid took 305 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1041 reset in 402 ms.
Product exploration explored 100000 steps with 1052 reset in 510 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 98 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 132 transition count 202
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 132 transition count 202
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 132 transition count 202
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 24 place count 132 transition count 202
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 38 place count 118 transition count 188
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 52 place count 118 transition count 188
Deduced a syphon composed of 10 places in 0 ms
Applied a total of 52 rules in 15 ms. Remains 118 /132 variables (removed 14) and now considering 188/202 (removed 14) transitions.
[2023-03-12 18:00:49] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 188 rows 118 cols
[2023-03-12 18:00:49] [INFO ] Computed 1 place invariants in 3 ms
[2023-03-12 18:00:49] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/132 places, 188/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 224 ms. Remains : 118/132 places, 188/202 transitions.
Support contains 98 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2023-03-12 18:00:49] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-12 18:00:49] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-12 18:00:49] [INFO ] Invariant cache hit.
[2023-03-12 18:00:49] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2023-03-12 18:00:49] [INFO ] Invariant cache hit.
[2023-03-12 18:00:50] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 303 ms. Remains : 132/132 places, 202/202 transitions.
Treatment of property BART-COL-040-LTLFireability-14 finished in 6882 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((!(p0 U p1)||(G(X(!p0))&&p0))))'
Support contains 10 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 109 transition count 179
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 109 transition count 179
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 65 place count 90 transition count 160
Iterating global reduction 0 with 19 rules applied. Total rules applied 84 place count 90 transition count 160
Applied a total of 84 rules in 2 ms. Remains 90 /132 variables (removed 42) and now considering 160/202 (removed 42) transitions.
// Phase 1: matrix 160 rows 90 cols
[2023-03-12 18:00:50] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-12 18:00:50] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-12 18:00:50] [INFO ] Invariant cache hit.
[2023-03-12 18:00:50] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2023-03-12 18:00:50] [INFO ] Invariant cache hit.
[2023-03-12 18:00:50] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/132 places, 160/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 181 ms. Remains : 90/132 places, 160/202 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, p1, (OR p1 p0), p1]
Running random walk in product with property : BART-COL-040-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(OR p0 p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (GEQ s42 1) (GEQ s88 1) (GEQ s87 1) (GEQ s86 1) (GEQ s85 1) (GEQ s77 1) (GEQ s78 1) (GEQ s79 1) (GEQ s41 1)), p1:(GEQ s1 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 149 steps with 0 reset in 0 ms.
FORMULA BART-COL-040-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-040-LTLFireability-15 finished in 348 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
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)||X(F(p1)))))'
[2023-03-12 18:00:50] [INFO ] Flatten gal took : 9 ms
[2023-03-12 18:00:50] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 14 ms.
[2023-03-12 18:00:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 132 places, 202 transitions and 404 arcs took 1 ms.
Total runtime 35907 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1615/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1615/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1615/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BART-COL-040-LTLFireability-04
Could not compute solution for formula : BART-COL-040-LTLFireability-09
Could not compute solution for formula : BART-COL-040-LTLFireability-14

BK_STOP 1678644051831

--------------------
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 BART-COL-040-LTLFireability-04
ltl formula formula --ltl=/tmp/1615/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 132 places, 202 transitions and 404 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.040 real 0.020 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1615/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1615/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1615/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1615/ltl_0_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** 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
ltl formula name BART-COL-040-LTLFireability-09
ltl formula formula --ltl=/tmp/1615/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 132 places, 202 transitions and 404 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.050 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1615/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1615/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1615/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1615/ltl_1_
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** 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:
*** 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
malloc_consolidate(): invalid chunk size
ltl formula name BART-COL-040-LTLFireability-14
ltl formula formula --ltl=/tmp/1615/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
pnml2lts-mc( 0/ 4): Petri net has 132 places, 202 transitions and 404 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1615/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1615/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1615/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1615/ltl_2_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** 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:
*** 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:
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** 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:

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="BART-COL-040"
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 BART-COL-040, 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 r009-oct2-167813598300732"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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