About the Execution of LTSMin+red for SafeBus-COL-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2698.483 | 283415.00 | 608165.00 | 1304.50 | T?FF?FFFF?FTF?FF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r361-smll-167891811100220.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is SafeBus-COL-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r361-smll-167891811100220
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 6.5K Feb 26 01:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 01:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 01:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 01:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 01:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 26 01:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 01:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 01:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 42K Mar 5 18:23 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 SafeBus-COL-10-LTLFireability-00
FORMULA_NAME SafeBus-COL-10-LTLFireability-01
FORMULA_NAME SafeBus-COL-10-LTLFireability-02
FORMULA_NAME SafeBus-COL-10-LTLFireability-03
FORMULA_NAME SafeBus-COL-10-LTLFireability-04
FORMULA_NAME SafeBus-COL-10-LTLFireability-05
FORMULA_NAME SafeBus-COL-10-LTLFireability-06
FORMULA_NAME SafeBus-COL-10-LTLFireability-07
FORMULA_NAME SafeBus-COL-10-LTLFireability-08
FORMULA_NAME SafeBus-COL-10-LTLFireability-09
FORMULA_NAME SafeBus-COL-10-LTLFireability-10
FORMULA_NAME SafeBus-COL-10-LTLFireability-11
FORMULA_NAME SafeBus-COL-10-LTLFireability-12
FORMULA_NAME SafeBus-COL-10-LTLFireability-13
FORMULA_NAME SafeBus-COL-10-LTLFireability-14
FORMULA_NAME SafeBus-COL-10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679102472924
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=SafeBus-COL-10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 01:21:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 01:21:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 01:21: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-18 01:21:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 01:21:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1007 ms
[2023-03-18 01:21:16] [INFO ] Detected 1 constant HL places corresponding to 10 PT places.
[2023-03-18 01:21:16] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 326 PT places and 12821.0 transition bindings in 31 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2023-03-18 01:21:16] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 7 ms.
[2023-03-18 01:21:16] [INFO ] Skeletonized 11 HLPN properties in 2 ms. Removed 5 properties that had guard overlaps.
Initial state reduction rules removed 2 formulas.
FORMULA SafeBus-COL-10-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-10-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 6 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10000 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 11) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 14 rows 17 cols
[2023-03-18 01:21:17] [INFO ] Computed 7 place invariants in 5 ms
[2023-03-18 01:21:17] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2023-03-18 01:21:17] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-18 01:21:17] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
[2023-03-18 01:21:17] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2023-03-18 01:21:17] [INFO ] Flatten gal took : 24 ms
FORMULA SafeBus-COL-10-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 01:21:17] [INFO ] Flatten gal took : 6 ms
Domain [It(10), It(10)] of place AMC breaks symmetries in sort It
[2023-03-18 01:21:17] [INFO ] Unfolded HLPN to a Petri net with 326 places and 1651 transitions 11294 arcs in 94 ms.
[2023-03-18 01:21:17] [INFO ] Unfolded 13 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
[2023-03-18 01:21:17] [INFO ] Reduced 80 identical enabling conditions.
[2023-03-18 01:21:17] [INFO ] Reduced 80 identical enabling conditions.
[2023-03-18 01:21:17] [INFO ] Reduced 80 identical enabling conditions.
Deduced a syphon composed of 10 places in 6 ms
Reduce places removed 20 places and 20 transitions.
FORMULA SafeBus-COL-10-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-10-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 306 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1631/1631 transitions.
Applied a total of 0 rules in 28 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2023-03-18 01:21:17] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2023-03-18 01:21:17] [INFO ] Computed 45 place invariants in 49 ms
[2023-03-18 01:21:17] [INFO ] Implicit Places using invariants in 275 ms returned []
[2023-03-18 01:21:17] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2023-03-18 01:21:17] [INFO ] Invariant cache hit.
[2023-03-18 01:21:18] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-18 01:21:18] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 793 ms to find 0 implicit places.
[2023-03-18 01:21:18] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
[2023-03-18 01:21:18] [INFO ] Invariant cache hit.
[2023-03-18 01:21:20] [INFO ] Dead Transitions using invariants and state equation in 1955 ms found 100 transitions.
Found 100 dead transitions using SMT.
Drop transitions removed 100 transitions
Dead transitions reduction (with SMT) removed 100 transitions
Starting structural reductions in LTL mode, iteration 1 : 306/306 places, 1531/1631 transitions.
Applied a total of 0 rules in 9 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2792 ms. Remains : 306/306 places, 1531/1631 transitions.
Support contains 306 out of 306 places after structural reductions.
[2023-03-18 01:21:20] [INFO ] Flatten gal took : 245 ms
[2023-03-18 01:21:21] [INFO ] Flatten gal took : 244 ms
[2023-03-18 01:21:21] [INFO ] Input system was already deterministic with 1531 transitions.
Finished random walk after 1234 steps, including 0 resets, run visited all 17 properties in 49 ms. (steps per millisecond=25 )
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(F((X(p1)&&p0))))'
Support contains 153 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 19 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-18 01:21:22] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:21:22] [INFO ] Invariant cache hit.
[2023-03-18 01:21:22] [INFO ] Implicit Places using invariants in 235 ms returned []
[2023-03-18 01:21:22] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:21:22] [INFO ] Invariant cache hit.
[2023-03-18 01:21:22] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-18 01:21:24] [INFO ] Implicit Places using invariants and state equation in 1624 ms returned []
Implicit Place search using SMT with State Equation took 1861 ms to find 0 implicit places.
[2023-03-18 01:21:24] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:21:24] [INFO ] Invariant cache hit.
[2023-03-18 01:21:25] [INFO ] Dead Transitions using invariants and state equation in 1445 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3326 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 295 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (AND (GEQ s0 1) (GEQ s20 1) (GEQ s41 1) (GEQ s295 1)) (AND (GEQ s3 1) (GEQ s20 1) (GEQ s94 1) (GEQ s295 1)) (AND (GEQ s0 1) (GEQ s20 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1263 ms.
Product exploration explored 100000 steps with 33333 reset in 1186 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 p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) p1)
Knowledge based reduction with 4 factoid took 187 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-COL-10-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-COL-10-LTLFireability-00 finished in 6377 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 20 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 36 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-18 01:21:28] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:21:28] [INFO ] Invariant cache hit.
[2023-03-18 01:21:29] [INFO ] Implicit Places using invariants in 621 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 640 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 14 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 692 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (AND (GEQ s268 1) (GEQ s281 1)) (AND (GEQ s264 1) (GEQ s277 1)) (AND (GEQ s266 1) (GEQ s279 1)) (AND (GEQ s270 1) (GEQ s283 1)) (AND (GEQ s262 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 3865 reset in 486 ms.
Product exploration explored 100000 steps with 3871 reset in 520 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 (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 31 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=15 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-18 01:21:31] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2023-03-18 01:21:31] [INFO ] Computed 35 place invariants in 19 ms
[2023-03-18 01:21:32] [INFO ] [Real]Absence check using 14 positive place invariants in 13 ms returned sat
[2023-03-18 01:21:32] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 40 ms returned sat
[2023-03-18 01:21:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 01:21:33] [INFO ] [Real]Absence check using state equation in 873 ms returned sat
[2023-03-18 01:21:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 01:21:34] [INFO ] [Nat]Absence check using 14 positive place invariants in 16 ms returned sat
[2023-03-18 01:21:34] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 224 ms returned sat
[2023-03-18 01:21:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 01:21:35] [INFO ] [Nat]Absence check using state equation in 520 ms returned sat
[2023-03-18 01:21:35] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-18 01:21:35] [INFO ] [Nat]Added 111 Read/Feed constraints in 198 ms returned sat
[2023-03-18 01:21:35] [INFO ] Deduced a trap composed of 49 places in 144 ms of which 5 ms to minimize.
[2023-03-18 01:21:35] [INFO ] Deduced a trap composed of 41 places in 146 ms of which 1 ms to minimize.
[2023-03-18 01:21:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 398 ms
[2023-03-18 01:21:36] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 144 ms.
[2023-03-18 01:21:36] [INFO ] Added : 3 causal constraints over 2 iterations in 325 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 20 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 12 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-18 01:21:36] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:21:36] [INFO ] Invariant cache hit.
[2023-03-18 01:21:36] [INFO ] Implicit Places using invariants in 576 ms returned []
[2023-03-18 01:21:36] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:21:36] [INFO ] Invariant cache hit.
[2023-03-18 01:21:37] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-18 01:21:39] [INFO ] Implicit Places using invariants and state equation in 2519 ms returned []
Implicit Place search using SMT with State Equation took 3100 ms to find 0 implicit places.
[2023-03-18 01:21:39] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:21:39] [INFO ] Invariant cache hit.
[2023-03-18 01:21:40] [INFO ] Dead Transitions using invariants and state equation in 1005 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4120 ms. Remains : 296/296 places, 1531/1531 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 (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 23 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=23 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-18 01:21:40] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:21:40] [INFO ] Invariant cache hit.
[2023-03-18 01:21:42] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned sat
[2023-03-18 01:21:42] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 42 ms returned sat
[2023-03-18 01:21:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 01:21:42] [INFO ] [Real]Absence check using state equation in 540 ms returned sat
[2023-03-18 01:21:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 01:21:44] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2023-03-18 01:21:44] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 41 ms returned sat
[2023-03-18 01:21:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 01:21:44] [INFO ] [Nat]Absence check using state equation in 601 ms returned sat
[2023-03-18 01:21:44] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-18 01:21:45] [INFO ] [Nat]Added 111 Read/Feed constraints in 114 ms returned sat
[2023-03-18 01:21:45] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 1 ms to minimize.
[2023-03-18 01:21:45] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 2 ms to minimize.
[2023-03-18 01:21:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 336 ms
[2023-03-18 01:21:45] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 91 ms.
[2023-03-18 01:21:45] [INFO ] Added : 2 causal constraints over 2 iterations in 234 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3856 reset in 487 ms.
Product exploration explored 100000 steps with 3857 reset in 494 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 20 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 274 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-18 01:21:47] [INFO ] Redundant transitions in 144 ms returned []
[2023-03-18 01:21:47] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:21:47] [INFO ] Invariant cache hit.
[2023-03-18 01:21:48] [INFO ] Dead Transitions using invariants and state equation in 1248 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1676 ms. Remains : 296/296 places, 1531/1531 transitions.
Support contains 20 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 18 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-18 01:21:48] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:21:48] [INFO ] Invariant cache hit.
[2023-03-18 01:21:49] [INFO ] Implicit Places using invariants in 645 ms returned []
[2023-03-18 01:21:49] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:21:49] [INFO ] Invariant cache hit.
[2023-03-18 01:21:49] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-18 01:21:51] [INFO ] Implicit Places using invariants and state equation in 2483 ms returned []
Implicit Place search using SMT with State Equation took 3130 ms to find 0 implicit places.
[2023-03-18 01:21:51] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:21:51] [INFO ] Invariant cache hit.
[2023-03-18 01:21:53] [INFO ] Dead Transitions using invariants and state equation in 1209 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4359 ms. Remains : 296/296 places, 1531/1531 transitions.
Treatment of property SafeBus-COL-10-LTLFireability-01 finished in 24717 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((p0&&G((p1 U (p0 U (!p2&&G(!p0))))))))'
Support contains 123 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 8 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-18 01:21:53] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2023-03-18 01:21:53] [INFO ] Computed 45 place invariants in 15 ms
[2023-03-18 01:21:53] [INFO ] Implicit Places using invariants in 435 ms returned []
[2023-03-18 01:21:53] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:21:53] [INFO ] Invariant cache hit.
[2023-03-18 01:21:54] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-18 01:21:56] [INFO ] Implicit Places using invariants and state equation in 2249 ms returned []
Implicit Place search using SMT with State Equation took 2687 ms to find 0 implicit places.
[2023-03-18 01:21:56] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:21:56] [INFO ] Invariant cache hit.
[2023-03-18 01:21:57] [INFO ] Dead Transitions using invariants and state equation in 1479 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4176 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 345 ms :[true, true, true, (OR p0 p2), (OR p0 p2), (OR p0 p2), p0, p0]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}, { cond=(AND p0 p1), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(OR p0 (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(OR (AND p0 p1) (AND p2 p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(OR (AND p0 p1) (AND p2 p1)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=5 dest: 7}], [{ cond=p0, acceptance={} source=6 dest: 2}, { cond=(NOT p0), acceptance={} source=6 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=7 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (AND (GEQ s31 1) (GEQ s284 1)) (AND (GEQ s32 1) (GEQ s284 1)) (AND (GEQ s40 1) (GEQ s284 1)) (AND (GEQ s34 1) (GEQ s284 1)) (AND (GEQ s33 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SafeBus-COL-10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-COL-10-LTLFireability-02 finished in 4553 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(X(F(G(p0))))&&F((X(p1) U p2)))))'
Support contains 93 out of 306 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 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 127 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-18 01:21:58] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:21:58] [INFO ] Invariant cache hit.
[2023-03-18 01:21:58] [INFO ] Implicit Places using invariants in 589 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 592 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 296 transition count 1521
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 286 transition count 1521
Applied a total of 20 rules in 119 ms. Remains 286 /296 variables (removed 10) and now considering 1521/1531 (removed 10) transitions.
[2023-03-18 01:21:58] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2023-03-18 01:21:58] [INFO ] Computed 35 place invariants in 12 ms
[2023-03-18 01:21:59] [INFO ] Implicit Places using invariants in 476 ms returned []
[2023-03-18 01:21:59] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2023-03-18 01:21:59] [INFO ] Invariant cache hit.
[2023-03-18 01:21:59] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-18 01:22:01] [INFO ] Implicit Places using invariants and state equation in 2128 ms returned []
Implicit Place search using SMT with State Equation took 2607 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 286/306 places, 1521/1531 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3445 ms. Remains : 286/306 places, 1521/1531 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2)]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s251 1) (GEQ s273 1)), p0:(AND (OR (LT s222 1) (LT s272 1)) (OR (LT s151 1) (LT s272 1)) (OR (LT s178 1) (LT s272 1)) (OR (LT s196 1) (LT s27...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 1656 ms.
Stack based approach found an accepted trace after 349 steps with 1 reset with depth 318 and stack size 318 in 7 ms.
FORMULA SafeBus-COL-10-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-COL-10-LTLFireability-03 finished in 5247 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)) U !p1)&&F((G(F(p2))||(F(p2)&&G(p3))))))'
Support contains 142 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 209 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-18 01:22:03] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2023-03-18 01:22:03] [INFO ] Computed 45 place invariants in 11 ms
[2023-03-18 01:22:03] [INFO ] Implicit Places using invariants in 391 ms returned []
[2023-03-18 01:22:03] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:22:03] [INFO ] Invariant cache hit.
[2023-03-18 01:22:04] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-18 01:22:06] [INFO ] Implicit Places using invariants and state equation in 2217 ms returned []
Implicit Place search using SMT with State Equation took 2624 ms to find 0 implicit places.
[2023-03-18 01:22:06] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-18 01:22:06] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:22:06] [INFO ] Invariant cache hit.
[2023-03-18 01:22:07] [INFO ] Dead Transitions using invariants and state equation in 1658 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4556 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 336 ms :[(OR (NOT p2) p1), (NOT p0), p1, (NOT p2), (NOT p2), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(NOT p3), acceptance={} source=0 dest: 3}, { cond=(NOT p2), acceptance={} source=0 dest: 4}, { cond=p3, acceptance={} source=0 dest: 5}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}, { cond=p3, acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=p3, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (AND (GEQ s236 1) (GEQ s267 1)) (AND (GEQ s237 1) (GEQ s268 1)) (AND (GEQ s238 1) (GEQ s269 1)) (AND (GEQ s239 1) (GEQ s270 1)) (AND (GEQ s240 1) (...], 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 1493 reset in 822 ms.
Product exploration explored 100000 steps with 1489 reset in 913 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p3 p2 (NOT p0)), (X p2), (X p3), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 504 ms. Reduced automaton from 6 states, 16 edges and 4 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p3) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p3) (NOT p2))]
Finished random walk after 43 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p1) p3 p2 (NOT p0)), (X p2), (X p3), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p3)), (F (AND (NOT p3) (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 10 factoid took 536 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p3) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p3) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p3) (NOT p2))]
Support contains 40 out of 306 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 7 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-18 01:22:11] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:22:11] [INFO ] Invariant cache hit.
[2023-03-18 01:22:11] [INFO ] Implicit Places using invariants in 426 ms returned []
[2023-03-18 01:22:11] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:22:11] [INFO ] Invariant cache hit.
[2023-03-18 01:22:12] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-18 01:22:13] [INFO ] Implicit Places using invariants and state equation in 2097 ms returned []
Implicit Place search using SMT with State Equation took 2525 ms to find 0 implicit places.
[2023-03-18 01:22:13] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:22:13] [INFO ] Invariant cache hit.
[2023-03-18 01:22:15] [INFO ] Dead Transitions using invariants and state equation in 1630 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4164 ms. Remains : 306/306 places, 1531/1531 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 p3 p2), (X p3), (X (NOT (AND (NOT p3) (NOT p2)))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 254 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p3) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p3) (NOT p2))]
Finished random walk after 47 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND p3 p2), (X p3), (X (NOT (AND (NOT p3) (NOT p2)))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(F (NOT p3)), (F (AND (NOT p2) (NOT p3))), (F (NOT p2))]
Knowledge based reduction with 6 factoid took 319 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p3) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p3) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p3) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p3) (NOT p2))]
Product exploration explored 100000 steps with 1554 reset in 798 ms.
Product exploration explored 100000 steps with 1559 reset in 818 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p3) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p3) (NOT p2))]
Support contains 40 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 181 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-18 01:22:18] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-18 01:22:18] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:22:18] [INFO ] Invariant cache hit.
[2023-03-18 01:22:20] [INFO ] Dead Transitions using invariants and state equation in 1672 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1891 ms. Remains : 306/306 places, 1531/1531 transitions.
Support contains 40 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 7 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-18 01:22:20] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:22:20] [INFO ] Invariant cache hit.
[2023-03-18 01:22:21] [INFO ] Implicit Places using invariants in 535 ms returned []
[2023-03-18 01:22:21] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:22:21] [INFO ] Invariant cache hit.
[2023-03-18 01:22:21] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-18 01:22:23] [INFO ] Implicit Places using invariants and state equation in 2404 ms returned []
Implicit Place search using SMT with State Equation took 2941 ms to find 0 implicit places.
[2023-03-18 01:22:23] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:22:23] [INFO ] Invariant cache hit.
[2023-03-18 01:22:24] [INFO ] Dead Transitions using invariants and state equation in 1384 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4333 ms. Remains : 306/306 places, 1531/1531 transitions.
Treatment of property SafeBus-COL-10-LTLFireability-04 finished in 21866 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((X(!p0) U (X(G(!p0))||(!p1&&X(!p0)))))||((X(!p0) U (X(G(!p0))||(!p1&&X(!p0))))&&F((F(p2)&&X(!p3))))))'
Support contains 60 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 7 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-18 01:22:25] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:22:25] [INFO ] Invariant cache hit.
[2023-03-18 01:22:25] [INFO ] Implicit Places using invariants in 562 ms returned []
[2023-03-18 01:22:25] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:22:25] [INFO ] Invariant cache hit.
[2023-03-18 01:22:25] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-18 01:22:28] [INFO ] Implicit Places using invariants and state equation in 2316 ms returned []
Implicit Place search using SMT with State Equation took 2889 ms to find 0 implicit places.
[2023-03-18 01:22:28] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:22:28] [INFO ] Invariant cache hit.
[2023-03-18 01:22:29] [INFO ] Dead Transitions using invariants and state equation in 1761 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4660 ms. Remains : 306/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 643 ms :[p0, p0, (AND p0 (NOT p2)), (AND p0 p3), p0, true, (AND (NOT p2) p0), (AND p0 (NOT p2)), (AND p0 p3), (AND p0 p3), (NOT p2), p3]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p2) p3), acceptance={} source=3 dest: 2}, { cond=p3, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={} source=3 dest: 6}, { cond=(AND p1 (NOT p2) p3), acceptance={} source=3 dest: 7}, { cond=p3, acceptance={} source=3 dest: 8}, { cond=(AND p1 p3), acceptance={} source=3 dest: 9}], [{ cond=true, acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) p0), acceptance={} source=6 dest: 10}], [{ cond=(NOT p2), acceptance={} source=7 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=7 dest: 7}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p2) p0 p3), acceptance={} source=8 dest: 10}, { cond=(AND p0 p3), acceptance={} source=8 dest: 11}], [{ cond=(AND (NOT p2) p3), acceptance={} source=9 dest: 6}, { cond=(AND p1 (NOT p2) p3), acceptance={} source=9 dest: 7}, { cond=p3, acceptance={} source=9 dest: 8}, { cond=(AND p1 (NOT p0) p3), acceptance={} source=9 dest: 9}, { cond=(AND p1 p0 p3), acceptance={0} source=9 dest: 9}], [{ cond=(NOT p2), acceptance={0} source=10 dest: 10}], [{ cond=(AND (NOT p2) p3), acceptance={} source=11 dest: 10}, { cond=p3, acceptance={0} source=11 dest: 11}]], initial=0, aps=[p2:(AND (OR (LT s13 1) (LT s305 1)) (OR (LT s18 1) (LT s302 1)) (OR (LT s17 1) (LT s296 1)) (OR (LT s18 1) (LT s298 1)) (OR (LT s12 1) (LT s299 1)) (OR (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 3 reset in 0 ms.
FORMULA SafeBus-COL-10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-COL-10-LTLFireability-06 finished in 5345 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||X(F(p1)))))))'
Support contains 22 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 7 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-18 01:22:30] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:22:30] [INFO ] Invariant cache hit.
[2023-03-18 01:22:31] [INFO ] Implicit Places using invariants in 652 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 655 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 7 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 671 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(AND (GEQ s251 1) (GEQ s273 1)), p1:(OR (AND (GEQ s239 1) (GEQ s270 1)) (AND (GEQ s237 1) (GEQ s268 1)) (AND (GEQ s236 1) (GEQ s267 1)) (AND (GEQ s238 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2325 reset in 596 ms.
Stack based approach found an accepted trace after 1817 steps with 44 reset with depth 112 and stack size 112 in 12 ms.
FORMULA SafeBus-COL-10-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-COL-10-LTLFireability-07 finished in 1497 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((X(p1)||p0)))'
Support contains 142 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 5 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-18 01:22:31] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:22:31] [INFO ] Invariant cache hit.
[2023-03-18 01:22:32] [INFO ] Implicit Places using invariants in 402 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 405 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 5 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 416 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (OR (LT s18 1) (LT s231 1)) (OR (LT s14 1) (LT s240 1)) (OR (LT s13 1) (LT s234 1)) (OR (LT s14 1) (LT s236 1)) (OR (LT s13 1) (LT s238 1)) (O...], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 31 steps with 0 reset in 1 ms.
FORMULA SafeBus-COL-10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-COL-10-LTLFireability-08 finished in 528 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(((p0 U (!p1 U (G(!p1)||(!p1&&G(!p0))))) U (G(p2) U G(p0)))))'
Support contains 60 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 6 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-18 01:22:32] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:22:32] [INFO ] Invariant cache hit.
[2023-03-18 01:22:33] [INFO ] Implicit Places using invariants in 590 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 592 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 6 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 607 ms. Remains : 296/306 places, 1531/1531 transitions.
Stuttering acceptance computed with spot in 518 ms :[(NOT p0), (NOT p0), true, (AND p0 (NOT p2)), (NOT p0), (AND p0 p1), (AND p0 (NOT p2) p1), (AND (NOT p0) p1 p2), (NOT p0), p0, (OR (AND p0 p1) (AND p1 p2)), false, (AND p0 (NOT p2) p1)]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=1 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 7}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 8}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 9}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 10}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=6 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=6 dest: 3}, { cond=(AND p0 p2 p1), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=6 dest: 9}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=6 dest: 10}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=6 dest: 11}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=6 dest: 12}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND p0 p2), acceptance={} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 2}, { cond=p0, acceptance={} source=8 dest: 8}], [{ cond=p0, acceptance={} source=9 dest: 2}, { cond=(NOT p0), acceptance={} source=9 dest: 9}], [{ cond=(OR (AND p0 p1) (AND p2 p1)), acceptance={} source=10 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=10 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p0) p2), acceptance={} source=11 dest: 11}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=12 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=12 dest: 3}, { cond=(AND p0 p2 p1), acceptance={} source=12 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=12 dest: 10}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=12 dest: 12}]], initial=0, aps=[p0:(OR (AND (GEQ s18 1) (GEQ s231 1)) (AND (GEQ s14 1) (GEQ s240 1)) (AND (GEQ s13 1) (GEQ s234 1)) (AND (GEQ s14 1) (GEQ s236 1)) (AND (GEQ s13 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25025 reset in 862 ms.
Product exploration explored 100000 steps with 24917 reset in 887 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p2)))), true, (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 26 factoid took 1724 ms. Reduced automaton from 13 states, 45 edges and 3 AP (stutter sensitive) to 13 states, 46 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 506 ms :[(NOT p0), (NOT p0), true, (AND p0 (NOT p2)), (NOT p0), (AND p0 p1), (AND p0 (NOT p2) p1), (AND (NOT p0) p1 p2), (NOT p0), p0, (OR (AND p0 p1) (AND p1 p2)), false, (AND p0 (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 462 ms. (steps per millisecond=21 ) properties (out of 18) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 01:22:38] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2023-03-18 01:22:38] [INFO ] Computed 35 place invariants in 7 ms
[2023-03-18 01:22:38] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-18 01:22:38] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 13 ms returned sat
[2023-03-18 01:22:38] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-18 01:22:39] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-18 01:22:39] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 13 ms returned sat
[2023-03-18 01:22:39] [INFO ] After 98ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p2)))), true, (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (G (NOT (AND p1 p0 p2))), (G (NOT (AND p1 (NOT p0) p2)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (AND p0 p2)), (F (AND (NOT p0) p2)), (F (NOT (AND (NOT p1) p0 (NOT p2)))), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (AND p1 p0 (NOT p2))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0) p2)), (F (NOT p0)), (F (OR (AND p1 p0) (AND p1 p2))), (F (AND p1 (NOT p0) (NOT p2))), (F (AND (NOT p1) p0 p2)), (F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p0))), (F (AND p1 p0))]
Knowledge based reduction with 28 factoid took 2032 ms. Reduced automaton from 13 states, 46 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), false]
Stuttering acceptance computed with spot in 246 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), false]
Support contains 60 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 6 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-18 01:22:41] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:22:41] [INFO ] Invariant cache hit.
[2023-03-18 01:22:42] [INFO ] Implicit Places using invariants in 477 ms returned []
[2023-03-18 01:22:42] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:22:42] [INFO ] Invariant cache hit.
[2023-03-18 01:22:42] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-18 01:22:44] [INFO ] Implicit Places using invariants and state equation in 2055 ms returned []
Implicit Place search using SMT with State Equation took 2535 ms to find 0 implicit places.
[2023-03-18 01:22:44] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:22:44] [INFO ] Invariant cache hit.
[2023-03-18 01:22:45] [INFO ] Dead Transitions using invariants and state equation in 1548 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4092 ms. Remains : 296/296 places, 1531/1531 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 1110 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 11) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 01:22:47] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:22:47] [INFO ] Invariant cache hit.
[2023-03-18 01:22:47] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-18 01:22:47] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 14 ms returned sat
[2023-03-18 01:22:47] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (G (OR (NOT p1) (NOT p2)))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p2)))), (F (NOT p0)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0))), (F (NOT (OR (AND (NOT p1) p0) (AND (NOT p1) p2)))), (F (AND p0 p2)), (F (AND p1 p0)), (F (NOT (AND (NOT p1) p0 (NOT p2))))]
Knowledge based reduction with 19 factoid took 1166 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(NOT p0), (NOT p0), true, (AND p0 p1), (AND p0 p1), false]
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (NOT p0), true, (AND p0 p1), (AND p0 p1), false]
Stuttering acceptance computed with spot in 220 ms :[(NOT p0), (NOT p0), true, (AND p0 p1), (AND p0 p1), false]
Product exploration explored 100000 steps with 24921 reset in 804 ms.
Product exploration explored 100000 steps with 24982 reset in 818 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 225 ms :[(NOT p0), (NOT p0), true, (AND p0 p1), (AND p0 p1), false]
Support contains 60 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 108 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-18 01:22:51] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-18 01:22:51] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:22:51] [INFO ] Invariant cache hit.
[2023-03-18 01:22:52] [INFO ] Dead Transitions using invariants and state equation in 1144 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1289 ms. Remains : 296/296 places, 1531/1531 transitions.
Support contains 60 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 7 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-18 01:22:52] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:22:52] [INFO ] Invariant cache hit.
[2023-03-18 01:22:53] [INFO ] Implicit Places using invariants in 524 ms returned []
[2023-03-18 01:22:53] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:22:53] [INFO ] Invariant cache hit.
[2023-03-18 01:22:53] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-18 01:22:55] [INFO ] Implicit Places using invariants and state equation in 2075 ms returned []
Implicit Place search using SMT with State Equation took 2601 ms to find 0 implicit places.
[2023-03-18 01:22:55] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:22:55] [INFO ] Invariant cache hit.
[2023-03-18 01:22:56] [INFO ] Dead Transitions using invariants and state equation in 1244 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3854 ms. Remains : 296/296 places, 1531/1531 transitions.
Treatment of property SafeBus-COL-10-LTLFireability-09 finished in 23983 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 20 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 99 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-18 01:22:56] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2023-03-18 01:22:56] [INFO ] Computed 45 place invariants in 7 ms
[2023-03-18 01:22:57] [INFO ] Implicit Places using invariants in 625 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 630 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 296 transition count 1521
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 286 transition count 1521
Applied a total of 20 rules in 108 ms. Remains 286 /296 variables (removed 10) and now considering 1521/1531 (removed 10) transitions.
[2023-03-18 01:22:57] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2023-03-18 01:22:57] [INFO ] Computed 35 place invariants in 8 ms
[2023-03-18 01:22:57] [INFO ] Implicit Places using invariants in 577 ms returned []
[2023-03-18 01:22:57] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2023-03-18 01:22:57] [INFO ] Invariant cache hit.
[2023-03-18 01:22:58] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-18 01:23:00] [INFO ] Implicit Places using invariants and state equation in 2574 ms returned []
Implicit Place search using SMT with State Equation took 3153 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 286/306 places, 1521/1531 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3991 ms. Remains : 286/306 places, 1521/1531 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : SafeBus-COL-10-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:(OR (AND (GEQ s18 1) (GEQ s231 1)) (AND (GEQ s14 1) (GEQ s240 1)) (AND (GEQ s13 1) (GEQ s234 1)) (AND (GEQ s14 1) (GEQ s236 1)) (AND (GEQ s13 1) (GEQ s...], 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 1588 ms.
Stack based approach found an accepted trace after 410 steps with 0 reset with depth 411 and stack size 411 in 7 ms.
FORMULA SafeBus-COL-10-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-COL-10-LTLFireability-10 finished in 5641 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 93 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 101 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-18 01:23:02] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2023-03-18 01:23:02] [INFO ] Computed 45 place invariants in 6 ms
[2023-03-18 01:23:02] [INFO ] Implicit Places using invariants in 510 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 516 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 296 transition count 1521
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 286 transition count 1521
Applied a total of 20 rules in 111 ms. Remains 286 /296 variables (removed 10) and now considering 1521/1531 (removed 10) transitions.
[2023-03-18 01:23:02] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2023-03-18 01:23:02] [INFO ] Computed 35 place invariants in 4 ms
[2023-03-18 01:23:03] [INFO ] Implicit Places using invariants in 422 ms returned []
[2023-03-18 01:23:03] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2023-03-18 01:23:03] [INFO ] Invariant cache hit.
[2023-03-18 01:23:03] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-18 01:23:05] [INFO ] Implicit Places using invariants and state equation in 2088 ms returned []
Implicit Place search using SMT with State Equation took 2511 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 286/306 places, 1521/1531 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3241 ms. Remains : 286/306 places, 1521/1531 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-COL-10-LTLFireability-13 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 (AND (GEQ s142 1) (GEQ s251 1) (GEQ s275 1)) (AND (GEQ s214 1) (GEQ s251 1) (GEQ s275 1)) (AND (GEQ s199 1) (GEQ s251 1) (GEQ s275 1)) (AND (GEQ s2...], 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 5186 reset in 929 ms.
Product exploration explored 100000 steps with 5205 reset in 933 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 120 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 72 ms :[(NOT p0), (NOT p0)]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
[2023-03-18 01:23:07] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2023-03-18 01:23:07] [INFO ] Invariant cache hit.
[2023-03-18 01:23:09] [INFO ] [Real]Absence check using 14 positive place invariants in 17 ms returned sat
[2023-03-18 01:23:09] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 30 ms returned sat
[2023-03-18 01:23:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 01:23:10] [INFO ] [Real]Absence check using state equation in 539 ms returned sat
[2023-03-18 01:23:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 01:23:12] [INFO ] [Nat]Absence check using 14 positive place invariants in 17 ms returned sat
[2023-03-18 01:23:12] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 71 ms returned sat
[2023-03-18 01:23:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 01:23:13] [INFO ] [Nat]Absence check using state equation in 644 ms returned sat
[2023-03-18 01:23:13] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-18 01:23:13] [INFO ] [Nat]Added 111 Read/Feed constraints in 186 ms returned sat
[2023-03-18 01:23:13] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 14 ms to minimize.
[2023-03-18 01:23:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2023-03-18 01:23:13] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 602 transitions) in 86 ms.
[2023-03-18 01:23:13] [INFO ] Added : 1 causal constraints over 1 iterations in 198 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 93 out of 286 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 286/286 places, 1521/1521 transitions.
Applied a total of 0 rules in 104 ms. Remains 286 /286 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2023-03-18 01:23:13] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2023-03-18 01:23:13] [INFO ] Invariant cache hit.
[2023-03-18 01:23:14] [INFO ] Implicit Places using invariants in 499 ms returned []
[2023-03-18 01:23:14] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2023-03-18 01:23:14] [INFO ] Invariant cache hit.
[2023-03-18 01:23:14] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-18 01:23:16] [INFO ] Implicit Places using invariants and state equation in 2151 ms returned []
Implicit Place search using SMT with State Equation took 2652 ms to find 0 implicit places.
[2023-03-18 01:23:16] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-18 01:23:16] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2023-03-18 01:23:16] [INFO ] Invariant cache hit.
[2023-03-18 01:23:17] [INFO ] Dead Transitions using invariants and state equation in 1279 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4074 ms. Remains : 286/286 places, 1521/1521 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 121 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 77 ms :[(NOT p0), (NOT p0)]
Finished random walk after 20 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=10 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
[2023-03-18 01:23:18] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2023-03-18 01:23:18] [INFO ] Invariant cache hit.
[2023-03-18 01:23:20] [INFO ] [Real]Absence check using 14 positive place invariants in 19 ms returned sat
[2023-03-18 01:23:20] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 30 ms returned sat
[2023-03-18 01:23:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 01:23:21] [INFO ] [Real]Absence check using state equation in 539 ms returned sat
[2023-03-18 01:23:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 01:23:23] [INFO ] [Nat]Absence check using 14 positive place invariants in 17 ms returned sat
[2023-03-18 01:23:23] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 72 ms returned sat
[2023-03-18 01:23:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 01:23:23] [INFO ] [Nat]Absence check using state equation in 652 ms returned sat
[2023-03-18 01:23:23] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-18 01:23:24] [INFO ] [Nat]Added 111 Read/Feed constraints in 183 ms returned sat
[2023-03-18 01:23:24] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 1 ms to minimize.
[2023-03-18 01:23:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2023-03-18 01:23:24] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 602 transitions) in 65 ms.
[2023-03-18 01:23:24] [INFO ] Added : 1 causal constraints over 1 iterations in 176 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5219 reset in 896 ms.
Product exploration explored 100000 steps with 5214 reset in 914 ms.
Support contains 93 out of 286 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 286/286 places, 1521/1521 transitions.
Applied a total of 0 rules in 102 ms. Remains 286 /286 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2023-03-18 01:23:26] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2023-03-18 01:23:26] [INFO ] Invariant cache hit.
[2023-03-18 01:23:26] [INFO ] Implicit Places using invariants in 462 ms returned []
[2023-03-18 01:23:26] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2023-03-18 01:23:26] [INFO ] Invariant cache hit.
[2023-03-18 01:23:27] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-18 01:23:29] [INFO ] Implicit Places using invariants and state equation in 2258 ms returned []
Implicit Place search using SMT with State Equation took 2728 ms to find 0 implicit places.
[2023-03-18 01:23:29] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-18 01:23:29] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
[2023-03-18 01:23:29] [INFO ] Invariant cache hit.
[2023-03-18 01:23:30] [INFO ] Dead Transitions using invariants and state equation in 1327 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4196 ms. Remains : 286/286 places, 1521/1521 transitions.
Treatment of property SafeBus-COL-10-LTLFireability-13 finished in 28534 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a Shortening insensitive property : SafeBus-COL-10-LTLFireability-01
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 20 out of 306 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 19 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-18 01:23:30] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2023-03-18 01:23:30] [INFO ] Computed 45 place invariants in 6 ms
[2023-03-18 01:23:31] [INFO ] Implicit Places using invariants in 724 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 727 ms to find 10 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 25 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 771 ms. Remains : 296/306 places, 1531/1531 transitions.
Running random walk in product with property : SafeBus-COL-10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (AND (GEQ s268 1) (GEQ s281 1)) (AND (GEQ s264 1) (GEQ s277 1)) (AND (GEQ s266 1) (GEQ s279 1)) (AND (GEQ s270 1) (GEQ s283 1)) (AND (GEQ s262 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3850 reset in 468 ms.
Product exploration explored 100000 steps with 3884 reset in 486 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 (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 18 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=18 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-18 01:23:33] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2023-03-18 01:23:33] [INFO ] Computed 35 place invariants in 5 ms
[2023-03-18 01:23:34] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2023-03-18 01:23:34] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 41 ms returned sat
[2023-03-18 01:23:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 01:23:35] [INFO ] [Real]Absence check using state equation in 878 ms returned sat
[2023-03-18 01:23:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 01:23:36] [INFO ] [Nat]Absence check using 14 positive place invariants in 13 ms returned sat
[2023-03-18 01:23:36] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 222 ms returned sat
[2023-03-18 01:23:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 01:23:37] [INFO ] [Nat]Absence check using state equation in 504 ms returned sat
[2023-03-18 01:23:37] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-18 01:23:37] [INFO ] [Nat]Added 111 Read/Feed constraints in 199 ms returned sat
[2023-03-18 01:23:37] [INFO ] Deduced a trap composed of 49 places in 105 ms of which 0 ms to minimize.
[2023-03-18 01:23:37] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 1 ms to minimize.
[2023-03-18 01:23:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 314 ms
[2023-03-18 01:23:37] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 69 ms.
[2023-03-18 01:23:37] [INFO ] Added : 3 causal constraints over 2 iterations in 221 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 20 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 6 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-18 01:23:37] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:23:37] [INFO ] Invariant cache hit.
[2023-03-18 01:23:38] [INFO ] Implicit Places using invariants in 592 ms returned []
[2023-03-18 01:23:38] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:23:38] [INFO ] Invariant cache hit.
[2023-03-18 01:23:38] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-18 01:23:41] [INFO ] Implicit Places using invariants and state equation in 2701 ms returned []
Implicit Place search using SMT with State Equation took 3295 ms to find 0 implicit places.
[2023-03-18 01:23:41] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:23:41] [INFO ] Invariant cache hit.
[2023-03-18 01:23:42] [INFO ] Dead Transitions using invariants and state equation in 1323 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4627 ms. Remains : 296/296 places, 1531/1531 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 (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-18 01:23:43] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:23:43] [INFO ] Invariant cache hit.
[2023-03-18 01:23:44] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2023-03-18 01:23:44] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 38 ms returned sat
[2023-03-18 01:23:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 01:23:44] [INFO ] [Real]Absence check using state equation in 509 ms returned sat
[2023-03-18 01:23:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 01:23:46] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2023-03-18 01:23:46] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 44 ms returned sat
[2023-03-18 01:23:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 01:23:46] [INFO ] [Nat]Absence check using state equation in 577 ms returned sat
[2023-03-18 01:23:46] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-18 01:23:46] [INFO ] [Nat]Added 111 Read/Feed constraints in 120 ms returned sat
[2023-03-18 01:23:47] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 1 ms to minimize.
[2023-03-18 01:23:47] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 0 ms to minimize.
[2023-03-18 01:23:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 309 ms
[2023-03-18 01:23:47] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 612 transitions) in 65 ms.
[2023-03-18 01:23:47] [INFO ] Added : 2 causal constraints over 2 iterations in 199 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3856 reset in 469 ms.
Product exploration explored 100000 steps with 3865 reset in 480 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 20 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 108 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-18 01:23:48] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-18 01:23:48] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:23:48] [INFO ] Invariant cache hit.
[2023-03-18 01:23:50] [INFO ] Dead Transitions using invariants and state equation in 1396 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1543 ms. Remains : 296/296 places, 1531/1531 transitions.
Support contains 20 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 7 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-18 01:23:50] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:23:50] [INFO ] Invariant cache hit.
[2023-03-18 01:23:50] [INFO ] Implicit Places using invariants in 588 ms returned []
[2023-03-18 01:23:50] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:23:50] [INFO ] Invariant cache hit.
[2023-03-18 01:23:51] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-18 01:23:53] [INFO ] Implicit Places using invariants and state equation in 2687 ms returned []
Implicit Place search using SMT with State Equation took 3277 ms to find 0 implicit places.
[2023-03-18 01:23:53] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:23:53] [INFO ] Invariant cache hit.
[2023-03-18 01:23:55] [INFO ] Dead Transitions using invariants and state equation in 1517 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4803 ms. Remains : 296/296 places, 1531/1531 transitions.
Treatment of property SafeBus-COL-10-LTLFireability-01 finished in 24607 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)) U !p1)&&F((G(F(p2))||(F(p2)&&G(p3))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U (!p1 U (G(!p1)||(!p1&&G(!p0))))) U (G(p2) U G(p0)))))'
Found a Lengthening insensitive property : SafeBus-COL-10-LTLFireability-09
Stuttering acceptance computed with spot in 570 ms :[(NOT p0), (NOT p0), true, (AND p0 (NOT p2)), (NOT p0), (AND p0 p1), (AND p0 (NOT p2) p1), (AND (NOT p0) p1 p2), (NOT p0), p0, (OR (AND p0 p1) (AND p1 p2)), false, (AND p0 (NOT p2) p1)]
Support contains 60 out of 306 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 306/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 15 ms. Remains 306 /306 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-18 01:23:56] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 306 cols
[2023-03-18 01:23:56] [INFO ] Computed 45 place invariants in 6 ms
[2023-03-18 01:23:56] [INFO ] Implicit Places using invariants in 512 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 516 ms to find 10 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 296/306 places, 1531/1531 transitions.
Applied a total of 0 rules in 15 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 548 ms. Remains : 296/306 places, 1531/1531 transitions.
Running random walk in product with property : SafeBus-COL-10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=1 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 7}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 8}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 9}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 10}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=6 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=6 dest: 3}, { cond=(AND p0 p2 p1), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=6 dest: 9}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=6 dest: 10}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=6 dest: 11}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=6 dest: 12}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND p0 p2), acceptance={} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 2}, { cond=p0, acceptance={} source=8 dest: 8}], [{ cond=p0, acceptance={} source=9 dest: 2}, { cond=(NOT p0), acceptance={} source=9 dest: 9}], [{ cond=(OR (AND p0 p1) (AND p2 p1)), acceptance={} source=10 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=10 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p0) p2), acceptance={} source=11 dest: 11}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=12 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=12 dest: 3}, { cond=(AND p0 p2 p1), acceptance={} source=12 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=12 dest: 10}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=12 dest: 12}]], initial=0, aps=[p0:(OR (AND (GEQ s18 1) (GEQ s231 1)) (AND (GEQ s14 1) (GEQ s240 1)) (AND (GEQ s13 1) (GEQ s234 1)) (AND (GEQ s14 1) (GEQ s236 1)) (AND (GEQ s13 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24981 reset in 869 ms.
Product exploration explored 100000 steps with 24934 reset in 895 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p2)))), true, (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 26 factoid took 1593 ms. Reduced automaton from 13 states, 45 edges and 3 AP (stutter sensitive) to 13 states, 46 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 491 ms :[(NOT p0), (NOT p0), true, (AND p0 (NOT p2)), (NOT p0), (AND p0 p1), (AND p0 (NOT p2) p1), (AND (NOT p0) p1 p2), (NOT p0), p0, (OR (AND p0 p1) (AND p1 p2)), false, (AND p0 (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 18) seen :16
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 01:24:01] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
// Phase 1: matrix 642 rows 296 cols
[2023-03-18 01:24:01] [INFO ] Computed 35 place invariants in 10 ms
[2023-03-18 01:24:01] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-18 01:24:01] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 14 ms returned sat
[2023-03-18 01:24:01] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-18 01:24:01] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-18 01:24:01] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 14 ms returned sat
[2023-03-18 01:24:01] [INFO ] After 99ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p2)))), true, (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (G (NOT (AND p1 p0 p2))), (G (NOT (AND p1 (NOT p0) p2)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (AND p0 p2)), (F (AND (NOT p0) p2)), (F (NOT (AND (NOT p1) p0 (NOT p2)))), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (AND p1 p0 (NOT p2))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0) p2)), (F (NOT p0)), (F (OR (AND p1 p0) (AND p1 p2))), (F (AND p1 (NOT p0) (NOT p2))), (F (AND (NOT p1) p0 p2)), (F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p0))), (F (AND p1 p0))]
Knowledge based reduction with 28 factoid took 1875 ms. Reduced automaton from 13 states, 46 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), false]
Stuttering acceptance computed with spot in 234 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), false]
Support contains 60 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 6 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-18 01:24:03] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:24:03] [INFO ] Invariant cache hit.
[2023-03-18 01:24:04] [INFO ] Implicit Places using invariants in 533 ms returned []
[2023-03-18 01:24:04] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:24:04] [INFO ] Invariant cache hit.
[2023-03-18 01:24:04] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-18 01:24:06] [INFO ] Implicit Places using invariants and state equation in 2197 ms returned []
Implicit Place search using SMT with State Equation took 2748 ms to find 0 implicit places.
[2023-03-18 01:24:06] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:24:06] [INFO ] Invariant cache hit.
[2023-03-18 01:24:07] [INFO ] Dead Transitions using invariants and state equation in 1030 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3785 ms. Remains : 296/296 places, 1531/1531 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 920 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (AND p1 (NOT p2) p0), (AND p1 (NOT p2) p0), false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 11) seen :10
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 01:24:08] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:24:08] [INFO ] Invariant cache hit.
[2023-03-18 01:24:09] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-18 01:24:09] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 12 ms returned sat
[2023-03-18 01:24:09] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (G (OR (NOT p1) (NOT p2)))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p2)))), (F (NOT p0)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0))), (F (NOT (OR (AND (NOT p1) p0) (AND (NOT p1) p2)))), (F (AND p0 p2)), (F (AND p1 p0)), (F (NOT (AND (NOT p1) p0 (NOT p2))))]
Knowledge based reduction with 19 factoid took 1153 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(NOT p0), (NOT p0), true, (AND p0 p1), (AND p0 p1), false]
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (NOT p0), true, (AND p0 p1), (AND p0 p1), false]
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (NOT p0), true, (AND p0 p1), (AND p0 p1), false]
Product exploration explored 100000 steps with 25014 reset in 780 ms.
Product exploration explored 100000 steps with 24976 reset in 787 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (NOT p0), true, (AND p0 p1), (AND p0 p1), false]
Support contains 60 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 105 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-18 01:24:12] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-18 01:24:12] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:24:12] [INFO ] Invariant cache hit.
[2023-03-18 01:24:14] [INFO ] Dead Transitions using invariants and state equation in 1277 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1424 ms. Remains : 296/296 places, 1531/1531 transitions.
Support contains 60 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 1531/1531 transitions.
Applied a total of 0 rules in 7 ms. Remains 296 /296 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2023-03-18 01:24:14] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:24:14] [INFO ] Invariant cache hit.
[2023-03-18 01:24:14] [INFO ] Implicit Places using invariants in 480 ms returned []
[2023-03-18 01:24:14] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:24:14] [INFO ] Invariant cache hit.
[2023-03-18 01:24:14] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-18 01:24:16] [INFO ] Implicit Places using invariants and state equation in 2172 ms returned []
Implicit Place search using SMT with State Equation took 2654 ms to find 0 implicit places.
[2023-03-18 01:24:16] [INFO ] Flow matrix only has 642 transitions (discarded 889 similar events)
[2023-03-18 01:24:16] [INFO ] Invariant cache hit.
[2023-03-18 01:24:18] [INFO ] Dead Transitions using invariants and state equation in 1330 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3992 ms. Remains : 296/296 places, 1531/1531 transitions.
Treatment of property SafeBus-COL-10-LTLFireability-09 finished in 22951 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)))'
[2023-03-18 01:24:18] [INFO ] Flatten gal took : 132 ms
[2023-03-18 01:24:18] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 12 ms.
[2023-03-18 01:24:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 306 places, 1531 transitions and 10404 arcs took 16 ms.
Total runtime 183261 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2907/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2907/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2907/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2907/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : SafeBus-COL-10-LTLFireability-01
Could not compute solution for formula : SafeBus-COL-10-LTLFireability-04
Could not compute solution for formula : SafeBus-COL-10-LTLFireability-09
Could not compute solution for formula : SafeBus-COL-10-LTLFireability-13
BK_STOP 1679102756339
--------------------
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 SafeBus-COL-10-LTLFireability-01
ltl formula formula --ltl=/tmp/2907/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 306 places, 1531 transitions and 10404 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.180 real 0.070 user 0.050 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2907/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2907/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2907/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2907/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name SafeBus-COL-10-LTLFireability-04
ltl formula formula --ltl=/tmp/2907/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: =============================================================================
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 306 places, 1531 transitions and 10404 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.180 real 0.070 user 0.040 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2907/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2907/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2907/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2907/ltl_1_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
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:
*** 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:
ltl formula name SafeBus-COL-10-LTLFireability-09
ltl formula formula --ltl=/tmp/2907/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 306 places, 1531 transitions and 10404 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.190 real 0.070 user 0.050 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2907/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2907/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2907/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2907/ltl_2_
terminate called after throwing an instance of 'std::runtime_error'
what(): too many children for formula
ltl formula name SafeBus-COL-10-LTLFireability-13
ltl formula formula --ltl=/tmp/2907/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
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 306 places, 1531 transitions and 10404 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.180 real 0.040 user 0.070 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2907/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2907/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2907/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2907/ltl_3_
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
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:
*** 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="SafeBus-COL-10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is SafeBus-COL-10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r361-smll-167891811100220"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-COL-10.tgz
mv SafeBus-COL-10 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;