fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r263-tall-171654372200153
Last Updated
July 7, 2024

About the Execution of 2023-gold for Murphy-COL-D1N010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
451.199 11880.00 19362.00 361.90 FFFTFFTFFFFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r263-tall-171654372200153.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Murphy-COL-D1N010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654372200153
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 5.4K Apr 11 22:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Apr 11 22:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 11 22:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 11 22:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 6 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 6 10:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 6 10:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 6 10:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 23:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Apr 11 23:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 11 23:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 11 23:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 6 10:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 6 10:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 20K May 18 16:43 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 Murphy-COL-D1N010-LTLFireability-00
FORMULA_NAME Murphy-COL-D1N010-LTLFireability-01
FORMULA_NAME Murphy-COL-D1N010-LTLFireability-02
FORMULA_NAME Murphy-COL-D1N010-LTLFireability-03
FORMULA_NAME Murphy-COL-D1N010-LTLFireability-04
FORMULA_NAME Murphy-COL-D1N010-LTLFireability-05
FORMULA_NAME Murphy-COL-D1N010-LTLFireability-06
FORMULA_NAME Murphy-COL-D1N010-LTLFireability-07
FORMULA_NAME Murphy-COL-D1N010-LTLFireability-08
FORMULA_NAME Murphy-COL-D1N010-LTLFireability-09
FORMULA_NAME Murphy-COL-D1N010-LTLFireability-10
FORMULA_NAME Murphy-COL-D1N010-LTLFireability-11
FORMULA_NAME Murphy-COL-D1N010-LTLFireability-12
FORMULA_NAME Murphy-COL-D1N010-LTLFireability-13
FORMULA_NAME Murphy-COL-D1N010-LTLFireability-14
FORMULA_NAME Murphy-COL-D1N010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716671259984

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-COL-D1N010
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-25 21:07:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 21:07:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 21:07:41] [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.
[2024-05-25 21:07:41] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 21:07:42] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 606 ms
[2024-05-25 21:07:42] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 12 PT places and 14.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2024-05-25 21:07:42] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 27 arcs in 6 ms.
[2024-05-25 21:07:42] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Murphy-COL-D1N010-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D1N010-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 3 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 24 steps, including 0 resets, run visited all 3 properties in 7 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
[2024-05-25 21:07:42] [INFO ] Flatten gal took : 15 ms
[2024-05-25 21:07:42] [INFO ] Flatten gal took : 2 ms
Arc [2:1*[(MOD (ADD $x 1) 2)]] contains successor/predecessor on variables of sort CD
[2024-05-25 21:07:42] [INFO ] Unfolded HLPN to a Petri net with 12 places and 14 transitions 54 arcs in 6 ms.
[2024-05-25 21:07:42] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 10 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
// Phase 1: matrix 14 rows 12 cols
[2024-05-25 21:07:42] [INFO ] Computed 3 invariants in 3 ms
[2024-05-25 21:07:42] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
[2024-05-25 21:07:42] [INFO ] Invariant cache hit.
[2024-05-25 21:07:42] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-25 21:07:42] [INFO ] Invariant cache hit.
[2024-05-25 21:07:42] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 21:07:42] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2024-05-25 21:07:42] [INFO ] Invariant cache hit.
[2024-05-25 21:07:42] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 245 ms. Remains : 12/12 places, 14/14 transitions.
Support contains 12 out of 12 places after structural reductions.
[2024-05-25 21:07:42] [INFO ] Flatten gal took : 6 ms
[2024-05-25 21:07:42] [INFO ] Flatten gal took : 4 ms
[2024-05-25 21:07:42] [INFO ] Input system was already deterministic with 14 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 13) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 21:07:42] [INFO ] Invariant cache hit.
[2024-05-25 21:07:42] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-25 21:07:42] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-25 21:07:43] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 21:07:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:07:43] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-25 21:07:43] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 21:07:43] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 21:07:43] [INFO ] After 5ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 21:07:43] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-25 21:07:43] [INFO ] After 49ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 14/14 transitions.
Graph (complete) has 46 edges and 12 vertex of which 6 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 6 transition count 8
Applied a total of 3 rules in 6 ms. Remains 6 /12 variables (removed 6) and now considering 8/14 (removed 6) transitions.
// Phase 1: matrix 8 rows 6 cols
[2024-05-25 21:07:43] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 21:07:43] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 6/12 places, 8/14 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Probably explored full state space saw : 36 states, properties seen :0
Probabilistic random walk after 132 steps, saw 36 distinct states, run finished after 11 ms. (steps per millisecond=12 ) properties seen :0
Explored full state space saw : 36 states, properties seen :0
Exhaustive walk after 132 steps, saw 36 distinct states, run finished after 2 ms. (steps per millisecond=66 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA Murphy-COL-D1N010-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D1N010-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!(X(G((F(p1)&&p0))))'
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
// Phase 1: matrix 14 rows 12 cols
[2024-05-25 21:07:43] [INFO ] Computed 3 invariants in 1 ms
[2024-05-25 21:07:43] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2024-05-25 21:07:43] [INFO ] Invariant cache hit.
[2024-05-25 21:07:43] [INFO ] Implicit Places using invariants in 26 ms returned [4, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 29 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 10/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 70 ms. Remains : 10/12 places, 14/14 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 269 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Murphy-COL-D1N010-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s2 1)) (OR (LT s1 1) (LT s3 1))), p1:(AND (LT s4 1) (LT s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA Murphy-COL-D1N010-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-COL-D1N010-LTLFireability-02 finished in 506 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' '!(((p0 U G(p1))||F(p0)))'
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2024-05-25 21:07:44] [INFO ] Invariant cache hit.
[2024-05-25 21:07:44] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2024-05-25 21:07:44] [INFO ] Invariant cache hit.
[2024-05-25 21:07:44] [INFO ] Implicit Places using invariants in 23 ms returned [4, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 28 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/12 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 64 ms. Remains : 10/12 places, 14/14 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Murphy-COL-D1N010-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (GEQ s6 1) (GEQ s7 1)), p1:(OR (GEQ s8 3) (GEQ s9 3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 27243 reset in 273 ms.
Product exploration explored 100000 steps with 27181 reset in 140 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 3 factoid took 367 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 50 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=25 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 329 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 14/14 transitions.
Applied a total of 0 rules in 2 ms. Remains 10 /10 variables (removed 0) and now considering 14/14 (removed 0) transitions.
// Phase 1: matrix 14 rows 10 cols
[2024-05-25 21:07:45] [INFO ] Computed 1 invariants in 1 ms
[2024-05-25 21:07:45] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
[2024-05-25 21:07:45] [INFO ] Invariant cache hit.
[2024-05-25 21:07:45] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-25 21:07:45] [INFO ] Invariant cache hit.
[2024-05-25 21:07:45] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 21:07:45] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2024-05-25 21:07:45] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 21:07:45] [INFO ] Invariant cache hit.
[2024-05-25 21:07:45] [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 155 ms. Remains : 10/10 places, 14/14 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 (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 3 factoid took 273 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 154 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=51 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 328 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 27318 reset in 107 ms.
Product exploration explored 100000 steps with 27209 reset in 103 ms.
Built C files in :
/tmp/ltsmin15254016113920450287
[2024-05-25 21:07:46] [INFO ] Computing symmetric may disable matrix : 14 transitions.
[2024-05-25 21:07:46] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 21:07:46] [INFO ] Computing symmetric may enable matrix : 14 transitions.
[2024-05-25 21:07:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 21:07:46] [INFO ] Computing Do-Not-Accords matrix : 14 transitions.
[2024-05-25 21:07:46] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 21:07:46] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15254016113920450287
Running compilation step : cd /tmp/ltsmin15254016113920450287;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 170 ms.
Running link step : cd /tmp/ltsmin15254016113920450287;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin15254016113920450287;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12065619717510432429.hoa' '--buchi-type=spotba'
LTSmin run took 108 ms.
FORMULA Murphy-COL-D1N010-LTLFireability-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Murphy-COL-D1N010-LTLFireability-03 finished in 3273 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)))'
Support contains 2 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
// Phase 1: matrix 14 rows 12 cols
[2024-05-25 21:07:47] [INFO ] Computed 3 invariants in 1 ms
[2024-05-25 21:07:47] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2024-05-25 21:07:47] [INFO ] Invariant cache hit.
[2024-05-25 21:07:47] [INFO ] Implicit Places using invariants in 29 ms returned [4, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 10/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 69 ms. Remains : 10/12 places, 14/14 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Murphy-COL-D1N010-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s8 3) (GEQ s9 3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 1 ms.
FORMULA Murphy-COL-D1N010-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-COL-D1N010-LTLFireability-04 finished in 168 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 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2024-05-25 21:07:47] [INFO ] Invariant cache hit.
[2024-05-25 21:07:47] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2024-05-25 21:07:47] [INFO ] Invariant cache hit.
[2024-05-25 21:07:47] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-25 21:07:47] [INFO ] Invariant cache hit.
[2024-05-25 21:07:47] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 21:07:47] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-25 21:07:47] [INFO ] Invariant cache hit.
[2024-05-25 21:07:47] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116 ms. Remains : 12/12 places, 14/14 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Murphy-COL-D1N010-LTLFireability-06 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 s1 3) (LT s5 1) (LT s9 1)) (OR (LT s0 3) (LT s4 1) (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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 79 ms.
Product exploration explored 100000 steps with 50000 reset in 84 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 21 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Murphy-COL-D1N010-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Murphy-COL-D1N010-LTLFireability-06 finished in 417 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||(p1 U X(p2))))))'
Support contains 4 out of 12 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2024-05-25 21:07:47] [INFO ] Invariant cache hit.
[2024-05-25 21:07:47] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2024-05-25 21:07:47] [INFO ] Invariant cache hit.
[2024-05-25 21:07:47] [INFO ] Implicit Places using invariants in 28 ms returned [4, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 10/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 71 ms. Remains : 10/12 places, 14/14 transitions.
Stuttering acceptance computed with spot in 133 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : Murphy-COL-D1N010-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s8 3) (GEQ s9 3)), p2:(AND (LT s4 1) (LT s5 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 22047 reset in 114 ms.
Stack based approach found an accepted trace after 80 steps with 18 reset with depth 10 and stack size 10 in 0 ms.
FORMULA Murphy-COL-D1N010-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D1N010-LTLFireability-07 finished in 354 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(G(p0)))'
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2024-05-25 21:07:48] [INFO ] Invariant cache hit.
[2024-05-25 21:07:48] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2024-05-25 21:07:48] [INFO ] Invariant cache hit.
[2024-05-25 21:07:48] [INFO ] Implicit Places using invariants in 20 ms returned [4, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 21 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/12 places, 14/14 transitions.
Applied a total of 0 rules in 2 ms. Remains 10 /10 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 53 ms. Remains : 10/12 places, 14/14 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Murphy-COL-D1N010-LTLFireability-08 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 s0 1) (LT s2 1)) (OR (LT s1 1) (LT s3 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 149 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 0 ms.
FORMULA Murphy-COL-D1N010-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D1N010-LTLFireability-08 finished in 257 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((X(p1)||p0)) U X(!p2)))'
Support contains 10 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2024-05-25 21:07:48] [INFO ] Invariant cache hit.
[2024-05-25 21:07:48] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2024-05-25 21:07:48] [INFO ] Invariant cache hit.
[2024-05-25 21:07:48] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-25 21:07:48] [INFO ] Invariant cache hit.
[2024-05-25 21:07:48] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 21:07:48] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-25 21:07:48] [INFO ] Invariant cache hit.
[2024-05-25 21:07:48] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 102 ms. Remains : 12/12 places, 14/14 transitions.
Stuttering acceptance computed with spot in 279 ms :[p2, (AND (NOT p1) p2), p2, true, (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Murphy-COL-D1N010-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 4}, { cond=p2, acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s2 1)) (AND (GEQ s1 1) (GEQ s3 1)) (AND (GEQ s1 3) (GEQ s5 1) (GEQ s9 1)) (AND (GEQ s0 3) (GEQ s4 1) (GEQ s8 1))), p1:(AND (OR...], 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 243 steps with 2 reset in 1 ms.
FORMULA Murphy-COL-D1N010-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-COL-D1N010-LTLFireability-09 finished in 414 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(G(((X(p1)||(!p2 U G(p1)))&&p0))))'
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2024-05-25 21:07:48] [INFO ] Invariant cache hit.
[2024-05-25 21:07:48] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2024-05-25 21:07:48] [INFO ] Invariant cache hit.
[2024-05-25 21:07:48] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-25 21:07:48] [INFO ] Invariant cache hit.
[2024-05-25 21:07:49] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 21:07:49] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-25 21:07:49] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 21:07:49] [INFO ] Invariant cache hit.
[2024-05-25 21:07:49] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 131 ms. Remains : 12/12 places, 14/14 transitions.
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Murphy-COL-D1N010-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=0 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p0 p1 p2), acceptance={1} source=0 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1) p2), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 p1 p2), acceptance={1} source=3 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={1} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 p1 p2), acceptance={1} source=4 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p0:(AND (LT s8 1) (LT s9 1)), p1:(OR (AND (GEQ s0 1) (GEQ s2 1) (GEQ s4 1)) (AND (GEQ s1 1) (GEQ s3 1) (GEQ s5 1))), p2:(AND (OR (LT s1 3) (LT s5 1) (LT s...], nbAcceptance=2, 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 8762 reset in 159 ms.
Stack based approach found an accepted trace after 20 steps with 2 reset with depth 17 and stack size 17 in 0 ms.
FORMULA Murphy-COL-D1N010-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D1N010-LTLFireability-10 finished in 574 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)))'
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2024-05-25 21:07:49] [INFO ] Invariant cache hit.
[2024-05-25 21:07:49] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2024-05-25 21:07:49] [INFO ] Invariant cache hit.
[2024-05-25 21:07:49] [INFO ] Implicit Places using invariants in 24 ms returned [4, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 26 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 10/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56 ms. Remains : 10/12 places, 14/14 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Murphy-COL-D1N010-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LT s6 1) (LT s7 1) (LT s4 1) (LT s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Murphy-COL-D1N010-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-COL-D1N010-LTLFireability-11 finished in 168 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)&&F(!p1)) U (G((!p0&&F(!p1)))||(G(!p0)&&X((p2&&X(!p1))))))))'
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2024-05-25 21:07:49] [INFO ] Invariant cache hit.
[2024-05-25 21:07:49] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2024-05-25 21:07:49] [INFO ] Invariant cache hit.
[2024-05-25 21:07:49] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-25 21:07:49] [INFO ] Invariant cache hit.
[2024-05-25 21:07:49] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 21:07:49] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-25 21:07:49] [INFO ] Invariant cache hit.
[2024-05-25 21:07:49] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104 ms. Remains : 12/12 places, 14/14 transitions.
Stuttering acceptance computed with spot in 325 ms :[(OR p0 p1), (OR p0 p1), true, (AND (NOT p0) p1), p0, p1, (AND (NOT p0) p1)]
Running random walk in product with property : Murphy-COL-D1N010-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 6}], [{ cond=p0, acceptance={} source=4 dest: 2}, { cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=p1, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (GEQ s8 1) (GEQ s9 1)), p1:(AND (OR (LT s1 3) (LT s5 1) (LT s9 1)) (OR (LT s0 3) (LT s4 1) (LT s8 1))), p2:(OR (GEQ s10 3) (GEQ s11 3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Murphy-COL-D1N010-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-COL-D1N010-LTLFireability-13 finished in 458 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)&&G((p0||X(F(!p1))))))))'
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2024-05-25 21:07:50] [INFO ] Invariant cache hit.
[2024-05-25 21:07:50] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2024-05-25 21:07:50] [INFO ] Invariant cache hit.
[2024-05-25 21:07:50] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-25 21:07:50] [INFO ] Invariant cache hit.
[2024-05-25 21:07:50] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 21:07:50] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-25 21:07:50] [INFO ] Invariant cache hit.
[2024-05-25 21:07:50] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 119 ms. Remains : 12/12 places, 14/14 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR p0 p1), (OR p0 p1), (OR p0 p1), p0, p1, (AND p1 (NOT p0))]
Running random walk in product with property : Murphy-COL-D1N010-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=true, acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s2 1)) (OR (LT s1 1) (LT s3 1))), p1:(OR (AND (GEQ s0 1) (GEQ s2 1) (GEQ s4 1)) (AND (GEQ s1 1) (GEQ s3 1) (GEQ s5 1)))], 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 537 reset in 113 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 20 in 0 ms.
FORMULA Murphy-COL-D1N010-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D1N010-LTLFireability-14 finished in 515 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(!p0)&&X(G(!p1))))'
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2024-05-25 21:07:50] [INFO ] Invariant cache hit.
[2024-05-25 21:07:50] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2024-05-25 21:07:50] [INFO ] Invariant cache hit.
[2024-05-25 21:07:50] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-25 21:07:50] [INFO ] Invariant cache hit.
[2024-05-25 21:07:50] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 21:07:50] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-25 21:07:50] [INFO ] Invariant cache hit.
[2024-05-25 21:07:50] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111 ms. Remains : 12/12 places, 14/14 transitions.
Stuttering acceptance computed with spot in 141 ms :[p1, true, (OR p1 p0), (OR p0 p1)]
Running random walk in product with property : Murphy-COL-D1N010-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=p1, acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (OR (LT s1 3) (LT s5 1) (LT s9 1)) (OR (LT s0 3) (LT s4 1) (LT s8 1))), p0:(OR (GEQ s10 3) (GEQ s11 3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Murphy-COL-D1N010-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-COL-D1N010-LTLFireability-15 finished in 273 ms.
All properties solved by simple procedures.
Total runtime 9342 ms.

BK_STOP 1716671271864

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="Murphy-COL-D1N010"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is Murphy-COL-D1N010, 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 r263-tall-171654372200153"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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