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.r423-tajo-167905976800492.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is SieveSingleMsgMbox-PT-d2m96, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r423-tajo-167905976800492
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 8.3K Feb 26 10:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 10:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 10:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 10:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 10:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 10:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Feb 26 10:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Feb 26 10:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.1M Mar 5 18:23 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 SieveSingleMsgMbox-PT-d2m96-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679249949790

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m96
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 18:19:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 18:19:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 18:19:11] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2023-03-19 18:19:11] [INFO ] Transformed 2398 places.
[2023-03-19 18:19:11] [INFO ] Transformed 1954 transitions.
[2023-03-19 18:19:11] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 1984 places in 13 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 853 rules applied. Total rules applied 853 place count 389 transition count 1126
Discarding 99 places :
Symmetric choice reduction at 1 with 99 rule applications. Total rules 952 place count 290 transition count 692
Iterating global reduction 1 with 99 rules applied. Total rules applied 1051 place count 290 transition count 692
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1061 place count 290 transition count 682
Discarding 73 places :
Symmetric choice reduction at 2 with 73 rule applications. Total rules 1134 place count 217 transition count 609
Iterating global reduction 2 with 73 rules applied. Total rules applied 1207 place count 217 transition count 609
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 1241 place count 217 transition count 575
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 1267 place count 191 transition count 545
Iterating global reduction 3 with 26 rules applied. Total rules applied 1293 place count 191 transition count 545
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 3 with 86 rules applied. Total rules applied 1379 place count 191 transition count 459
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1385 place count 185 transition count 449
Iterating global reduction 4 with 6 rules applied. Total rules applied 1391 place count 185 transition count 449
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1397 place count 179 transition count 443
Iterating global reduction 4 with 6 rules applied. Total rules applied 1403 place count 179 transition count 443
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1406 place count 176 transition count 439
Iterating global reduction 4 with 3 rules applied. Total rules applied 1409 place count 176 transition count 439
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1410 place count 175 transition count 438
Iterating global reduction 4 with 1 rules applied. Total rules applied 1411 place count 175 transition count 438
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1412 place count 174 transition count 437
Iterating global reduction 4 with 1 rules applied. Total rules applied 1413 place count 174 transition count 437
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1414 place count 173 transition count 436
Iterating global reduction 4 with 1 rules applied. Total rules applied 1415 place count 173 transition count 436
Applied a total of 1415 rules in 91 ms. Remains 173 /414 variables (removed 241) and now considering 436/1954 (removed 1518) transitions.
// Phase 1: matrix 436 rows 173 cols
[2023-03-19 18:19:11] [INFO ] Computed 5 place invariants in 18 ms
[2023-03-19 18:19:12] [INFO ] Implicit Places using invariants in 240 ms returned []
[2023-03-19 18:19:12] [INFO ] Invariant cache hit.
[2023-03-19 18:19:12] [INFO ] State equation strengthened by 302 read => feed constraints.
[2023-03-19 18:19:12] [INFO ] Implicit Places using invariants and state equation in 696 ms returned []
Implicit Place search using SMT with State Equation took 962 ms to find 0 implicit places.
[2023-03-19 18:19:12] [INFO ] Invariant cache hit.
[2023-03-19 18:19:13] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 173/414 places, 436/1954 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1268 ms. Remains : 173/414 places, 436/1954 transitions.
Support contains 24 out of 173 places after structural reductions.
[2023-03-19 18:19:13] [INFO ] Flatten gal took : 68 ms
[2023-03-19 18:19:13] [INFO ] Flatten gal took : 31 ms
[2023-03-19 18:19:13] [INFO ] Input system was already deterministic with 436 transitions.
Incomplete random walk after 10000 steps, including 2253 resets, run finished after 736 ms. (steps per millisecond=13 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 40 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 38 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 109 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Interrupted probabilistic random walk after 254457 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{0=1, 1=1, 6=1, 7=1, 11=1, 14=1, 15=1, 16=1, 17=1, 21=1, 24=1}
Probabilistic random walk after 254457 steps, saw 115285 distinct states, run finished after 3004 ms. (steps per millisecond=84 ) properties seen :11
Running SMT prover for 14 properties.
[2023-03-19 18:19:17] [INFO ] Invariant cache hit.
[2023-03-19 18:19:17] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 18:19:17] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 6 ms returned sat
[2023-03-19 18:19:18] [INFO ] After 595ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:11
[2023-03-19 18:19:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 18:19:18] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 18:19:18] [INFO ] After 390ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :11
[2023-03-19 18:19:18] [INFO ] State equation strengthened by 302 read => feed constraints.
[2023-03-19 18:19:19] [INFO ] After 630ms SMT Verify possible using 302 Read/Feed constraints in natural domain returned unsat :3 sat :11
[2023-03-19 18:19:20] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 7 ms to minimize.
[2023-03-19 18:19:20] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 1 ms to minimize.
[2023-03-19 18:19:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 177 ms
[2023-03-19 18:19:20] [INFO ] After 1717ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :11
Attempting to minimize the solution found.
Minimization took 649 ms.
[2023-03-19 18:19:21] [INFO ] After 2881ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :11
Fused 14 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 304 ms.
Support contains 10 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 436/436 transitions.
Graph (complete) has 705 edges and 173 vertex of which 172 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 172 transition count 434
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 15 place count 160 transition count 300
Iterating global reduction 1 with 12 rules applied. Total rules applied 27 place count 160 transition count 300
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 39 place count 148 transition count 288
Iterating global reduction 1 with 12 rules applied. Total rules applied 51 place count 148 transition count 288
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 58 place count 148 transition count 281
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 66 place count 140 transition count 267
Iterating global reduction 2 with 8 rules applied. Total rules applied 74 place count 140 transition count 267
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 79 place count 140 transition count 262
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 82 place count 137 transition count 259
Iterating global reduction 3 with 3 rules applied. Total rules applied 85 place count 137 transition count 259
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 88 place count 134 transition count 256
Iterating global reduction 3 with 3 rules applied. Total rules applied 91 place count 134 transition count 256
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 92 place count 133 transition count 255
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 133 transition count 255
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 102 place count 133 transition count 246
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 103 place count 132 transition count 245
Iterating global reduction 4 with 1 rules applied. Total rules applied 104 place count 132 transition count 245
Applied a total of 104 rules in 73 ms. Remains 132 /173 variables (removed 41) and now considering 245/436 (removed 191) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 132/173 places, 245/436 transitions.
Incomplete random walk after 10000 steps, including 2256 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 496 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 514 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 472 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 423 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 440 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 463 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 490 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 479 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 471 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 453 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 456 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 296614 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 296614 steps, saw 128240 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 245 rows 132 cols
[2023-03-19 18:19:25] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-19 18:19:25] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 18:19:25] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 18:19:25] [INFO ] After 310ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-19 18:19:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 18:19:25] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 18:19:26] [INFO ] After 341ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-19 18:19:26] [INFO ] State equation strengthened by 148 read => feed constraints.
[2023-03-19 18:19:27] [INFO ] After 825ms SMT Verify possible using 148 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-19 18:19:27] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 4 ms to minimize.
[2023-03-19 18:19:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2023-03-19 18:19:28] [INFO ] After 1928ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 841 ms.
[2023-03-19 18:19:29] [INFO ] After 3199ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 381 ms.
Support contains 10 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 245/245 transitions.
Applied a total of 0 rules in 15 ms. Remains 132 /132 variables (removed 0) and now considering 245/245 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 132/132 places, 245/245 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 245/245 transitions.
Applied a total of 0 rules in 13 ms. Remains 132 /132 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2023-03-19 18:19:29] [INFO ] Invariant cache hit.
[2023-03-19 18:19:29] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-19 18:19:29] [INFO ] Invariant cache hit.
[2023-03-19 18:19:29] [INFO ] State equation strengthened by 148 read => feed constraints.
[2023-03-19 18:19:29] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
[2023-03-19 18:19:29] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-19 18:19:29] [INFO ] Invariant cache hit.
[2023-03-19 18:19:30] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 608 ms. Remains : 132/132 places, 245/245 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 132 transition count 238
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 126 transition count 238
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 13 place count 126 transition count 221
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 47 place count 109 transition count 221
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 65 place count 100 transition count 212
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 99 transition count 221
Applied a total of 67 rules in 16 ms. Remains 99 /132 variables (removed 33) and now considering 221/245 (removed 24) transitions.
Running SMT prover for 11 properties.
// Phase 1: matrix 221 rows 99 cols
[2023-03-19 18:19:30] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-19 18:19:30] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-19 18:19:30] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 18:19:30] [INFO ] After 261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-19 18:19:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 18:19:30] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 18:19:30] [INFO ] After 296ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-19 18:19:30] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2023-03-19 18:19:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-19 18:19:30] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2023-03-19 18:19:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-03-19 18:19:31] [INFO ] After 820ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 284 ms.
[2023-03-19 18:19:31] [INFO ] After 1170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 34 stabilizing places and 59 stable transitions
Graph (complete) has 768 edges and 173 vertex of which 172 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||G(p1)))&&F(p2)))'
Support contains 4 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 436/436 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 155 transition count 224
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 155 transition count 224
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 54 place count 137 transition count 206
Iterating global reduction 0 with 18 rules applied. Total rules applied 72 place count 137 transition count 206
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 80 place count 137 transition count 198
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 91 place count 126 transition count 178
Iterating global reduction 1 with 11 rules applied. Total rules applied 102 place count 126 transition count 178
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 109 place count 126 transition count 171
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 112 place count 123 transition count 168
Iterating global reduction 2 with 3 rules applied. Total rules applied 115 place count 123 transition count 168
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 118 place count 120 transition count 165
Iterating global reduction 2 with 3 rules applied. Total rules applied 121 place count 120 transition count 165
Applied a total of 121 rules in 30 ms. Remains 120 /173 variables (removed 53) and now considering 165/436 (removed 271) transitions.
// Phase 1: matrix 165 rows 120 cols
[2023-03-19 18:19:31] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-19 18:19:31] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-19 18:19:31] [INFO ] Invariant cache hit.
[2023-03-19 18:19:32] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-19 18:19:32] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2023-03-19 18:19:32] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-19 18:19:32] [INFO ] Invariant cache hit.
[2023-03-19 18:19:32] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/173 places, 165/436 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 563 ms. Remains : 120/173 places, 165/436 transitions.
Stuttering acceptance computed with spot in 312 ms :[true, (OR (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=4 dest: 2}, { cond=(AND p0 p2), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=4, aps=[p1:(OR (LT s1 1) (LT s114 1)), p2:(AND (GEQ s1 1) (GEQ s62 1)), p0:(AND (GEQ s1 1) (GEQ s115 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 3 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-02 finished in 948 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)||X(p2)) U (p3 U X(p0)))))'
Support contains 5 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 436/436 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 156 transition count 248
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 156 transition count 248
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 51 place count 139 transition count 231
Iterating global reduction 0 with 17 rules applied. Total rules applied 68 place count 139 transition count 231
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 78 place count 139 transition count 221
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 88 place count 129 transition count 204
Iterating global reduction 1 with 10 rules applied. Total rules applied 98 place count 129 transition count 204
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 104 place count 129 transition count 198
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 107 place count 126 transition count 195
Iterating global reduction 2 with 3 rules applied. Total rules applied 110 place count 126 transition count 195
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 113 place count 123 transition count 192
Iterating global reduction 2 with 3 rules applied. Total rules applied 116 place count 123 transition count 192
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 117 place count 122 transition count 189
Iterating global reduction 2 with 1 rules applied. Total rules applied 118 place count 122 transition count 189
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 119 place count 121 transition count 188
Iterating global reduction 2 with 1 rules applied. Total rules applied 120 place count 121 transition count 188
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 121 place count 120 transition count 187
Iterating global reduction 2 with 1 rules applied. Total rules applied 122 place count 120 transition count 187
Applied a total of 122 rules in 24 ms. Remains 120 /173 variables (removed 53) and now considering 187/436 (removed 249) transitions.
// Phase 1: matrix 187 rows 120 cols
[2023-03-19 18:19:32] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-19 18:19:32] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-19 18:19:32] [INFO ] Invariant cache hit.
[2023-03-19 18:19:32] [INFO ] State equation strengthened by 104 read => feed constraints.
[2023-03-19 18:19:33] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
[2023-03-19 18:19:33] [INFO ] Invariant cache hit.
[2023-03-19 18:19:33] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 120/173 places, 187/436 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 597 ms. Remains : 120/173 places, 187/436 transitions.
Stuttering acceptance computed with spot in 543 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 5}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 6}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=0 dest: 7}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 3}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=1 dest: 5}, { cond=(AND p3 (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 6}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p3 (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 5}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0) p2), acceptance={0} source=6 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=6 dest: 5}, { cond=(AND p3 (NOT p1) (NOT p0) p2), acceptance={0} source=6 dest: 6}, { cond=(AND p3 (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 8}, { cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 9}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0) p2), acceptance={} source=7 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND p3 (NOT p1) (NOT p0) p2), acceptance={} source=7 dest: 6}, { cond=(AND p3 (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=7 dest: 9}], [{ cond=(AND p3 (NOT p0)), acceptance={0} source=8 dest: 8}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=8 dest: 9}], [{ cond=(NOT p0), acceptance={} source=9 dest: 3}]], initial=4, aps=[p3:(AND (GEQ s1 1) (GEQ s114 1)), p1:(AND (GEQ s1 1) (GEQ s113 1)), p0:(AND (GEQ s1 1) (GEQ s112 1)), p2:(AND (GEQ s1 1) (GEQ s115 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-06 finished in 1179 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(X(F(p0))))'
Support contains 2 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 436/436 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 209
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 209
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 60 place count 133 transition count 189
Iterating global reduction 0 with 20 rules applied. Total rules applied 80 place count 133 transition count 189
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 89 place count 133 transition count 180
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 102 place count 120 transition count 157
Iterating global reduction 1 with 13 rules applied. Total rules applied 115 place count 120 transition count 157
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 124 place count 120 transition count 148
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 129 place count 115 transition count 143
Iterating global reduction 2 with 5 rules applied. Total rules applied 134 place count 115 transition count 143
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 139 place count 110 transition count 138
Iterating global reduction 2 with 5 rules applied. Total rules applied 144 place count 110 transition count 138
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 146 place count 108 transition count 134
Iterating global reduction 2 with 2 rules applied. Total rules applied 148 place count 108 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 150 place count 108 transition count 132
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 152 place count 106 transition count 130
Iterating global reduction 3 with 2 rules applied. Total rules applied 154 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 155 place count 105 transition count 129
Iterating global reduction 3 with 1 rules applied. Total rules applied 156 place count 105 transition count 129
Applied a total of 156 rules in 19 ms. Remains 105 /173 variables (removed 68) and now considering 129/436 (removed 307) transitions.
// Phase 1: matrix 129 rows 105 cols
[2023-03-19 18:19:33] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-19 18:19:34] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-19 18:19:34] [INFO ] Invariant cache hit.
[2023-03-19 18:19:34] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-19 18:19:34] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2023-03-19 18:19:34] [INFO ] Invariant cache hit.
[2023-03-19 18:19:34] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 105/173 places, 129/436 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 426 ms. Remains : 105/173 places, 129/436 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (LT s1 1) (LT s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 338 ms.
Product exploration explored 100000 steps with 33333 reset in 248 ms.
Computed a total of 22 stabilizing places and 27 stable transitions
Graph (complete) has 343 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 64 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-09 finished in 1227 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0&&X(p1)))&&F(G(p2)))))'
Support contains 5 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 436/436 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 154 transition count 222
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 154 transition count 222
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 57 place count 135 transition count 203
Iterating global reduction 0 with 19 rules applied. Total rules applied 76 place count 135 transition count 203
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 85 place count 135 transition count 194
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 97 place count 123 transition count 173
Iterating global reduction 1 with 12 rules applied. Total rules applied 109 place count 123 transition count 173
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 117 place count 123 transition count 165
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 121 place count 119 transition count 161
Iterating global reduction 2 with 4 rules applied. Total rules applied 125 place count 119 transition count 161
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 129 place count 115 transition count 157
Iterating global reduction 2 with 4 rules applied. Total rules applied 133 place count 115 transition count 157
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 135 place count 113 transition count 153
Iterating global reduction 2 with 2 rules applied. Total rules applied 137 place count 113 transition count 153
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 140 place count 113 transition count 150
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 142 place count 111 transition count 148
Iterating global reduction 3 with 2 rules applied. Total rules applied 144 place count 111 transition count 148
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 145 place count 110 transition count 147
Iterating global reduction 3 with 1 rules applied. Total rules applied 146 place count 110 transition count 147
Applied a total of 146 rules in 11 ms. Remains 110 /173 variables (removed 63) and now considering 147/436 (removed 289) transitions.
// Phase 1: matrix 147 rows 110 cols
[2023-03-19 18:19:35] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-19 18:19:35] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-19 18:19:35] [INFO ] Invariant cache hit.
[2023-03-19 18:19:35] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-19 18:19:35] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2023-03-19 18:19:35] [INFO ] Invariant cache hit.
[2023-03-19 18:19:35] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 110/173 places, 147/436 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 514 ms. Remains : 110/173 places, 147/436 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s104 1)), p2:(OR (LT s27 1) (LT s32 1)), p1:(OR (LT s1 1) (LT s105 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 37423 reset in 375 ms.
Product exploration explored 100000 steps with 37282 reset in 298 ms.
Computed a total of 22 stabilizing places and 28 stable transitions
Graph (complete) has 370 edges and 110 vertex of which 109 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 22 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 396 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Incomplete random walk after 10000 steps, including 2224 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 478 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 1042 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 436 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 466 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 518626 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :{1=1}
Probabilistic random walk after 518626 steps, saw 221631 distinct states, run finished after 3002 ms. (steps per millisecond=172 ) properties seen :1
Running SMT prover for 3 properties.
[2023-03-19 18:19:40] [INFO ] Invariant cache hit.
[2023-03-19 18:19:40] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 18:19:40] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-19 18:19:40] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-19 18:19:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-19 18:19:40] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-19 18:19:40] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-19 18:19:40] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-19 18:19:41] [INFO ] After 101ms SMT Verify possible using 71 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-19 18:19:41] [INFO ] After 178ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 111 ms.
[2023-03-19 18:19:41] [INFO ] After 454ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 168 ms.
Support contains 3 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 147/147 transitions.
Graph (complete) has 332 edges and 110 vertex of which 109 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 109 transition count 145
Applied a total of 3 rules in 9 ms. Remains 109 /110 variables (removed 1) and now considering 145/147 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 109/110 places, 145/147 transitions.
Incomplete random walk after 10000 steps, including 2230 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 484 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 497 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 694807 steps, run timeout after 3001 ms. (steps per millisecond=231 ) properties seen :{}
Probabilistic random walk after 694807 steps, saw 295492 distinct states, run finished after 3001 ms. (steps per millisecond=231 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 145 rows 109 cols
[2023-03-19 18:19:44] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-19 18:19:44] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 18:19:44] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-19 18:19:44] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 18:19:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 18:19:44] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 18:19:44] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 18:19:44] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-19 18:19:44] [INFO ] After 43ms SMT Verify possible using 69 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 18:19:44] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-19 18:19:44] [INFO ] After 249ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 45 ms.
Support contains 3 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 145/145 transitions.
Applied a total of 0 rules in 5 ms. Remains 109 /109 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 109/109 places, 145/145 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 145/145 transitions.
Applied a total of 0 rules in 4 ms. Remains 109 /109 variables (removed 0) and now considering 145/145 (removed 0) transitions.
[2023-03-19 18:19:44] [INFO ] Invariant cache hit.
[2023-03-19 18:19:45] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-19 18:19:45] [INFO ] Invariant cache hit.
[2023-03-19 18:19:45] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-19 18:19:45] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2023-03-19 18:19:45] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 18:19:45] [INFO ] Invariant cache hit.
[2023-03-19 18:19:45] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 382 ms. Remains : 109/109 places, 145/145 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 109 transition count 138
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 103 transition count 138
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 13 place count 103 transition count 121
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 47 place count 86 transition count 121
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 61 place count 79 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 78 transition count 123
Applied a total of 63 rules in 10 ms. Remains 78 /109 variables (removed 31) and now considering 123/145 (removed 22) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 123 rows 78 cols
[2023-03-19 18:19:45] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-19 18:19:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 18:19:45] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 18:19:45] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 18:19:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 18:19:45] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-19 18:19:45] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 18:19:45] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2023-03-19 18:19:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-19 18:19:45] [INFO ] After 200ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-19 18:19:45] [INFO ] After 282ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 10 factoid took 508 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Support contains 5 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 147/147 transitions.
Applied a total of 0 rules in 8 ms. Remains 110 /110 variables (removed 0) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 110 cols
[2023-03-19 18:19:46] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-19 18:19:46] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-19 18:19:46] [INFO ] Invariant cache hit.
[2023-03-19 18:19:46] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-19 18:19:47] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2023-03-19 18:19:47] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 18:19:47] [INFO ] Invariant cache hit.
[2023-03-19 18:19:47] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 475 ms. Remains : 110/110 places, 147/147 transitions.
Computed a total of 22 stabilizing places and 28 stable transitions
Graph (complete) has 370 edges and 110 vertex of which 109 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 22 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p1), (X p0), (X (X p2)), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 260 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Incomplete random walk after 10000 steps, including 2245 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 487 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 1055 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 465 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 806804 steps, run timeout after 3001 ms. (steps per millisecond=268 ) properties seen :{1=1}
Probabilistic random walk after 806804 steps, saw 342384 distinct states, run finished after 3001 ms. (steps per millisecond=268 ) properties seen :1
Running SMT prover for 2 properties.
[2023-03-19 18:19:51] [INFO ] Invariant cache hit.
[2023-03-19 18:19:51] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 18:19:51] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 18:19:51] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 18:19:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 18:19:51] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 18:19:51] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 18:19:51] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-19 18:19:51] [INFO ] After 33ms SMT Verify possible using 71 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 18:19:51] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2023-03-19 18:19:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-19 18:19:51] [INFO ] After 206ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-03-19 18:19:51] [INFO ] After 351ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 45 ms.
Support contains 3 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 147/147 transitions.
Graph (complete) has 332 edges and 110 vertex of which 109 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 109 transition count 145
Applied a total of 3 rules in 7 ms. Remains 109 /110 variables (removed 1) and now considering 145/147 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 109/110 places, 145/147 transitions.
Incomplete random walk after 10000 steps, including 2241 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 467 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 465 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 852935 steps, run timeout after 3001 ms. (steps per millisecond=284 ) properties seen :{}
Probabilistic random walk after 852935 steps, saw 361139 distinct states, run finished after 3001 ms. (steps per millisecond=284 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 145 rows 109 cols
[2023-03-19 18:19:54] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-19 18:19:54] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-19 18:19:54] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 18:19:54] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 18:19:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 18:19:54] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-19 18:19:54] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 18:19:54] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-19 18:19:54] [INFO ] After 27ms SMT Verify possible using 69 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 18:19:55] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2023-03-19 18:19:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-19 18:19:55] [INFO ] After 169ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-19 18:19:55] [INFO ] After 299ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 21 ms.
Support contains 3 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 145/145 transitions.
Applied a total of 0 rules in 5 ms. Remains 109 /109 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 109/109 places, 145/145 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 145/145 transitions.
Applied a total of 0 rules in 4 ms. Remains 109 /109 variables (removed 0) and now considering 145/145 (removed 0) transitions.
[2023-03-19 18:19:55] [INFO ] Invariant cache hit.
[2023-03-19 18:19:55] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-19 18:19:55] [INFO ] Invariant cache hit.
[2023-03-19 18:19:55] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-19 18:19:55] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2023-03-19 18:19:55] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 18:19:55] [INFO ] Invariant cache hit.
[2023-03-19 18:19:55] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 393 ms. Remains : 109/109 places, 145/145 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 109 transition count 138
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 103 transition count 138
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 13 place count 103 transition count 121
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 47 place count 86 transition count 121
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 61 place count 79 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 78 transition count 123
Applied a total of 63 rules in 8 ms. Remains 78 /109 variables (removed 31) and now considering 123/145 (removed 22) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 123 rows 78 cols
[2023-03-19 18:19:55] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-19 18:19:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 18:19:55] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-19 18:19:55] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 18:19:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 18:19:55] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 18:19:55] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 18:19:55] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-19 18:19:55] [INFO ] After 189ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p1), (X p0), (X (X p2)), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 7 factoid took 407 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Product exploration explored 100000 steps with 37308 reset in 244 ms.
Product exploration explored 100000 steps with 37374 reset in 225 ms.
Support contains 5 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 147/147 transitions.
Applied a total of 0 rules in 5 ms. Remains 110 /110 variables (removed 0) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 110 cols
[2023-03-19 18:19:57] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-19 18:19:57] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-19 18:19:57] [INFO ] Invariant cache hit.
[2023-03-19 18:19:57] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-19 18:19:57] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
[2023-03-19 18:19:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 18:19:57] [INFO ] Invariant cache hit.
[2023-03-19 18:19:57] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 504 ms. Remains : 110/110 places, 147/147 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-10 finished in 22858 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 436/436 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 209
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 209
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 60 place count 133 transition count 189
Iterating global reduction 0 with 20 rules applied. Total rules applied 80 place count 133 transition count 189
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 90 place count 133 transition count 179
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 103 place count 120 transition count 156
Iterating global reduction 1 with 13 rules applied. Total rules applied 116 place count 120 transition count 156
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 125 place count 120 transition count 147
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 130 place count 115 transition count 142
Iterating global reduction 2 with 5 rules applied. Total rules applied 135 place count 115 transition count 142
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 140 place count 110 transition count 137
Iterating global reduction 2 with 5 rules applied. Total rules applied 145 place count 110 transition count 137
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 147 place count 108 transition count 133
Iterating global reduction 2 with 2 rules applied. Total rules applied 149 place count 108 transition count 133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 151 place count 108 transition count 131
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 153 place count 106 transition count 129
Iterating global reduction 3 with 2 rules applied. Total rules applied 155 place count 106 transition count 129
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 156 place count 105 transition count 128
Iterating global reduction 3 with 1 rules applied. Total rules applied 157 place count 105 transition count 128
Applied a total of 157 rules in 41 ms. Remains 105 /173 variables (removed 68) and now considering 128/436 (removed 308) transitions.
// Phase 1: matrix 128 rows 105 cols
[2023-03-19 18:19:58] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 18:19:58] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-19 18:19:58] [INFO ] Invariant cache hit.
[2023-03-19 18:19:58] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-19 18:19:58] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2023-03-19 18:19:58] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 18:19:58] [INFO ] Invariant cache hit.
[2023-03-19 18:19:58] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/173 places, 128/436 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 456 ms. Remains : 105/173 places, 128/436 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-11 finished in 565 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' '!(F(p0))'
Support contains 3 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 436/436 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 154 transition count 211
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 154 transition count 211
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 57 place count 135 transition count 192
Iterating global reduction 0 with 19 rules applied. Total rules applied 76 place count 135 transition count 192
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 85 place count 135 transition count 183
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 97 place count 123 transition count 161
Iterating global reduction 1 with 12 rules applied. Total rules applied 109 place count 123 transition count 161
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 117 place count 123 transition count 153
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 121 place count 119 transition count 149
Iterating global reduction 2 with 4 rules applied. Total rules applied 125 place count 119 transition count 149
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 129 place count 115 transition count 145
Iterating global reduction 2 with 4 rules applied. Total rules applied 133 place count 115 transition count 145
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 134 place count 114 transition count 144
Iterating global reduction 2 with 1 rules applied. Total rules applied 135 place count 114 transition count 144
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 137 place count 114 transition count 142
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 138 place count 113 transition count 141
Iterating global reduction 3 with 1 rules applied. Total rules applied 139 place count 113 transition count 141
Applied a total of 139 rules in 19 ms. Remains 113 /173 variables (removed 60) and now considering 141/436 (removed 295) transitions.
// Phase 1: matrix 141 rows 113 cols
[2023-03-19 18:19:58] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 18:19:58] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-19 18:19:58] [INFO ] Invariant cache hit.
[2023-03-19 18:19:58] [INFO ] State equation strengthened by 62 read => feed constraints.
[2023-03-19 18:19:58] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
[2023-03-19 18:19:58] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 18:19:58] [INFO ] Invariant cache hit.
[2023-03-19 18:19:58] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/173 places, 141/436 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 341 ms. Remains : 113/173 places, 141/436 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s60 1)) (AND (GEQ s1 1) (GEQ s108 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 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-12 finished in 378 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((!p0 U (F(p1) U (G(p3)&&p2)))))'
Support contains 4 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 436/436 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 155 transition count 235
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 155 transition count 235
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 54 place count 137 transition count 217
Iterating global reduction 0 with 18 rules applied. Total rules applied 72 place count 137 transition count 217
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 80 place count 137 transition count 209
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 91 place count 126 transition count 190
Iterating global reduction 1 with 11 rules applied. Total rules applied 102 place count 126 transition count 190
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 109 place count 126 transition count 183
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 113 place count 122 transition count 179
Iterating global reduction 2 with 4 rules applied. Total rules applied 117 place count 122 transition count 179
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 121 place count 118 transition count 175
Iterating global reduction 2 with 4 rules applied. Total rules applied 125 place count 118 transition count 175
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 127 place count 116 transition count 171
Iterating global reduction 2 with 2 rules applied. Total rules applied 129 place count 116 transition count 171
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 133 place count 116 transition count 167
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 135 place count 114 transition count 165
Iterating global reduction 3 with 2 rules applied. Total rules applied 137 place count 114 transition count 165
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 138 place count 113 transition count 164
Iterating global reduction 3 with 1 rules applied. Total rules applied 139 place count 113 transition count 164
Applied a total of 139 rules in 18 ms. Remains 113 /173 variables (removed 60) and now considering 164/436 (removed 272) transitions.
// Phase 1: matrix 164 rows 113 cols
[2023-03-19 18:19:59] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 18:19:59] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-19 18:19:59] [INFO ] Invariant cache hit.
[2023-03-19 18:19:59] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-19 18:19:59] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2023-03-19 18:19:59] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 18:19:59] [INFO ] Invariant cache hit.
[2023-03-19 18:19:59] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/173 places, 164/436 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 448 ms. Remains : 113/173 places, 164/436 transitions.
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p2) (NOT p3)), (NOT p1), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (NOT p3), (NOT p3)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1) p0) (AND (NOT p3) (NOT p1) p0)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p3) p0)), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p0))), acceptance={} source=0 dest: 3}, { cond=(AND p2 p3 p0), acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p3) (NOT p1))), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 p3), acceptance={} source=2 dest: 5}], [{ cond=(OR (AND (NOT p2) (NOT p1) p0) (AND (NOT p3) (NOT p1) p0)), acceptance={} source=3 dest: 1}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p3) p0)), acceptance={} source=3 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p0))), acceptance={0} source=3 dest: 3}, { cond=(AND p2 p3 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p2 p3 p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) p0), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND p3 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND p3 p0), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(NOT p3), acceptance={0} source=5 dest: 2}, { cond=p3, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s106 1)), p1:(AND (GEQ s1 1) (GEQ s108 1)), p0:(AND (GEQ s1 1) (GEQ s107 1)), p3:(AND (GEQ s1 1) (GEQ s106 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-13 finished in 719 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 173/173 places, 436/436 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 153 transition count 209
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 153 transition count 209
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 60 place count 133 transition count 189
Iterating global reduction 0 with 20 rules applied. Total rules applied 80 place count 133 transition count 189
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 89 place count 133 transition count 180
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 102 place count 120 transition count 157
Iterating global reduction 1 with 13 rules applied. Total rules applied 115 place count 120 transition count 157
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 124 place count 120 transition count 148
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 129 place count 115 transition count 143
Iterating global reduction 2 with 5 rules applied. Total rules applied 134 place count 115 transition count 143
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 139 place count 110 transition count 138
Iterating global reduction 2 with 5 rules applied. Total rules applied 144 place count 110 transition count 138
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 146 place count 108 transition count 134
Iterating global reduction 2 with 2 rules applied. Total rules applied 148 place count 108 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 150 place count 108 transition count 132
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 152 place count 106 transition count 130
Iterating global reduction 3 with 2 rules applied. Total rules applied 154 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 155 place count 105 transition count 129
Iterating global reduction 3 with 1 rules applied. Total rules applied 156 place count 105 transition count 129
Applied a total of 156 rules in 21 ms. Remains 105 /173 variables (removed 68) and now considering 129/436 (removed 307) transitions.
// Phase 1: matrix 129 rows 105 cols
[2023-03-19 18:19:59] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 18:19:59] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-19 18:19:59] [INFO ] Invariant cache hit.
[2023-03-19 18:19:59] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-19 18:20:00] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2023-03-19 18:20:00] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 18:20:00] [INFO ] Invariant cache hit.
[2023-03-19 18:20:00] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/173 places, 129/436 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 431 ms. Remains : 105/173 places, 129/436 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-14 finished in 516 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0&&X(p1)))&&F(G(p2)))))'
Found a Shortening insensitive property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-10
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Support contains 5 out of 173 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 173/173 places, 436/436 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 154 transition count 222
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 154 transition count 222
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 57 place count 135 transition count 203
Iterating global reduction 0 with 19 rules applied. Total rules applied 76 place count 135 transition count 203
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 85 place count 135 transition count 194
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 97 place count 123 transition count 173
Iterating global reduction 1 with 12 rules applied. Total rules applied 109 place count 123 transition count 173
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 117 place count 123 transition count 165
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 121 place count 119 transition count 161
Iterating global reduction 2 with 4 rules applied. Total rules applied 125 place count 119 transition count 161
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 129 place count 115 transition count 157
Iterating global reduction 2 with 4 rules applied. Total rules applied 133 place count 115 transition count 157
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 135 place count 113 transition count 153
Iterating global reduction 2 with 2 rules applied. Total rules applied 137 place count 113 transition count 153
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 140 place count 113 transition count 150
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 142 place count 111 transition count 148
Iterating global reduction 3 with 2 rules applied. Total rules applied 144 place count 111 transition count 148
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 145 place count 110 transition count 147
Iterating global reduction 3 with 1 rules applied. Total rules applied 146 place count 110 transition count 147
Applied a total of 146 rules in 22 ms. Remains 110 /173 variables (removed 63) and now considering 147/436 (removed 289) transitions.
// Phase 1: matrix 147 rows 110 cols
[2023-03-19 18:20:00] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 18:20:00] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-19 18:20:00] [INFO ] Invariant cache hit.
[2023-03-19 18:20:00] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-19 18:20:01] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
[2023-03-19 18:20:01] [INFO ] Invariant cache hit.
[2023-03-19 18:20:01] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 110/173 places, 147/436 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 634 ms. Remains : 110/173 places, 147/436 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s104 1)), p2:(OR (LT s27 1) (LT s32 1)), p1:(OR (LT s1 1) (LT s105 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 37198 reset in 183 ms.
Product exploration explored 100000 steps with 37499 reset in 202 ms.
Computed a total of 22 stabilizing places and 28 stable transitions
Graph (complete) has 370 edges and 110 vertex of which 109 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Computed a total of 22 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 347 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Incomplete random walk after 10000 steps, including 2222 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 474 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 1045 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 474 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 489 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 633811 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :{1=1}
Probabilistic random walk after 633811 steps, saw 270228 distinct states, run finished after 3001 ms. (steps per millisecond=211 ) properties seen :1
Running SMT prover for 3 properties.
[2023-03-19 18:20:05] [INFO ] Invariant cache hit.
[2023-03-19 18:20:05] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 18:20:05] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 18:20:05] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-19 18:20:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 18:20:05] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 18:20:05] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-19 18:20:05] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-19 18:20:05] [INFO ] After 51ms SMT Verify possible using 71 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-19 18:20:05] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 101 ms.
[2023-03-19 18:20:05] [INFO ] After 299ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 90 ms.
Support contains 3 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 147/147 transitions.
Graph (complete) has 332 edges and 110 vertex of which 109 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 109 transition count 145
Applied a total of 3 rules in 4 ms. Remains 109 /110 variables (removed 1) and now considering 145/147 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 109/110 places, 145/147 transitions.
Incomplete random walk after 10000 steps, including 2210 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 492 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 481 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 753446 steps, run timeout after 3001 ms. (steps per millisecond=251 ) properties seen :{}
Probabilistic random walk after 753446 steps, saw 320777 distinct states, run finished after 3001 ms. (steps per millisecond=251 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 145 rows 109 cols
[2023-03-19 18:20:08] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-19 18:20:08] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-19 18:20:08] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 18:20:09] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 18:20:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 18:20:09] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 18:20:09] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 18:20:09] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-19 18:20:09] [INFO ] After 43ms SMT Verify possible using 69 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 18:20:09] [INFO ] After 88ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-19 18:20:09] [INFO ] After 221ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 24 ms.
Support contains 3 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 145/145 transitions.
Applied a total of 0 rules in 3 ms. Remains 109 /109 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 109/109 places, 145/145 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 145/145 transitions.
Applied a total of 0 rules in 2 ms. Remains 109 /109 variables (removed 0) and now considering 145/145 (removed 0) transitions.
[2023-03-19 18:20:09] [INFO ] Invariant cache hit.
[2023-03-19 18:20:09] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-19 18:20:09] [INFO ] Invariant cache hit.
[2023-03-19 18:20:09] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-19 18:20:09] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2023-03-19 18:20:09] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 18:20:09] [INFO ] Invariant cache hit.
[2023-03-19 18:20:09] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 334 ms. Remains : 109/109 places, 145/145 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 109 transition count 138
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 103 transition count 138
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 13 place count 103 transition count 121
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 47 place count 86 transition count 121
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 61 place count 79 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 78 transition count 123
Applied a total of 63 rules in 8 ms. Remains 78 /109 variables (removed 31) and now considering 123/145 (removed 22) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 123 rows 78 cols
[2023-03-19 18:20:09] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-19 18:20:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 18:20:09] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 18:20:09] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 18:20:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-19 18:20:09] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 18:20:09] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 18:20:09] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2023-03-19 18:20:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-03-19 18:20:09] [INFO ] After 117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-19 18:20:09] [INFO ] After 180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 10 factoid took 377 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Support contains 5 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 147/147 transitions.
Applied a total of 0 rules in 5 ms. Remains 110 /110 variables (removed 0) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 110 cols
[2023-03-19 18:20:10] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-19 18:20:10] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-19 18:20:10] [INFO ] Invariant cache hit.
[2023-03-19 18:20:10] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-19 18:20:10] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2023-03-19 18:20:10] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 18:20:10] [INFO ] Invariant cache hit.
[2023-03-19 18:20:10] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 439 ms. Remains : 110/110 places, 147/147 transitions.
Computed a total of 22 stabilizing places and 28 stable transitions
Graph (complete) has 370 edges and 110 vertex of which 109 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 22 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p1), (X p0), (X (X p2)), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 244 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Incomplete random walk after 10000 steps, including 2236 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 484 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 1035 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 475 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 859538 steps, run timeout after 3001 ms. (steps per millisecond=286 ) properties seen :{1=1}
Probabilistic random walk after 859538 steps, saw 363842 distinct states, run finished after 3001 ms. (steps per millisecond=286 ) properties seen :1
Running SMT prover for 2 properties.
[2023-03-19 18:20:14] [INFO ] Invariant cache hit.
[2023-03-19 18:20:14] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 18:20:14] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 18:20:14] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 18:20:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 18:20:14] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-19 18:20:14] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 18:20:14] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-19 18:20:14] [INFO ] After 39ms SMT Verify possible using 71 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 18:20:15] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2023-03-19 18:20:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2023-03-19 18:20:15] [INFO ] After 172ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-19 18:20:15] [INFO ] After 337ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 18 ms.
Support contains 3 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 147/147 transitions.
Graph (complete) has 332 edges and 110 vertex of which 109 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 109 transition count 145
Applied a total of 3 rules in 5 ms. Remains 109 /110 variables (removed 1) and now considering 145/147 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 109/110 places, 145/147 transitions.
Incomplete random walk after 10000 steps, including 2253 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 475 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 457 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 933411 steps, run timeout after 3001 ms. (steps per millisecond=311 ) properties seen :{}
Probabilistic random walk after 933411 steps, saw 393224 distinct states, run finished after 3001 ms. (steps per millisecond=311 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 145 rows 109 cols
[2023-03-19 18:20:18] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-19 18:20:18] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 18:20:18] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-19 18:20:18] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 18:20:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-19 18:20:18] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-19 18:20:18] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 18:20:18] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-19 18:20:18] [INFO ] After 48ms SMT Verify possible using 69 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 18:20:18] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2023-03-19 18:20:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-19 18:20:18] [INFO ] After 199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-19 18:20:18] [INFO ] After 417ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 145/145 transitions.
Applied a total of 0 rules in 6 ms. Remains 109 /109 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 109/109 places, 145/145 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 145/145 transitions.
Applied a total of 0 rules in 4 ms. Remains 109 /109 variables (removed 0) and now considering 145/145 (removed 0) transitions.
[2023-03-19 18:20:18] [INFO ] Invariant cache hit.
[2023-03-19 18:20:18] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-19 18:20:18] [INFO ] Invariant cache hit.
[2023-03-19 18:20:19] [INFO ] State equation strengthened by 69 read => feed constraints.
[2023-03-19 18:20:19] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2023-03-19 18:20:19] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 18:20:19] [INFO ] Invariant cache hit.
[2023-03-19 18:20:19] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 445 ms. Remains : 109/109 places, 145/145 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 109 transition count 138
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 103 transition count 138
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 13 place count 103 transition count 121
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 47 place count 86 transition count 121
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 61 place count 79 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 78 transition count 123
Applied a total of 63 rules in 11 ms. Remains 78 /109 variables (removed 31) and now considering 123/145 (removed 22) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 123 rows 78 cols
[2023-03-19 18:20:19] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-19 18:20:19] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-19 18:20:19] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 18:20:19] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 18:20:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-19 18:20:19] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-19 18:20:19] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 18:20:19] [INFO ] After 89ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-19 18:20:19] [INFO ] After 153ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p1), (X p0), (X (X p2)), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 7 factoid took 286 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Product exploration explored 100000 steps with 37180 reset in 232 ms.
Product exploration explored 100000 steps with 37317 reset in 230 ms.
Support contains 5 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 147/147 transitions.
Applied a total of 0 rules in 3 ms. Remains 110 /110 variables (removed 0) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 110 cols
[2023-03-19 18:20:20] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-19 18:20:20] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-19 18:20:21] [INFO ] Invariant cache hit.
[2023-03-19 18:20:21] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-19 18:20:21] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
[2023-03-19 18:20:21] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 18:20:21] [INFO ] Invariant cache hit.
[2023-03-19 18:20:21] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 480 ms. Remains : 110/110 places, 147/147 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-10 finished in 21197 ms.
[2023-03-19 18:20:21] [INFO ] Flatten gal took : 26 ms
[2023-03-19 18:20:21] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-19 18:20:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 173 places, 436 transitions and 1723 arcs took 4 ms.
Total runtime 70007 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT SieveSingleMsgMbox-PT-d2m96
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
LTLFireability

