fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r041-tajo-167813694600388
Last Updated
May 14, 2023

About the Execution of LTSMin+red for BugTracking-PT-q8m002

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
997.004 210663.00 278606.00 136.30 FFFFTFTFTF?FTFFF normal

Execution Chart

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

Trace from the execution

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

--------------------
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 1678633101961

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m002
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 14:58:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 14:58:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 14:58:24] [INFO ] Load time of PNML (sax parser for PT used): 716 ms
[2023-03-12 14:58:24] [INFO ] Transformed 754 places.
[2023-03-12 14:58:24] [INFO ] Transformed 27370 transitions.
[2023-03-12 14:58:24] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 934 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 474 places in 132 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 89 ms. Remains 277 /280 variables (removed 3) and now considering 3871/3904 (removed 33) transitions.
[2023-03-12 14:58:25] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2023-03-12 14:58:25] [INFO ] Computed 8 place invariants in 47 ms
[2023-03-12 14:58:25] [INFO ] Implicit Places using invariants in 632 ms returned []
[2023-03-12 14:58:25] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 14:58:25] [INFO ] Invariant cache hit.
[2023-03-12 14:58:26] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-12 14:58:27] [INFO ] Implicit Places using invariants and state equation in 2115 ms returned []
Implicit Place search using SMT with State Equation took 2780 ms to find 0 implicit places.
[2023-03-12 14:58:27] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 14:58:27] [INFO ] Invariant cache hit.
[2023-03-12 14:58:29] [INFO ] Dead Transitions using invariants and state equation in 1304 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 4198 ms. Remains : 277/280 places, 3871/3904 transitions.
Support contains 11 out of 277 places after structural reductions.
[2023-03-12 14:58:29] [INFO ] Flatten gal took : 323 ms
[2023-03-12 14:58:29] [INFO ] Flatten gal took : 202 ms
[2023-03-12 14:58:30] [INFO ] Input system was already deterministic with 3871 transitions.
Incomplete random walk after 10000 steps, including 213 resets, run finished after 418 ms. (steps per millisecond=23 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 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 92 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 109 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 46 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 71794 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 71794 steps, saw 41472 distinct states, run finished after 3002 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-12 14:58:34] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 14:58:34] [INFO ] Invariant cache hit.
[2023-03-12 14:58:34] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 14:58:35] [INFO ] After 805ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:2
[2023-03-12 14:58:35] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-12 14:58:35] [INFO ] After 135ms SMT Verify possible using 282 Read/Feed constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-12 14:58:35] [INFO ] After 1063ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-12 14:58:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 14:58:36] [INFO ] After 901ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-12 14:58:37] [INFO ] After 725ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-12 14:58:37] [INFO ] Deduced a trap composed of 14 places in 308 ms of which 4 ms to minimize.
[2023-03-12 14:58:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 497 ms
[2023-03-12 14:58:38] [INFO ] Deduced a trap composed of 62 places in 341 ms of which 1 ms to minimize.
[2023-03-12 14:58:38] [INFO ] Deduced a trap composed of 32 places in 381 ms of which 2 ms to minimize.
[2023-03-12 14:58:39] [INFO ] Deduced a trap composed of 14 places in 331 ms of which 2 ms to minimize.
[2023-03-12 14:58:39] [INFO ] Deduced a trap composed of 55 places in 369 ms of which 1 ms to minimize.
[2023-03-12 14:58:40] [INFO ] Deduced a trap composed of 60 places in 341 ms of which 1 ms to minimize.
[2023-03-12 14:58:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2306 ms
[2023-03-12 14:58:40] [INFO ] After 4101ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 419 ms.
[2023-03-12 14:58:40] [INFO ] After 5503ms 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 31 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 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 257 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 258 ms. Remains : 270/277 places, 3872/3871 transitions.
Incomplete random walk after 10000 steps, including 260 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 66 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 153 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 79828 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 79828 steps, saw 52421 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 14:58:44] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2023-03-12 14:58:44] [INFO ] Computed 8 place invariants in 24 ms
[2023-03-12 14:58:44] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 14:58:45] [INFO ] After 1050ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-12 14:58:45] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 14:58:46] [INFO ] After 204ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 14:58:46] [INFO ] After 1344ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 14:58:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 14:58:46] [INFO ] After 786ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 14:58:47] [INFO ] After 515ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 14:58:47] [INFO ] Deduced a trap composed of 13 places in 318 ms of which 2 ms to minimize.
[2023-03-12 14:58:48] [INFO ] Deduced a trap composed of 43 places in 336 ms of which 0 ms to minimize.
[2023-03-12 14:58:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 876 ms
[2023-03-12 14:58:48] [INFO ] Deduced a trap composed of 23 places in 443 ms of which 0 ms to minimize.
[2023-03-12 14:58:49] [INFO ] Deduced a trap composed of 56 places in 449 ms of which 1 ms to minimize.
[2023-03-12 14:58:50] [INFO ] Deduced a trap composed of 46 places in 473 ms of which 1 ms to minimize.
[2023-03-12 14:58:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1745 ms
[2023-03-12 14:58:50] [INFO ] Deduced a trap composed of 35 places in 386 ms of which 0 ms to minimize.
[2023-03-12 14:58:51] [INFO ] Deduced a trap composed of 33 places in 358 ms of which 0 ms to minimize.
[2023-03-12 14:58:51] [INFO ] Deduced a trap composed of 57 places in 345 ms of which 0 ms to minimize.
[2023-03-12 14:58:52] [INFO ] Deduced a trap composed of 59 places in 315 ms of which 0 ms to minimize.
[2023-03-12 14:58:52] [INFO ] Deduced a trap composed of 60 places in 363 ms of which 0 ms to minimize.
[2023-03-12 14:58:52] [INFO ] Deduced a trap composed of 61 places in 377 ms of which 2 ms to minimize.
[2023-03-12 14:58:53] [INFO ] Deduced a trap composed of 19 places in 575 ms of which 0 ms to minimize.
[2023-03-12 14:58:54] [INFO ] Deduced a trap composed of 10 places in 382 ms of which 0 ms to minimize.
[2023-03-12 14:58:54] [INFO ] Deduced a trap composed of 59 places in 303 ms of which 0 ms to minimize.
[2023-03-12 14:58:54] [INFO ] Deduced a trap composed of 60 places in 283 ms of which 0 ms to minimize.
[2023-03-12 14:58:54] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4573 ms
[2023-03-12 14:58:54] [INFO ] After 8018ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 344 ms.
[2023-03-12 14:58:55] [INFO ] After 9227ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 51 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 82 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 83 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 66 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
[2023-03-12 14:58:55] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-12 14:58:55] [INFO ] Invariant cache hit.
[2023-03-12 14:58:56] [INFO ] Implicit Places using invariants in 946 ms returned []
[2023-03-12 14:58:56] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-12 14:58:56] [INFO ] Invariant cache hit.
[2023-03-12 14:58:57] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 14:58:58] [INFO ] Implicit Places using invariants and state equation in 1978 ms returned []
Implicit Place search using SMT with State Equation took 2938 ms to find 0 implicit places.
[2023-03-12 14:58:58] [INFO ] Redundant transitions in 336 ms returned []
[2023-03-12 14:58:58] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-12 14:58:58] [INFO ] Invariant cache hit.
[2023-03-12 14:59:00] [INFO ] Dead Transitions using invariants and state equation in 1429 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4788 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 2 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 236 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-12 14:59:00] [INFO ] Computed 9 place invariants in 22 ms
[2023-03-12 14:59:00] [INFO ] [Real]Absence check using 9 positive place invariants in 18 ms returned sat
[2023-03-12 14:59:01] [INFO ] After 656ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2023-03-12 14:59:01] [INFO ] After 1112ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:1
Attempting to minimize the solution found.
Minimization took 122 ms.
[2023-03-12 14:59:01] [INFO ] After 1510ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 14:59:02] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 14:59:02] [INFO ] After 698ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 14:59:03] [INFO ] After 1015ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 155 ms.
[2023-03-12 14:59:03] [INFO ] After 1225ms 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 144 ms. Remains 275 /277 variables (removed 2) and now considering 3877/3871 (removed -6) transitions.
[2023-03-12 14:59:03] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2023-03-12 14:59:03] [INFO ] Computed 8 place invariants in 11 ms
[2023-03-12 14:59:03] [INFO ] Implicit Places using invariants in 436 ms returned []
[2023-03-12 14:59:03] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-12 14:59:03] [INFO ] Invariant cache hit.
[2023-03-12 14:59:04] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 14:59:05] [INFO ] Implicit Places using invariants and state equation in 1922 ms returned []
Implicit Place search using SMT with State Equation took 2360 ms to find 0 implicit places.
[2023-03-12 14:59:06] [INFO ] Redundant transitions in 206 ms returned []
[2023-03-12 14:59:06] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-12 14:59:06] [INFO ] Invariant cache hit.
[2023-03-12 14:59:07] [INFO ] Dead Transitions using invariants and state equation in 1129 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 3864 ms. Remains : 275/277 places, 3877/3871 transitions.
Stuttering acceptance computed with spot in 151 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 2 steps with 0 reset in 2 ms.
FORMULA BugTracking-PT-q8m002-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BugTracking-PT-q8m002-LTLFireability-09 finished in 4116 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 12 ms. Remains 277 /277 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 14:59:07] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2023-03-12 14:59:07] [INFO ] Computed 8 place invariants in 13 ms
[2023-03-12 14:59:07] [INFO ] Implicit Places using invariants in 372 ms returned []
[2023-03-12 14:59:07] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 14:59:07] [INFO ] Invariant cache hit.
[2023-03-12 14:59:08] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-12 14:59:09] [INFO ] Implicit Places using invariants and state equation in 1772 ms returned []
Implicit Place search using SMT with State Equation took 2148 ms to find 0 implicit places.
[2023-03-12 14:59:09] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 14:59:09] [INFO ] Invariant cache hit.
[2023-03-12 14:59:10] [INFO ] Dead Transitions using invariants and state equation in 1013 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3175 ms. Remains : 277/277 places, 3871/3871 transitions.
Stuttering acceptance computed with spot in 279 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 22180 reset in 855 ms.
Product exploration explored 100000 steps with 22289 reset in 779 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 396 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 229 ms :[p0, p0, (AND p0 (NOT p1)), p0, true, p0, (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 226 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 95 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 184 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 78234 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 78234 steps, saw 45175 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-12 14:59:16] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 14:59:16] [INFO ] Invariant cache hit.
[2023-03-12 14:59:16] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-12 14:59:17] [INFO ] After 740ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 14:59:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 14:59:18] [INFO ] After 994ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 14:59:18] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-12 14:59:19] [INFO ] After 876ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 14:59:19] [INFO ] Deduced a trap composed of 30 places in 282 ms of which 1 ms to minimize.
[2023-03-12 14:59:20] [INFO ] Deduced a trap composed of 21 places in 287 ms of which 0 ms to minimize.
[2023-03-12 14:59:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 864 ms
[2023-03-12 14:59:20] [INFO ] Deduced a trap composed of 67 places in 286 ms of which 0 ms to minimize.
[2023-03-12 14:59:21] [INFO ] Deduced a trap composed of 34 places in 253 ms of which 0 ms to minimize.
[2023-03-12 14:59:21] [INFO ] Deduced a trap composed of 69 places in 271 ms of which 0 ms to minimize.
[2023-03-12 14:59:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1210 ms
[2023-03-12 14:59:22] [INFO ] Deduced a trap composed of 26 places in 365 ms of which 0 ms to minimize.
[2023-03-12 14:59:22] [INFO ] Deduced a trap composed of 77 places in 398 ms of which 0 ms to minimize.
[2023-03-12 14:59:23] [INFO ] Deduced a trap composed of 52 places in 374 ms of which 0 ms to minimize.
[2023-03-12 14:59:23] [INFO ] Deduced a trap composed of 11 places in 388 ms of which 1 ms to minimize.
[2023-03-12 14:59:24] [INFO ] Deduced a trap composed of 24 places in 322 ms of which 4 ms to minimize.
[2023-03-12 14:59:24] [INFO ] Deduced a trap composed of 37 places in 306 ms of which 1 ms to minimize.
[2023-03-12 14:59:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2686 ms
[2023-03-12 14:59:25] [INFO ] Deduced a trap composed of 73 places in 327 ms of which 2 ms to minimize.
[2023-03-12 14:59:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 446 ms
[2023-03-12 14:59:25] [INFO ] After 6583ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 464 ms.
[2023-03-12 14:59:25] [INFO ] After 8165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 78 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 2 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 123 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 130 ms. Remains : 270/277 places, 3872/3871 transitions.
Incomplete random walk after 10001 steps, including 222 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 164 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 70 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 273 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 88669 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 88669 steps, saw 58513 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-12 14:59:29] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2023-03-12 14:59:29] [INFO ] Computed 8 place invariants in 11 ms
[2023-03-12 14:59:29] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 14:59:30] [INFO ] After 810ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 14:59:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 14:59:31] [INFO ] After 975ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 14:59:31] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 14:59:32] [INFO ] After 877ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 14:59:33] [INFO ] Deduced a trap composed of 10 places in 351 ms of which 1 ms to minimize.
[2023-03-12 14:59:33] [INFO ] Deduced a trap composed of 83 places in 349 ms of which 2 ms to minimize.
[2023-03-12 14:59:33] [INFO ] Deduced a trap composed of 65 places in 287 ms of which 0 ms to minimize.
[2023-03-12 14:59:34] [INFO ] Deduced a trap composed of 90 places in 341 ms of which 1 ms to minimize.
[2023-03-12 14:59:34] [INFO ] Deduced a trap composed of 63 places in 355 ms of which 0 ms to minimize.
[2023-03-12 14:59:35] [INFO ] Deduced a trap composed of 63 places in 291 ms of which 0 ms to minimize.
[2023-03-12 14:59:35] [INFO ] Deduced a trap composed of 56 places in 302 ms of which 0 ms to minimize.
[2023-03-12 14:59:36] [INFO ] Deduced a trap composed of 66 places in 300 ms of which 1 ms to minimize.
[2023-03-12 14:59:36] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3548 ms
[2023-03-12 14:59:36] [INFO ] Deduced a trap composed of 16 places in 394 ms of which 0 ms to minimize.
[2023-03-12 14:59:37] [INFO ] Deduced a trap composed of 17 places in 337 ms of which 1 ms to minimize.
[2023-03-12 14:59:37] [INFO ] Deduced a trap composed of 23 places in 362 ms of which 0 ms to minimize.
[2023-03-12 14:59:38] [INFO ] Deduced a trap composed of 73 places in 358 ms of which 1 ms to minimize.
[2023-03-12 14:59:38] [INFO ] Deduced a trap composed of 34 places in 445 ms of which 1 ms to minimize.
[2023-03-12 14:59:39] [INFO ] Deduced a trap composed of 10 places in 502 ms of which 1 ms to minimize.
[2023-03-12 14:59:39] [INFO ] Deduced a trap composed of 31 places in 445 ms of which 1 ms to minimize.
[2023-03-12 14:59:39] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3519 ms
[2023-03-12 14:59:40] [INFO ] After 8565ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 582 ms.
[2023-03-12 14:59:40] [INFO ] After 10224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 249 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 49 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 49 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-12 14:59:40] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-12 14:59:40] [INFO ] Invariant cache hit.
[2023-03-12 14:59:41] [INFO ] Implicit Places using invariants in 380 ms returned []
[2023-03-12 14:59:41] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-12 14:59:41] [INFO ] Invariant cache hit.
[2023-03-12 14:59:41] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 14:59:43] [INFO ] Implicit Places using invariants and state equation in 1776 ms returned []
Implicit Place search using SMT with State Equation took 2159 ms to find 0 implicit places.
[2023-03-12 14:59:43] [INFO ] Redundant transitions in 176 ms returned []
[2023-03-12 14:59:43] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-12 14:59:43] [INFO ] Invariant cache hit.
[2023-03-12 14:59:44] [INFO ] Dead Transitions using invariants and state equation in 1196 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3623 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 2 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 224 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-12 14:59:44] [INFO ] Computed 9 place invariants in 12 ms
[2023-03-12 14:59:44] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 14:59:45] [INFO ] After 691ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-12 14:59:45] [INFO ] After 824ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 14:59:45] [INFO ] After 907ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 14:59:45] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 14:59:46] [INFO ] After 905ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 14:59:47] [INFO ] After 1499ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 431 ms.
[2023-03-12 14:59:47] [INFO ] After 2010ms 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 453 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 231 ms :[p0, p0, (AND p0 (NOT p1)), p0, true, p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 344 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 25 ms. Remains 277 /277 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 14:59:48] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2023-03-12 14:59:48] [INFO ] Computed 8 place invariants in 10 ms
[2023-03-12 14:59:49] [INFO ] Implicit Places using invariants in 443 ms returned []
[2023-03-12 14:59:49] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 14:59:49] [INFO ] Invariant cache hit.
[2023-03-12 14:59:49] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-12 14:59:51] [INFO ] Implicit Places using invariants and state equation in 1745 ms returned []
Implicit Place search using SMT with State Equation took 2204 ms to find 0 implicit places.
[2023-03-12 14:59:51] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 14:59:51] [INFO ] Invariant cache hit.
[2023-03-12 14:59:52] [INFO ] Dead Transitions using invariants and state equation in 1182 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3412 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 324 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 173 ms :[p0, p0, (AND (NOT p1) p0), p0, true, p0, (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 219 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 83 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 86 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 196 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 76783 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 76783 steps, saw 44343 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-12 14:59:56] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 14:59:56] [INFO ] Invariant cache hit.
[2023-03-12 14:59:56] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 14:59:57] [INFO ] After 774ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 14:59:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 14:59:58] [INFO ] After 1020ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 14:59:58] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-12 14:59:59] [INFO ] After 964ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 14:59:59] [INFO ] Deduced a trap composed of 9 places in 353 ms of which 1 ms to minimize.
[2023-03-12 15:00:00] [INFO ] Deduced a trap composed of 28 places in 245 ms of which 24 ms to minimize.
[2023-03-12 15:00:00] [INFO ] Deduced a trap composed of 24 places in 253 ms of which 0 ms to minimize.
[2023-03-12 15:00:00] [INFO ] Deduced a trap composed of 35 places in 310 ms of which 1 ms to minimize.
[2023-03-12 15:00:01] [INFO ] Deduced a trap composed of 24 places in 303 ms of which 0 ms to minimize.
[2023-03-12 15:00:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2042 ms
[2023-03-12 15:00:01] [INFO ] Deduced a trap composed of 21 places in 167 ms of which 0 ms to minimize.
[2023-03-12 15:00:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 358 ms
[2023-03-12 15:00:02] [INFO ] After 4222ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 766 ms.
[2023-03-12 15:00:03] [INFO ] After 6122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 77 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 165 ms. Remains : 270/277 places, 3872/3871 transitions.
Incomplete random walk after 10000 steps, including 275 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 157 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 77 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 165 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 289 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 89318 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 89318 steps, saw 58971 distinct states, run finished after 3003 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-12 15:00:07] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2023-03-12 15:00:07] [INFO ] Computed 8 place invariants in 23 ms
[2023-03-12 15:00:07] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 15:00:07] [INFO ] After 785ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 15:00:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:00:09] [INFO ] After 1158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 15:00:09] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:00:10] [INFO ] After 853ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 15:00:10] [INFO ] Deduced a trap composed of 26 places in 305 ms of which 1 ms to minimize.
[2023-03-12 15:00:10] [INFO ] Deduced a trap composed of 26 places in 298 ms of which 2 ms to minimize.
[2023-03-12 15:00:11] [INFO ] Deduced a trap composed of 24 places in 272 ms of which 5 ms to minimize.
[2023-03-12 15:00:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1209 ms
[2023-03-12 15:00:11] [INFO ] Deduced a trap composed of 97 places in 390 ms of which 0 ms to minimize.
[2023-03-12 15:00:12] [INFO ] Deduced a trap composed of 97 places in 508 ms of which 4 ms to minimize.
[2023-03-12 15:00:13] [INFO ] Deduced a trap composed of 58 places in 525 ms of which 6 ms to minimize.
[2023-03-12 15:00:13] [INFO ] Deduced a trap composed of 65 places in 518 ms of which 2 ms to minimize.
[2023-03-12 15:00:14] [INFO ] Deduced a trap composed of 89 places in 486 ms of which 1 ms to minimize.
[2023-03-12 15:00:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2974 ms
[2023-03-12 15:00:15] [INFO ] Deduced a trap composed of 17 places in 558 ms of which 0 ms to minimize.
[2023-03-12 15:00:15] [INFO ] Deduced a trap composed of 57 places in 374 ms of which 0 ms to minimize.
[2023-03-12 15:00:16] [INFO ] Deduced a trap composed of 68 places in 386 ms of which 0 ms to minimize.
[2023-03-12 15:00:16] [INFO ] Deduced a trap composed of 13 places in 371 ms of which 1 ms to minimize.
[2023-03-12 15:00:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2062 ms
[2023-03-12 15:00:16] [INFO ] After 7679ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 522 ms.
[2023-03-12 15:00:17] [INFO ] After 9443ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 145 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 66 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 78 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 63 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
[2023-03-12 15:00:17] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-12 15:00:17] [INFO ] Invariant cache hit.
[2023-03-12 15:00:18] [INFO ] Implicit Places using invariants in 437 ms returned []
[2023-03-12 15:00:18] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-12 15:00:18] [INFO ] Invariant cache hit.
[2023-03-12 15:00:18] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:00:19] [INFO ] Implicit Places using invariants and state equation in 1599 ms returned []
Implicit Place search using SMT with State Equation took 2057 ms to find 0 implicit places.
[2023-03-12 15:00:19] [INFO ] Redundant transitions in 123 ms returned []
[2023-03-12 15:00:19] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-12 15:00:19] [INFO ] Invariant cache hit.
[2023-03-12 15:00:21] [INFO ] Dead Transitions using invariants and state equation in 1321 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3597 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 2 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 190 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-12 15:00:21] [INFO ] Computed 9 place invariants in 32 ms
[2023-03-12 15:00:21] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 15:00:22] [INFO ] After 623ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-12 15:00:22] [INFO ] After 731ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 15:00:22] [INFO ] After 850ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 15:00:22] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 15:00:23] [INFO ] After 799ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 15:00:23] [INFO ] After 1276ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 323 ms.
[2023-03-12 15:00:23] [INFO ] After 1679ms 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 361 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 280 ms :[p0, p0, (AND (NOT p1) p0), p0, true, p0, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 188 ms :[p0, p0, (AND (NOT p1) p0), p0, true, p0, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 200 ms :[p0, p0, (AND (NOT p1) p0), p0, true, p0, (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 22222 reset in 704 ms.
Product exploration explored 100000 steps with 22188 reset in 708 ms.
Applying partial POR strategy [false, false, false, true, true, false, true]
Stuttering acceptance computed with spot in 173 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 3 ms
Applied a total of 2 rules in 77 ms. Remains 277 /277 variables (removed 0) and now considering 3881/3871 (removed -10) transitions.
[2023-03-12 15:00:27] [INFO ] Redundant transitions in 125 ms returned []
[2023-03-12 15:00:27] [INFO ] Flow matrix only has 3709 transitions (discarded 172 similar events)
// Phase 1: matrix 3709 rows 277 cols
[2023-03-12 15:00:27] [INFO ] Computed 8 place invariants in 11 ms
[2023-03-12 15:00:28] [INFO ] Dead Transitions using invariants and state equation in 1508 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 1759 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 25 ms. Remains 277 /277 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 15:00:28] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2023-03-12 15:00:28] [INFO ] Computed 8 place invariants in 18 ms
[2023-03-12 15:00:29] [INFO ] Implicit Places using invariants in 518 ms returned []
[2023-03-12 15:00:29] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 15:00:29] [INFO ] Invariant cache hit.
[2023-03-12 15:00:29] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-12 15:00:30] [INFO ] Implicit Places using invariants and state equation in 1663 ms returned []
Implicit Place search using SMT with State Equation took 2196 ms to find 0 implicit places.
[2023-03-12 15:00:30] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 15:00:30] [INFO ] Invariant cache hit.
[2023-03-12 15:00:31] [INFO ] Dead Transitions using invariants and state equation in 1089 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3324 ms. Remains : 277/277 places, 3871/3871 transitions.
Treatment of property BugTracking-PT-q8m002-LTLFireability-10 finished in 84879 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 317 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 2 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 46 ms. Remains 275 /277 variables (removed 2) and now considering 3877/3871 (removed -6) transitions.
[2023-03-12 15:00:32] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2023-03-12 15:00:32] [INFO ] Computed 8 place invariants in 10 ms
[2023-03-12 15:00:33] [INFO ] Implicit Places using invariants in 459 ms returned []
[2023-03-12 15:00:33] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-12 15:00:33] [INFO ] Invariant cache hit.
[2023-03-12 15:00:33] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:00:35] [INFO ] Implicit Places using invariants and state equation in 1825 ms returned []
Implicit Place search using SMT with State Equation took 2314 ms to find 0 implicit places.
[2023-03-12 15:00:35] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-12 15:00:35] [INFO ] Invariant cache hit.
[2023-03-12 15:00:36] [INFO ] Dead Transitions using invariants and state equation in 1097 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 3479 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 22144 reset in 714 ms.
Product exploration explored 100000 steps with 22250 reset in 739 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 534 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 191 ms :[p0, p0, (AND p0 (NOT p1)), p0, true, p0, (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 209 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 199 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 68515 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68515 steps, saw 39589 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-12 15:00:42] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-12 15:00:42] [INFO ] Invariant cache hit.
[2023-03-12 15:00:42] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:00:42] [INFO ] After 675ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 15:00:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:00:43] [INFO ] After 812ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 15:00:43] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:00:44] [INFO ] After 857ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 15:00:45] [INFO ] Deduced a trap composed of 14 places in 439 ms of which 0 ms to minimize.
[2023-03-12 15:00:45] [INFO ] Deduced a trap composed of 48 places in 416 ms of which 0 ms to minimize.
[2023-03-12 15:00:46] [INFO ] Deduced a trap composed of 57 places in 414 ms of which 1 ms to minimize.
[2023-03-12 15:00:46] [INFO ] Deduced a trap composed of 10 places in 418 ms of which 1 ms to minimize.
[2023-03-12 15:00:47] [INFO ] Deduced a trap composed of 9 places in 306 ms of which 0 ms to minimize.
[2023-03-12 15:00:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2420 ms
[2023-03-12 15:00:47] [INFO ] After 3832ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 350 ms.
[2023-03-12 15:00:48] [INFO ] After 5078ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 199 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 136 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 137 ms. Remains : 270/275 places, 3872/3877 transitions.
Incomplete random walk after 10000 steps, including 235 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 176 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 166 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 263 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 96433 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 96433 steps, saw 63993 distinct states, run finished after 3002 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-12 15:00:52] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2023-03-12 15:00:52] [INFO ] Computed 8 place invariants in 10 ms
[2023-03-12 15:00:52] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:00:52] [INFO ] After 683ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 15:00:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:00:53] [INFO ] After 837ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 15:00:53] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:00:54] [INFO ] After 798ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 15:00:55] [INFO ] Deduced a trap composed of 10 places in 277 ms of which 1 ms to minimize.
[2023-03-12 15:00:55] [INFO ] Deduced a trap composed of 83 places in 298 ms of which 0 ms to minimize.
[2023-03-12 15:00:55] [INFO ] Deduced a trap composed of 65 places in 295 ms of which 0 ms to minimize.
[2023-03-12 15:00:56] [INFO ] Deduced a trap composed of 90 places in 313 ms of which 0 ms to minimize.
[2023-03-12 15:00:56] [INFO ] Deduced a trap composed of 63 places in 329 ms of which 0 ms to minimize.
[2023-03-12 15:00:57] [INFO ] Deduced a trap composed of 63 places in 301 ms of which 0 ms to minimize.
[2023-03-12 15:00:57] [INFO ] Deduced a trap composed of 56 places in 406 ms of which 1 ms to minimize.
[2023-03-12 15:00:58] [INFO ] Deduced a trap composed of 66 places in 450 ms of which 0 ms to minimize.
[2023-03-12 15:00:58] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3548 ms
[2023-03-12 15:00:59] [INFO ] Deduced a trap composed of 16 places in 563 ms of which 1 ms to minimize.
[2023-03-12 15:00:59] [INFO ] Deduced a trap composed of 17 places in 481 ms of which 0 ms to minimize.
[2023-03-12 15:01:00] [INFO ] Deduced a trap composed of 23 places in 469 ms of which 0 ms to minimize.
[2023-03-12 15:01:01] [INFO ] Deduced a trap composed of 73 places in 407 ms of which 0 ms to minimize.
[2023-03-12 15:01:01] [INFO ] Deduced a trap composed of 34 places in 415 ms of which 0 ms to minimize.
[2023-03-12 15:01:02] [INFO ] Deduced a trap composed of 10 places in 508 ms of which 0 ms to minimize.
[2023-03-12 15:01:02] [INFO ] Deduced a trap composed of 31 places in 458 ms of which 0 ms to minimize.
[2023-03-12 15:01:02] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4030 ms
[2023-03-12 15:01:02] [INFO ] After 9045ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 612 ms.
[2023-03-12 15:01:03] [INFO ] After 10564ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 290 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 57 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 57 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 57 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
[2023-03-12 15:01:03] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-12 15:01:03] [INFO ] Invariant cache hit.
[2023-03-12 15:01:04] [INFO ] Implicit Places using invariants in 456 ms returned []
[2023-03-12 15:01:04] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-12 15:01:04] [INFO ] Invariant cache hit.
[2023-03-12 15:01:04] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:01:06] [INFO ] Implicit Places using invariants and state equation in 1807 ms returned []
Implicit Place search using SMT with State Equation took 2264 ms to find 0 implicit places.
[2023-03-12 15:01:06] [INFO ] Redundant transitions in 123 ms returned []
[2023-03-12 15:01:06] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-12 15:01:06] [INFO ] Invariant cache hit.
[2023-03-12 15:01:07] [INFO ] Dead Transitions using invariants and state equation in 1202 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3675 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 172 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-12 15:01:07] [INFO ] Computed 9 place invariants in 12 ms
[2023-03-12 15:01:07] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 15:01:08] [INFO ] After 600ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-12 15:01:08] [INFO ] After 768ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 15:01:08] [INFO ] After 876ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 15:01:08] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 15:01:09] [INFO ] After 832ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 15:01:09] [INFO ] After 1286ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 349 ms.
[2023-03-12 15:01:10] [INFO ] After 1732ms 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 334 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 172 ms :[p0, p0, (AND p0 (NOT p1)), p0, true, p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 194 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 10 ms. Remains 275 /275 variables (removed 0) and now considering 3877/3877 (removed 0) transitions.
[2023-03-12 15:01:11] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2023-03-12 15:01:11] [INFO ] Computed 8 place invariants in 9 ms
[2023-03-12 15:01:11] [INFO ] Implicit Places using invariants in 343 ms returned []
[2023-03-12 15:01:11] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-12 15:01:11] [INFO ] Invariant cache hit.
[2023-03-12 15:01:11] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:01:13] [INFO ] Implicit Places using invariants and state equation in 1775 ms returned []
Implicit Place search using SMT with State Equation took 2175 ms to find 0 implicit places.
[2023-03-12 15:01:13] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-12 15:01:13] [INFO ] Invariant cache hit.
[2023-03-12 15:01:14] [INFO ] Dead Transitions using invariants and state equation in 1245 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3432 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 443 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 225 ms :[p0, p0, (AND (NOT p1) p0), p0, true, p0, (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 179 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 191 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 78655 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 78655 steps, saw 45416 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-12 15:01:18] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-12 15:01:18] [INFO ] Invariant cache hit.
[2023-03-12 15:01:18] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:01:19] [INFO ] After 803ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 15:01:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:01:20] [INFO ] After 983ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 15:01:20] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:01:21] [INFO ] After 795ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 15:01:22] [INFO ] Deduced a trap composed of 26 places in 390 ms of which 0 ms to minimize.
[2023-03-12 15:01:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 588 ms
[2023-03-12 15:01:23] [INFO ] Deduced a trap composed of 16 places in 227 ms of which 0 ms to minimize.
[2023-03-12 15:01:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 431 ms
[2023-03-12 15:01:23] [INFO ] After 2981ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 706 ms.
[2023-03-12 15:01:24] [INFO ] After 4761ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 350 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 102 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 102 ms. Remains : 270/275 places, 3872/3877 transitions.
Incomplete random walk after 10000 steps, including 253 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 158 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 172 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 299 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 84584 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 84584 steps, saw 55629 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-12 15:01:28] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2023-03-12 15:01:28] [INFO ] Computed 8 place invariants in 9 ms
[2023-03-12 15:01:28] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-12 15:01:29] [INFO ] After 719ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 15:01:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:01:29] [INFO ] After 867ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 15:01:30] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:01:30] [INFO ] After 662ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 15:01:31] [INFO ] Deduced a trap composed of 26 places in 236 ms of which 0 ms to minimize.
[2023-03-12 15:01:31] [INFO ] Deduced a trap composed of 26 places in 203 ms of which 0 ms to minimize.
[2023-03-12 15:01:31] [INFO ] Deduced a trap composed of 24 places in 250 ms of which 1 ms to minimize.
[2023-03-12 15:01:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 936 ms
[2023-03-12 15:01:32] [INFO ] Deduced a trap composed of 97 places in 392 ms of which 0 ms to minimize.
[2023-03-12 15:01:32] [INFO ] Deduced a trap composed of 97 places in 390 ms of which 1 ms to minimize.
[2023-03-12 15:01:33] [INFO ] Deduced a trap composed of 58 places in 354 ms of which 0 ms to minimize.
[2023-03-12 15:01:33] [INFO ] Deduced a trap composed of 65 places in 378 ms of which 1 ms to minimize.
[2023-03-12 15:01:34] [INFO ] Deduced a trap composed of 89 places in 393 ms of which 1 ms to minimize.
[2023-03-12 15:01:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2366 ms
[2023-03-12 15:01:34] [INFO ] Deduced a trap composed of 17 places in 402 ms of which 1 ms to minimize.
[2023-03-12 15:01:35] [INFO ] Deduced a trap composed of 57 places in 302 ms of which 0 ms to minimize.
[2023-03-12 15:01:35] [INFO ] Deduced a trap composed of 68 places in 348 ms of which 0 ms to minimize.
[2023-03-12 15:01:35] [INFO ] Deduced a trap composed of 13 places in 361 ms of which 0 ms to minimize.
[2023-03-12 15:01:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1746 ms
[2023-03-12 15:01:36] [INFO ] After 6195ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 491 ms.
[2023-03-12 15:01:36] [INFO ] After 7656ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 218 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 46 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 46 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 50 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
[2023-03-12 15:01:37] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-12 15:01:37] [INFO ] Invariant cache hit.
[2023-03-12 15:01:37] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-03-12 15:01:37] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-12 15:01:37] [INFO ] Invariant cache hit.
[2023-03-12 15:01:37] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:01:38] [INFO ] Implicit Places using invariants and state equation in 1502 ms returned []
Implicit Place search using SMT with State Equation took 1845 ms to find 0 implicit places.
[2023-03-12 15:01:38] [INFO ] Redundant transitions in 123 ms returned []
[2023-03-12 15:01:38] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-12 15:01:39] [INFO ] Invariant cache hit.
[2023-03-12 15:01:40] [INFO ] Dead Transitions using invariants and state equation in 1144 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3182 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 177 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-12 15:01:40] [INFO ] Computed 9 place invariants in 11 ms
[2023-03-12 15:01:40] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 15:01:41] [INFO ] After 565ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-12 15:01:41] [INFO ] After 669ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 15:01:41] [INFO ] After 772ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 15:01:41] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-12 15:01:42] [INFO ] After 777ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 15:01:42] [INFO ] After 1298ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 312 ms.
[2023-03-12 15:01:42] [INFO ] After 1696ms 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 399 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 288 ms :[p0, p0, (AND (NOT p1) p0), p0, true, p0, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 230 ms :[p0, p0, (AND (NOT p1) p0), p0, true, p0, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 227 ms :[p0, p0, (AND (NOT p1) p0), p0, true, p0, (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 22233 reset in 853 ms.
Product exploration explored 100000 steps with 22190 reset in 716 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 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 46 ms. Remains 275 /275 variables (removed 0) and now considering 3877/3877 (removed 0) transitions.
[2023-03-12 15:01:46] [INFO ] Redundant transitions in 124 ms returned []
[2023-03-12 15:01:46] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2023-03-12 15:01:46] [INFO ] Computed 8 place invariants in 9 ms
[2023-03-12 15:01:47] [INFO ] Dead Transitions using invariants and state equation in 1304 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1487 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 10 ms. Remains 275 /275 variables (removed 0) and now considering 3877/3877 (removed 0) transitions.
[2023-03-12 15:01:47] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-12 15:01:47] [INFO ] Invariant cache hit.
[2023-03-12 15:01:47] [INFO ] Implicit Places using invariants in 362 ms returned []
[2023-03-12 15:01:47] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-12 15:01:47] [INFO ] Invariant cache hit.
[2023-03-12 15:01:48] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:01:49] [INFO ] Implicit Places using invariants and state equation in 1750 ms returned []
Implicit Place search using SMT with State Equation took 2129 ms to find 0 implicit places.
[2023-03-12 15:01:49] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-12 15:01:49] [INFO ] Invariant cache hit.
[2023-03-12 15:01:50] [INFO ] Dead Transitions using invariants and state equation in 1078 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3230 ms. Remains : 275/275 places, 3877/3877 transitions.
Treatment of property BugTracking-PT-q8m002-LTLFireability-10 finished in 78609 ms.
[2023-03-12 15:01:51] [INFO ] Flatten gal took : 216 ms
[2023-03-12 15:01:51] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-12 15:01:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 277 places, 3871 transitions and 19025 arcs took 32 ms.
Total runtime 207532 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1791/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BugTracking-PT-q8m002-LTLFireability-10

BK_STOP 1678633312624

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name BugTracking-PT-q8m002-LTLFireability-10
ltl formula formula --ltl=/tmp/1791/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 277 places, 3871 transitions and 19025 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.780 real 0.210 user 0.170 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1791/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1791/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1791/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1791/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is BugTracking-PT-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 r041-tajo-167813694600388"
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 ;