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

About the Execution of LTSMin+red for PGCD-COL-D02N100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
485.659 19118.00 28770.00 418.20 FFFF?TTFFFF??FFF 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.r521-tall-167987246600396.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 PGCD-COL-D02N100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246600396
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 5.8K Mar 23 15:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Mar 23 15:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 7 12:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 7 12:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 7 12:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 7 12:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 7.5K Mar 23 15:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 23 15:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 23 15:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 23 15:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 7 12:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 7 12:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_pt
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 11K Mar 31 16:48 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 PGCD-COL-D02N100-LTLFireability-00
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-01
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-02
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-03
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-04
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-05
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-06
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-07
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-08
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-09
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-10
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-11
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-12
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-13
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-14
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680940423955

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=PGCD-COL-D02N100
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-08 07:53:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-08 07:53:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-08 07:53:45] [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-04-08 07:53:45] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-04-08 07:53:46] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 724 ms
[2023-04-08 07:53:46] [INFO ] Imported 3 HL places and 3 HL transitions for a total of 9 PT places and 9.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2023-04-08 07:53:46] [INFO ] Built PT skeleton of HLPN with 3 places and 3 transitions 14 arcs in 7 ms.
[2023-04-08 07:53:46] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 1 properties that can be checked using skeleton over-approximation.
FORMULA PGCD-COL-D02N100-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
[2023-04-08 07:53:46] [INFO ] Flatten gal took : 12 ms
[2023-04-08 07:53:46] [INFO ] Flatten gal took : 1 ms
Arc [2:1*[(MOD (ADD $x 1) 3)]] contains successor/predecessor on variables of sort CD
[2023-04-08 07:53:46] [INFO ] Unfolded HLPN to a Petri net with 9 places and 9 transitions 42 arcs in 5 ms.
[2023-04-08 07:53:46] [INFO ] Unfolded 15 HLPN properties in 0 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PGCD-COL-D02N100-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-COL-D02N100-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-COL-D02N100-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 5 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 9 cols
[2023-04-08 07:53:46] [INFO ] Computed 4 invariants in 6 ms
[2023-04-08 07:53:46] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
[2023-04-08 07:53:46] [INFO ] Invariant cache hit.
[2023-04-08 07:53:46] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-08 07:53:46] [INFO ] Invariant cache hit.
[2023-04-08 07:53:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:53:46] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-04-08 07:53:46] [INFO ] Invariant cache hit.
[2023-04-08 07:53:46] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 231 ms. Remains : 9/9 places, 9/9 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-04-08 07:53:46] [INFO ] Flatten gal took : 5 ms
[2023-04-08 07:53:46] [INFO ] Flatten gal took : 4 ms
[2023-04-08 07:53:46] [INFO ] Input system was already deterministic with 9 transitions.
Finished random walk after 107 steps, including 0 resets, run visited all 8 properties in 15 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
FORMULA PGCD-COL-D02N100-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 5 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 07:53:47] [INFO ] Invariant cache hit.
[2023-04-08 07:53:47] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2023-04-08 07:53:47] [INFO ] Invariant cache hit.
[2023-04-08 07:53:47] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-08 07:53:47] [INFO ] Invariant cache hit.
[2023-04-08 07:53:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:53:47] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-04-08 07:53:47] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:53:47] [INFO ] Invariant cache hit.
[2023-04-08 07:53:47] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115 ms. Remains : 9/9 places, 9/9 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 147 ms :[(NOT p0)]
Running random walk in product with property : PGCD-COL-D02N100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s2 1) (LT s5 1) (LT s8 1)) (OR (LT s0 1) (LT s3 1) (LT s6 1)) (OR (LT s1 1) (LT s4 1) (LT s7 1)))], 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 261 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 1 ms.
FORMULA PGCD-COL-D02N100-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property PGCD-COL-D02N100-LTLFireability-02 finished in 575 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(p1))))'
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 07:53:47] [INFO ] Invariant cache hit.
[2023-04-08 07:53:47] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-04-08 07:53:47] [INFO ] Invariant cache hit.
[2023-04-08 07:53:47] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-08 07:53:47] [INFO ] Invariant cache hit.
[2023-04-08 07:53:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:53:47] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-04-08 07:53:47] [INFO ] Invariant cache hit.
[2023-04-08 07:53:47] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 102 ms. Remains : 9/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 188 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : PGCD-COL-D02N100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s3 1)) (AND (GEQ s1 1) (GEQ s4 1)) (AND (GEQ s2 1) (GEQ s5 1))), p0:(AND (OR (LT s0 3) (LT s6 1)) (OR (LT s1 3) (LT s7 1)) (OR...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 135 ms.
Entered a terminal (fully accepting) state of product in 52226 steps with 0 reset in 143 ms.
FORMULA PGCD-COL-D02N100-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PGCD-COL-D02N100-LTLFireability-03 finished in 588 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||G((p1||G(p2)))))'
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 07:53:48] [INFO ] Invariant cache hit.
[2023-04-08 07:53:48] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
[2023-04-08 07:53:48] [INFO ] Invariant cache hit.
[2023-04-08 07:53:48] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-08 07:53:48] [INFO ] Invariant cache hit.
[2023-04-08 07:53:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:53:48] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-04-08 07:53:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:53:48] [INFO ] Invariant cache hit.
[2023-04-08 07:53:48] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 119 ms. Remains : 9/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PGCD-COL-D02N100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (OR (LT s0 3) (LT s6 1)) (OR (LT s1 3) (LT s7 1)) (OR (LT s2 3) (LT s8 1))), p0:(AND (OR (LT s2 1) (LT s5 1) (LT s8 1)) (OR (LT s0 1) (LT s3 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 132 ms.
Product exploration explored 100000 steps with 0 reset in 192 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 14 factoid took 299 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10037 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=358 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-08 07:53:49] [INFO ] Invariant cache hit.
[2023-04-08 07:53:49] [INFO ] After 19ms SMT Verify possible using all constraints in real 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 p1 (NOT p0) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (AND p2 (NOT p1))), (F (NOT p2)), (F (NOT p1)), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 16 factoid took 579 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 3 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 07:53:50] [INFO ] Invariant cache hit.
[2023-04-08 07:53:50] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2023-04-08 07:53:50] [INFO ] Invariant cache hit.
[2023-04-08 07:53:50] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-08 07:53:50] [INFO ] Invariant cache hit.
[2023-04-08 07:53:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:53:50] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-04-08 07:53:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:53:50] [INFO ] Invariant cache hit.
[2023-04-08 07:53:50] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115 ms. Remains : 9/9 places, 9/9 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X p1), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 14 factoid took 276 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10075 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=915 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-08 07:53:51] [INFO ] Invariant cache hit.
[2023-04-08 07:53:51] [INFO ] After 23ms SMT Verify possible using all constraints in real 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 p1 (NOT p0) p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X p1), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (AND p2 (NOT p1))), (F (NOT p2)), (F (NOT p1)), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 16 factoid took 585 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 114 ms.
Product exploration explored 100000 steps with 0 reset in 144 ms.
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 07:53:52] [INFO ] Invariant cache hit.
[2023-04-08 07:53:52] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2023-04-08 07:53:52] [INFO ] Invariant cache hit.
[2023-04-08 07:53:52] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-08 07:53:52] [INFO ] Invariant cache hit.
[2023-04-08 07:53:52] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:53:52] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-04-08 07:53:52] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:53:52] [INFO ] Invariant cache hit.
[2023-04-08 07:53:52] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 123 ms. Remains : 9/9 places, 9/9 transitions.
Treatment of property PGCD-COL-D02N100-LTLFireability-04 finished in 4433 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!p0) U (X(X(F(!p2)))||p1)))'
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 07:53:52] [INFO ] Invariant cache hit.
[2023-04-08 07:53:52] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
[2023-04-08 07:53:52] [INFO ] Invariant cache hit.
[2023-04-08 07:53:52] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-08 07:53:52] [INFO ] Invariant cache hit.
[2023-04-08 07:53:52] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:53:52] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-04-08 07:53:52] [INFO ] Invariant cache hit.
[2023-04-08 07:53:52] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 103 ms. Remains : 9/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p1) p2), (OR (AND (NOT p1) p2) (AND p0 p2)), (OR (AND (NOT p1) p2) (AND p0 p2)), p2]
Running random walk in product with property : PGCD-COL-D02N100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={0} source=2 dest: 3}], [{ cond=p2, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s0 3) (GEQ s6 1)) (AND (GEQ s1 3) (GEQ s7 1)) (AND (GEQ s2 3) (GEQ s8 1))), p0:(AND (OR (LT s0 3) (LT s6 1)) (OR (LT s1 3) (LT s7 1)) (OR...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 135 ms.
Product exploration explored 100000 steps with 33333 reset in 138 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) p0 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 20 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PGCD-COL-D02N100-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PGCD-COL-D02N100-LTLFireability-06 finished in 598 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(!p0))))'
Support contains 6 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 07:53:53] [INFO ] Invariant cache hit.
[2023-04-08 07:53:53] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
[2023-04-08 07:53:53] [INFO ] Invariant cache hit.
[2023-04-08 07:53:53] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-08 07:53:53] [INFO ] Invariant cache hit.
[2023-04-08 07:53:53] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:53:53] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-04-08 07:53:53] [INFO ] Invariant cache hit.
[2023-04-08 07:53:53] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 102 ms. Remains : 9/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 114 ms :[p0, p0, p0]
Running random walk in product with property : PGCD-COL-D02N100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=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:(AND (OR (LT s0 3) (LT s6 1)) (OR (LT s1 3) (LT s7 1)) (OR (LT s2 3) (LT s8 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 23462 reset in 80 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA PGCD-COL-D02N100-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property PGCD-COL-D02N100-LTLFireability-07 finished in 309 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 07:53:53] [INFO ] Invariant cache hit.
[2023-04-08 07:53:53] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
[2023-04-08 07:53:53] [INFO ] Invariant cache hit.
[2023-04-08 07:53:53] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-04-08 07:53:53] [INFO ] Invariant cache hit.
[2023-04-08 07:53:53] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:53:53] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-04-08 07:53:53] [INFO ] Invariant cache hit.
[2023-04-08 07:53:53] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 163 ms. Remains : 9/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PGCD-COL-D02N100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s2 1) (LT s5 1) (LT s8 1)) (OR (LT s0 1) (LT s3 1) (LT s6 1)) (OR (LT s1 1) (LT s4 1) (LT s7 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 85 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 24 in 0 ms.
FORMULA PGCD-COL-D02N100-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property PGCD-COL-D02N100-LTLFireability-08 finished in 359 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(G(p1))&&p0))&&(F(!p2) U ((p1&&F(!p2))||G(F(!p2))))))'
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 4 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 07:53:54] [INFO ] Invariant cache hit.
[2023-04-08 07:53:54] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-04-08 07:53:54] [INFO ] Invariant cache hit.
[2023-04-08 07:53:54] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-04-08 07:53:54] [INFO ] Invariant cache hit.
[2023-04-08 07:53:54] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:53:54] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-04-08 07:53:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:53:54] [INFO ] Invariant cache hit.
[2023-04-08 07:53:54] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 122 ms. Remains : 9/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p1) (NOT p0) p2), (NOT p1), (NOT p0), p2, p2]
Running random walk in product with property : PGCD-COL-D02N100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=p2, acceptance={} source=0 dest: 4}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (LT s2 1) (LT s5 1) (LT s8 1)) (OR (LT s0 1) (LT s3 1) (LT s6 1)) (OR (LT s1 1) (LT s4 1) (LT s7 1))), p1:(AND (OR (LT s2 1) (LT s5 1) (LT s8 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 104 ms.
Stack based approach found an accepted trace after 36 steps with 0 reset with depth 37 and stack size 37 in 0 ms.
FORMULA PGCD-COL-D02N100-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property PGCD-COL-D02N100-LTLFireability-09 finished in 463 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&(G(F(!p1)) U (G(p0)||p2))))'
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 07:53:54] [INFO ] Invariant cache hit.
[2023-04-08 07:53:54] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2023-04-08 07:53:54] [INFO ] Invariant cache hit.
[2023-04-08 07:53:54] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-04-08 07:53:54] [INFO ] Invariant cache hit.
[2023-04-08 07:53:54] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:53:54] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-04-08 07:53:54] [INFO ] Invariant cache hit.
[2023-04-08 07:53:54] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108 ms. Remains : 9/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 272 ms :[(NOT p0), (NOT p0), p1, p1, (AND (NOT p0) (NOT p2)), true, (AND p1 (NOT p0))]
Running random walk in product with property : PGCD-COL-D02N100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 2}, { cond=(NOT p0), acceptance={} source=6 dest: 3}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(OR (AND (GEQ s2 1) (GEQ s5 1) (GEQ s8 1)) (AND (GEQ s0 1) (GEQ s3 1) (GEQ s6 1)) (AND (GEQ s1 1) (GEQ s4 1) (GEQ s7 1))), p0:(OR (AND (GEQ s0 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 97 ms.
Entered a terminal (fully accepting) state of product in 91516 steps with 0 reset in 105 ms.
FORMULA PGCD-COL-D02N100-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PGCD-COL-D02N100-LTLFireability-10 finished in 609 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G((p0 U !p1)) U !p1)&&(X((G(!p1) U (p0&&G(!p1))))||p2))))'
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 07:53:55] [INFO ] Invariant cache hit.
[2023-04-08 07:53:55] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2023-04-08 07:53:55] [INFO ] Invariant cache hit.
[2023-04-08 07:53:55] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-08 07:53:55] [INFO ] Invariant cache hit.
[2023-04-08 07:53:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:53:55] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-04-08 07:53:55] [INFO ] Invariant cache hit.
[2023-04-08 07:53:55] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98 ms. Remains : 9/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 306 ms :[(OR p1 (AND (NOT p0) (NOT p2))), (OR p1 (AND (NOT p0) (NOT p2))), true, p1, p1, p1, (OR (NOT p0) p1), p1]
Running random walk in product with property : PGCD-COL-D02N100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p0 p2), acceptance={} source=1 dest: 4}, { cond=(AND p1 p0 p2), acceptance={} source=1 dest: 5}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={} source=4 dest: 3}, { cond=(OR (NOT p1) p0), acceptance={} source=4 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=5 dest: 4}, { cond=(AND p1 p0), acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 7}], [{ cond=p1, acceptance={} source=7 dest: 2}, { cond=(NOT p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(AND (OR (LT s0 3) (LT s6 1)) (OR (LT s1 3) (LT s7 1)) (OR (LT s2 3) (LT s8 1))), p0:(OR (AND (GEQ s0 1) (GEQ s3 1)) (AND (GEQ s1 1) (GEQ s4 1)) (AND (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 103 ms.
Product exploration explored 100000 steps with 7 reset in 147 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (AND p1 p0 p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 292 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 253 ms :[p1, true, p1, p1, p1, false, false]
Incomplete random walk after 10037 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=477 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-08 07:53:56] [INFO ] Invariant cache hit.
[2023-04-08 07:53:56] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:53:56] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 07:53:56] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-08 07:53:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:53:56] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-08 07:53:56] [INFO ] After 60ms 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 p1 p0 p2), (X (AND p1 p0 p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND (NOT p0) p1))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 10 factoid took 411 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[p1, p1, p1]
Stuttering acceptance computed with spot in 118 ms :[p1, p1, p1]
[2023-04-08 07:53:57] [INFO ] Invariant cache hit.
[2023-04-08 07:53:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:53:57] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 07:53:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:53:57] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:53:57] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:53:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:53:57] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-08 07:53:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:53:57] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-08 07:53:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:53:57] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:53:57] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 7 ms.
[2023-04-08 07:53:57] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Could not prove EG p1
Support contains 6 out of 9 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 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 07:53:57] [INFO ] Invariant cache hit.
[2023-04-08 07:53:57] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
[2023-04-08 07:53:57] [INFO ] Invariant cache hit.
[2023-04-08 07:53:57] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-08 07:53:57] [INFO ] Invariant cache hit.
[2023-04-08 07:53:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:53:57] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-04-08 07:53:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:53:57] [INFO ] Invariant cache hit.
[2023-04-08 07:53:57] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117 ms. Remains : 9/9 places, 9/9 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 : [p1, (X p1), true]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[p1, p1, p1]
Finished random walk after 102 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=102 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), true]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 284 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[p1, p1, p1]
Stuttering acceptance computed with spot in 121 ms :[p1, p1, p1]
[2023-04-08 07:53:58] [INFO ] Invariant cache hit.
[2023-04-08 07:53:58] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:53:58] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 07:53:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 07:53:58] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-04-08 07:53:58] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 07:53:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:53:58] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 07:53:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 07:53:58] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-04-08 07:53:58] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:53:58] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-04-08 07:53:58] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2023-04-08 07:53:58] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 113 ms :[p1, p1, p1]
Product exploration explored 100000 steps with 0 reset in 78 ms.
Product exploration explored 100000 steps with 19 reset in 125 ms.
Support contains 6 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 07:53:58] [INFO ] Invariant cache hit.
[2023-04-08 07:53:58] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
[2023-04-08 07:53:58] [INFO ] Invariant cache hit.
[2023-04-08 07:53:58] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-08 07:53:58] [INFO ] Invariant cache hit.
[2023-04-08 07:53:58] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:53:58] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-04-08 07:53:58] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:53:58] [INFO ] Invariant cache hit.
[2023-04-08 07:53:58] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 120 ms. Remains : 9/9 places, 9/9 transitions.
Treatment of property PGCD-COL-D02N100-LTLFireability-11 finished in 3626 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 07:53:58] [INFO ] Invariant cache hit.
[2023-04-08 07:53:58] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
[2023-04-08 07:53:58] [INFO ] Invariant cache hit.
[2023-04-08 07:53:58] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-08 07:53:58] [INFO ] Invariant cache hit.
[2023-04-08 07:53:58] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:53:58] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-04-08 07:53:58] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:53:58] [INFO ] Invariant cache hit.
[2023-04-08 07:53:58] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 107 ms. Remains : 9/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PGCD-COL-D02N100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s3 1)) (AND (GEQ s1 1) (GEQ s4 1)) (AND (GEQ s2 1) (GEQ s5 1))), p1:(OR (AND (GEQ s2 1) (GEQ s5 1) (GEQ s8 1)) (AND (GEQ s0 1)...], 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 104 ms.
Product exploration explored 100000 steps with 0 reset in 121 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 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 92 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 204 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=204 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 148 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 3 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 07:53:59] [INFO ] Invariant cache hit.
[2023-04-08 07:53:59] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-04-08 07:53:59] [INFO ] Invariant cache hit.
[2023-04-08 07:53:59] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-04-08 07:53:59] [INFO ] Invariant cache hit.
[2023-04-08 07:53:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:53:59] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-04-08 07:53:59] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:53:59] [INFO ] Invariant cache hit.
[2023-04-08 07:53:59] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 110 ms. Remains : 9/9 places, 9/9 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 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 91 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 107 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=107 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 156 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 101 ms.
Product exploration explored 100000 steps with 0 reset in 114 ms.
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 07:54:00] [INFO ] Invariant cache hit.
[2023-04-08 07:54:00] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2023-04-08 07:54:00] [INFO ] Invariant cache hit.
[2023-04-08 07:54:00] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-08 07:54:00] [INFO ] Invariant cache hit.
[2023-04-08 07:54:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:54:00] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-04-08 07:54:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:54:01] [INFO ] Invariant cache hit.
[2023-04-08 07:54:01] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 114 ms. Remains : 9/9 places, 9/9 transitions.
Treatment of property PGCD-COL-D02N100-LTLFireability-12 finished in 2354 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||X((p1&&F(!p0)))))'
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 07:54:01] [INFO ] Invariant cache hit.
[2023-04-08 07:54:01] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
[2023-04-08 07:54:01] [INFO ] Invariant cache hit.
[2023-04-08 07:54:01] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-08 07:54:01] [INFO ] Invariant cache hit.
[2023-04-08 07:54:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 07:54:01] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-04-08 07:54:01] [INFO ] Invariant cache hit.
[2023-04-08 07:54:01] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85 ms. Remains : 9/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 214 ms :[true, p0, (OR (NOT p1) p0), p0, p0, p0]
Running random walk in product with property : PGCD-COL-D02N100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=3, aps=[p0:(AND (OR (LT s0 3) (LT s6 1)) (OR (LT s1 3) (LT s7 1)) (OR (LT s2 3) (LT s8 1))), p1:(OR (AND (GEQ s0 1) (GEQ s3 1)) (AND (GEQ s1 1) (GEQ s4 1)) (AND (...], 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 23449 reset in 87 ms.
Stack based approach found an accepted trace after 1376 steps with 332 reset with depth 7 and stack size 7 in 1 ms.
FORMULA PGCD-COL-D02N100-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property PGCD-COL-D02N100-LTLFireability-13 finished in 408 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||G((p1||G(p2)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G((p0 U !p1)) U !p1)&&(X((G(!p1) U (p0&&G(!p1))))||p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
[2023-04-08 07:54:01] [INFO ] Flatten gal took : 5 ms
[2023-04-08 07:54:01] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-04-08 07:54:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 9 places, 9 transitions and 42 arcs took 0 ms.
Total runtime 16391 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1501/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1501/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1501/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : PGCD-COL-D02N100-LTLFireability-04
Could not compute solution for formula : PGCD-COL-D02N100-LTLFireability-11
Could not compute solution for formula : PGCD-COL-D02N100-LTLFireability-12

BK_STOP 1680940443073

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name PGCD-COL-D02N100-LTLFireability-04
ltl formula formula --ltl=/tmp/1501/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 9 places, 9 transitions and 42 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.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1501/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1501/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1501/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1501/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name PGCD-COL-D02N100-LTLFireability-11
ltl formula formula --ltl=/tmp/1501/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 9 places, 9 transitions and 42 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
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): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1501/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1501/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1501/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1501/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name PGCD-COL-D02N100-LTLFireability-12
ltl formula formula --ltl=/tmp/1501/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 9 places, 9 transitions and 42 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1501/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1501/ltl_2_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1501/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1501/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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="PGCD-COL-D02N100"
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 PGCD-COL-D02N100, 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 r521-tall-167987246600396"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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