BK_STOP 1679250081812

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: rewrite Frontend/Parser/formula_rewrite.k:373
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 3 (type EXCL) for 0 SieveSingleMsgMbox-PT-d2m96-LTLFireability-10
lola: time limit : 1800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d2m96-LTLFireability-10: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 5/1800 7/32 SieveSingleMsgMbox-PT-d2m96-LTLFireability-10 939238 m, 187847 m/sec, 2098371 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d2m96-LTLFireability-10: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 10/1800 13/32 SieveSingleMsgMbox-PT-d2m96-LTLFireability-10 1875584 m, 187269 m/sec, 4204031 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d2m96-LTLFireability-10: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 15/1800 19/32 SieveSingleMsgMbox-PT-d2m96-LTLFireability-10 2701993 m, 165281 m/sec, 6168837 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d2m96-LTLFireability-10: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 20/1800 24/32 SieveSingleMsgMbox-PT-d2m96-LTLFireability-10 3490129 m, 157627 m/sec, 8007736 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d2m96-LTLFireability-10: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 25/1800 30/32 SieveSingleMsgMbox-PT-d2m96-LTLFireability-10 4316359 m, 165246 m/sec, 9836283 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d2m96-LTLFireability-10: CONJ 0 1 0 0 2 0 1 0

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

Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: LAUNCH task # 5 (type EXCL) for 0 SieveSingleMsgMbox-PT-d2m96-LTLFireability-10
lola: time limit : 3570 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d2m96-LTLFireability-10: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 5/3570 7/32 SieveSingleMsgMbox-PT-d2m96-LTLFireability-10 848815 m, 169763 m/sec, 2114058 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d2m96-LTLFireability-10: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 10/3570 13/32 SieveSingleMsgMbox-PT-d2m96-LTLFireability-10 1690386 m, 168314 m/sec, 4369988 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d2m96-LTLFireability-10: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 15/3570 19/32 SieveSingleMsgMbox-PT-d2m96-LTLFireability-10 2570234 m, 175969 m/sec, 6592194 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d2m96-LTLFireability-10: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 20/3570 25/32 SieveSingleMsgMbox-PT-d2m96-LTLFireability-10 3391812 m, 164315 m/sec, 8781318 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d2m96-LTLFireability-10: CONJ 0 0 1 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 25/3570 32/32 SieveSingleMsgMbox-PT-d2m96-LTLFireability-10 4266320 m, 174901 m/sec, 11002779 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SieveSingleMsgMbox-PT-d2m96-LTLFireability-10: CONJ 0 0 0 0 2 0 2 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SieveSingleMsgMbox-PT-d2m96-LTLFireability-10: CONJ unknown CONJ


Time elapsed: 60 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SieveSingleMsgMbox-PT-d2m96"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is SieveSingleMsgMbox-PT-d2m96, 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 r423-tajo-167905976800492"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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