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-167813692500388.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-q8m002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692500388
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 11K Feb 26 07:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 26 07:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 07:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 07:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 08:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 26 08:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 08:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 08:00 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-q8m002-LTLFireability-00
FORMULA_NAME BugTracking-PT-q8m002-LTLFireability-01
FORMULA_NAME BugTracking-PT-q8m002-LTLFireability-02
FORMULA_NAME BugTracking-PT-q8m002-LTLFireability-03
FORMULA_NAME BugTracking-PT-q8m002-LTLFireability-04
FORMULA_NAME BugTracking-PT-q8m002-LTLFireability-05
FORMULA_NAME BugTracking-PT-q8m002-LTLFireability-06
FORMULA_NAME BugTracking-PT-q8m002-LTLFireability-07
FORMULA_NAME BugTracking-PT-q8m002-LTLFireability-08
FORMULA_NAME BugTracking-PT-q8m002-LTLFireability-09
FORMULA_NAME BugTracking-PT-q8m002-LTLFireability-10
FORMULA_NAME BugTracking-PT-q8m002-LTLFireability-11
FORMULA_NAME BugTracking-PT-q8m002-LTLFireability-12
FORMULA_NAME BugTracking-PT-q8m002-LTLFireability-13
FORMULA_NAME BugTracking-PT-q8m002-LTLFireability-14
FORMULA_NAME BugTracking-PT-q8m002-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678496254256

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-q8m002
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 00:57:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 00:57:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 00:57:37] [INFO ] Load time of PNML (sax parser for PT used): 858 ms
[2023-03-11 00:57:37] [INFO ] Transformed 754 places.
[2023-03-11 00:57:37] [INFO ] Transformed 27370 transitions.
[2023-03-11 00:57:37] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1220 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 474 places in 144 ms
Reduce places removed 474 places and 23466 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA BugTracking-PT-q8m002-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 11 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 278 transition count 3904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 277 transition count 3871
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 277 transition count 3871
Applied a total of 4 rules in 162 ms. Remains 277 /280 variables (removed 3) and now considering 3871/3904 (removed 33) transitions.
[2023-03-11 00:57:38] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2023-03-11 00:57:38] [INFO ] Computed 8 place invariants in 57 ms
[2023-03-11 00:57:39] [INFO ] Implicit Places using invariants in 971 ms returned []
[2023-03-11 00:57:39] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-11 00:57:39] [INFO ] Invariant cache hit.
[2023-03-11 00:57:40] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-11 00:57:42] [INFO ] Implicit Places using invariants and state equation in 2293 ms returned []
Implicit Place search using SMT with State Equation took 3351 ms to find 0 implicit places.
[2023-03-11 00:57:42] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-11 00:57:42] [INFO ] Invariant cache hit.
[2023-03-11 00:57:43] [INFO ] Dead Transitions using invariants and state equation in 1119 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 277/280 places, 3871/3904 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4638 ms. Remains : 277/280 places, 3871/3904 transitions.
Support contains 11 out of 277 places after structural reductions.
[2023-03-11 00:57:43] [INFO ] Flatten gal took : 329 ms
[2023-03-11 00:57:43] [INFO ] Flatten gal took : 188 ms
[2023-03-11 00:57:44] [INFO ] Input system was already deterministic with 3871 transitions.
Incomplete random walk after 10000 steps, including 203 resets, run finished after 474 ms. (steps per millisecond=21 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 94 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 136 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 77671 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 77671 steps, saw 44853 distinct states, run finished after 3002 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-11 00:57:48] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-11 00:57:48] [INFO ] Invariant cache hit.
[2023-03-11 00:57:48] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-11 00:57:49] [INFO ] After 898ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:2
[2023-03-11 00:57:49] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-11 00:57:49] [INFO ] After 187ms SMT Verify possible using 282 Read/Feed constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-11 00:57:49] [INFO ] After 1200ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-11 00:57:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-11 00:57:50] [INFO ] After 1071ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-11 00:57:51] [INFO ] After 908ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-11 00:57:52] [INFO ] Deduced a trap composed of 14 places in 328 ms of which 5 ms to minimize.
[2023-03-11 00:57:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 555 ms
[2023-03-11 00:57:53] [INFO ] Deduced a trap composed of 62 places in 417 ms of which 1 ms to minimize.
[2023-03-11 00:57:53] [INFO ] Deduced a trap composed of 32 places in 400 ms of which 5 ms to minimize.
[2023-03-11 00:57:54] [INFO ] Deduced a trap composed of 14 places in 315 ms of which 1 ms to minimize.
[2023-03-11 00:57:54] [INFO ] Deduced a trap composed of 55 places in 354 ms of which 1 ms to minimize.
[2023-03-11 00:57:55] [INFO ] Deduced a trap composed of 60 places in 357 ms of which 2 ms to minimize.
[2023-03-11 00:57:55] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2487 ms
[2023-03-11 00:57:55] [INFO ] After 4540ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 491 ms.
[2023-03-11 00:57:55] [INFO ] After 6226ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 52 ms.
Support contains 9 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 275 transition count 3877
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 9 place count 275 transition count 3872
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 14 place count 270 transition count 3872
Applied a total of 14 rules in 302 ms. Remains 270 /277 variables (removed 7) and now considering 3872/3871 (removed -1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 304 ms. Remains : 270/277 places, 3872/3871 transitions.
Incomplete random walk after 10000 steps, including 250 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 69 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 145 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 165 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 93657 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 93657 steps, saw 62034 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 00:57:59] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2023-03-11 00:57:59] [INFO ] Computed 8 place invariants in 45 ms
[2023-03-11 00:57:59] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-11 00:58:01] [INFO ] After 1447ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-11 00:58:01] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-11 00:58:01] [INFO ] After 208ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 00:58:01] [INFO ] After 1813ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 00:58:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-11 00:58:02] [INFO ] After 1095ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 00:58:03] [INFO ] After 714ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 00:58:04] [INFO ] Deduced a trap composed of 13 places in 366 ms of which 1 ms to minimize.
[2023-03-11 00:58:04] [INFO ] Deduced a trap composed of 43 places in 305 ms of which 0 ms to minimize.
[2023-03-11 00:58:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 945 ms
[2023-03-11 00:58:05] [INFO ] Deduced a trap composed of 23 places in 444 ms of which 1 ms to minimize.
[2023-03-11 00:58:05] [INFO ] Deduced a trap composed of 56 places in 420 ms of which 0 ms to minimize.
[2023-03-11 00:58:06] [INFO ] Deduced a trap composed of 46 places in 419 ms of which 0 ms to minimize.
[2023-03-11 00:58:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1685 ms
[2023-03-11 00:58:06] [INFO ] Deduced a trap composed of 35 places in 408 ms of which 2 ms to minimize.
[2023-03-11 00:58:07] [INFO ] Deduced a trap composed of 33 places in 347 ms of which 1 ms to minimize.
[2023-03-11 00:58:07] [INFO ] Deduced a trap composed of 57 places in 405 ms of which 0 ms to minimize.
[2023-03-11 00:58:08] [INFO ] Deduced a trap composed of 59 places in 409 ms of which 1 ms to minimize.
[2023-03-11 00:58:08] [INFO ] Deduced a trap composed of 60 places in 334 ms of which 1 ms to minimize.
[2023-03-11 00:58:09] [INFO ] Deduced a trap composed of 61 places in 332 ms of which 1 ms to minimize.
[2023-03-11 00:58:09] [INFO ] Deduced a trap composed of 19 places in 548 ms of which 1 ms to minimize.
[2023-03-11 00:58:10] [INFO ] Deduced a trap composed of 10 places in 410 ms of which 1 ms to minimize.
[2023-03-11 00:58:10] [INFO ] Deduced a trap composed of 59 places in 343 ms of which 1 ms to minimize.
[2023-03-11 00:58:11] [INFO ] Deduced a trap composed of 60 places in 364 ms of which 0 ms to minimize.
[2023-03-11 00:58:11] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 5024 ms
[2023-03-11 00:58:11] [INFO ] After 8738ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 385 ms.
[2023-03-11 00:58:11] [INFO ] After 10309ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 29 ms.
Support contains 9 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 74 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 270/270 places, 3872/3872 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 70 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
[2023-03-11 00:58:12] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-11 00:58:12] [INFO ] Invariant cache hit.
[2023-03-11 00:58:12] [INFO ] Implicit Places using invariants in 409 ms returned []
[2023-03-11 00:58:12] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-11 00:58:12] [INFO ] Invariant cache hit.
[2023-03-11 00:58:13] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-11 00:58:14] [INFO ] Implicit Places using invariants and state equation in 2147 ms returned []
Implicit Place search using SMT with State Equation took 2561 ms to find 0 implicit places.
[2023-03-11 00:58:15] [INFO ] Redundant transitions in 312 ms returned []
[2023-03-11 00:58:15] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-11 00:58:15] [INFO ] Invariant cache hit.
[2023-03-11 00:58:16] [INFO ] Dead Transitions using invariants and state equation in 1044 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3993 ms. Remains : 270/270 places, 3872/3872 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 270 transition count 3699
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 177 place count 268 transition count 3697
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 268 transition count 3696
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 268 transition count 3692
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 264 transition count 3692
Applied a total of 186 rules in 203 ms. Remains 264 /270 variables (removed 6) and now considering 3692/3872 (removed 180) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 3692 rows 264 cols
[2023-03-11 00:58:16] [INFO ] Computed 9 place invariants in 40 ms
[2023-03-11 00:58:16] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-11 00:58:17] [INFO ] After 724ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2023-03-11 00:58:17] [INFO ] After 1211ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:1
Attempting to minimize the solution found.
Minimization took 209 ms.
[2023-03-11 00:58:17] [INFO ] After 1498ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 00:58:17] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-11 00:58:18] [INFO ] After 859ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 00:58:19] [INFO ] After 1178ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 174 ms.
[2023-03-11 00:58:19] [INFO ] After 1461ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Successfully simplified 1 atomic propositions for a total of 2 simplifications.
Computed a total of 6 stabilizing places and 131 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' '!(F(p0))'
Support contains 3 out of 277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
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 275 transition count 3877
Applied a total of 4 rules in 139 ms. Remains 275 /277 variables (removed 2) and now considering 3877/3871 (removed -6) transitions.
[2023-03-11 00:58:19] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2023-03-11 00:58:19] [INFO ] Computed 8 place invariants in 28 ms
[2023-03-11 00:58:19] [INFO ] Implicit Places using invariants in 425 ms returned []
[2023-03-11 00:58:20] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-11 00:58:20] [INFO ] Invariant cache hit.
[2023-03-11 00:58:20] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-11 00:58:21] [INFO ] Implicit Places using invariants and state equation in 1760 ms returned []
Implicit Place search using SMT with State Equation took 2189 ms to find 0 implicit places.
[2023-03-11 00:58:21] [INFO ] Redundant transitions in 172 ms returned []
[2023-03-11 00:58:21] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-11 00:58:21] [INFO ] Invariant cache hit.
[2023-03-11 00:58:23] [INFO ] Dead Transitions using invariants and state equation in 1232 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 275/277 places, 3877/3871 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3746 ms. Remains : 275/277 places, 3877/3871 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p0)]
Running random walk in product with property : BugTracking-PT-q8m002-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s10 1) (GEQ s79 1) (GEQ s205 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 63 steps with 0 reset in 5 ms.
FORMULA BugTracking-PT-q8m002-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BugTracking-PT-q8m002-LTLFireability-09 finished in 3982 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(((!p0 U p1) U X(X(G(!p0))))))'
Support contains 6 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Applied a total of 0 rules in 15 ms. Remains 277 /277 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-11 00:58:23] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2023-03-11 00:58:23] [INFO ] Computed 8 place invariants in 11 ms
[2023-03-11 00:58:23] [INFO ] Implicit Places using invariants in 334 ms returned []
[2023-03-11 00:58:23] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-11 00:58:23] [INFO ] Invariant cache hit.
[2023-03-11 00:58:24] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-11 00:58:25] [INFO ] Implicit Places using invariants and state equation in 1929 ms returned []
Implicit Place search using SMT with State Equation took 2266 ms to find 0 implicit places.
[2023-03-11 00:58:25] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-11 00:58:25] [INFO ] Invariant cache hit.
[2023-03-11 00:58:26] [INFO ] Dead Transitions using invariants and state equation in 1093 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3376 ms. Remains : 277/277 places, 3871/3871 transitions.
Stuttering acceptance computed with spot in 237 ms :[p0, p0, (AND (NOT p1) p0), p0, true, p0, (AND (NOT p1) p0)]
Running random walk in product with property : BugTracking-PT-q8m002-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(NOT p0), acceptance={} source=5 dest: 5}, { cond=(AND p1 p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s2 1) (GEQ s40 1) (GEQ s190 1)), p0:(AND (GEQ s5 1) (GEQ s62 1) (GEQ s168 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22181 reset in 845 ms.
Product exploration explored 100000 steps with 22262 reset in 801 ms.
Computed a total of 6 stabilizing places and 131 stable transitions
Computed a total of 6 stabilizing places and 131 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 495 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[p0, p0, (AND p0 (NOT p1)), p0, true, p0, (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 185 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 99 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 100 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 135 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 90220 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 90220 steps, saw 52069 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-11 00:58:33] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-11 00:58:33] [INFO ] Invariant cache hit.
[2023-03-11 00:58:33] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-11 00:58:33] [INFO ] After 664ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 00:58:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-11 00:58:35] [INFO ] After 1230ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 00:58:35] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-11 00:58:36] [INFO ] After 995ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 00:58:36] [INFO ] Deduced a trap composed of 30 places in 424 ms of which 1 ms to minimize.
[2023-03-11 00:58:37] [INFO ] Deduced a trap composed of 21 places in 384 ms of which 3 ms to minimize.
[2023-03-11 00:58:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1135 ms
[2023-03-11 00:58:37] [INFO ] Deduced a trap composed of 67 places in 308 ms of which 0 ms to minimize.
[2023-03-11 00:58:38] [INFO ] Deduced a trap composed of 34 places in 379 ms of which 1 ms to minimize.
[2023-03-11 00:58:38] [INFO ] Deduced a trap composed of 69 places in 350 ms of which 0 ms to minimize.
[2023-03-11 00:58:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1486 ms
[2023-03-11 00:58:39] [INFO ] Deduced a trap composed of 26 places in 450 ms of which 1 ms to minimize.
[2023-03-11 00:58:40] [INFO ] Deduced a trap composed of 77 places in 570 ms of which 0 ms to minimize.
[2023-03-11 00:58:41] [INFO ] Deduced a trap composed of 52 places in 520 ms of which 0 ms to minimize.
[2023-03-11 00:58:41] [INFO ] Deduced a trap composed of 11 places in 523 ms of which 1 ms to minimize.
[2023-03-11 00:58:41] [INFO ] Deduced a trap composed of 24 places in 295 ms of which 0 ms to minimize.
[2023-03-11 00:58:42] [INFO ] Deduced a trap composed of 37 places in 307 ms of which 0 ms to minimize.
[2023-03-11 00:58:42] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3302 ms
[2023-03-11 00:58:43] [INFO ] Deduced a trap composed of 73 places in 398 ms of which 1 ms to minimize.
[2023-03-11 00:58:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 614 ms
[2023-03-11 00:58:43] [INFO ] After 8213ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 720 ms.
[2023-03-11 00:58:44] [INFO ] After 10297ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 107 ms.
Support contains 6 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
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 275 transition count 3877
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 9 place count 275 transition count 3872
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 14 place count 270 transition count 3872
Applied a total of 14 rules in 164 ms. Remains 270 /277 variables (removed 7) and now considering 3872/3871 (removed -1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 270/277 places, 3872/3871 transitions.
Incomplete random walk after 10000 steps, including 258 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 144 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 149 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 256 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 95979 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 95979 steps, saw 63673 distinct states, run finished after 3002 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-11 00:58:48] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2023-03-11 00:58:48] [INFO ] Computed 8 place invariants in 23 ms
[2023-03-11 00:58:48] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-11 00:58:48] [INFO ] After 829ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 00:58:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-11 00:58:50] [INFO ] After 1156ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 00:58:50] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-11 00:58:51] [INFO ] After 1227ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 00:58:52] [INFO ] Deduced a trap composed of 10 places in 433 ms of which 1 ms to minimize.
[2023-03-11 00:58:52] [INFO ] Deduced a trap composed of 83 places in 417 ms of which 0 ms to minimize.
[2023-03-11 00:58:53] [INFO ] Deduced a trap composed of 65 places in 420 ms of which 1 ms to minimize.
[2023-03-11 00:58:54] [INFO ] Deduced a trap composed of 90 places in 401 ms of which 1 ms to minimize.
[2023-03-11 00:58:54] [INFO ] Deduced a trap composed of 63 places in 366 ms of which 1 ms to minimize.
[2023-03-11 00:58:54] [INFO ] Deduced a trap composed of 63 places in 389 ms of which 1 ms to minimize.
[2023-03-11 00:58:55] [INFO ] Deduced a trap composed of 56 places in 425 ms of which 1 ms to minimize.
[2023-03-11 00:58:56] [INFO ] Deduced a trap composed of 66 places in 377 ms of which 1 ms to minimize.
[2023-03-11 00:58:56] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4295 ms
[2023-03-11 00:58:57] [INFO ] Deduced a trap composed of 16 places in 520 ms of which 1 ms to minimize.
[2023-03-11 00:58:57] [INFO ] Deduced a trap composed of 17 places in 453 ms of which 0 ms to minimize.
[2023-03-11 00:58:58] [INFO ] Deduced a trap composed of 23 places in 469 ms of which 1 ms to minimize.
[2023-03-11 00:58:58] [INFO ] Deduced a trap composed of 73 places in 435 ms of which 1 ms to minimize.
[2023-03-11 00:58:59] [INFO ] Deduced a trap composed of 34 places in 442 ms of which 1 ms to minimize.
[2023-03-11 00:58:59] [INFO ] Deduced a trap composed of 10 places in 480 ms of which 0 ms to minimize.
[2023-03-11 00:59:00] [INFO ] Deduced a trap composed of 31 places in 481 ms of which 1 ms to minimize.
[2023-03-11 00:59:00] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4050 ms
[2023-03-11 00:59:00] [INFO ] After 10487ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 790 ms.
[2023-03-11 00:59:01] [INFO ] After 12545ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 223 ms.
Support contains 6 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 76 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 270/270 places, 3872/3872 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 78 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
[2023-03-11 00:59:01] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-11 00:59:01] [INFO ] Invariant cache hit.
[2023-03-11 00:59:02] [INFO ] Implicit Places using invariants in 461 ms returned []
[2023-03-11 00:59:02] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-11 00:59:02] [INFO ] Invariant cache hit.
[2023-03-11 00:59:02] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-11 00:59:04] [INFO ] Implicit Places using invariants and state equation in 1853 ms returned []
Implicit Place search using SMT with State Equation took 2316 ms to find 0 implicit places.
[2023-03-11 00:59:04] [INFO ] Redundant transitions in 128 ms returned []
[2023-03-11 00:59:04] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-11 00:59:04] [INFO ] Invariant cache hit.
[2023-03-11 00:59:05] [INFO ] Dead Transitions using invariants and state equation in 1157 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3692 ms. Remains : 270/270 places, 3872/3872 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 270 transition count 3699
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 177 place count 268 transition count 3697
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 268 transition count 3696
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 268 transition count 3692
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 264 transition count 3692
Applied a total of 186 rules in 192 ms. Remains 264 /270 variables (removed 6) and now considering 3692/3872 (removed 180) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 3692 rows 264 cols
[2023-03-11 00:59:05] [INFO ] Computed 9 place invariants in 30 ms
[2023-03-11 00:59:05] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-11 00:59:06] [INFO ] After 698ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-11 00:59:06] [INFO ] After 904ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 00:59:06] [INFO ] After 994ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 00:59:06] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-11 00:59:08] [INFO ] After 1193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 00:59:08] [INFO ] After 1991ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 656 ms.
[2023-03-11 00:59:09] [INFO ] After 2754ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 674 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 323 ms :[p0, p0, (AND p0 (NOT p1)), p0, true, p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 281 ms :[p0, p0, (AND p0 (NOT p1)), p0, true, p0, (AND p0 (NOT p1))]
Support contains 6 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Applied a total of 0 rules in 18 ms. Remains 277 /277 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-11 00:59:10] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2023-03-11 00:59:10] [INFO ] Computed 8 place invariants in 19 ms
[2023-03-11 00:59:11] [INFO ] Implicit Places using invariants in 446 ms returned []
[2023-03-11 00:59:11] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-11 00:59:11] [INFO ] Invariant cache hit.
[2023-03-11 00:59:12] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-11 00:59:13] [INFO ] Implicit Places using invariants and state equation in 2472 ms returned []
Implicit Place search using SMT with State Equation took 2924 ms to find 0 implicit places.
[2023-03-11 00:59:13] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-11 00:59:13] [INFO ] Invariant cache hit.
[2023-03-11 00:59:14] [INFO ] Dead Transitions using invariants and state equation in 1177 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4120 ms. Remains : 277/277 places, 3871/3871 transitions.
Computed a total of 6 stabilizing places and 131 stable transitions
Computed a total of 6 stabilizing places and 131 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 556 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[p0, p0, (AND (NOT p1) p0), p0, true, p0, (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 194 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 87 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 202 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 68823 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68823 steps, saw 39766 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-11 00:59:19] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-11 00:59:19] [INFO ] Invariant cache hit.
[2023-03-11 00:59:19] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-11 00:59:20] [INFO ] After 627ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 00:59:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-11 00:59:21] [INFO ] After 1007ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 00:59:21] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-11 00:59:22] [INFO ] After 1135ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 00:59:23] [INFO ] Deduced a trap composed of 9 places in 381 ms of which 0 ms to minimize.
[2023-03-11 00:59:23] [INFO ] Deduced a trap composed of 28 places in 267 ms of which 4 ms to minimize.
[2023-03-11 00:59:23] [INFO ] Deduced a trap composed of 24 places in 295 ms of which 1 ms to minimize.
[2023-03-11 00:59:24] [INFO ] Deduced a trap composed of 35 places in 274 ms of which 1 ms to minimize.
[2023-03-11 00:59:24] [INFO ] Deduced a trap composed of 24 places in 267 ms of which 1 ms to minimize.
[2023-03-11 00:59:24] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2188 ms
[2023-03-11 00:59:25] [INFO ] Deduced a trap composed of 21 places in 175 ms of which 0 ms to minimize.
[2023-03-11 00:59:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 396 ms
[2023-03-11 00:59:26] [INFO ] After 4703ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 785 ms.
[2023-03-11 00:59:26] [INFO ] After 6588ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 75 ms.
Support contains 6 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
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 275 transition count 3877
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 9 place count 275 transition count 3872
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 14 place count 270 transition count 3872
Applied a total of 14 rules in 152 ms. Remains 270 /277 variables (removed 7) and now considering 3872/3871 (removed -1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 270/277 places, 3872/3871 transitions.
Incomplete random walk after 10000 steps, including 280 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 145 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 143 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 231 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 85993 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 85993 steps, saw 56624 distinct states, run finished after 3002 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-11 00:59:30] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2023-03-11 00:59:30] [INFO ] Computed 8 place invariants in 9 ms
[2023-03-11 00:59:30] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-11 00:59:31] [INFO ] After 683ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 00:59:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-11 00:59:32] [INFO ] After 921ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 00:59:32] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-11 00:59:33] [INFO ] After 926ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 00:59:34] [INFO ] Deduced a trap composed of 26 places in 298 ms of which 1 ms to minimize.
[2023-03-11 00:59:34] [INFO ] Deduced a trap composed of 26 places in 287 ms of which 1 ms to minimize.
[2023-03-11 00:59:34] [INFO ] Deduced a trap composed of 24 places in 276 ms of which 2 ms to minimize.
[2023-03-11 00:59:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1254 ms
[2023-03-11 00:59:35] [INFO ] Deduced a trap composed of 97 places in 487 ms of which 1 ms to minimize.
[2023-03-11 00:59:36] [INFO ] Deduced a trap composed of 97 places in 489 ms of which 2 ms to minimize.
[2023-03-11 00:59:36] [INFO ] Deduced a trap composed of 58 places in 493 ms of which 2 ms to minimize.
[2023-03-11 00:59:37] [INFO ] Deduced a trap composed of 65 places in 500 ms of which 1 ms to minimize.
[2023-03-11 00:59:38] [INFO ] Deduced a trap composed of 89 places in 505 ms of which 0 ms to minimize.
[2023-03-11 00:59:38] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3198 ms
[2023-03-11 00:59:39] [INFO ] Deduced a trap composed of 17 places in 468 ms of which 0 ms to minimize.
[2023-03-11 00:59:39] [INFO ] Deduced a trap composed of 57 places in 334 ms of which 0 ms to minimize.
[2023-03-11 00:59:40] [INFO ] Deduced a trap composed of 68 places in 455 ms of which 0 ms to minimize.
[2023-03-11 00:59:40] [INFO ] Deduced a trap composed of 13 places in 466 ms of which 1 ms to minimize.
[2023-03-11 00:59:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2262 ms
[2023-03-11 00:59:41] [INFO ] After 8452ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 823 ms.
[2023-03-11 00:59:41] [INFO ] After 10314ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 175 ms.
Support contains 6 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 65 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 270/270 places, 3872/3872 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 62 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
[2023-03-11 00:59:42] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-11 00:59:42] [INFO ] Invariant cache hit.
[2023-03-11 00:59:42] [INFO ] Implicit Places using invariants in 455 ms returned []
[2023-03-11 00:59:42] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-11 00:59:42] [INFO ] Invariant cache hit.
[2023-03-11 00:59:43] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-11 00:59:44] [INFO ] Implicit Places using invariants and state equation in 1879 ms returned []
Implicit Place search using SMT with State Equation took 2336 ms to find 0 implicit places.
[2023-03-11 00:59:44] [INFO ] Redundant transitions in 129 ms returned []
[2023-03-11 00:59:44] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-11 00:59:44] [INFO ] Invariant cache hit.
[2023-03-11 00:59:45] [INFO ] Dead Transitions using invariants and state equation in 1052 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3585 ms. Remains : 270/270 places, 3872/3872 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 270 transition count 3699
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 177 place count 268 transition count 3697
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 268 transition count 3696
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 268 transition count 3692
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 264 transition count 3692
Applied a total of 186 rules in 173 ms. Remains 264 /270 variables (removed 6) and now considering 3692/3872 (removed 180) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 3692 rows 264 cols
[2023-03-11 00:59:45] [INFO ] Computed 9 place invariants in 30 ms
[2023-03-11 00:59:45] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-11 00:59:46] [INFO ] After 767ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-11 00:59:46] [INFO ] After 953ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 00:59:46] [INFO ] After 1051ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 00:59:47] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-11 00:59:47] [INFO ] After 909ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 00:59:48] [INFO ] After 1716ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 507 ms.
[2023-03-11 00:59:49] [INFO ] After 2311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 585 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 285 ms :[p0, p0, (AND (NOT p1) p0), p0, true, p0, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 298 ms :[p0, p0, (AND (NOT p1) p0), p0, true, p0, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 352 ms :[p0, p0, (AND (NOT p1) p0), p0, true, p0, (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 22335 reset in 969 ms.
Product exploration explored 100000 steps with 22187 reset in 714 ms.
Applying partial POR strategy [false, false, false, true, true, false, true]
Stuttering acceptance computed with spot in 283 ms :[p0, p0, (AND (NOT p1) p0), p0, true, p0, (AND (NOT p1) p0)]
Support contains 6 out of 277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 3 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 277 transition count 3881
Deduced a syphon composed of 2 places in 4 ms
Applied a total of 2 rules in 146 ms. Remains 277 /277 variables (removed 0) and now considering 3881/3871 (removed -10) transitions.
[2023-03-11 00:59:53] [INFO ] Redundant transitions in 131 ms returned []
[2023-03-11 00:59:53] [INFO ] Flow matrix only has 3709 transitions (discarded 172 similar events)
// Phase 1: matrix 3709 rows 277 cols
[2023-03-11 00:59:53] [INFO ] Computed 8 place invariants in 26 ms
[2023-03-11 00:59:54] [INFO ] Dead Transitions using invariants and state equation in 1303 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 277/277 places, 3881/3871 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1596 ms. Remains : 277/277 places, 3881/3871 transitions.
Support contains 6 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Applied a total of 0 rules in 10 ms. Remains 277 /277 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-11 00:59:54] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2023-03-11 00:59:54] [INFO ] Computed 8 place invariants in 8 ms
[2023-03-11 00:59:55] [INFO ] Implicit Places using invariants in 396 ms returned []
[2023-03-11 00:59:55] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-11 00:59:55] [INFO ] Invariant cache hit.
[2023-03-11 00:59:55] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-11 00:59:56] [INFO ] Implicit Places using invariants and state equation in 1903 ms returned []
Implicit Place search using SMT with State Equation took 2301 ms to find 0 implicit places.
[2023-03-11 00:59:56] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-11 00:59:56] [INFO ] Invariant cache hit.
[2023-03-11 00:59:57] [INFO ] Dead Transitions using invariants and state equation in 997 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3313 ms. Remains : 277/277 places, 3871/3871 transitions.
Treatment of property BugTracking-PT-q8m002-LTLFireability-10 finished in 94901 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(((!p0 U p1) U X(X(G(!p0))))))'
Found a Lengthening insensitive property : BugTracking-PT-q8m002-LTLFireability-10
Stuttering acceptance computed with spot in 318 ms :[p0, p0, (AND (NOT p1) p0), p0, true, p0, (AND (NOT p1) p0)]
Support contains 6 out of 277 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 275 transition count 3877
Applied a total of 4 rules in 65 ms. Remains 275 /277 variables (removed 2) and now considering 3877/3871 (removed -6) transitions.
[2023-03-11 00:59:58] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2023-03-11 00:59:58] [INFO ] Computed 8 place invariants in 25 ms
[2023-03-11 00:59:59] [INFO ] Implicit Places using invariants in 469 ms returned []
[2023-03-11 00:59:59] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-11 00:59:59] [INFO ] Invariant cache hit.
[2023-03-11 00:59:59] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-11 01:00:01] [INFO ] Implicit Places using invariants and state equation in 1818 ms returned []
Implicit Place search using SMT with State Equation took 2293 ms to find 0 implicit places.
[2023-03-11 01:00:01] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-11 01:00:01] [INFO ] Invariant cache hit.
[2023-03-11 01:00:02] [INFO ] Dead Transitions using invariants and state equation in 1056 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 275/277 places, 3877/3871 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3416 ms. Remains : 275/277 places, 3877/3871 transitions.
Running random walk in product with property : BugTracking-PT-q8m002-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(NOT p0), acceptance={} source=5 dest: 5}, { cond=(AND p1 p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s2 1) (GEQ s38 1) (GEQ s188 1)), p0:(AND (GEQ s5 1) (GEQ s60 1) (GEQ s166 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22239 reset in 849 ms.
Product exploration explored 100000 steps with 22294 reset in 841 ms.
Computed a total of 6 stabilizing places and 131 stable transitions
Computed a total of 6 stabilizing places and 131 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 448 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[p0, p0, (AND p0 (NOT p1)), p0, true, p0, (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 195 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 77 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 110 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 185 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 92055 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 92055 steps, saw 53121 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-11 01:00:07] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-11 01:00:07] [INFO ] Invariant cache hit.
[2023-03-11 01:00:08] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-11 01:00:08] [INFO ] After 646ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 01:00:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-11 01:00:09] [INFO ] After 925ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 01:00:09] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-11 01:00:10] [INFO ] After 1225ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 01:00:11] [INFO ] Deduced a trap composed of 14 places in 543 ms of which 1 ms to minimize.
[2023-03-11 01:00:12] [INFO ] Deduced a trap composed of 48 places in 532 ms of which 1 ms to minimize.
[2023-03-11 01:00:12] [INFO ] Deduced a trap composed of 57 places in 530 ms of which 1 ms to minimize.
[2023-03-11 01:00:13] [INFO ] Deduced a trap composed of 10 places in 549 ms of which 1 ms to minimize.
[2023-03-11 01:00:14] [INFO ] Deduced a trap composed of 9 places in 377 ms of which 0 ms to minimize.
[2023-03-11 01:00:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3176 ms
[2023-03-11 01:00:14] [INFO ] After 5202ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 631 ms.
[2023-03-11 01:00:15] [INFO ] After 6827ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 164 ms.
Support contains 6 out of 275 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 275/275 places, 3877/3877 transitions.
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 275 transition count 3872
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 10 place count 270 transition count 3872
Applied a total of 10 rules in 171 ms. Remains 270 /275 variables (removed 5) and now considering 3872/3877 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 270/275 places, 3872/3877 transitions.
Incomplete random walk after 10000 steps, including 222 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 172 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 140 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 233 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 107137 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 107137 steps, saw 70537 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-11 01:00:19] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2023-03-11 01:00:19] [INFO ] Computed 8 place invariants in 11 ms
[2023-03-11 01:00:19] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-11 01:00:20] [INFO ] After 942ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 01:00:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-11 01:00:21] [INFO ] After 1242ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 01:00:21] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-11 01:00:22] [INFO ] After 1216ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 01:00:23] [INFO ] Deduced a trap composed of 10 places in 398 ms of which 0 ms to minimize.
[2023-03-11 01:00:24] [INFO ] Deduced a trap composed of 83 places in 417 ms of which 0 ms to minimize.
[2023-03-11 01:00:24] [INFO ] Deduced a trap composed of 65 places in 386 ms of which 1 ms to minimize.
[2023-03-11 01:00:25] [INFO ] Deduced a trap composed of 90 places in 462 ms of which 3 ms to minimize.
[2023-03-11 01:00:25] [INFO ] Deduced a trap composed of 63 places in 386 ms of which 0 ms to minimize.
[2023-03-11 01:00:26] [INFO ] Deduced a trap composed of 63 places in 392 ms of which 1 ms to minimize.
[2023-03-11 01:00:27] [INFO ] Deduced a trap composed of 56 places in 378 ms of which 0 ms to minimize.
[2023-03-11 01:00:27] [INFO ] Deduced a trap composed of 66 places in 411 ms of which 0 ms to minimize.
[2023-03-11 01:00:27] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4312 ms
[2023-03-11 01:00:28] [INFO ] Deduced a trap composed of 16 places in 474 ms of which 0 ms to minimize.
[2023-03-11 01:00:29] [INFO ] Deduced a trap composed of 17 places in 424 ms of which 0 ms to minimize.
[2023-03-11 01:00:29] [INFO ] Deduced a trap composed of 23 places in 437 ms of which 1 ms to minimize.
[2023-03-11 01:00:30] [INFO ] Deduced a trap composed of 73 places in 446 ms of which 1 ms to minimize.
[2023-03-11 01:00:30] [INFO ] Deduced a trap composed of 34 places in 443 ms of which 0 ms to minimize.
[2023-03-11 01:00:31] [INFO ] Deduced a trap composed of 10 places in 369 ms of which 1 ms to minimize.
[2023-03-11 01:00:31] [INFO ] Deduced a trap composed of 31 places in 380 ms of which 0 ms to minimize.
[2023-03-11 01:00:31] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3699 ms
[2023-03-11 01:00:31] [INFO ] After 10053ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 846 ms.
[2023-03-11 01:00:32] [INFO ] After 12253ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 277 ms.
Support contains 6 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 58 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 270/270 places, 3872/3872 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 77 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
[2023-03-11 01:00:33] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-11 01:00:33] [INFO ] Invariant cache hit.
[2023-03-11 01:00:33] [INFO ] Implicit Places using invariants in 441 ms returned []
[2023-03-11 01:00:33] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-11 01:00:33] [INFO ] Invariant cache hit.
[2023-03-11 01:00:34] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-11 01:00:35] [INFO ] Implicit Places using invariants and state equation in 1592 ms returned []
Implicit Place search using SMT with State Equation took 2036 ms to find 0 implicit places.
[2023-03-11 01:00:35] [INFO ] Redundant transitions in 93 ms returned []
[2023-03-11 01:00:35] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-11 01:00:35] [INFO ] Invariant cache hit.
[2023-03-11 01:00:36] [INFO ] Dead Transitions using invariants and state equation in 1069 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3283 ms. Remains : 270/270 places, 3872/3872 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 270 transition count 3699
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 177 place count 268 transition count 3697
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 268 transition count 3696
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 268 transition count 3692
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 264 transition count 3692
Applied a total of 186 rules in 170 ms. Remains 264 /270 variables (removed 6) and now considering 3692/3872 (removed 180) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 3692 rows 264 cols
[2023-03-11 01:00:36] [INFO ] Computed 9 place invariants in 11 ms
[2023-03-11 01:00:36] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-11 01:00:37] [INFO ] After 590ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-11 01:00:37] [INFO ] After 737ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 01:00:37] [INFO ] After 835ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 01:00:37] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-11 01:00:38] [INFO ] After 1073ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 01:00:39] [INFO ] After 1807ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 581 ms.
[2023-03-11 01:00:39] [INFO ] After 2503ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 500 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[p0, p0, (AND p0 (NOT p1)), p0, true, p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 258 ms :[p0, p0, (AND p0 (NOT p1)), p0, true, p0, (AND p0 (NOT p1))]
Support contains 6 out of 275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 3877/3877 transitions.
Applied a total of 0 rules in 23 ms. Remains 275 /275 variables (removed 0) and now considering 3877/3877 (removed 0) transitions.
[2023-03-11 01:00:40] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2023-03-11 01:00:40] [INFO ] Computed 8 place invariants in 11 ms
[2023-03-11 01:00:41] [INFO ] Implicit Places using invariants in 380 ms returned []
[2023-03-11 01:00:41] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-11 01:00:41] [INFO ] Invariant cache hit.
[2023-03-11 01:00:41] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-11 01:00:43] [INFO ] Implicit Places using invariants and state equation in 1821 ms returned []
Implicit Place search using SMT with State Equation took 2203 ms to find 0 implicit places.
[2023-03-11 01:00:43] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-11 01:00:43] [INFO ] Invariant cache hit.
[2023-03-11 01:00:44] [INFO ] Dead Transitions using invariants and state equation in 941 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3168 ms. Remains : 275/275 places, 3877/3877 transitions.
Computed a total of 6 stabilizing places and 131 stable transitions
Computed a total of 6 stabilizing places and 131 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 407 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[p0, p0, (AND (NOT p1) p0), p0, true, p0, (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 228 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 83 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 177 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 89560 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 89560 steps, saw 51690 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-11 01:00:48] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-11 01:00:48] [INFO ] Invariant cache hit.
[2023-03-11 01:00:48] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-11 01:00:48] [INFO ] After 643ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 01:00:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-11 01:00:49] [INFO ] After 877ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 01:00:49] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-11 01:00:50] [INFO ] After 1087ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 01:00:51] [INFO ] Deduced a trap composed of 26 places in 385 ms of which 0 ms to minimize.
[2023-03-11 01:00:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 569 ms
[2023-03-11 01:00:52] [INFO ] Deduced a trap composed of 16 places in 209 ms of which 1 ms to minimize.
[2023-03-11 01:00:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 390 ms
[2023-03-11 01:00:52] [INFO ] After 3241ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 581 ms.
[2023-03-11 01:00:53] [INFO ] After 4772ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 322 ms.
Support contains 6 out of 275 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 275/275 places, 3877/3877 transitions.
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 275 transition count 3872
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 10 place count 270 transition count 3872
Applied a total of 10 rules in 118 ms. Remains 270 /275 variables (removed 5) and now considering 3872/3877 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 270/275 places, 3872/3877 transitions.
Incomplete random walk after 10000 steps, including 235 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 147 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 156 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 238 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 96173 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 96173 steps, saw 63810 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-11 01:00:57] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2023-03-11 01:00:57] [INFO ] Computed 8 place invariants in 8 ms
[2023-03-11 01:00:57] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-11 01:00:58] [INFO ] After 656ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 01:00:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-11 01:00:59] [INFO ] After 1155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 01:00:59] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-11 01:01:00] [INFO ] After 885ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 01:01:00] [INFO ] Deduced a trap composed of 26 places in 266 ms of which 1 ms to minimize.
[2023-03-11 01:01:01] [INFO ] Deduced a trap composed of 26 places in 232 ms of which 0 ms to minimize.
[2023-03-11 01:01:01] [INFO ] Deduced a trap composed of 24 places in 264 ms of which 0 ms to minimize.
[2023-03-11 01:01:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1066 ms
[2023-03-11 01:01:02] [INFO ] Deduced a trap composed of 97 places in 513 ms of which 1 ms to minimize.
[2023-03-11 01:01:02] [INFO ] Deduced a trap composed of 97 places in 431 ms of which 1 ms to minimize.
[2023-03-11 01:01:03] [INFO ] Deduced a trap composed of 58 places in 369 ms of which 1 ms to minimize.
[2023-03-11 01:01:03] [INFO ] Deduced a trap composed of 65 places in 334 ms of which 0 ms to minimize.
[2023-03-11 01:01:04] [INFO ] Deduced a trap composed of 89 places in 421 ms of which 0 ms to minimize.
[2023-03-11 01:01:04] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2556 ms
[2023-03-11 01:01:04] [INFO ] Deduced a trap composed of 17 places in 469 ms of which 1 ms to minimize.
[2023-03-11 01:01:05] [INFO ] Deduced a trap composed of 57 places in 331 ms of which 0 ms to minimize.
[2023-03-11 01:01:05] [INFO ] Deduced a trap composed of 68 places in 459 ms of which 0 ms to minimize.
[2023-03-11 01:01:06] [INFO ] Deduced a trap composed of 13 places in 411 ms of which 0 ms to minimize.
[2023-03-11 01:01:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2105 ms
[2023-03-11 01:01:06] [INFO ] After 7376ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 741 ms.
[2023-03-11 01:01:07] [INFO ] After 9366ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 190 ms.
Support contains 6 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 56 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 270/270 places, 3872/3872 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 56 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
[2023-03-11 01:01:07] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-11 01:01:07] [INFO ] Invariant cache hit.
[2023-03-11 01:01:08] [INFO ] Implicit Places using invariants in 413 ms returned []
[2023-03-11 01:01:08] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-11 01:01:08] [INFO ] Invariant cache hit.
[2023-03-11 01:01:08] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-11 01:01:09] [INFO ] Implicit Places using invariants and state equation in 1580 ms returned []
Implicit Place search using SMT with State Equation took 1995 ms to find 0 implicit places.
[2023-03-11 01:01:09] [INFO ] Redundant transitions in 128 ms returned []
[2023-03-11 01:01:09] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-11 01:01:09] [INFO ] Invariant cache hit.
[2023-03-11 01:01:10] [INFO ] Dead Transitions using invariants and state equation in 900 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3087 ms. Remains : 270/270 places, 3872/3872 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 270 transition count 3699
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 177 place count 268 transition count 3697
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 268 transition count 3696
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 268 transition count 3692
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 264 transition count 3692
Applied a total of 186 rules in 153 ms. Remains 264 /270 variables (removed 6) and now considering 3692/3872 (removed 180) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 3692 rows 264 cols
[2023-03-11 01:01:11] [INFO ] Computed 9 place invariants in 25 ms
[2023-03-11 01:01:11] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-11 01:01:11] [INFO ] After 577ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-11 01:01:11] [INFO ] After 733ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 01:01:11] [INFO ] After 832ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 01:01:11] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-11 01:01:12] [INFO ] After 961ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 01:01:13] [INFO ] After 1681ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 541 ms.
[2023-03-11 01:01:14] [INFO ] After 2320ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 540 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[p0, p0, (AND (NOT p1) p0), p0, true, p0, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 215 ms :[p0, p0, (AND (NOT p1) p0), p0, true, p0, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 222 ms :[p0, p0, (AND (NOT p1) p0), p0, true, p0, (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 22156 reset in 837 ms.
Product exploration explored 100000 steps with 22127 reset in 636 ms.
Applying partial POR strategy [false, false, false, true, true, false, true]
Stuttering acceptance computed with spot in 261 ms :[p0, p0, (AND (NOT p1) p0), p0, true, p0, (AND (NOT p1) p0)]
Support contains 6 out of 275 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 275/275 places, 3877/3877 transitions.
Applied a total of 0 rules in 79 ms. Remains 275 /275 variables (removed 0) and now considering 3877/3877 (removed 0) transitions.
[2023-03-11 01:01:17] [INFO ] Redundant transitions in 136 ms returned []
[2023-03-11 01:01:17] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2023-03-11 01:01:17] [INFO ] Computed 8 place invariants in 24 ms
[2023-03-11 01:01:18] [INFO ] Dead Transitions using invariants and state equation in 1302 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1525 ms. Remains : 275/275 places, 3877/3877 transitions.
Support contains 6 out of 275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 3877/3877 transitions.
Applied a total of 0 rules in 9 ms. Remains 275 /275 variables (removed 0) and now considering 3877/3877 (removed 0) transitions.
[2023-03-11 01:01:18] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-11 01:01:18] [INFO ] Invariant cache hit.
[2023-03-11 01:01:19] [INFO ] Implicit Places using invariants in 334 ms returned []
[2023-03-11 01:01:19] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-11 01:01:19] [INFO ] Invariant cache hit.
[2023-03-11 01:01:19] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-11 01:01:20] [INFO ] Implicit Places using invariants and state equation in 946 ms returned []
Implicit Place search using SMT with State Equation took 1281 ms to find 0 implicit places.
[2023-03-11 01:01:20] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-11 01:01:20] [INFO ] Invariant cache hit.
[2023-03-11 01:01:21] [INFO ] Dead Transitions using invariants and state equation in 1284 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2575 ms. Remains : 275/275 places, 3877/3877 transitions.
Treatment of property BugTracking-PT-q8m002-LTLFireability-10 finished in 83349 ms.
[2023-03-11 01:01:21] [INFO ] Flatten gal took : 139 ms
[2023-03-11 01:01:21] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-11 01:01:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 277 places, 3871 transitions and 19025 arcs took 31 ms.
Total runtime 225123 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT BugTracking-PT-q8m002
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

BK_STOP 1678496502223

--------------------
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/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/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-q8m002-LTLFireability-10
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-q8m002-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 7/32 BugTracking-PT-q8m002-LTLFireability-10 742282 m, 148456 m/sec, 930618 t fired, .

Time elapsed: 5 secs. Pages in use: 7
# 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-q8m002-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 16/32 BugTracking-PT-q8m002-LTLFireability-10 1635641 m, 178671 m/sec, 2050651 t fired, .

Time elapsed: 10 secs. Pages in use: 16
# 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-q8m002-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3600 24/32 BugTracking-PT-q8m002-LTLFireability-10 2531512 m, 179174 m/sec, 3173837 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BugTracking-PT-q8m002-LTLFireability-10: 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-q8m002-LTLFireability-10: 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-q8m002"
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-q8m002, 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-167813692500388"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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