Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813694600380.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is BugTracking-PT-q3m256, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694600380
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.2K Feb 26 07:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 07:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 07:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 07:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 08:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 26 08:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 07:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 26 07:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M Mar 5 18:22 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 BugTracking-PT-q3m256-LTLFireability-00
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-01
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-02
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-03
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-04
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-05
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-06
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-07
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-08
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-09
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-10
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-11
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-12
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-13
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-14
FORMULA_NAME BugTracking-PT-q3m256-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678632294670

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m256
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 14:44:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 14:44:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 14:44:57] [INFO ] Load time of PNML (sax parser for PT used): 659 ms
[2023-03-12 14:44:57] [INFO ] Transformed 754 places.
[2023-03-12 14:44:57] [INFO ] Transformed 27370 transitions.
[2023-03-12 14:44:57] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 913 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 514 places in 107 ms
Reduce places removed 514 places and 24601 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BugTracking-PT-q3m256-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 6 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 238 transition count 2769
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 237 transition count 2750
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 237 transition count 2750
Applied a total of 4 rules in 71 ms. Remains 237 /240 variables (removed 3) and now considering 2750/2769 (removed 19) transitions.
[2023-03-12 14:44:57] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2023-03-12 14:44:57] [INFO ] Computed 8 place invariants in 29 ms
[2023-03-12 14:44:58] [INFO ] Implicit Places using invariants in 513 ms returned []
[2023-03-12 14:44:58] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 14:44:58] [INFO ] Invariant cache hit.
[2023-03-12 14:44:58] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-12 14:44:59] [INFO ] Implicit Places using invariants and state equation in 1588 ms returned []
Implicit Place search using SMT with State Equation took 2132 ms to find 0 implicit places.
[2023-03-12 14:44:59] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 14:44:59] [INFO ] Invariant cache hit.
[2023-03-12 14:45:01] [INFO ] Dead Transitions using invariants and state equation in 1124 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 237/240 places, 2750/2769 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3351 ms. Remains : 237/240 places, 2750/2769 transitions.
Support contains 6 out of 237 places after structural reductions.
[2023-03-12 14:45:01] [INFO ] Flatten gal took : 321 ms
[2023-03-12 14:45:01] [INFO ] Flatten gal took : 183 ms
[2023-03-12 14:45:02] [INFO ] Input system was already deterministic with 2750 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 123654 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 123654 steps, saw 59836 distinct states, run finished after 3003 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 14:45:05] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 14:45:05] [INFO ] Invariant cache hit.
[2023-03-12 14:45:05] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 14:45:06] [INFO ] After 620ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-12 14:45:06] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-12 14:45:06] [INFO ] After 127ms SMT Verify possible using 240 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 14:45:06] [INFO ] After 870ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 14:45:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 14:45:07] [INFO ] After 488ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 14:45:07] [INFO ] After 431ms SMT Verify possible using 240 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 14:45:08] [INFO ] Deduced a trap composed of 21 places in 327 ms of which 4 ms to minimize.
[2023-03-12 14:45:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 493 ms
[2023-03-12 14:45:08] [INFO ] After 1321ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 262 ms.
[2023-03-12 14:45:08] [INFO ] After 2165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 50 ms.
Support contains 6 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 235 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 229 transition count 2747
Applied a total of 16 rules in 234 ms. Remains 229 /237 variables (removed 8) and now considering 2747/2750 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 236 ms. Remains : 229/237 places, 2747/2750 transitions.
Incomplete random walk after 10096 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=776 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 112578 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 112578 steps, saw 47982 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 14:45:12] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 14:45:12] [INFO ] Computed 8 place invariants in 28 ms
[2023-03-12 14:45:12] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 14:45:13] [INFO ] After 558ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-12 14:45:13] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:45:13] [INFO ] After 117ms SMT Verify possible using 241 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 14:45:13] [INFO ] After 797ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 14:45:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 14:45:13] [INFO ] After 520ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 14:45:14] [INFO ] After 326ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 14:45:14] [INFO ] Deduced a trap composed of 7 places in 259 ms of which 2 ms to minimize.
[2023-03-12 14:45:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 355 ms
[2023-03-12 14:45:14] [INFO ] After 904ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 325 ms.
[2023-03-12 14:45:14] [INFO ] After 1836ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 5 ms.
Support contains 6 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 67 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 52 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-12 14:45:15] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:45:15] [INFO ] Invariant cache hit.
[2023-03-12 14:45:15] [INFO ] Implicit Places using invariants in 340 ms returned []
[2023-03-12 14:45:15] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:45:15] [INFO ] Invariant cache hit.
[2023-03-12 14:45:15] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:45:17] [INFO ] Implicit Places using invariants and state equation in 1580 ms returned []
Implicit Place search using SMT with State Equation took 1940 ms to find 0 implicit places.
[2023-03-12 14:45:17] [INFO ] Redundant transitions in 224 ms returned []
[2023-03-12 14:45:17] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:45:17] [INFO ] Invariant cache hit.
[2023-03-12 14:45:18] [INFO ] Dead Transitions using invariants and state equation in 990 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3233 ms. Remains : 229/229 places, 2747/2747 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 130 transitions.
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 229 transition count 2617
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 228 transition count 2616
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 133 place count 228 transition count 2615
Free-agglomeration rule applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 138 place count 228 transition count 2610
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 143 place count 223 transition count 2610
Applied a total of 143 rules in 326 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 2610 rows 223 cols
[2023-03-12 14:45:18] [INFO ] Computed 9 place invariants in 30 ms
[2023-03-12 14:45:18] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-12 14:45:19] [INFO ] After 649ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-12 14:45:19] [INFO ] After 763ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 14:45:19] [INFO ] After 901ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 14:45:19] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-12 14:45:20] [INFO ] After 605ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 14:45:20] [INFO ] After 879ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 173 ms.
[2023-03-12 14:45:20] [INFO ] After 1137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Computed a total of 6 stabilizing places and 111 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((G(p1)||G(p2))))))'
Support contains 6 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 235 transition count 2753
Applied a total of 4 rules in 115 ms. Remains 235 /237 variables (removed 2) and now considering 2753/2750 (removed -3) transitions.
[2023-03-12 14:45:20] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2023-03-12 14:45:20] [INFO ] Computed 8 place invariants in 12 ms
[2023-03-12 14:45:21] [INFO ] Implicit Places using invariants in 367 ms returned []
[2023-03-12 14:45:21] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:45:21] [INFO ] Invariant cache hit.
[2023-03-12 14:45:21] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:45:22] [INFO ] Implicit Places using invariants and state equation in 1574 ms returned []
Implicit Place search using SMT with State Equation took 1945 ms to find 0 implicit places.
[2023-03-12 14:45:23] [INFO ] Redundant transitions in 155 ms returned []
[2023-03-12 14:45:23] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:45:23] [INFO ] Invariant cache hit.
[2023-03-12 14:45:23] [INFO ] Dead Transitions using invariants and state equation in 760 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 235/237 places, 2753/2750 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2985 ms. Remains : 235/237 places, 2753/2750 transitions.
Stuttering acceptance computed with spot in 281 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BugTracking-PT-q3m256-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s10 1) (LT s82 1) (LT s180 1) (LT s17 1) (LT s99 1) (LT s203 1)), p1:(AND (GEQ s10 1) (GEQ s82 1) (GEQ s180 1)), p2:(OR (LT s17 1) (LT s99 1) (...], nbAcceptance=2, 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 23 reset in 980 ms.
Product exploration explored 100000 steps with 22 reset in 753 ms.
Computed a total of 6 stabilizing places and 111 stable transitions
Computed a total of 6 stabilizing places and 111 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p1 p2))), (X p0), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 499 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 118929 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 118929 steps, saw 57411 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-12 14:45:30] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:45:30] [INFO ] Invariant cache hit.
[2023-03-12 14:45:30] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 14:45:30] [INFO ] After 378ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:4
[2023-03-12 14:45:30] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:45:30] [INFO ] After 146ms SMT Verify possible using 241 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 14:45:30] [INFO ] After 665ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 14:45:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 14:45:31] [INFO ] After 623ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 14:45:32] [INFO ] After 564ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 14:45:32] [INFO ] Deduced a trap composed of 40 places in 392 ms of which 1 ms to minimize.
[2023-03-12 14:45:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 546 ms
[2023-03-12 14:45:33] [INFO ] After 1653ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 284 ms.
[2023-03-12 14:45:33] [INFO ] After 2635ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 128 ms.
Support contains 6 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 2753/2753 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 229 transition count 2747
Applied a total of 12 rules in 91 ms. Remains 229 /235 variables (removed 6) and now considering 2747/2753 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 229/235 places, 2747/2753 transitions.
Incomplete random walk after 10129 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=844 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 127772 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 127772 steps, saw 58173 distinct states, run finished after 3002 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-12 14:45:37] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 14:45:37] [INFO ] Computed 8 place invariants in 11 ms
[2023-03-12 14:45:37] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 14:45:37] [INFO ] After 408ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:4
[2023-03-12 14:45:37] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:45:37] [INFO ] After 186ms SMT Verify possible using 241 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 14:45:37] [INFO ] After 678ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 14:45:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 14:45:38] [INFO ] After 547ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 14:45:38] [INFO ] After 348ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 14:45:39] [INFO ] Deduced a trap composed of 38 places in 322 ms of which 1 ms to minimize.
[2023-03-12 14:45:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 416 ms
[2023-03-12 14:45:39] [INFO ] Deduced a trap composed of 22 places in 287 ms of which 0 ms to minimize.
[2023-03-12 14:45:40] [INFO ] Deduced a trap composed of 42 places in 382 ms of which 0 ms to minimize.
[2023-03-12 14:45:40] [INFO ] Deduced a trap composed of 60 places in 364 ms of which 1 ms to minimize.
[2023-03-12 14:45:41] [INFO ] Deduced a trap composed of 59 places in 300 ms of which 0 ms to minimize.
[2023-03-12 14:45:41] [INFO ] Deduced a trap composed of 15 places in 288 ms of which 0 ms to minimize.
[2023-03-12 14:45:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1878 ms
[2023-03-12 14:45:42] [INFO ] Deduced a trap composed of 69 places in 392 ms of which 0 ms to minimize.
[2023-03-12 14:45:42] [INFO ] Deduced a trap composed of 41 places in 391 ms of which 0 ms to minimize.
[2023-03-12 14:45:42] [INFO ] Deduced a trap composed of 27 places in 305 ms of which 1 ms to minimize.
[2023-03-12 14:45:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1302 ms
[2023-03-12 14:45:42] [INFO ] After 4358ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 284 ms.
[2023-03-12 14:45:43] [INFO ] After 5279ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 6 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 73 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 73 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-12 14:45:43] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:45:43] [INFO ] Invariant cache hit.
[2023-03-12 14:45:43] [INFO ] Implicit Places using invariants in 262 ms returned []
[2023-03-12 14:45:43] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:45:43] [INFO ] Invariant cache hit.
[2023-03-12 14:45:44] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:45:45] [INFO ] Implicit Places using invariants and state equation in 1363 ms returned []
Implicit Place search using SMT with State Equation took 1628 ms to find 0 implicit places.
[2023-03-12 14:45:45] [INFO ] Redundant transitions in 102 ms returned []
[2023-03-12 14:45:45] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:45:45] [INFO ] Invariant cache hit.
[2023-03-12 14:45:46] [INFO ] Dead Transitions using invariants and state equation in 938 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2749 ms. Remains : 229/229 places, 2747/2747 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 130 transitions.
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 229 transition count 2617
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 228 transition count 2616
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 133 place count 228 transition count 2615
Free-agglomeration rule applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 138 place count 228 transition count 2610
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 143 place count 223 transition count 2610
Applied a total of 143 rules in 312 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 2610 rows 223 cols
[2023-03-12 14:45:46] [INFO ] Computed 9 place invariants in 22 ms
[2023-03-12 14:45:46] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 14:45:47] [INFO ] After 566ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:4
[2023-03-12 14:45:47] [INFO ] After 728ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:4
Attempting to minimize the solution found.
Minimization took 77 ms.
[2023-03-12 14:45:47] [INFO ] After 892ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:4
[2023-03-12 14:45:47] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 14:45:48] [INFO ] After 654ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 14:45:48] [INFO ] After 1161ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 271 ms.
[2023-03-12 14:45:48] [INFO ] After 1529ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p1 p2))), (X p0), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 498 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 2753/2753 transitions.
Applied a total of 0 rules in 38 ms. Remains 235 /235 variables (removed 0) and now considering 2753/2753 (removed 0) transitions.
[2023-03-12 14:45:49] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2023-03-12 14:45:49] [INFO ] Computed 8 place invariants in 8 ms
[2023-03-12 14:45:50] [INFO ] Implicit Places using invariants in 327 ms returned []
[2023-03-12 14:45:50] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:45:50] [INFO ] Invariant cache hit.
[2023-03-12 14:45:50] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:45:51] [INFO ] Implicit Places using invariants and state equation in 1223 ms returned []
Implicit Place search using SMT with State Equation took 1565 ms to find 0 implicit places.
[2023-03-12 14:45:51] [INFO ] Redundant transitions in 50 ms returned []
[2023-03-12 14:45:51] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:45:51] [INFO ] Invariant cache hit.
[2023-03-12 14:45:52] [INFO ] Dead Transitions using invariants and state equation in 866 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2528 ms. Remains : 235/235 places, 2753/2753 transitions.
Computed a total of 6 stabilizing places and 111 stable transitions
Computed a total of 6 stabilizing places and 111 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p1 p2))), (X p0), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 501 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 130350 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 130350 steps, saw 62950 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-12 14:45:56] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:45:56] [INFO ] Invariant cache hit.
[2023-03-12 14:45:56] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 14:45:56] [INFO ] After 460ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:4
[2023-03-12 14:45:56] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:45:57] [INFO ] After 125ms SMT Verify possible using 241 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 14:45:57] [INFO ] After 675ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 14:45:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 14:45:57] [INFO ] After 601ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 14:45:58] [INFO ] After 370ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 14:45:58] [INFO ] Deduced a trap composed of 40 places in 304 ms of which 2 ms to minimize.
[2023-03-12 14:45:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 385 ms
[2023-03-12 14:45:58] [INFO ] After 1159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 235 ms.
[2023-03-12 14:45:59] [INFO ] After 2068ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 96 ms.
Support contains 6 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 2753/2753 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 229 transition count 2747
Applied a total of 12 rules in 81 ms. Remains 229 /235 variables (removed 6) and now considering 2747/2753 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 229/235 places, 2747/2753 transitions.
Incomplete random walk after 10096 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1009 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 133148 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 133148 steps, saw 61776 distinct states, run finished after 3002 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-12 14:46:02] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 14:46:02] [INFO ] Computed 8 place invariants in 7 ms
[2023-03-12 14:46:02] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 14:46:03] [INFO ] After 486ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:4
[2023-03-12 14:46:03] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:46:03] [INFO ] After 159ms SMT Verify possible using 241 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 14:46:03] [INFO ] After 765ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 14:46:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-12 14:46:04] [INFO ] After 567ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 14:46:04] [INFO ] After 379ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 14:46:04] [INFO ] Deduced a trap composed of 38 places in 317 ms of which 1 ms to minimize.
[2023-03-12 14:46:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 409 ms
[2023-03-12 14:46:05] [INFO ] Deduced a trap composed of 22 places in 334 ms of which 0 ms to minimize.
[2023-03-12 14:46:05] [INFO ] Deduced a trap composed of 42 places in 343 ms of which 1 ms to minimize.
[2023-03-12 14:46:06] [INFO ] Deduced a trap composed of 60 places in 308 ms of which 1 ms to minimize.
[2023-03-12 14:46:06] [INFO ] Deduced a trap composed of 59 places in 284 ms of which 1 ms to minimize.
[2023-03-12 14:46:06] [INFO ] Deduced a trap composed of 15 places in 282 ms of which 1 ms to minimize.
[2023-03-12 14:46:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1804 ms
[2023-03-12 14:46:07] [INFO ] Deduced a trap composed of 69 places in 272 ms of which 0 ms to minimize.
[2023-03-12 14:46:07] [INFO ] Deduced a trap composed of 41 places in 312 ms of which 0 ms to minimize.
[2023-03-12 14:46:08] [INFO ] Deduced a trap composed of 27 places in 282 ms of which 0 ms to minimize.
[2023-03-12 14:46:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1040 ms
[2023-03-12 14:46:08] [INFO ] After 4009ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 249 ms.
[2023-03-12 14:46:08] [INFO ] After 4906ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 34 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 32 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-12 14:46:08] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:46:08] [INFO ] Invariant cache hit.
[2023-03-12 14:46:08] [INFO ] Implicit Places using invariants in 355 ms returned []
[2023-03-12 14:46:08] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:46:08] [INFO ] Invariant cache hit.
[2023-03-12 14:46:09] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:46:10] [INFO ] Implicit Places using invariants and state equation in 1339 ms returned []
Implicit Place search using SMT with State Equation took 1735 ms to find 0 implicit places.
[2023-03-12 14:46:10] [INFO ] Redundant transitions in 70 ms returned []
[2023-03-12 14:46:10] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:46:10] [INFO ] Invariant cache hit.
[2023-03-12 14:46:11] [INFO ] Dead Transitions using invariants and state equation in 938 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2782 ms. Remains : 229/229 places, 2747/2747 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 130 transitions.
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 229 transition count 2617
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 228 transition count 2616
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 133 place count 228 transition count 2615
Free-agglomeration rule applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 138 place count 228 transition count 2610
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 143 place count 223 transition count 2610
Applied a total of 143 rules in 248 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 2610 rows 223 cols
[2023-03-12 14:46:11] [INFO ] Computed 9 place invariants in 8 ms
[2023-03-12 14:46:11] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-12 14:46:12] [INFO ] After 430ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:4
[2023-03-12 14:46:12] [INFO ] After 610ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:4
Attempting to minimize the solution found.
Minimization took 102 ms.
[2023-03-12 14:46:12] [INFO ] After 873ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:4
[2023-03-12 14:46:12] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-12 14:46:13] [INFO ] After 589ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 14:46:13] [INFO ] After 995ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 209 ms.
[2023-03-12 14:46:13] [INFO ] After 1333ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p1 p2))), (X p0), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 365 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 23 reset in 758 ms.
Product exploration explored 100000 steps with 22 reset in 696 ms.
Support contains 6 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 2753/2753 transitions.
Applied a total of 0 rules in 54 ms. Remains 235 /235 variables (removed 0) and now considering 2753/2753 (removed 0) transitions.
[2023-03-12 14:46:15] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2023-03-12 14:46:15] [INFO ] Computed 8 place invariants in 26 ms
[2023-03-12 14:46:16] [INFO ] Implicit Places using invariants in 330 ms returned []
[2023-03-12 14:46:16] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:46:16] [INFO ] Invariant cache hit.
[2023-03-12 14:46:16] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:46:17] [INFO ] Implicit Places using invariants and state equation in 1340 ms returned []
Implicit Place search using SMT with State Equation took 1699 ms to find 0 implicit places.
[2023-03-12 14:46:17] [INFO ] Redundant transitions in 76 ms returned []
[2023-03-12 14:46:17] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:46:17] [INFO ] Invariant cache hit.
[2023-03-12 14:46:18] [INFO ] Dead Transitions using invariants and state equation in 857 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2704 ms. Remains : 235/235 places, 2753/2753 transitions.
Treatment of property BugTracking-PT-q3m256-LTLFireability-07 finished in 58059 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((G(p1)||G(p2))))))'
[2023-03-12 14:46:19] [INFO ] Flatten gal took : 158 ms
[2023-03-12 14:46:19] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-12 14:46:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 237 places, 2750 transitions and 13477 arcs took 23 ms.
Total runtime 82833 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/948/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BugTracking-PT-q3m256-LTLFireability-07

BK_STOP 1678632380401

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name BugTracking-PT-q3m256-LTLFireability-07
ltl formula formula --ltl=/tmp/948/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 237 places, 2750 transitions and 13477 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/948/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/948/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.580 real 0.120 user 0.070 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/948/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/948/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

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="BugTracking-PT-q3m256"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is BugTracking-PT-q3m256, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813694600380"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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