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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 6.7K Mar 23 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Mar 23 15:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 23 15:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 23 15:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 7 12:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 7 12:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 7 12:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 7 12:01 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 129K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 7 12:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 7 12:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 20K 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-COL-D2N100-LTLCardinality-00
FORMULA_NAME Murphy-COL-D2N100-LTLCardinality-01
FORMULA_NAME Murphy-COL-D2N100-LTLCardinality-02
FORMULA_NAME Murphy-COL-D2N100-LTLCardinality-03
FORMULA_NAME Murphy-COL-D2N100-LTLCardinality-04
FORMULA_NAME Murphy-COL-D2N100-LTLCardinality-05
FORMULA_NAME Murphy-COL-D2N100-LTLCardinality-06
FORMULA_NAME Murphy-COL-D2N100-LTLCardinality-07
FORMULA_NAME Murphy-COL-D2N100-LTLCardinality-08
FORMULA_NAME Murphy-COL-D2N100-LTLCardinality-09
FORMULA_NAME Murphy-COL-D2N100-LTLCardinality-10
FORMULA_NAME Murphy-COL-D2N100-LTLCardinality-11
FORMULA_NAME Murphy-COL-D2N100-LTLCardinality-12
FORMULA_NAME Murphy-COL-D2N100-LTLCardinality-13
FORMULA_NAME Murphy-COL-D2N100-LTLCardinality-14
FORMULA_NAME Murphy-COL-D2N100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680938612873

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-COL-D2N100
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-08 07:23:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-08 07:23:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-08 07:23:34] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-04-08 07:23:34] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-04-08 07:23:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 454 ms
[2023-04-08 07:23:35] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 18 PT places and 21.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2023-04-08 07:23:35] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 27 arcs in 4 ms.
[2023-04-08 07:23:35] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA Murphy-COL-D2N100-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D2N100-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D2N100-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D2N100-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10067 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=296 ) properties (out of 23) seen :20
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 7 rows 6 cols
[2023-04-08 07:23:35] [INFO ] Computed 2 invariants in 5 ms
[2023-04-08 07:23:35] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:23:35] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-08 07:23:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:23:35] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
FORMULA Murphy-COL-D2N100-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-08 07:23:35] [INFO ] Flatten gal took : 15 ms
[2023-04-08 07:23:35] [INFO ] Flatten gal took : 2 ms
Arc [2:1*[(MOD (ADD $x 1) 3)]] contains successor/predecessor on variables of sort CD
[2023-04-08 07:23:35] [INFO ] Unfolded HLPN to a Petri net with 18 places and 21 transitions 81 arcs in 6 ms.
[2023-04-08 07:23:35] [INFO ] Unfolded 11 HLPN properties in 1 ms.
Support contains 18 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 5 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 18 cols
[2023-04-08 07:23:35] [INFO ] Computed 4 invariants in 0 ms
[2023-04-08 07:23:35] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
[2023-04-08 07:23:35] [INFO ] Invariant cache hit.
[2023-04-08 07:23:35] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-08 07:23:35] [INFO ] Invariant cache hit.
[2023-04-08 07:23:35] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-08 07:23:35] [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:23:35] [INFO ] Invariant cache hit.
[2023-04-08 07:23:35] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 165 ms. Remains : 18/18 places, 21/21 transitions.
Support contains 18 out of 18 places after structural reductions.
[2023-04-08 07:23:35] [INFO ] Flatten gal took : 16 ms
[2023-04-08 07:23:35] [INFO ] Flatten gal took : 4 ms
[2023-04-08 07:23:35] [INFO ] Input system was already deterministic with 21 transitions.
Incomplete random walk after 10028 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 22) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-04-08 07:23:36] [INFO ] Invariant cache hit.
[2023-04-08 07:23:36] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:23:36] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-08 07:23:36] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-08 07:23:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:23:36] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 07:23:36] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2023-04-08 07:23:36] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-08 07:23:36] [INFO ] After 5ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2023-04-08 07:23:36] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-08 07:23:36] [INFO ] After 81ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 6 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 6 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-08 07:23:36] [INFO ] Invariant cache hit.
[2023-04-08 07:23:36] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 18/18 places, 21/21 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2042797 steps, run timeout after 3001 ms. (steps per millisecond=680 ) properties seen :{}
Probabilistic random walk after 2042797 steps, saw 1318296 distinct states, run finished after 3002 ms. (steps per millisecond=680 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-08 07:23:39] [INFO ] Invariant cache hit.
[2023-04-08 07:23:39] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-04-08 07:23:39] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 14 ms returned sat
[2023-04-08 07:23:39] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 07:23:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:23:39] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 5 ms returned sat
[2023-04-08 07:23:39] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-08 07:23:39] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-08 07:23:39] [INFO ] After 8ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-08 07:23:39] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-04-08 07:23:39] [INFO ] After 77ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 18/18 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-08 07:23:39] [INFO ] Invariant cache hit.
[2023-04-08 07:23:39] [INFO ] Implicit Places using invariants in 46 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 47 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 15/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 49 ms. Remains : 15/18 places, 21/21 transitions.
Incomplete random walk after 10076 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2519 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2519082 steps, run timeout after 3001 ms. (steps per millisecond=839 ) properties seen :{}
Probabilistic random walk after 2519082 steps, saw 1618750 distinct states, run finished after 3002 ms. (steps per millisecond=839 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 21 rows 15 cols
[2023-04-08 07:23:42] [INFO ] Computed 1 invariants in 5 ms
[2023-04-08 07:23:42] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:23:42] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 07:23:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:23:42] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-08 07:23:42] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-08 07:23:42] [INFO ] After 7ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-08 07:23:42] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-08 07:23:42] [INFO ] After 53ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 563 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=187 )
Parikh walk visited 1 properties in 2 ms.
Successfully simplified 2 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' '!(X(p0))'
Support contains 6 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 18 cols
[2023-04-08 07:23:42] [INFO ] Computed 4 invariants in 2 ms
[2023-04-08 07:23:43] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2023-04-08 07:23:43] [INFO ] Invariant cache hit.
[2023-04-08 07:23:43] [INFO ] Implicit Places using invariants in 27 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 28 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 15/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67 ms. Remains : 15/18 places, 21/21 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 216 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Murphy-COL-D2N100-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ (ADD s3 s4 s5) (ADD s6 s7 s8))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 1 ms.
FORMULA Murphy-COL-D2N100-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-COL-D2N100-LTLCardinality-01 finished in 344 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)&&F(G(p1)))))'
Support contains 12 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 5 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-08 07:23:43] [INFO ] Invariant cache hit.
[2023-04-08 07:23:43] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2023-04-08 07:23:43] [INFO ] Invariant cache hit.
[2023-04-08 07:23:43] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-04-08 07:23:43] [INFO ] Invariant cache hit.
[2023-04-08 07:23:43] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-08 07:23:43] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-04-08 07:23:43] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-08 07:23:43] [INFO ] Invariant cache hit.
[2023-04-08 07:23:43] [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 146 ms. Remains : 18/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Murphy-COL-D2N100-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s6 s7 s8) (ADD s12 s13 s14)), p1:(OR (LEQ 1 (ADD s3 s4 s5)) (LEQ 3 (ADD s15 s16 s17)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1 reset in 330 ms.
Stack based approach found an accepted trace after 21 steps with 1 reset with depth 19 and stack size 19 in 0 ms.
FORMULA Murphy-COL-D2N100-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D2N100-LTLCardinality-02 finished in 648 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((G(p0)&&p1))||X(X(((!p0 U !p1)||!p1)))))'
Support contains 6 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-08 07:23:43] [INFO ] Invariant cache hit.
[2023-04-08 07:23:43] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-04-08 07:23:43] [INFO ] Invariant cache hit.
[2023-04-08 07:23:43] [INFO ] Implicit Places using invariants in 29 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 31 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 15/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 70 ms. Remains : 15/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 255 ms :[p1, (AND (NOT p0) p1), (AND (NOT p0) p1), p1, true, (AND (NOT p0) p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Murphy-COL-D2N100-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=5 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND p0 p1), acceptance={} source=6 dest: 6}]], initial=5, aps=[p0:(GT 2 (ADD s3 s4 s5)), p1:(GT 1 (ADD s9 s10 s11))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24773 reset in 207 ms.
Stack based approach found an accepted trace after 191 steps with 44 reset with depth 8 and stack size 8 in 0 ms.
FORMULA Murphy-COL-D2N100-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D2N100-LTLCardinality-03 finished in 557 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)||G(p1)))'
Support contains 9 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-08 07:23:44] [INFO ] Invariant cache hit.
[2023-04-08 07:23:44] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
[2023-04-08 07:23:44] [INFO ] Invariant cache hit.
[2023-04-08 07:23:44] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-04-08 07:23:44] [INFO ] Invariant cache hit.
[2023-04-08 07:23:44] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-08 07:23:44] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-04-08 07:23:44] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:23:44] [INFO ] Invariant cache hit.
[2023-04-08 07:23:44] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 141 ms. Remains : 18/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Murphy-COL-D2N100-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ 2 (ADD s9 s10 s11)), p1:(LEQ (ADD s6 s7 s8) (ADD s3 s4 s5))], 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 7965 reset in 156 ms.
Product exploration explored 100000 steps with 7752 reset in 176 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 5 factoid took 209 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 69 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 205 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=102 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F p0), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 292 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 68 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 9 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-08 07:23:45] [INFO ] Invariant cache hit.
[2023-04-08 07:23:45] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2023-04-08 07:23:45] [INFO ] Invariant cache hit.
[2023-04-08 07:23:45] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-08 07:23:45] [INFO ] Invariant cache hit.
[2023-04-08 07:23:45] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-08 07:23:45] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-04-08 07:23:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:23:45] [INFO ] Invariant cache hit.
[2023-04-08 07:23:45] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 123 ms. Remains : 18/18 places, 21/21 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 (AND p1 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 200 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 81 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 213 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=213 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 239 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 80 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 7819 reset in 151 ms.
Product exploration explored 100000 steps with 7703 reset in 180 ms.
Support contains 9 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-08 07:23:47] [INFO ] Invariant cache hit.
[2023-04-08 07:23:47] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2023-04-08 07:23:47] [INFO ] Invariant cache hit.
[2023-04-08 07:23:47] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-08 07:23:47] [INFO ] Invariant cache hit.
[2023-04-08 07:23:47] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-08 07:23:47] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-04-08 07:23:47] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:23:47] [INFO ] Invariant cache hit.
[2023-04-08 07:23:47] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118 ms. Remains : 18/18 places, 21/21 transitions.
Treatment of property Murphy-COL-D2N100-LTLCardinality-04 finished in 2679 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((p0&&X((F(p1)&&F(G(p2))))))))'
Support contains 15 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-08 07:23:47] [INFO ] Invariant cache hit.
[2023-04-08 07:23:47] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-04-08 07:23:47] [INFO ] Invariant cache hit.
[2023-04-08 07:23:47] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-08 07:23:47] [INFO ] Invariant cache hit.
[2023-04-08 07:23:47] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-08 07:23:47] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-04-08 07:23:47] [INFO ] Invariant cache hit.
[2023-04-08 07:23:47] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 122 ms. Remains : 18/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 305 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : Murphy-COL-D2N100-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}, { cond=true, acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=p2, acceptance={} source=6 dest: 6}, { cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(GT (ADD s6 s7 s8) (ADD s15 s16 s17)), p1:(AND (LEQ (ADD s3 s4 s5) (ADD s0 s1 s2)) (LEQ 1 (ADD s3 s4 s5))), p2:(LEQ (ADD s12 s13 s14) (ADD s15 s16 s17)...], 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 2 steps with 0 reset in 0 ms.
FORMULA Murphy-COL-D2N100-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-COL-D2N100-LTLCardinality-06 finished in 447 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(G((p0&&(G(p1) U X(G(p2))))))))'
Support contains 9 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-08 07:23:47] [INFO ] Invariant cache hit.
[2023-04-08 07:23:47] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-04-08 07:23:47] [INFO ] Invariant cache hit.
[2023-04-08 07:23:47] [INFO ] Implicit Places using invariants in 25 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 27 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 15/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62 ms. Remains : 15/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), true, (NOT p2), (NOT p2), (AND (NOT p1) p2)]
Running random walk in product with property : Murphy-COL-D2N100-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=(AND p1 p2), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 3}, { cond=(AND p1 p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ 3 (ADD s9 s10 s11)), p1:(LEQ 3 (ADD s12 s13 s14)), p2:(LEQ 1 (ADD s6 s7 s8))], 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 2 steps with 0 reset in 0 ms.
FORMULA Murphy-COL-D2N100-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-COL-D2N100-LTLCardinality-07 finished in 366 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 U p1)||p2)))||(X(p0)&&X(G(p1)))))'
Support contains 9 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-08 07:23:47] [INFO ] Invariant cache hit.
[2023-04-08 07:23:48] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-04-08 07:23:48] [INFO ] Invariant cache hit.
[2023-04-08 07:23:48] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-08 07:23:48] [INFO ] Invariant cache hit.
[2023-04-08 07:23:48] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-08 07:23:48] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-04-08 07:23:48] [INFO ] Invariant cache hit.
[2023-04-08 07:23:48] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123 ms. Remains : 18/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND p1 (NOT p2)), false]
Running random walk in product with property : Murphy-COL-D2N100-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p2) (NOT p0) p1) (AND (NOT p2) p0 (NOT p1))), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(GT 2 (ADD s15 s16 s17)), p0:(LEQ 1 (ADD s15 s16 s17)), p1:(LEQ (ADD s6 s7 s8) (ADD s12 s13 s14))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1046 reset in 206 ms.
Stack based approach found an accepted trace after 1325 steps with 19 reset with depth 7 and stack size 7 in 3 ms.
FORMULA Murphy-COL-D2N100-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D2N100-LTLCardinality-08 finished in 505 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(G(!p1))))))'
Support contains 12 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-08 07:23:48] [INFO ] Invariant cache hit.
[2023-04-08 07:23:48] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2023-04-08 07:23:48] [INFO ] Invariant cache hit.
[2023-04-08 07:23:48] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-04-08 07:23:48] [INFO ] Invariant cache hit.
[2023-04-08 07:23:48] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-08 07:23:48] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-04-08 07:23:48] [INFO ] Invariant cache hit.
[2023-04-08 07:23:48] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111 ms. Remains : 18/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, p1, (AND p1 (NOT p0)), p1]
Running random walk in product with property : Murphy-COL-D2N100-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(GT (ADD s3 s4 s5) (ADD s6 s7 s8)), p1:(LEQ (ADD s12 s13 s14) (ADD s15 s16 s17))], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1235 steps with 0 reset in 3 ms.
FORMULA Murphy-COL-D2N100-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-COL-D2N100-LTLCardinality-10 finished in 262 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 3 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-08 07:23:48] [INFO ] Invariant cache hit.
[2023-04-08 07:23:48] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
[2023-04-08 07:23:48] [INFO ] Invariant cache hit.
[2023-04-08 07:23:48] [INFO ] Implicit Places using invariants in 22 ms returned [6, 7, 8]
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 : 15/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 51 ms. Remains : 15/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Murphy-COL-D2N100-LTLCardinality-12 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 (ADD s3 s4 s5))], 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 30 reset in 150 ms.
Stack based approach found an accepted trace after 3804 steps with 0 reset with depth 3805 and stack size 3673 in 7 ms.
FORMULA Murphy-COL-D2N100-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D2N100-LTLCardinality-12 finished in 307 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(X(F(p0)))))'
Support contains 3 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-08 07:23:49] [INFO ] Invariant cache hit.
[2023-04-08 07:23:49] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-04-08 07:23:49] [INFO ] Invariant cache hit.
[2023-04-08 07:23:49] [INFO ] Implicit Places using invariants in 33 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 34 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 15/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 74 ms. Remains : 15/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Murphy-COL-D2N100-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LEQ 3 (ADD s12 s13 s14))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 24797 reset in 124 ms.
Stack based approach found an accepted trace after 5526 steps with 1367 reset with depth 10 and stack size 10 in 7 ms.
FORMULA Murphy-COL-D2N100-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D2N100-LTLCardinality-14 finished in 401 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(p0)||G((G(p1) U p0)))))'
Support contains 9 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2023-04-08 07:23:49] [INFO ] Invariant cache hit.
[2023-04-08 07:23:49] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2023-04-08 07:23:49] [INFO ] Invariant cache hit.
[2023-04-08 07:23:49] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-04-08 07:23:49] [INFO ] Invariant cache hit.
[2023-04-08 07:23:49] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-08 07:23:49] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-04-08 07:23:49] [INFO ] Invariant cache hit.
[2023-04-08 07:23:49] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104 ms. Remains : 18/18 places, 21/21 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), true, (NOT p1)]
Running random walk in product with property : Murphy-COL-D2N100-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2) (ADD s3 s4 s5)), p1:(OR (GT (ADD s6 s7 s8) (ADD s0 s1 s2)) (LEQ (ADD s0 s1 s2) (ADD s3 s4 s5)))], 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 33369 reset in 126 ms.
Product exploration explored 100000 steps with 33426 reset in 138 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 96 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), true, (NOT p1)]
Incomplete random walk after 10034 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1433 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-08 07:23:50] [INFO ] Invariant cache hit.
[2023-04-08 07:23:50] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 07:23:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:23:50] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 07:23:50] [INFO ] After 19ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (AND (NOT p0) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p1)))
Knowledge based reduction with 9 factoid took 162 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Murphy-COL-D2N100-LTLCardinality-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Murphy-COL-D2N100-LTLCardinality-15 finished in 1060 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)||G(p1)))'
[2023-04-08 07:23:50] [INFO ] Flatten gal took : 7 ms
[2023-04-08 07:23:50] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-04-08 07:23:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 18 places, 21 transitions and 81 arcs took 0 ms.
Total runtime 16104 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1069/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Murphy-COL-D2N100-LTLCardinality-04

BK_STOP 1680938631927

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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-COL-D2N100-LTLCardinality-04
ltl formula formula --ltl=/tmp/1069/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 18 places, 21 transitions and 81 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( 0/ 4): LTL layer: formula: /tmp/1069/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1069/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1069/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1069/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2

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-D2N100"
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-COL-D2N100, 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-167987246500299"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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