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.r039-tajo-167813692400356.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 lolaxred
Input is BugTracking-PT-q3m032, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692400356
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.4K Feb 26 06:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 06:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Feb 26 06:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 26 06:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K 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 17K Feb 25 15:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 07:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 07:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 06:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 06:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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-q3m032-LTLFireability-00
FORMULA_NAME BugTracking-PT-q3m032-LTLFireability-01
FORMULA_NAME BugTracking-PT-q3m032-LTLFireability-02
FORMULA_NAME BugTracking-PT-q3m032-LTLFireability-03
FORMULA_NAME BugTracking-PT-q3m032-LTLFireability-04
FORMULA_NAME BugTracking-PT-q3m032-LTLFireability-05
FORMULA_NAME BugTracking-PT-q3m032-LTLFireability-06
FORMULA_NAME BugTracking-PT-q3m032-LTLFireability-07
FORMULA_NAME BugTracking-PT-q3m032-LTLFireability-08
FORMULA_NAME BugTracking-PT-q3m032-LTLFireability-09
FORMULA_NAME BugTracking-PT-q3m032-LTLFireability-10
FORMULA_NAME BugTracking-PT-q3m032-LTLFireability-11
FORMULA_NAME BugTracking-PT-q3m032-LTLFireability-12
FORMULA_NAME BugTracking-PT-q3m032-LTLFireability-13
FORMULA_NAME BugTracking-PT-q3m032-LTLFireability-14
FORMULA_NAME BugTracking-PT-q3m032-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678494003695

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m032
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 00:20:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 00:20:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 00:20:06] [INFO ] Load time of PNML (sax parser for PT used): 616 ms
[2023-03-11 00:20:06] [INFO ] Transformed 754 places.
[2023-03-11 00:20:06] [INFO ] Transformed 27370 transitions.
[2023-03-11 00:20:06] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 796 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 514 places in 113 ms
Reduce places removed 514 places and 24601 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BugTracking-PT-q3m032-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 5 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 65 ms. Remains 237 /240 variables (removed 3) and now considering 2750/2769 (removed 19) transitions.
[2023-03-11 00:20:06] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2023-03-11 00:20:06] [INFO ] Computed 8 place invariants in 44 ms
[2023-03-11 00:20:07] [INFO ] Implicit Places using invariants in 460 ms returned []
[2023-03-11 00:20:07] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-11 00:20:07] [INFO ] Invariant cache hit.
[2023-03-11 00:20:07] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-11 00:20:08] [INFO ] Implicit Places using invariants and state equation in 1241 ms returned []
Implicit Place search using SMT with State Equation took 1725 ms to find 0 implicit places.
[2023-03-11 00:20:08] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-11 00:20:08] [INFO ] Invariant cache hit.
[2023-03-11 00:20:09] [INFO ] Dead Transitions using invariants and state equation in 750 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 2543 ms. Remains : 237/240 places, 2750/2769 transitions.
Support contains 5 out of 237 places after structural reductions.
[2023-03-11 00:20:09] [INFO ] Flatten gal took : 326 ms
[2023-03-11 00:20:09] [INFO ] Flatten gal took : 123 ms
[2023-03-11 00:20:10] [INFO ] Input system was already deterministic with 2750 transitions.
Incomplete random walk after 10000 steps, including 24 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 176656 steps, run timeout after 3007 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 176656 steps, saw 89938 distinct states, run finished after 3020 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 00:20:13] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-11 00:20:13] [INFO ] Invariant cache hit.
[2023-03-11 00:20:13] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-11 00:20:14] [INFO ] After 562ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 00:20:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-11 00:20:14] [INFO ] After 603ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 00:20:14] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-11 00:20:15] [INFO ] After 343ms SMT Verify possible using 240 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 00:20:15] [INFO ] Deduced a trap composed of 12 places in 209 ms of which 5 ms to minimize.
[2023-03-11 00:20:16] [INFO ] Deduced a trap composed of 20 places in 269 ms of which 1 ms to minimize.
[2023-03-11 00:20:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 644 ms
[2023-03-11 00:20:16] [INFO ] After 1214ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 117 ms.
[2023-03-11 00:20:16] [INFO ] After 2035ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 50 ms.
Support contains 3 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 228 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 229 ms. Remains : 229/237 places, 2747/2750 transitions.
Incomplete random walk after 10027 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=278 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 222423 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 222423 steps, saw 110291 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 00:20:19] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-11 00:20:19] [INFO ] Computed 8 place invariants in 37 ms
[2023-03-11 00:20:19] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-11 00:20:20] [INFO ] After 613ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 00:20:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-11 00:20:20] [INFO ] After 561ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 00:20:20] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-11 00:20:21] [INFO ] After 345ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 00:20:21] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 1 ms to minimize.
[2023-03-11 00:20:21] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 1 ms to minimize.
[2023-03-11 00:20:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 454 ms
[2023-03-11 00:20:21] [INFO ] After 917ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 125 ms.
[2023-03-11 00:20:21] [INFO ] After 1691ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 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 55 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 55 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 53 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-11 00:20:21] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-11 00:20:21] [INFO ] Invariant cache hit.
[2023-03-11 00:20:22] [INFO ] Implicit Places using invariants in 328 ms returned []
[2023-03-11 00:20:22] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-11 00:20:22] [INFO ] Invariant cache hit.
[2023-03-11 00:20:22] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-11 00:20:23] [INFO ] Implicit Places using invariants and state equation in 1714 ms returned []
Implicit Place search using SMT with State Equation took 2046 ms to find 0 implicit places.
[2023-03-11 00:20:24] [INFO ] Redundant transitions in 200 ms returned []
[2023-03-11 00:20:24] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-11 00:20:24] [INFO ] Invariant cache hit.
[2023-03-11 00:20:25] [INFO ] Dead Transitions using invariants and state equation in 860 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3167 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 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 134 place count 227 transition count 2615
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 227 transition count 2614
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 139 place count 227 transition count 2610
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 143 place count 223 transition count 2610
Applied a total of 143 rules in 323 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2610 rows 223 cols
[2023-03-11 00:20:25] [INFO ] Computed 9 place invariants in 11 ms
[2023-03-11 00:20:25] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-11 00:20:25] [INFO ] After 451ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 00:20:25] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-11 00:20:26] [INFO ] After 485ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 00:20:26] [INFO ] After 610ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 81 ms.
[2023-03-11 00:20:26] [INFO ] After 777ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 1 atomic propositions for a total of 2 simplifications.
FORMULA BugTracking-PT-q3m032-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!(X(G(p0)))'
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Applied a total of 0 rules in 8 ms. Remains 237 /237 variables (removed 0) and now considering 2750/2750 (removed 0) transitions.
[2023-03-11 00:20:26] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2023-03-11 00:20:26] [INFO ] Computed 8 place invariants in 8 ms
[2023-03-11 00:20:27] [INFO ] Implicit Places using invariants in 336 ms returned []
[2023-03-11 00:20:27] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-11 00:20:27] [INFO ] Invariant cache hit.
[2023-03-11 00:20:27] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-11 00:20:28] [INFO ] Implicit Places using invariants and state equation in 1476 ms returned []
Implicit Place search using SMT with State Equation took 1814 ms to find 0 implicit places.
[2023-03-11 00:20:28] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-11 00:20:28] [INFO ] Invariant cache hit.
[2023-03-11 00:20:29] [INFO ] Dead Transitions using invariants and state equation in 739 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2563 ms. Remains : 237/237 places, 2750/2750 transitions.
Stuttering acceptance computed with spot in 261 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BugTracking-PT-q3m032-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s10 1) (LT s82 1) (LT s192 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 170 reset in 740 ms.
Product exploration explored 100000 steps with 178 reset in 844 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 166 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10012 steps, including 14 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 228941 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 228941 steps, saw 117113 distinct states, run finished after 3003 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 00:20:34] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-11 00:20:34] [INFO ] Invariant cache hit.
[2023-03-11 00:20:34] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2023-03-11 00:20:35] [INFO ] After 490ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 00:20:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-11 00:20:35] [INFO ] After 473ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 00:20:35] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-11 00:20:35] [INFO ] After 249ms SMT Verify possible using 240 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 00:20:36] [INFO ] Deduced a trap composed of 12 places in 210 ms of which 1 ms to minimize.
[2023-03-11 00:20:36] [INFO ] Deduced a trap composed of 9 places in 216 ms of which 0 ms to minimize.
[2023-03-11 00:20:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 728 ms
[2023-03-11 00:20:36] [INFO ] After 1139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 121 ms.
[2023-03-11 00:20:36] [INFO ] After 1822ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 20 ms.
Support contains 3 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 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
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 128 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 130 ms. Remains : 229/237 places, 2747/2750 transitions.
Incomplete random walk after 10014 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 215608 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 215608 steps, saw 105965 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 00:20:40] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-11 00:20:40] [INFO ] Computed 8 place invariants in 37 ms
[2023-03-11 00:20:40] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-11 00:20:40] [INFO ] After 608ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 00:20:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-11 00:20:41] [INFO ] After 496ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 00:20:41] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-11 00:20:41] [INFO ] After 379ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 00:20:41] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2023-03-11 00:20:42] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 0 ms to minimize.
[2023-03-11 00:20:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 374 ms
[2023-03-11 00:20:42] [INFO ] After 875ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 137 ms.
[2023-03-11 00:20:42] [INFO ] After 1593ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 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 62 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 63 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 47 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-11 00:20:42] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-11 00:20:42] [INFO ] Invariant cache hit.
[2023-03-11 00:20:42] [INFO ] Implicit Places using invariants in 358 ms returned []
[2023-03-11 00:20:42] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-11 00:20:42] [INFO ] Invariant cache hit.
[2023-03-11 00:20:43] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-11 00:20:44] [INFO ] Implicit Places using invariants and state equation in 1495 ms returned []
Implicit Place search using SMT with State Equation took 1862 ms to find 0 implicit places.
[2023-03-11 00:20:44] [INFO ] Redundant transitions in 177 ms returned []
[2023-03-11 00:20:44] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-11 00:20:44] [INFO ] Invariant cache hit.
[2023-03-11 00:20:45] [INFO ] Dead Transitions using invariants and state equation in 884 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2991 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 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 134 place count 227 transition count 2615
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 227 transition count 2614
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 139 place count 227 transition count 2610
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 143 place count 223 transition count 2610
Applied a total of 143 rules in 298 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2610 rows 223 cols
[2023-03-11 00:20:45] [INFO ] Computed 9 place invariants in 15 ms
[2023-03-11 00:20:45] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-11 00:20:46] [INFO ] After 475ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 00:20:46] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-11 00:20:46] [INFO ] After 436ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 00:20:46] [INFO ] After 512ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-11 00:20:46] [INFO ] After 623ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 115 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Applied a total of 0 rules in 7 ms. Remains 237 /237 variables (removed 0) and now considering 2750/2750 (removed 0) transitions.
[2023-03-11 00:20:47] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2023-03-11 00:20:47] [INFO ] Computed 8 place invariants in 8 ms
[2023-03-11 00:20:47] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-03-11 00:20:47] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-11 00:20:47] [INFO ] Invariant cache hit.
[2023-03-11 00:20:47] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-11 00:20:48] [INFO ] Implicit Places using invariants and state equation in 1290 ms returned []
Implicit Place search using SMT with State Equation took 1580 ms to find 0 implicit places.
[2023-03-11 00:20:48] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-11 00:20:48] [INFO ] Invariant cache hit.
[2023-03-11 00:20:49] [INFO ] Dead Transitions using invariants and state equation in 917 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2507 ms. Remains : 237/237 places, 2750/2750 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 109 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10012 steps, including 21 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 236132 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :{}
Probabilistic random walk after 236132 steps, saw 120913 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 00:20:52] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-11 00:20:52] [INFO ] Invariant cache hit.
[2023-03-11 00:20:52] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-11 00:20:53] [INFO ] After 601ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 00:20:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-11 00:20:54] [INFO ] After 469ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 00:20:54] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-11 00:20:54] [INFO ] After 263ms SMT Verify possible using 240 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 00:20:54] [INFO ] Deduced a trap composed of 12 places in 207 ms of which 0 ms to minimize.
[2023-03-11 00:20:54] [INFO ] Deduced a trap composed of 9 places in 197 ms of which 1 ms to minimize.
[2023-03-11 00:20:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 681 ms
[2023-03-11 00:20:55] [INFO ] After 1104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 159 ms.
[2023-03-11 00:20:55] [INFO ] After 1821ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 3 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 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
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 137 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 139 ms. Remains : 229/237 places, 2747/2750 transitions.
Incomplete random walk after 10009 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 213357 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 213357 steps, saw 104541 distinct states, run finished after 3006 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 00:20:58] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-11 00:20:58] [INFO ] Computed 8 place invariants in 13 ms
[2023-03-11 00:20:58] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-11 00:20:59] [INFO ] After 606ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 00:20:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-11 00:20:59] [INFO ] After 474ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 00:20:59] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-11 00:21:00] [INFO ] After 290ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 00:21:00] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2023-03-11 00:21:00] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2023-03-11 00:21:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 297 ms
[2023-03-11 00:21:00] [INFO ] After 693ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 101 ms.
[2023-03-11 00:21:00] [INFO ] After 1345ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 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 48 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 48 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 46 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-11 00:21:00] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-11 00:21:00] [INFO ] Invariant cache hit.
[2023-03-11 00:21:01] [INFO ] Implicit Places using invariants in 376 ms returned []
[2023-03-11 00:21:01] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-11 00:21:01] [INFO ] Invariant cache hit.
[2023-03-11 00:21:01] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-11 00:21:02] [INFO ] Implicit Places using invariants and state equation in 1219 ms returned []
Implicit Place search using SMT with State Equation took 1600 ms to find 0 implicit places.
[2023-03-11 00:21:02] [INFO ] Redundant transitions in 94 ms returned []
[2023-03-11 00:21:02] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-11 00:21:02] [INFO ] Invariant cache hit.
[2023-03-11 00:21:03] [INFO ] Dead Transitions using invariants and state equation in 874 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2623 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 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 134 place count 227 transition count 2615
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 227 transition count 2614
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 139 place count 227 transition count 2610
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 143 place count 223 transition count 2610
Applied a total of 143 rules in 245 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2610 rows 223 cols
[2023-03-11 00:21:03] [INFO ] Computed 9 place invariants in 22 ms
[2023-03-11 00:21:03] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-11 00:21:03] [INFO ] After 458ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 00:21:04] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-11 00:21:04] [INFO ] After 325ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 00:21:04] [INFO ] After 390ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-11 00:21:04] [INFO ] After 489ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 168 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 171 reset in 848 ms.
Product exploration explored 100000 steps with 163 reset in 649 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Support contains 3 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: -7
Deduced a syphon composed of 2 places in 2 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 237 transition count 2757
Deduced a syphon composed of 2 places in 3 ms
Applied a total of 2 rules in 186 ms. Remains 237 /237 variables (removed 0) and now considering 2757/2750 (removed -7) transitions.
[2023-03-11 00:21:06] [INFO ] Redundant transitions in 75 ms returned []
[2023-03-11 00:21:06] [INFO ] Flow matrix only has 2628 transitions (discarded 129 similar events)
// Phase 1: matrix 2628 rows 237 cols
[2023-03-11 00:21:06] [INFO ] Computed 8 place invariants in 10 ms
[2023-03-11 00:21:07] [INFO ] Dead Transitions using invariants and state equation in 890 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 237/237 places, 2757/2750 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1174 ms. Remains : 237/237 places, 2757/2750 transitions.
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Applied a total of 0 rules in 8 ms. Remains 237 /237 variables (removed 0) and now considering 2750/2750 (removed 0) transitions.
[2023-03-11 00:21:07] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2023-03-11 00:21:07] [INFO ] Computed 8 place invariants in 14 ms
[2023-03-11 00:21:08] [INFO ] Implicit Places using invariants in 351 ms returned []
[2023-03-11 00:21:08] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-11 00:21:08] [INFO ] Invariant cache hit.
[2023-03-11 00:21:08] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-11 00:21:09] [INFO ] Implicit Places using invariants and state equation in 1430 ms returned []
Implicit Place search using SMT with State Equation took 1787 ms to find 0 implicit places.
[2023-03-11 00:21:09] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-11 00:21:09] [INFO ] Invariant cache hit.
[2023-03-11 00:21:10] [INFO ] Dead Transitions using invariants and state equation in 851 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2649 ms. Remains : 237/237 places, 2750/2750 transitions.
Treatment of property BugTracking-PT-q3m032-LTLFireability-08 finished in 43992 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' '!(X(G(p0)))'
Found a Lengthening insensitive property : BugTracking-PT-q3m032-LTLFireability-08
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in LI_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 33 ms. Remains 235 /237 variables (removed 2) and now considering 2753/2750 (removed -3) transitions.
[2023-03-11 00:21:10] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2023-03-11 00:21:10] [INFO ] Computed 8 place invariants in 10 ms
[2023-03-11 00:21:11] [INFO ] Implicit Places using invariants in 335 ms returned []
[2023-03-11 00:21:11] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-11 00:21:11] [INFO ] Invariant cache hit.
[2023-03-11 00:21:11] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-11 00:21:12] [INFO ] Implicit Places using invariants and state equation in 1073 ms returned []
Implicit Place search using SMT with State Equation took 1415 ms to find 0 implicit places.
[2023-03-11 00:21:12] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-11 00:21:12] [INFO ] Invariant cache hit.
[2023-03-11 00:21:13] [INFO ] Dead Transitions using invariants and state equation in 716 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 235/237 places, 2753/2750 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2182 ms. Remains : 235/237 places, 2753/2750 transitions.
Running random walk in product with property : BugTracking-PT-q3m032-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s10 1) (LT s80 1) (LT s190 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 174 reset in 705 ms.
Product exploration explored 100000 steps with 174 reset in 679 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 152 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 213023 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 213023 steps, saw 108955 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 00:21:17] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-11 00:21:17] [INFO ] Invariant cache hit.
[2023-03-11 00:21:17] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-11 00:21:18] [INFO ] After 610ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 00:21:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-11 00:21:18] [INFO ] After 494ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 00:21:18] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-11 00:21:19] [INFO ] After 349ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 00:21:19] [INFO ] Deduced a trap composed of 12 places in 201 ms of which 1 ms to minimize.
[2023-03-11 00:21:19] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 1 ms to minimize.
[2023-03-11 00:21:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 565 ms
[2023-03-11 00:21:19] [INFO ] After 1005ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 111 ms.
[2023-03-11 00:21:20] [INFO ] After 1679ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 3 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 97 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 99 ms. Remains : 229/235 places, 2747/2753 transitions.
Incomplete random walk after 10021 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=334 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 207699 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 207699 steps, saw 100949 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 00:21:23] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-11 00:21:23] [INFO ] Computed 8 place invariants in 19 ms
[2023-03-11 00:21:23] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-11 00:21:23] [INFO ] After 660ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 00:21:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-11 00:21:24] [INFO ] After 562ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 00:21:24] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-11 00:21:24] [INFO ] After 373ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 00:21:25] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2023-03-11 00:21:25] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 0 ms to minimize.
[2023-03-11 00:21:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 392 ms
[2023-03-11 00:21:25] [INFO ] After 918ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 146 ms.
[2023-03-11 00:21:25] [INFO ] After 1714ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 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 60 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 60 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 44 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-11 00:21:25] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-11 00:21:25] [INFO ] Invariant cache hit.
[2023-03-11 00:21:26] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-03-11 00:21:26] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-11 00:21:26] [INFO ] Invariant cache hit.
[2023-03-11 00:21:26] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-11 00:21:27] [INFO ] Implicit Places using invariants and state equation in 1263 ms returned []
Implicit Place search using SMT with State Equation took 1607 ms to find 0 implicit places.
[2023-03-11 00:21:27] [INFO ] Redundant transitions in 78 ms returned []
[2023-03-11 00:21:27] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-11 00:21:27] [INFO ] Invariant cache hit.
[2023-03-11 00:21:28] [INFO ] Dead Transitions using invariants and state equation in 788 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2529 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 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 134 place count 227 transition count 2615
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 227 transition count 2614
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 139 place count 227 transition count 2610
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 143 place count 223 transition count 2610
Applied a total of 143 rules in 228 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2610 rows 223 cols
[2023-03-11 00:21:28] [INFO ] Computed 9 place invariants in 20 ms
[2023-03-11 00:21:28] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-11 00:21:28] [INFO ] After 480ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 00:21:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-11 00:21:29] [INFO ] After 364ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 00:21:29] [INFO ] After 436ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-11 00:21:29] [INFO ] After 554ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 193 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 2753/2753 transitions.
Applied a total of 0 rules in 11 ms. Remains 235 /235 variables (removed 0) and now considering 2753/2753 (removed 0) transitions.
[2023-03-11 00:21:29] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2023-03-11 00:21:29] [INFO ] Computed 8 place invariants in 13 ms
[2023-03-11 00:21:30] [INFO ] Implicit Places using invariants in 346 ms returned []
[2023-03-11 00:21:30] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-11 00:21:30] [INFO ] Invariant cache hit.
[2023-03-11 00:21:30] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-11 00:21:31] [INFO ] Implicit Places using invariants and state equation in 1557 ms returned []
Implicit Place search using SMT with State Equation took 1905 ms to find 0 implicit places.
[2023-03-11 00:21:31] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-11 00:21:31] [INFO ] Invariant cache hit.
[2023-03-11 00:21:32] [INFO ] Dead Transitions using invariants and state equation in 758 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2675 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10002 steps, including 24 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
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
Interrupted probabilistic random walk after 242876 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :{}
Probabilistic random walk after 242876 steps, saw 124769 distinct states, run finished after 3003 ms. (steps per millisecond=80 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 00:21:35] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-11 00:21:35] [INFO ] Invariant cache hit.
[2023-03-11 00:21:35] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-11 00:21:36] [INFO ] After 729ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 00:21:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-11 00:21:37] [INFO ] After 503ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 00:21:37] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-11 00:21:37] [INFO ] After 306ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 00:21:37] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 1 ms to minimize.
[2023-03-11 00:21:38] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 1 ms to minimize.
[2023-03-11 00:21:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 453 ms
[2023-03-11 00:21:38] [INFO ] After 830ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-11 00:21:38] [INFO ] After 1479ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 3 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 65 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 65 ms. Remains : 229/235 places, 2747/2753 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 259582 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :{}
Probabilistic random walk after 259582 steps, saw 133862 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 00:21:41] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-11 00:21:41] [INFO ] Computed 8 place invariants in 17 ms
[2023-03-11 00:21:41] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-11 00:21:41] [INFO ] After 555ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 00:21:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-11 00:21:42] [INFO ] After 450ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 00:21:42] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-11 00:21:42] [INFO ] After 437ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 00:21:43] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 0 ms to minimize.
[2023-03-11 00:21:43] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2023-03-11 00:21:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 399 ms
[2023-03-11 00:21:43] [INFO ] After 958ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 109 ms.
[2023-03-11 00:21:43] [INFO ] After 1578ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 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 51 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 51 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 41 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-11 00:21:43] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-11 00:21:43] [INFO ] Invariant cache hit.
[2023-03-11 00:21:43] [INFO ] Implicit Places using invariants in 321 ms returned []
[2023-03-11 00:21:43] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-11 00:21:43] [INFO ] Invariant cache hit.
[2023-03-11 00:21:44] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-11 00:21:45] [INFO ] Implicit Places using invariants and state equation in 1495 ms returned []
Implicit Place search using SMT with State Equation took 1818 ms to find 0 implicit places.
[2023-03-11 00:21:45] [INFO ] Redundant transitions in 58 ms returned []
[2023-03-11 00:21:45] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-11 00:21:45] [INFO ] Invariant cache hit.
[2023-03-11 00:21:46] [INFO ] Dead Transitions using invariants and state equation in 900 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2825 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 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 134 place count 227 transition count 2615
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 227 transition count 2614
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 139 place count 227 transition count 2610
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 143 place count 223 transition count 2610
Applied a total of 143 rules in 234 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2610 rows 223 cols
[2023-03-11 00:21:46] [INFO ] Computed 9 place invariants in 19 ms
[2023-03-11 00:21:46] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-11 00:21:47] [INFO ] After 442ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 00:21:47] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-11 00:21:47] [INFO ] After 413ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 00:21:47] [INFO ] After 515ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-03-11 00:21:47] [INFO ] After 663ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 105 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 178 reset in 670 ms.
Product exploration explored 100000 steps with 175 reset in 696 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Support contains 3 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 75 ms. Remains 235 /235 variables (removed 0) and now considering 2753/2753 (removed 0) transitions.
[2023-03-11 00:21:49] [INFO ] Redundant transitions in 71 ms returned []
[2023-03-11 00:21:49] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2023-03-11 00:21:49] [INFO ] Computed 8 place invariants in 16 ms
[2023-03-11 00:21:50] [INFO ] Dead Transitions using invariants and state equation in 758 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 922 ms. Remains : 235/235 places, 2753/2753 transitions.
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 2753/2753 transitions.
Applied a total of 0 rules in 7 ms. Remains 235 /235 variables (removed 0) and now considering 2753/2753 (removed 0) transitions.
[2023-03-11 00:21:50] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-11 00:21:50] [INFO ] Invariant cache hit.
[2023-03-11 00:21:50] [INFO ] Implicit Places using invariants in 271 ms returned []
[2023-03-11 00:21:50] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-11 00:21:50] [INFO ] Invariant cache hit.
[2023-03-11 00:21:51] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-11 00:21:52] [INFO ] Implicit Places using invariants and state equation in 1268 ms returned []
Implicit Place search using SMT with State Equation took 1541 ms to find 0 implicit places.
[2023-03-11 00:21:52] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-11 00:21:52] [INFO ] Invariant cache hit.
[2023-03-11 00:21:52] [INFO ] Dead Transitions using invariants and state equation in 770 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2320 ms. Remains : 235/235 places, 2753/2753 transitions.
Treatment of property BugTracking-PT-q3m032-LTLFireability-08 finished in 42269 ms.
[2023-03-11 00:21:53] [INFO ] Flatten gal took : 132 ms
[2023-03-11 00:21:53] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-11 00:21:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 237 places, 2750 transitions and 13477 arcs took 22 ms.
Total runtime 107756 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT BugTracking-PT-q3m032
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
LTLFireability

BK_STOP 1678494133531

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 BugTracking-PT-q3m032-LTLFireability-08
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BugTracking-PT-q3m032-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 8/32 BugTracking-PT-q3m032-LTLFireability-08 875763 m, 175152 m/sec, 1172509 t fired, .

Time elapsed: 5 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BugTracking-PT-q3m032-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 18/32 BugTracking-PT-q3m032-LTLFireability-08 1944369 m, 213721 m/sec, 2605885 t fired, .

Time elapsed: 10 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BugTracking-PT-q3m032-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3600 27/32 BugTracking-PT-q3m032-LTLFireability-08 3019136 m, 214953 m/sec, 4047682 t fired, .

Time elapsed: 15 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for BugTracking-PT-q3m032-LTLFireability-08 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BugTracking-PT-q3m032-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 20 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: Portfolio finished: no open tasks 1

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BugTracking-PT-q3m032-LTLFireability-08: LTL unknown AGGR


Time elapsed: 20 secs. Pages in use: 32

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-q3m032"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is BugTracking-PT-q3m032, 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 r039-tajo-167813692400356"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q3m032.tgz
mv BugTracking-PT-q3m032 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 ;