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-167987246600355.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 Murphy-PT-D3N050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246600355
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 6.0K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 7 12:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 7 12:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 7 12:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 7 12:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 7 12:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 7 12:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 15K 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 Murphy-PT-D3N050-LTLCardinality-00
FORMULA_NAME Murphy-PT-D3N050-LTLCardinality-01
FORMULA_NAME Murphy-PT-D3N050-LTLCardinality-02
FORMULA_NAME Murphy-PT-D3N050-LTLCardinality-03
FORMULA_NAME Murphy-PT-D3N050-LTLCardinality-04
FORMULA_NAME Murphy-PT-D3N050-LTLCardinality-05
FORMULA_NAME Murphy-PT-D3N050-LTLCardinality-06
FORMULA_NAME Murphy-PT-D3N050-LTLCardinality-07
FORMULA_NAME Murphy-PT-D3N050-LTLCardinality-08
FORMULA_NAME Murphy-PT-D3N050-LTLCardinality-09
FORMULA_NAME Murphy-PT-D3N050-LTLCardinality-10
FORMULA_NAME Murphy-PT-D3N050-LTLCardinality-11
FORMULA_NAME Murphy-PT-D3N050-LTLCardinality-12
FORMULA_NAME Murphy-PT-D3N050-LTLCardinality-13
FORMULA_NAME Murphy-PT-D3N050-LTLCardinality-14
FORMULA_NAME Murphy-PT-D3N050-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680938677620

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-PT-D3N050
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-08 07:24:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-08 07:24:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-08 07:24:39] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2023-04-08 07:24:39] [INFO ] Transformed 24 places.
[2023-04-08 07:24:39] [INFO ] Transformed 28 transitions.
[2023-04-08 07:24:39] [INFO ] Parsed PT model containing 24 places and 28 transitions and 108 arcs in 81 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Murphy-PT-D3N050-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D3N050-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D3N050-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D3N050-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D3N050-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 9 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 24 cols
[2023-04-08 07:24:39] [INFO ] Computed 5 invariants in 5 ms
[2023-04-08 07:24:39] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
[2023-04-08 07:24:39] [INFO ] Invariant cache hit.
[2023-04-08 07:24:39] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-04-08 07:24:39] [INFO ] Invariant cache hit.
[2023-04-08 07:24:39] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:39] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-04-08 07:24:39] [INFO ] Invariant cache hit.
[2023-04-08 07:24:39] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 260 ms. Remains : 24/24 places, 28/28 transitions.
Support contains 21 out of 24 places after structural reductions.
[2023-04-08 07:24:40] [INFO ] Flatten gal took : 18 ms
[2023-04-08 07:24:40] [INFO ] Flatten gal took : 6 ms
[2023-04-08 07:24:40] [INFO ] Input system was already deterministic with 28 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 26) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-04-08 07:24:40] [INFO ] Invariant cache hit.
[2023-04-08 07:24:40] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:24:40] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:24:40] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-08 07:24:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:24:40] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-04-08 07:24:40] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-04-08 07:24:40] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:40] [INFO ] After 11ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-04-08 07:24:40] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 6 ms to minimize.
[2023-04-08 07:24:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-04-08 07:24:40] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-04-08 07:24:40] [INFO ] After 158ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Graph (complete) has 92 edges and 24 vertex of which 12 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 12 transition count 16
Applied a total of 5 rules in 4 ms. Remains 12 /24 variables (removed 12) and now considering 16/28 (removed 12) transitions.
// Phase 1: matrix 16 rows 12 cols
[2023-04-08 07:24:40] [INFO ] Computed 0 invariants in 0 ms
[2023-04-08 07:24:40] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 12/24 places, 16/28 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Probably explored full state space saw : 1296 states, properties seen :0
Probabilistic random walk after 8208 steps, saw 1296 distinct states, run finished after 30 ms. (steps per millisecond=273 ) properties seen :0
Explored full state space saw : 1296 states, properties seen :0
Exhaustive walk after 8208 steps, saw 1296 distinct states, run finished after 27 ms. (steps per millisecond=304 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 5 atomic propositions for a total of 11 simplifications.
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' '!(G(F(p0)))'
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 24 cols
[2023-04-08 07:24:41] [INFO ] Computed 5 invariants in 0 ms
[2023-04-08 07:24:41] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
[2023-04-08 07:24:41] [INFO ] Invariant cache hit.
[2023-04-08 07:24:41] [INFO ] Implicit Places using invariants in 35 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 43 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 92 ms. Remains : 20/24 places, 28/28 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 171 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Murphy-PT-D3N050-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6237 reset in 276 ms.
Stack based approach found an accepted trace after 61 steps with 6 reset with depth 7 and stack size 7 in 1 ms.
FORMULA Murphy-PT-D3N050-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D3N050-LTLCardinality-00 finished in 584 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) U G((X(p1)&&(p2||G(p3))))))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:41] [INFO ] Invariant cache hit.
[2023-04-08 07:24:41] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
[2023-04-08 07:24:41] [INFO ] Invariant cache hit.
[2023-04-08 07:24:41] [INFO ] Implicit Places using invariants in 40 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 42 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 98 ms. Remains : 20/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 390 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) (NOT p1) p3)), (NOT p1), (AND (NOT p0) p2 (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) p2 (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : Murphy-PT-D3N050-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(OR p2 p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR (AND p2 (NOT p0)) (AND p3 (NOT p0))), acceptance={} source=0 dest: 2}, { cond=(OR p2 p3), acceptance={0, 1} source=0 dest: 3}, { cond=(AND (NOT p2) p3 (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) p3), acceptance={1} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(OR (AND p2 (NOT p0) (NOT p1)) (AND p3 (NOT p0) (NOT p1))), acceptance={} source=2 dest: 1}], [{ cond=(OR (AND p2 (NOT p1)) (AND p3 (NOT p1))), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(OR (AND p2 (NOT p0) (NOT p1)) (AND p3 (NOT p0) (NOT p1))), acceptance={} source=3 dest: 2}, { cond=(OR (AND p2 (NOT p1)) (AND p3 (NOT p1))), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p2) p3 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={1} source=3 dest: 5}], [{ cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p2 p3 (NOT p0)), acceptance={} source=4 dest: 4}], [{ cond=(AND p2 (NOT p3)), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND (NOT p2) p3 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p2 p3), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) p3), acceptance={1} source=5 dest: 5}, { cond=(AND p2 p3 (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND p2 p3), acceptance={1} source=5 dest: 7}], [{ cond=(AND p2 (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND p2 p3 (NOT p0) (NOT p1)), acceptance={} source=6 dest: 4}], [{ cond=(AND p2 (NOT p3) (NOT p1)), acceptance={0} source=7 dest: 0}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={0, 1} source=7 dest: 0}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=7 dest: 1}, { cond=(AND p2 (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=7 dest: 2}, { cond=(AND p2 (NOT p3) (NOT p1)), acceptance={0, 1} source=7 dest: 3}, { cond=(AND (NOT p2) p3 (NOT p0) (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(AND p2 p3 (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={1} source=7 dest: 5}, { cond=(AND p2 p3 (NOT p0) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND p2 p3 (NOT p1)), acceptance={1} source=7 dest: 7}]], initial=0, aps=[p2:(LEQ s7 s16), p3:(LEQ 2 s17), p0:(LEQ 1 s11), p1:(LEQ s11 s6)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 23001 reset in 215 ms.
Stack based approach found an accepted trace after 779 steps with 181 reset with depth 10 and stack size 10 in 2 ms.
FORMULA Murphy-PT-D3N050-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D3N050-LTLCardinality-03 finished in 739 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))||((G(p1) U G(!p0))&&X(p2))))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:42] [INFO ] Invariant cache hit.
[2023-04-08 07:24:42] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
[2023-04-08 07:24:42] [INFO ] Invariant cache hit.
[2023-04-08 07:24:42] [INFO ] Implicit Places using invariants in 44 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 56 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 116 ms. Remains : 20/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Murphy-PT-D3N050-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT s1 s13), p1:(LEQ 1 s6), p2:(LEQ s0 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 30035 reset in 192 ms.
Product exploration explored 100000 steps with 30359 reset in 217 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 p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 271 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 676 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=338 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 353 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 20 cols
[2023-04-08 07:24:44] [INFO ] Computed 1 invariants in 1 ms
[2023-04-08 07:24:44] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-04-08 07:24:44] [INFO ] Invariant cache hit.
[2023-04-08 07:24:44] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-04-08 07:24:44] [INFO ] Invariant cache hit.
[2023-04-08 07:24:44] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:44] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-04-08 07:24:44] [INFO ] Invariant cache hit.
[2023-04-08 07:24:44] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106 ms. Remains : 20/20 places, 28/28 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 (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 233 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 733 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=146 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 248 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 22064 reset in 138 ms.
Product exploration explored 100000 steps with 22383 reset in 142 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 5 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:45] [INFO ] Invariant cache hit.
[2023-04-08 07:24:45] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2023-04-08 07:24:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:24:45] [INFO ] Invariant cache hit.
[2023-04-08 07:24:45] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 89 ms. Remains : 20/20 places, 28/28 transitions.
Support contains 3 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:45] [INFO ] Invariant cache hit.
[2023-04-08 07:24:45] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-04-08 07:24:45] [INFO ] Invariant cache hit.
[2023-04-08 07:24:45] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-08 07:24:45] [INFO ] Invariant cache hit.
[2023-04-08 07:24:46] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:24:46] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-04-08 07:24:46] [INFO ] Invariant cache hit.
[2023-04-08 07:24:46] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 20/20 places, 28/28 transitions.
Treatment of property Murphy-PT-D3N050-LTLCardinality-04 finished in 3491 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 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 24 cols
[2023-04-08 07:24:46] [INFO ] Computed 5 invariants in 1 ms
[2023-04-08 07:24:46] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-04-08 07:24:46] [INFO ] Invariant cache hit.
[2023-04-08 07:24:46] [INFO ] Implicit Places using invariants in 23 ms returned [9, 10, 11]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 23 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 58 ms. Remains : 21/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0)]
Running random walk in product with property : Murphy-PT-D3N050-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s8)], 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 157 ms.
Stack based approach found an accepted trace after 176 steps with 0 reset with depth 177 and stack size 166 in 0 ms.
FORMULA Murphy-PT-D3N050-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D3N050-LTLCardinality-07 finished in 370 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)||X(X(X(X(G(p1))))))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:46] [INFO ] Invariant cache hit.
[2023-04-08 07:24:46] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
[2023-04-08 07:24:46] [INFO ] Invariant cache hit.
[2023-04-08 07:24:46] [INFO ] Implicit Places using invariants in 26 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 27 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 83 ms. Remains : 20/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 415 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Murphy-PT-D3N050-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}], [{ cond=true, acceptance={} source=6 dest: 4}], [{ cond=(NOT p0), acceptance={} source=7 dest: 4}, { cond=p0, acceptance={} source=7 dest: 5}], [{ cond=true, acceptance={} source=8 dest: 6}], [{ cond=(NOT p0), acceptance={} source=9 dest: 6}, { cond=p0, acceptance={} source=9 dest: 7}], [{ cond=true, acceptance={} source=10 dest: 11}], [{ cond=(NOT p0), acceptance={} source=11 dest: 8}, { cond=p0, acceptance={} source=11 dest: 9}]], initial=10, aps=[p1:(AND (LEQ 2 s16) (LEQ s3 s15)), p0:(LEQ 2 s16)], 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, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 1 ms.
FORMULA Murphy-PT-D3N050-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-PT-D3N050-LTLCardinality-08 finished in 523 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&&X(p1)))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:46] [INFO ] Invariant cache hit.
[2023-04-08 07:24:47] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-04-08 07:24:47] [INFO ] Invariant cache hit.
[2023-04-08 07:24:47] [INFO ] Implicit Places using invariants in 28 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 29 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65 ms. Remains : 20/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Murphy-PT-D3N050-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 2 s4), p1:(AND (NOT (LEQ 2 s4)) (LEQ s12 s10))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 65 reset in 159 ms.
Stack based approach found an accepted trace after 137 steps with 0 reset with depth 138 and stack size 138 in 0 ms.
FORMULA Murphy-PT-D3N050-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D3N050-LTLCardinality-09 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(p0))'
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:47] [INFO ] Invariant cache hit.
[2023-04-08 07:24:47] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-04-08 07:24:47] [INFO ] Invariant cache hit.
[2023-04-08 07:24:47] [INFO ] Implicit Places using invariants in 31 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 32 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 69 ms. Remains : 20/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Murphy-PT-D3N050-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3587 reset in 135 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA Murphy-PT-D3N050-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D3N050-LTLCardinality-10 finished in 254 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&&X(p1))))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:47] [INFO ] Invariant cache hit.
[2023-04-08 07:24:47] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-04-08 07:24:47] [INFO ] Invariant cache hit.
[2023-04-08 07:24:47] [INFO ] Implicit Places using invariants in 25 ms returned [8, 9]
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 : 22/24 places, 28/28 transitions.
Applied a total of 0 rules in 3 ms. Remains 22 /22 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 59 ms. Remains : 22/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Murphy-PT-D3N050-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s9 s21), p1:(LEQ s0 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 31 reset in 157 ms.
Stack based approach found an accepted trace after 96 steps with 7 reset with depth 34 and stack size 34 in 1 ms.
FORMULA Murphy-PT-D3N050-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D3N050-LTLCardinality-11 finished in 399 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)||G(p1))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:48] [INFO ] Invariant cache hit.
[2023-04-08 07:24:48] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-04-08 07:24:48] [INFO ] Invariant cache hit.
[2023-04-08 07:24:48] [INFO ] Implicit Places using invariants in 23 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 24 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 65 ms. Remains : 20/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Murphy-PT-D3N050-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s9 s19), p1:(LEQ s10 s15)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 173 ms.
Stack based approach found an accepted trace after 7934 steps with 0 reset with depth 7935 and stack size 7705 in 19 ms.
FORMULA Murphy-PT-D3N050-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D3N050-LTLCardinality-12 finished in 318 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)))'
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:48] [INFO ] Invariant cache hit.
[2023-04-08 07:24:48] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-04-08 07:24:48] [INFO ] Invariant cache hit.
[2023-04-08 07:24:48] [INFO ] Implicit Places using invariants in 23 ms returned [8, 10, 11]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 30 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 75 ms. Remains : 21/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Murphy-PT-D3N050-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1324 reset in 145 ms.
Stack based approach found an accepted trace after 22 steps with 0 reset with depth 23 and stack size 23 in 0 ms.
FORMULA Murphy-PT-D3N050-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D3N050-LTLCardinality-14 finished in 304 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 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:24:48] [INFO ] Invariant cache hit.
[2023-04-08 07:24:48] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-04-08 07:24:48] [INFO ] Invariant cache hit.
[2023-04-08 07:24:48] [INFO ] Implicit Places using invariants in 23 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 24 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 59 ms. Remains : 20/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Murphy-PT-D3N050-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ 2 s8) (LEQ s4 s12))], 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 62 reset in 136 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-PT-D3N050-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D3N050-LTLCardinality-15 finished in 278 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))||((G(p1) U G(!p0))&&X(p2))))'
[2023-04-08 07:24:49] [INFO ] Flatten gal took : 13 ms
[2023-04-08 07:24:49] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-04-08 07:24:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 24 places, 28 transitions and 108 arcs took 0 ms.
Total runtime 9620 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/999/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Murphy-PT-D3N050-LTLCardinality-04

BK_STOP 1680938690110

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name Murphy-PT-D3N050-LTLCardinality-04
ltl formula formula --ltl=/tmp/999/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 24 places, 28 transitions and 108 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.000 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/999/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/999/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/999/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/999/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 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:

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-PT-D3N050"
export BK_EXAMINATION="LTLCardinality"
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 Murphy-PT-D3N050, examination is LTLCardinality"
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-167987246600355"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Murphy-PT-D3N050.tgz
mv Murphy-PT-D3N050 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;