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.r421-tajo-167905975300484.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 itstools
Input is SieveSingleMsgMbox-PT-d2m64, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r421-tajo-167905975300484
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 6.0K Feb 26 10:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 10:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 10:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 10:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K 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.3K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 26 10:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 10:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 10:32 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-d2m64-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679182422053

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m64
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-18 23:33:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 23:33:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:33:43] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2023-03-18 23:33:43] [INFO ] Transformed 2398 places.
[2023-03-18 23:33:43] [INFO ] Transformed 1954 transitions.
[2023-03-18 23:33:43] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 226 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
Deduced a syphon composed of 1984 places in 13 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 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 106 places :
Symmetric choice reduction at 1 with 106 rule applications. Total rules 959 place count 283 transition count 584
Iterating global reduction 1 with 106 rules applied. Total rules applied 1065 place count 283 transition count 584
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1075 place count 283 transition count 574
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 1153 place count 205 transition count 496
Iterating global reduction 2 with 78 rules applied. Total rules applied 1231 place count 205 transition count 496
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 1262 place count 205 transition count 465
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 1289 place count 178 transition count 434
Iterating global reduction 3 with 27 rules applied. Total rules applied 1316 place count 178 transition count 434
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1379 place count 178 transition count 371
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1385 place count 172 transition count 361
Iterating global reduction 4 with 6 rules applied. Total rules applied 1391 place count 172 transition count 361
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1397 place count 166 transition count 355
Iterating global reduction 4 with 6 rules applied. Total rules applied 1403 place count 166 transition count 355
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1406 place count 163 transition count 351
Iterating global reduction 4 with 3 rules applied. Total rules applied 1409 place count 163 transition count 351
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1411 place count 161 transition count 349
Iterating global reduction 4 with 2 rules applied. Total rules applied 1413 place count 161 transition count 349
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1415 place count 159 transition count 347
Iterating global reduction 4 with 2 rules applied. Total rules applied 1417 place count 159 transition count 347
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1418 place count 158 transition count 346
Iterating global reduction 4 with 1 rules applied. Total rules applied 1419 place count 158 transition count 346
Applied a total of 1419 rules in 88 ms. Remains 158 /414 variables (removed 256) and now considering 346/1954 (removed 1608) transitions.
// Phase 1: matrix 346 rows 158 cols
[2023-03-18 23:33:44] [INFO ] Computed 5 place invariants in 21 ms
[2023-03-18 23:33:44] [INFO ] Implicit Places using invariants in 311 ms returned []
[2023-03-18 23:33:44] [INFO ] Invariant cache hit.
[2023-03-18 23:33:44] [INFO ] State equation strengthened by 221 read => feed constraints.
[2023-03-18 23:33:45] [INFO ] Implicit Places using invariants and state equation in 1108 ms returned []
Implicit Place search using SMT with State Equation took 1454 ms to find 0 implicit places.
[2023-03-18 23:33:45] [INFO ] Invariant cache hit.
[2023-03-18 23:33:45] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 158/414 places, 346/1954 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1713 ms. Remains : 158/414 places, 346/1954 transitions.
Support contains 19 out of 158 places after structural reductions.
[2023-03-18 23:33:46] [INFO ] Flatten gal took : 81 ms
[2023-03-18 23:33:46] [INFO ] Flatten gal took : 57 ms
[2023-03-18 23:33:46] [INFO ] Input system was already deterministic with 346 transitions.
Support contains 18 out of 158 places (down from 19) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2207 resets, run finished after 881 ms. (steps per millisecond=11 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 33 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 94 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 204287 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{2=1, 3=1, 4=1, 5=1, 6=1, 11=1, 12=1, 14=1}
Probabilistic random walk after 204287 steps, saw 92770 distinct states, run finished after 3004 ms. (steps per millisecond=68 ) properties seen :8
Running SMT prover for 8 properties.
[2023-03-18 23:33:50] [INFO ] Invariant cache hit.
[2023-03-18 23:33:50] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 23:33:50] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 23:33:50] [INFO ] After 376ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:7
[2023-03-18 23:33:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:33:50] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 23:33:51] [INFO ] After 240ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2023-03-18 23:33:51] [INFO ] State equation strengthened by 221 read => feed constraints.
[2023-03-18 23:33:51] [INFO ] After 407ms SMT Verify possible using 221 Read/Feed constraints in natural domain returned unsat :1 sat :7
[2023-03-18 23:33:51] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 7 ms to minimize.
[2023-03-18 23:33:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2023-03-18 23:33:52] [INFO ] After 1201ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 845 ms.
[2023-03-18 23:33:53] [INFO ] After 2393ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 360 ms.
Support contains 8 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 346/346 transitions.
Graph (complete) has 599 edges and 158 vertex of which 157 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 157 transition count 344
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 11 place count 149 transition count 252
Iterating global reduction 1 with 8 rules applied. Total rules applied 19 place count 149 transition count 252
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 26 place count 142 transition count 245
Iterating global reduction 1 with 7 rules applied. Total rules applied 33 place count 142 transition count 245
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 38 place count 142 transition count 240
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 44 place count 136 transition count 228
Iterating global reduction 2 with 6 rules applied. Total rules applied 50 place count 136 transition count 228
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 54 place count 136 transition count 224
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 135 transition count 223
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 135 transition count 223
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 134 transition count 222
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 134 transition count 222
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 133 transition count 221
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 133 transition count 221
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 66 place count 133 transition count 215
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 67 place count 132 transition count 214
Iterating global reduction 4 with 1 rules applied. Total rules applied 68 place count 132 transition count 214
Applied a total of 68 rules in 65 ms. Remains 132 /158 variables (removed 26) and now considering 214/346 (removed 132) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 132/158 places, 214/346 transitions.
Incomplete random walk after 10000 steps, including 2273 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 506 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 475 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 467 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 478 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 478 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 476 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 475 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 288612 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 288612 steps, saw 121048 distinct states, run finished after 3004 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 214 rows 132 cols
[2023-03-18 23:33:57] [INFO ] Computed 4 place invariants in 8 ms
[2023-03-18 23:33:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:33:57] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-18 23:33:57] [INFO ] After 312ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 23:33:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 23:33:57] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 23:33:58] [INFO ] After 222ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-18 23:33:58] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 23:33:58] [INFO ] After 212ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-18 23:33:58] [INFO ] After 647ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 304 ms.
[2023-03-18 23:33:59] [INFO ] After 1299ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 260 ms.
Support contains 8 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 214/214 transitions.
Applied a total of 0 rules in 18 ms. Remains 132 /132 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 132/132 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 214/214 transitions.
Applied a total of 0 rules in 12 ms. Remains 132 /132 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-18 23:33:59] [INFO ] Invariant cache hit.
[2023-03-18 23:33:59] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-18 23:33:59] [INFO ] Invariant cache hit.
[2023-03-18 23:33:59] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 23:33:59] [INFO ] Implicit Places using invariants and state equation in 505 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
[2023-03-18 23:33:59] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-18 23:33:59] [INFO ] Invariant cache hit.
[2023-03-18 23:34:00] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 724 ms. Remains : 132/132 places, 214/214 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 207
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 207
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 13 place count 126 transition count 189
Deduced a syphon composed of 18 places in 7 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 49 place count 108 transition count 189
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 67 place count 99 transition count 180
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 69 place count 98 transition count 189
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 71 place count 98 transition count 189
Applied a total of 71 rules in 49 ms. Remains 98 /132 variables (removed 34) and now considering 189/214 (removed 25) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 189 rows 98 cols
[2023-03-18 23:34:00] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-18 23:34:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:34:00] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 23:34:00] [INFO ] After 239ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 23:34:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:34:00] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 23:34:00] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-18 23:34:00] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
[2023-03-18 23:34:00] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2023-03-18 23:34:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 134 ms
[2023-03-18 23:34:00] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2023-03-18 23:34:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-03-18 23:34:00] [INFO ] After 607ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 195 ms.
[2023-03-18 23:34:01] [INFO ] After 853ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 34 stabilizing places and 54 stable transitions
Graph (complete) has 654 edges and 158 vertex of which 157 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(G(p0))))'
Support contains 2 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 346/346 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 144 transition count 199
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 144 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 144 transition count 198
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 42 place count 131 transition count 184
Iterating global reduction 1 with 13 rules applied. Total rules applied 55 place count 131 transition count 184
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 63 place count 131 transition count 176
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 75 place count 119 transition count 154
Iterating global reduction 2 with 12 rules applied. Total rules applied 87 place count 119 transition count 154
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 95 place count 119 transition count 146
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 99 place count 115 transition count 142
Iterating global reduction 3 with 4 rules applied. Total rules applied 103 place count 115 transition count 142
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 107 place count 111 transition count 138
Iterating global reduction 3 with 4 rules applied. Total rules applied 111 place count 111 transition count 138
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 113 place count 109 transition count 136
Iterating global reduction 3 with 2 rules applied. Total rules applied 115 place count 109 transition count 136
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 117 place count 109 transition count 134
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 119 place count 107 transition count 130
Iterating global reduction 4 with 2 rules applied. Total rules applied 121 place count 107 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 122 place count 106 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 123 place count 106 transition count 129
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 124 place count 105 transition count 128
Iterating global reduction 4 with 1 rules applied. Total rules applied 125 place count 105 transition count 128
Applied a total of 125 rules in 20 ms. Remains 105 /158 variables (removed 53) and now considering 128/346 (removed 218) transitions.
// Phase 1: matrix 128 rows 105 cols
[2023-03-18 23:34:01] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 23:34:01] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-18 23:34:01] [INFO ] Invariant cache hit.
[2023-03-18 23:34:01] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-18 23:34:01] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2023-03-18 23:34:01] [INFO ] Invariant cache hit.
[2023-03-18 23:34:01] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 105/158 places, 128/346 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 397 ms. Remains : 105/158 places, 128/346 transitions.
Stuttering acceptance computed with spot in 308 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s1 1) (GEQ s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-00 finished in 777 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))'
Support contains 2 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 346/346 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 144 transition count 199
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 144 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 144 transition count 198
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 42 place count 131 transition count 184
Iterating global reduction 1 with 13 rules applied. Total rules applied 55 place count 131 transition count 184
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 62 place count 131 transition count 177
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 74 place count 119 transition count 155
Iterating global reduction 2 with 12 rules applied. Total rules applied 86 place count 119 transition count 155
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 94 place count 119 transition count 147
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 98 place count 115 transition count 143
Iterating global reduction 3 with 4 rules applied. Total rules applied 102 place count 115 transition count 143
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 106 place count 111 transition count 139
Iterating global reduction 3 with 4 rules applied. Total rules applied 110 place count 111 transition count 139
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 112 place count 109 transition count 137
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 109 transition count 137
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 116 place count 109 transition count 135
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 118 place count 107 transition count 131
Iterating global reduction 4 with 2 rules applied. Total rules applied 120 place count 107 transition count 131
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 121 place count 106 transition count 130
Iterating global reduction 4 with 1 rules applied. Total rules applied 122 place count 106 transition count 130
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 123 place count 105 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 124 place count 105 transition count 129
Applied a total of 124 rules in 54 ms. Remains 105 /158 variables (removed 53) and now considering 129/346 (removed 217) transitions.
// Phase 1: matrix 129 rows 105 cols
[2023-03-18 23:34:02] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-18 23:34:02] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-18 23:34:02] [INFO ] Invariant cache hit.
[2023-03-18 23:34:02] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-18 23:34:02] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2023-03-18 23:34:02] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-18 23:34:02] [INFO ] Invariant cache hit.
[2023-03-18 23:34:02] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/158 places, 129/346 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 502 ms. Remains : 105/158 places, 129/346 transitions.
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22394 reset in 347 ms.
Product exploration explored 100000 steps with 22524 reset in 255 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 p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 184 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2226 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 492 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1835360 steps, run timeout after 3001 ms. (steps per millisecond=611 ) properties seen :{}
Probabilistic random walk after 1835360 steps, saw 773833 distinct states, run finished after 3001 ms. (steps per millisecond=611 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 23:34:06] [INFO ] Invariant cache hit.
[2023-03-18 23:34:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:34:06] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-18 23:34:06] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:34:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:34:06] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 23:34:06] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:34:06] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-18 23:34:06] [INFO ] After 37ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 23:34:06] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2023-03-18 23:34:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2023-03-18 23:34:06] [INFO ] After 188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-18 23:34:07] [INFO ] After 321ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 129/129 transitions.
Graph (complete) has 307 edges and 105 vertex of which 104 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 104 transition count 127
Applied a total of 3 rules in 20 ms. Remains 104 /105 variables (removed 1) and now considering 127/129 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 104/105 places, 127/129 transitions.
Incomplete random walk after 10000 steps, including 2191 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 459 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1791930 steps, run timeout after 3001 ms. (steps per millisecond=597 ) properties seen :{}
Probabilistic random walk after 1791930 steps, saw 756164 distinct states, run finished after 3001 ms. (steps per millisecond=597 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 127 rows 104 cols
[2023-03-18 23:34:10] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-18 23:34:10] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 23:34:10] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 23:34:10] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:34:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:34:10] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-18 23:34:10] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:34:10] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-18 23:34:10] [INFO ] After 31ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 23:34:10] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-18 23:34:10] [INFO ] After 201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 5 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 104/104 places, 127/127 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 4 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2023-03-18 23:34:10] [INFO ] Invariant cache hit.
[2023-03-18 23:34:10] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-18 23:34:10] [INFO ] Invariant cache hit.
[2023-03-18 23:34:10] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-18 23:34:10] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2023-03-18 23:34:10] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 23:34:10] [INFO ] Invariant cache hit.
[2023-03-18 23:34:10] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 334 ms. Remains : 104/104 places, 127/127 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 104 transition count 120
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 98 transition count 120
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 98 transition count 103
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 81 transition count 103
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 59 place count 75 transition count 97
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 61 place count 74 transition count 106
Applied a total of 61 rules in 9 ms. Remains 74 /104 variables (removed 30) and now considering 106/127 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 106 rows 74 cols
[2023-03-18 23:34:10] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-18 23:34:10] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:34:10] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-18 23:34:10] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:34:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:34:10] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 23:34:10] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:34:10] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-18 23:34:10] [INFO ] After 99ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 137 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 129/129 transitions.
Applied a total of 0 rules in 5 ms. Remains 105 /105 variables (removed 0) and now considering 129/129 (removed 0) transitions.
// Phase 1: matrix 129 rows 105 cols
[2023-03-18 23:34:11] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 23:34:11] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-18 23:34:11] [INFO ] Invariant cache hit.
[2023-03-18 23:34:11] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-18 23:34:11] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2023-03-18 23:34:11] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 23:34:11] [INFO ] Invariant cache hit.
[2023-03-18 23:34:11] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 382 ms. Remains : 105/105 places, 129/129 transitions.
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.3 ms
Computed a total of 22 stabilizing places and 27 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 152 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2205 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 490 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2037368 steps, run timeout after 3001 ms. (steps per millisecond=678 ) properties seen :{}
Probabilistic random walk after 2037368 steps, saw 855609 distinct states, run finished after 3005 ms. (steps per millisecond=677 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 23:34:14] [INFO ] Invariant cache hit.
[2023-03-18 23:34:14] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 23:34:14] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 23:34:14] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:34:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:34:14] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 23:34:15] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:34:15] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-18 23:34:15] [INFO ] After 25ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 23:34:15] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2023-03-18 23:34:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-18 23:34:15] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-18 23:34:15] [INFO ] After 191ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 129/129 transitions.
Graph (complete) has 307 edges and 105 vertex of which 104 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 104 transition count 127
Applied a total of 3 rules in 4 ms. Remains 104 /105 variables (removed 1) and now considering 127/129 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 104/105 places, 127/129 transitions.
Incomplete random walk after 10000 steps, including 2252 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 455 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2199319 steps, run timeout after 3001 ms. (steps per millisecond=732 ) properties seen :{}
Probabilistic random walk after 2199319 steps, saw 923870 distinct states, run finished after 3001 ms. (steps per millisecond=732 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 127 rows 104 cols
[2023-03-18 23:34:18] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-18 23:34:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:34:18] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 23:34:18] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:34:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 23:34:18] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 23:34:18] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:34:18] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-18 23:34:18] [INFO ] After 23ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 23:34:18] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-18 23:34:18] [INFO ] After 143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 104/104 places, 127/127 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 127/127 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2023-03-18 23:34:18] [INFO ] Invariant cache hit.
[2023-03-18 23:34:18] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-18 23:34:18] [INFO ] Invariant cache hit.
[2023-03-18 23:34:18] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-18 23:34:18] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2023-03-18 23:34:18] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 23:34:18] [INFO ] Invariant cache hit.
[2023-03-18 23:34:18] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 328 ms. Remains : 104/104 places, 127/127 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 104 transition count 120
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 98 transition count 120
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 98 transition count 103
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 81 transition count 103
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 59 place count 75 transition count 97
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 61 place count 74 transition count 106
Applied a total of 61 rules in 9 ms. Remains 74 /104 variables (removed 30) and now considering 106/127 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 106 rows 74 cols
[2023-03-18 23:34:18] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-18 23:34:18] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-18 23:34:18] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 23:34:18] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 23:34:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 23:34:18] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 23:34:18] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 23:34:18] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-18 23:34:18] [INFO ] After 80ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 181 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 22438 reset in 149 ms.
Product exploration explored 100000 steps with 22431 reset in 177 ms.
Built C files in :
/tmp/ltsmin6194156942503772435
[2023-03-18 23:34:19] [INFO ] Computing symmetric may disable matrix : 129 transitions.
[2023-03-18 23:34:19] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 23:34:19] [INFO ] Computing symmetric may enable matrix : 129 transitions.
[2023-03-18 23:34:19] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 23:34:19] [INFO ] Computing Do-Not-Accords matrix : 129 transitions.
[2023-03-18 23:34:19] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 23:34:19] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6194156942503772435
Running compilation step : cd /tmp/ltsmin6194156942503772435;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 424 ms.
Running link step : cd /tmp/ltsmin6194156942503772435;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 67 ms.
Running LTSmin : cd /tmp/ltsmin6194156942503772435;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8117649830477054189.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 129/129 transitions.
Applied a total of 0 rules in 6 ms. Remains 105 /105 variables (removed 0) and now considering 129/129 (removed 0) transitions.
// Phase 1: matrix 129 rows 105 cols
[2023-03-18 23:34:34] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 23:34:34] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-18 23:34:34] [INFO ] Invariant cache hit.
[2023-03-18 23:34:34] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-18 23:34:35] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2023-03-18 23:34:35] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 23:34:35] [INFO ] Invariant cache hit.
[2023-03-18 23:34:35] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 384 ms. Remains : 105/105 places, 129/129 transitions.
Built C files in :
/tmp/ltsmin8068236569534420055
[2023-03-18 23:34:35] [INFO ] Computing symmetric may disable matrix : 129 transitions.
[2023-03-18 23:34:35] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 23:34:35] [INFO ] Computing symmetric may enable matrix : 129 transitions.
[2023-03-18 23:34:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 23:34:35] [INFO ] Computing Do-Not-Accords matrix : 129 transitions.
[2023-03-18 23:34:35] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 23:34:35] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8068236569534420055
Running compilation step : cd /tmp/ltsmin8068236569534420055;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 350 ms.
Running link step : cd /tmp/ltsmin8068236569534420055;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin8068236569534420055;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16150275460995847108.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 23:34:50] [INFO ] Flatten gal took : 8 ms
[2023-03-18 23:34:50] [INFO ] Flatten gal took : 8 ms
[2023-03-18 23:34:50] [INFO ] Time to serialize gal into /tmp/LTL13114092131970539933.gal : 2 ms
[2023-03-18 23:34:50] [INFO ] Time to serialize properties into /tmp/LTL1742855239439870955.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13114092131970539933.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1518212525714543874.hoa' '-atoms' '/tmp/LTL1742855239439870955.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1742855239439870955.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1518212525714543874.hoa
Detected timeout of ITS tools.
[2023-03-18 23:35:05] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:35:05] [INFO ] Flatten gal took : 6 ms
[2023-03-18 23:35:05] [INFO ] Time to serialize gal into /tmp/LTL18271140164522851491.gal : 1 ms
[2023-03-18 23:35:05] [INFO ] Time to serialize properties into /tmp/LTL700115333897265280.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18271140164522851491.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL700115333897265280.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G("((s1<1)||(l2218<1))")))
Formula 0 simplified : F!"((s1<1)||(l2218<1))"
Detected timeout of ITS tools.
[2023-03-18 23:35:20] [INFO ] Flatten gal took : 16 ms
[2023-03-18 23:35:20] [INFO ] Applying decomposition
[2023-03-18 23:35:20] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12595458018205025736.txt' '-o' '/tmp/graph12595458018205025736.bin' '-w' '/tmp/graph12595458018205025736.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12595458018205025736.bin' '-l' '-1' '-v' '-w' '/tmp/graph12595458018205025736.weights' '-q' '0' '-e' '0.001'
[2023-03-18 23:35:20] [INFO ] Decomposing Gal with order
[2023-03-18 23:35:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 23:35:20] [INFO ] Removed a total of 131 redundant transitions.
[2023-03-18 23:35:20] [INFO ] Flatten gal took : 50 ms
[2023-03-18 23:35:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 83 labels/synchronizations in 10 ms.
[2023-03-18 23:35:20] [INFO ] Time to serialize gal into /tmp/LTL4037367264211076938.gal : 3 ms
[2023-03-18 23:35:20] [INFO ] Time to serialize properties into /tmp/LTL14240630282950545266.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4037367264211076938.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14240630282950545266.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G("((i0.u0.s1<1)||(i0.u20.l2218<1))")))
Formula 0 simplified : F!"((i0.u0.s1<1)||(i0.u20.l2218<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6940641091056741821
[2023-03-18 23:35:35] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6940641091056741821
Running compilation step : cd /tmp/ltsmin6940641091056741821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 219 ms.
Running link step : cd /tmp/ltsmin6940641091056741821;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin6940641091056741821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((LTLAPp0==true))' '--buchi-type=spotba'
LTSmin run took 3009 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-01 finished in 96922 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)))||(X(p1)&&F(p2))))'
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 346/346 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 145 transition count 212
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 145 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 145 transition count 211
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 39 place count 133 transition count 198
Iterating global reduction 1 with 12 rules applied. Total rules applied 51 place count 133 transition count 198
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 133 transition count 191
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 69 place count 122 transition count 171
Iterating global reduction 2 with 11 rules applied. Total rules applied 80 place count 122 transition count 171
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 87 place count 122 transition count 164
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 90 place count 119 transition count 161
Iterating global reduction 3 with 3 rules applied. Total rules applied 93 place count 119 transition count 161
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 96 place count 116 transition count 158
Iterating global reduction 3 with 3 rules applied. Total rules applied 99 place count 116 transition count 158
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 100 place count 115 transition count 157
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 115 transition count 157
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 102 place count 114 transition count 154
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 114 transition count 154
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 104 place count 113 transition count 153
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 113 transition count 153
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 106 place count 112 transition count 152
Iterating global reduction 3 with 1 rules applied. Total rules applied 107 place count 112 transition count 152
Applied a total of 107 rules in 21 ms. Remains 112 /158 variables (removed 46) and now considering 152/346 (removed 194) transitions.
// Phase 1: matrix 152 rows 112 cols
[2023-03-18 23:35:39] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 23:35:39] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-18 23:35:39] [INFO ] Invariant cache hit.
[2023-03-18 23:35:39] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-18 23:35:39] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2023-03-18 23:35:39] [INFO ] Invariant cache hit.
[2023-03-18 23:35:39] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 112/158 places, 152/346 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 347 ms. Remains : 112/158 places, 152/346 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (LT s1 1) (LT s107 1) (AND (GEQ s1 1) (GEQ s106 1))), p1:(OR (LT s1 1) (LT s106 1)), p0:(AND (GEQ s1 1) (GEQ s107 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 235 ms.
Product exploration explored 100000 steps with 50000 reset in 224 ms.
Computed a total of 22 stabilizing places and 28 stable transitions
Graph (complete) has 378 edges and 112 vertex of which 111 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 p2 p1 (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X p1), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 5 factoid took 84 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-02 finished in 1089 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((p1&&G(p2))))))'
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 346/346 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 145 transition count 212
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 145 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 145 transition count 211
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 39 place count 133 transition count 198
Iterating global reduction 1 with 12 rules applied. Total rules applied 51 place count 133 transition count 198
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 57 place count 133 transition count 192
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 68 place count 122 transition count 172
Iterating global reduction 2 with 11 rules applied. Total rules applied 79 place count 122 transition count 172
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 86 place count 122 transition count 165
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 89 place count 119 transition count 162
Iterating global reduction 3 with 3 rules applied. Total rules applied 92 place count 119 transition count 162
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 95 place count 116 transition count 159
Iterating global reduction 3 with 3 rules applied. Total rules applied 98 place count 116 transition count 159
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 100 place count 114 transition count 157
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 114 transition count 157
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 105 place count 114 transition count 154
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 107 place count 112 transition count 150
Iterating global reduction 4 with 2 rules applied. Total rules applied 109 place count 112 transition count 150
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 110 place count 111 transition count 149
Iterating global reduction 4 with 1 rules applied. Total rules applied 111 place count 111 transition count 149
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 112 place count 110 transition count 148
Iterating global reduction 4 with 1 rules applied. Total rules applied 113 place count 110 transition count 148
Applied a total of 113 rules in 40 ms. Remains 110 /158 variables (removed 48) and now considering 148/346 (removed 198) transitions.
// Phase 1: matrix 148 rows 110 cols
[2023-03-18 23:35:40] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 23:35:40] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-18 23:35:40] [INFO ] Invariant cache hit.
[2023-03-18 23:35:40] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-18 23:35:40] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2023-03-18 23:35:40] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 23:35:40] [INFO ] Invariant cache hit.
[2023-03-18 23:35:40] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/158 places, 148/346 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 474 ms. Remains : 110/158 places, 148/346 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s104 1)), p1:(OR (LT s1 1) (LT s79 1)), p2:(AND (GEQ s1 1) (GEQ s105 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-05 finished in 612 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||(p1 U p2)))))'
Support contains 4 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 346/346 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 146 transition count 213
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 146 transition count 213
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 35 place count 135 transition count 202
Iterating global reduction 0 with 11 rules applied. Total rules applied 46 place count 135 transition count 202
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 53 place count 135 transition count 195
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 63 place count 125 transition count 176
Iterating global reduction 1 with 10 rules applied. Total rules applied 73 place count 125 transition count 176
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 80 place count 125 transition count 169
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 83 place count 122 transition count 166
Iterating global reduction 2 with 3 rules applied. Total rules applied 86 place count 122 transition count 166
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 89 place count 119 transition count 163
Iterating global reduction 2 with 3 rules applied. Total rules applied 92 place count 119 transition count 163
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 93 place count 118 transition count 162
Iterating global reduction 2 with 1 rules applied. Total rules applied 94 place count 118 transition count 162
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 97 place count 118 transition count 159
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 98 place count 117 transition count 158
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 117 transition count 158
Applied a total of 99 rules in 14 ms. Remains 117 /158 variables (removed 41) and now considering 158/346 (removed 188) transitions.
// Phase 1: matrix 158 rows 117 cols
[2023-03-18 23:35:40] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 23:35:40] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-18 23:35:40] [INFO ] Invariant cache hit.
[2023-03-18 23:35:40] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-18 23:35:41] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2023-03-18 23:35:41] [INFO ] Invariant cache hit.
[2023-03-18 23:35:41] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 117/158 places, 158/346 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 374 ms. Remains : 117/158 places, 158/346 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p0 p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s111 1)), p2:(AND (GEQ s1 1) (GEQ s112 1)), p1:(AND (GEQ s1 1) (GEQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-08 finished in 514 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)&&F(G(p1)))) U p2))'
Support contains 5 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 346/346 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 146 transition count 213
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 146 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 146 transition count 212
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 37 place count 134 transition count 199
Iterating global reduction 1 with 12 rules applied. Total rules applied 49 place count 134 transition count 199
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 57 place count 134 transition count 191
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 68 place count 123 transition count 171
Iterating global reduction 2 with 11 rules applied. Total rules applied 79 place count 123 transition count 171
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 86 place count 123 transition count 164
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 89 place count 120 transition count 161
Iterating global reduction 3 with 3 rules applied. Total rules applied 92 place count 120 transition count 161
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 95 place count 117 transition count 158
Iterating global reduction 3 with 3 rules applied. Total rules applied 98 place count 117 transition count 158
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 99 place count 116 transition count 157
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 116 transition count 157
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 101 place count 115 transition count 154
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 115 transition count 154
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 103 place count 114 transition count 153
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 114 transition count 153
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 105 place count 113 transition count 152
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 113 transition count 152
Applied a total of 106 rules in 28 ms. Remains 113 /158 variables (removed 45) and now considering 152/346 (removed 194) transitions.
// Phase 1: matrix 152 rows 113 cols
[2023-03-18 23:35:41] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 23:35:41] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-18 23:35:41] [INFO ] Invariant cache hit.
[2023-03-18 23:35:41] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-18 23:35:41] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2023-03-18 23:35:41] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 23:35:41] [INFO ] Invariant cache hit.
[2023-03-18 23:35:41] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/158 places, 152/346 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 387 ms. Remains : 113/158 places, 152/346 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p2), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s107 1)), p0:(AND (GEQ s1 1) (GEQ s108 1)), p1:(AND (GEQ s15 1) (GEQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-10 finished in 597 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(G(p0)))'
Support contains 2 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 346/346 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 144 transition count 188
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 144 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 144 transition count 187
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 42 place count 131 transition count 173
Iterating global reduction 1 with 13 rules applied. Total rules applied 55 place count 131 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 63 place count 131 transition count 165
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 75 place count 119 transition count 142
Iterating global reduction 2 with 12 rules applied. Total rules applied 87 place count 119 transition count 142
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 95 place count 119 transition count 134
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 99 place count 115 transition count 130
Iterating global reduction 3 with 4 rules applied. Total rules applied 103 place count 115 transition count 130
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 107 place count 111 transition count 126
Iterating global reduction 3 with 4 rules applied. Total rules applied 111 place count 111 transition count 126
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 114 place count 108 transition count 123
Iterating global reduction 3 with 3 rules applied. Total rules applied 117 place count 108 transition count 123
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 119 place count 108 transition count 121
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 121 place count 106 transition count 119
Iterating global reduction 4 with 2 rules applied. Total rules applied 123 place count 106 transition count 119
Applied a total of 123 rules in 18 ms. Remains 106 /158 variables (removed 52) and now considering 119/346 (removed 227) transitions.
// Phase 1: matrix 119 rows 106 cols
[2023-03-18 23:35:41] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 23:35:41] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-18 23:35:41] [INFO ] Invariant cache hit.
[2023-03-18 23:35:42] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-18 23:35:42] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2023-03-18 23:35:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 23:35:42] [INFO ] Invariant cache hit.
[2023-03-18 23:35:42] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/158 places, 119/346 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 296 ms. Remains : 106/158 places, 119/346 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m64-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s57 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d2m64-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m64-LTLFireability-13 finished in 354 ms.
All properties solved by simple procedures.
Total runtime 118551 ms.

BK_STOP 1679182542383

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-d2m64"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is SieveSingleMsgMbox-PT-d2m64, 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 r421-tajo-167905975300484"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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