Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r519-tall-167987244700052.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is Anderson-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r519-tall-167987244700052
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 13K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 1.3M Mar 31 16:48 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 Anderson-PT-10-LTLFireability-00
FORMULA_NAME Anderson-PT-10-LTLFireability-01
FORMULA_NAME Anderson-PT-10-LTLFireability-02
FORMULA_NAME Anderson-PT-10-LTLFireability-03
FORMULA_NAME Anderson-PT-10-LTLFireability-04
FORMULA_NAME Anderson-PT-10-LTLFireability-05
FORMULA_NAME Anderson-PT-10-LTLFireability-06
FORMULA_NAME Anderson-PT-10-LTLFireability-07
FORMULA_NAME Anderson-PT-10-LTLFireability-08
FORMULA_NAME Anderson-PT-10-LTLFireability-09
FORMULA_NAME Anderson-PT-10-LTLFireability-10
FORMULA_NAME Anderson-PT-10-LTLFireability-11
FORMULA_NAME Anderson-PT-10-LTLFireability-12
FORMULA_NAME Anderson-PT-10-LTLFireability-13
FORMULA_NAME Anderson-PT-10-LTLFireability-14
FORMULA_NAME Anderson-PT-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680831810788

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-10
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-07 01:43:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 01:43:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 01:43:32] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2023-04-07 01:43:32] [INFO ] Transformed 621 places.
[2023-04-07 01:43:32] [INFO ] Transformed 2480 transitions.
[2023-04-07 01:43:32] [INFO ] Found NUPN structural information;
[2023-04-07 01:43:32] [INFO ] Parsed PT model containing 621 places and 2480 transitions and 9560 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA Anderson-PT-10-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 2480/2480 transitions.
Discarding 163 places :
Symmetric choice reduction at 0 with 163 rule applications. Total rules 163 place count 458 transition count 1003
Iterating global reduction 0 with 163 rules applied. Total rules applied 326 place count 458 transition count 1003
Applied a total of 326 rules in 98 ms. Remains 458 /621 variables (removed 163) and now considering 1003/2480 (removed 1477) transitions.
// Phase 1: matrix 1003 rows 458 cols
[2023-04-07 01:43:32] [INFO ] Computed 23 invariants in 46 ms
[2023-04-07 01:43:33] [INFO ] Implicit Places using invariants in 611 ms returned []
[2023-04-07 01:43:33] [INFO ] Invariant cache hit.
[2023-04-07 01:43:33] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 01:43:34] [INFO ] Implicit Places using invariants and state equation in 1456 ms returned []
Implicit Place search using SMT with State Equation took 2091 ms to find 0 implicit places.
[2023-04-07 01:43:34] [INFO ] Invariant cache hit.
[2023-04-07 01:43:35] [INFO ] Dead Transitions using invariants and state equation in 603 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 458/621 places, 1003/2480 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2794 ms. Remains : 458/621 places, 1003/2480 transitions.
Support contains 37 out of 458 places after structural reductions.
[2023-04-07 01:43:35] [INFO ] Flatten gal took : 99 ms
[2023-04-07 01:43:35] [INFO ] Flatten gal took : 58 ms
[2023-04-07 01:43:35] [INFO ] Input system was already deterministic with 1003 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 448 ms. (steps per millisecond=22 ) properties (out of 20) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-04-07 01:43:36] [INFO ] Invariant cache hit.
[2023-04-07 01:43:36] [INFO ] [Real]Absence check using 12 positive place invariants in 13 ms returned sat
[2023-04-07 01:43:36] [INFO ] [Real]Absence check using 12 positive and 11 generalized place invariants in 14 ms returned sat
[2023-04-07 01:43:37] [INFO ] After 969ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-04-07 01:43:37] [INFO ] [Nat]Absence check using 12 positive place invariants in 16 ms returned sat
[2023-04-07 01:43:37] [INFO ] [Nat]Absence check using 12 positive and 11 generalized place invariants in 15 ms returned sat
[2023-04-07 01:43:39] [INFO ] After 1643ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-04-07 01:43:39] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 01:43:40] [INFO ] After 1639ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-04-07 01:43:42] [INFO ] After 3283ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 1542 ms.
[2023-04-07 01:43:44] [INFO ] After 6829ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 1 properties in 68 ms.
Support contains 24 out of 458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 1003/1003 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 458 transition count 913
Deduced a syphon composed of 90 places in 2 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 368 transition count 913
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 184 place count 364 transition count 837
Iterating global reduction 0 with 4 rules applied. Total rules applied 188 place count 364 transition count 837
Applied a total of 188 rules in 72 ms. Remains 364 /458 variables (removed 94) and now considering 837/1003 (removed 166) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 364/458 places, 837/1003 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 13) seen :4
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 837 rows 364 cols
[2023-04-07 01:43:45] [INFO ] Computed 23 invariants in 13 ms
[2023-04-07 01:43:45] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2023-04-07 01:43:45] [INFO ] [Real]Absence check using 12 positive and 11 generalized place invariants in 11 ms returned sat
[2023-04-07 01:43:45] [INFO ] After 575ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-04-07 01:43:45] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2023-04-07 01:43:45] [INFO ] [Nat]Absence check using 12 positive and 11 generalized place invariants in 14 ms returned sat
[2023-04-07 01:43:46] [INFO ] After 751ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-04-07 01:43:46] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 01:43:47] [INFO ] After 541ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-04-07 01:43:47] [INFO ] After 1132ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 468 ms.
[2023-04-07 01:43:48] [INFO ] After 2516ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 70 ms.
Support contains 13 out of 364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 837/837 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 359 transition count 742
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 359 transition count 742
Applied a total of 10 rules in 28 ms. Remains 359 /364 variables (removed 5) and now considering 742/837 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 359/364 places, 742/837 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 334161 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :{0=1}
Probabilistic random walk after 334161 steps, saw 240928 distinct states, run finished after 3002 ms. (steps per millisecond=111 ) properties seen :1
Running SMT prover for 6 properties.
// Phase 1: matrix 742 rows 359 cols
[2023-04-07 01:43:51] [INFO ] Computed 23 invariants in 10 ms
[2023-04-07 01:43:52] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2023-04-07 01:43:52] [INFO ] [Real]Absence check using 12 positive and 11 generalized place invariants in 11 ms returned sat
[2023-04-07 01:43:52] [INFO ] After 442ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 01:43:52] [INFO ] [Nat]Absence check using 12 positive place invariants in 9 ms returned sat
[2023-04-07 01:43:52] [INFO ] [Nat]Absence check using 12 positive and 11 generalized place invariants in 12 ms returned sat
[2023-04-07 01:43:53] [INFO ] After 603ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-07 01:43:53] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 01:43:53] [INFO ] After 565ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-07 01:43:54] [INFO ] After 974ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 244 ms.
[2023-04-07 01:43:54] [INFO ] After 1970ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 18 ms.
Support contains 11 out of 359 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 359/359 places, 742/742 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 358 transition count 723
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 358 transition count 723
Applied a total of 2 rules in 26 ms. Remains 358 /359 variables (removed 1) and now considering 723/742 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 358/359 places, 723/742 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 345599 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :{}
Probabilistic random walk after 345599 steps, saw 252774 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 723 rows 358 cols
[2023-04-07 01:43:57] [INFO ] Computed 23 invariants in 4 ms
[2023-04-07 01:43:57] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2023-04-07 01:43:57] [INFO ] [Real]Absence check using 12 positive and 11 generalized place invariants in 11 ms returned sat
[2023-04-07 01:43:58] [INFO ] After 349ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 01:43:58] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2023-04-07 01:43:58] [INFO ] [Nat]Absence check using 12 positive and 11 generalized place invariants in 11 ms returned sat
[2023-04-07 01:43:58] [INFO ] After 556ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-07 01:43:58] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 01:43:59] [INFO ] After 427ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-07 01:43:59] [INFO ] After 824ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 298 ms.
[2023-04-07 01:44:00] [INFO ] After 1800ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 61 ms.
Support contains 11 out of 358 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 723/723 transitions.
Applied a total of 0 rules in 15 ms. Remains 358 /358 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 358/358 places, 723/723 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 723/723 transitions.
Applied a total of 0 rules in 14 ms. Remains 358 /358 variables (removed 0) and now considering 723/723 (removed 0) transitions.
[2023-04-07 01:44:00] [INFO ] Invariant cache hit.
[2023-04-07 01:44:00] [INFO ] Implicit Places using invariants in 386 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 390 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 357/358 places, 723/723 transitions.
Drop transitions removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 93 rules applied. Total rules applied 93 place count 357 transition count 630
Reduce places removed 93 places and 0 transitions.
Iterating post reduction 1 with 93 rules applied. Total rules applied 186 place count 264 transition count 630
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 193 place count 264 transition count 623
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 200 place count 257 transition count 623
Applied a total of 200 rules in 27 ms. Remains 257 /357 variables (removed 100) and now considering 623/723 (removed 100) transitions.
// Phase 1: matrix 623 rows 257 cols
[2023-04-07 01:44:00] [INFO ] Computed 22 invariants in 6 ms
[2023-04-07 01:44:00] [INFO ] Implicit Places using invariants in 293 ms returned []
[2023-04-07 01:44:00] [INFO ] Invariant cache hit.
[2023-04-07 01:44:00] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 01:44:01] [INFO ] Implicit Places using invariants and state equation in 654 ms returned []
Implicit Place search using SMT with State Equation took 949 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 257/358 places, 623/723 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1380 ms. Remains : 257/358 places, 623/723 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 368976 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :{1=1, 2=1, 5=1}
Probabilistic random walk after 368976 steps, saw 263342 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :3
Running SMT prover for 3 properties.
[2023-04-07 01:44:04] [INFO ] Invariant cache hit.
[2023-04-07 01:44:04] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 01:44:04] [INFO ] [Real]Absence check using 12 positive and 10 generalized place invariants in 8 ms returned sat
[2023-04-07 01:44:05] [INFO ] After 318ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 01:44:05] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 01:44:05] [INFO ] [Nat]Absence check using 12 positive and 10 generalized place invariants in 14 ms returned sat
[2023-04-07 01:44:05] [INFO ] After 276ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 01:44:05] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 01:44:05] [INFO ] After 160ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 01:44:05] [INFO ] After 309ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 94 ms.
[2023-04-07 01:44:05] [INFO ] After 769ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 13 ms.
Support contains 7 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 623/623 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 254 transition count 566
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 254 transition count 566
Applied a total of 6 rules in 13 ms. Remains 254 /257 variables (removed 3) and now considering 566/623 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 254/257 places, 566/623 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 411459 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :{}
Probabilistic random walk after 411459 steps, saw 305897 distinct states, run finished after 3001 ms. (steps per millisecond=137 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 566 rows 254 cols
[2023-04-07 01:44:09] [INFO ] Computed 22 invariants in 9 ms
[2023-04-07 01:44:09] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 01:44:09] [INFO ] [Real]Absence check using 12 positive and 10 generalized place invariants in 7 ms returned sat
[2023-04-07 01:44:09] [INFO ] After 296ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 01:44:09] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-04-07 01:44:09] [INFO ] [Nat]Absence check using 12 positive and 10 generalized place invariants in 7 ms returned sat
[2023-04-07 01:44:09] [INFO ] After 236ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 01:44:09] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 01:44:10] [INFO ] After 169ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 01:44:10] [INFO ] After 343ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 107 ms.
[2023-04-07 01:44:10] [INFO ] After 772ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 7 ms.
Support contains 7 out of 254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 566/566 transitions.
Applied a total of 0 rules in 19 ms. Remains 254 /254 variables (removed 0) and now considering 566/566 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 254/254 places, 566/566 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 566/566 transitions.
Applied a total of 0 rules in 8 ms. Remains 254 /254 variables (removed 0) and now considering 566/566 (removed 0) transitions.
[2023-04-07 01:44:10] [INFO ] Invariant cache hit.
[2023-04-07 01:44:10] [INFO ] Implicit Places using invariants in 174 ms returned []
[2023-04-07 01:44:10] [INFO ] Invariant cache hit.
[2023-04-07 01:44:10] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 01:44:11] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 755 ms to find 0 implicit places.
[2023-04-07 01:44:11] [INFO ] Redundant transitions in 39 ms returned []
[2023-04-07 01:44:11] [INFO ] Invariant cache hit.
[2023-04-07 01:44:11] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1090 ms. Remains : 254/254 places, 566/566 transitions.
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 100 Pre rules applied. Total rules applied 0 place count 254 transition count 466
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 154 transition count 466
Applied a total of 200 rules in 10 ms. Remains 154 /254 variables (removed 100) and now considering 466/566 (removed 100) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 466 rows 154 cols
[2023-04-07 01:44:11] [INFO ] Computed 22 invariants in 3 ms
[2023-04-07 01:44:11] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 01:44:11] [INFO ] [Real]Absence check using 12 positive and 10 generalized place invariants in 8 ms returned sat
[2023-04-07 01:44:11] [INFO ] After 228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 01:44:11] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 01:44:11] [INFO ] [Nat]Absence check using 12 positive and 10 generalized place invariants in 16 ms returned sat
[2023-04-07 01:44:11] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 01:44:12] [INFO ] After 249ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-04-07 01:44:12] [INFO ] After 380ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA Anderson-PT-10-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0)) U p1)))'
Support contains 4 out of 458 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 458/458 places, 1003/1003 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 458 transition count 913
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 368 transition count 913
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 195 place count 353 transition count 628
Iterating global reduction 0 with 15 rules applied. Total rules applied 210 place count 353 transition count 628
Applied a total of 210 rules in 67 ms. Remains 353 /458 variables (removed 105) and now considering 628/1003 (removed 375) transitions.
// Phase 1: matrix 628 rows 353 cols
[2023-04-07 01:44:12] [INFO ] Computed 23 invariants in 11 ms
[2023-04-07 01:44:12] [INFO ] Implicit Places using invariants in 396 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 399 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 352/458 places, 628/1003 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 352 transition count 530
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 196 place count 254 transition count 530
Applied a total of 196 rules in 26 ms. Remains 254 /352 variables (removed 98) and now considering 530/628 (removed 98) transitions.
// Phase 1: matrix 530 rows 254 cols
[2023-04-07 01:44:12] [INFO ] Computed 22 invariants in 6 ms
[2023-04-07 01:44:13] [INFO ] Implicit Places using invariants in 204 ms returned []
[2023-04-07 01:44:13] [INFO ] Invariant cache hit.
[2023-04-07 01:44:13] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 01:44:13] [INFO ] Implicit Places using invariants and state equation in 790 ms returned []
Implicit Place search using SMT with State Equation took 1001 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 254/458 places, 530/1003 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1494 ms. Remains : 254/458 places, 530/1003 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 238 ms :[(NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s10 1) (EQ s32 1)), p0:(AND (EQ s22 1) (EQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 280 ms.
Stack based approach found an accepted trace after 61 steps with 0 reset with depth 62 and stack size 62 in 0 ms.
FORMULA Anderson-PT-10-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-02 finished in 2072 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 6 out of 458 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 458/458 places, 1003/1003 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 458 transition count 913
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 368 transition count 913
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 194 place count 354 transition count 647
Iterating global reduction 0 with 14 rules applied. Total rules applied 208 place count 354 transition count 647
Applied a total of 208 rules in 29 ms. Remains 354 /458 variables (removed 104) and now considering 647/1003 (removed 356) transitions.
// Phase 1: matrix 647 rows 354 cols
[2023-04-07 01:44:14] [INFO ] Computed 23 invariants in 9 ms
[2023-04-07 01:44:14] [INFO ] Implicit Places using invariants in 412 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 414 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 353/458 places, 647/1003 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 97 place count 353 transition count 550
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 194 place count 256 transition count 550
Applied a total of 194 rules in 12 ms. Remains 256 /353 variables (removed 97) and now considering 550/647 (removed 97) transitions.
// Phase 1: matrix 550 rows 256 cols
[2023-04-07 01:44:14] [INFO ] Computed 22 invariants in 3 ms
[2023-04-07 01:44:15] [INFO ] Implicit Places using invariants in 208 ms returned []
[2023-04-07 01:44:15] [INFO ] Invariant cache hit.
[2023-04-07 01:44:15] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 01:44:15] [INFO ] Implicit Places using invariants and state equation in 863 ms returned []
Implicit Place search using SMT with State Equation took 1074 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 256/458 places, 550/1003 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1530 ms. Remains : 256/458 places, 550/1003 transitions.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ 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}]], initial=0, aps=[p0:(AND (EQ s25 1) (EQ s38 1)), p1:(OR (NEQ s15 1) (NEQ s37 1) (AND (EQ s24 1) (EQ s35 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 160 ms.
Stack based approach found an accepted trace after 40 steps with 0 reset with depth 41 and stack size 41 in 0 ms.
FORMULA Anderson-PT-10-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-04 finished in 1813 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(p1)))'
Support contains 4 out of 458 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 458/458 places, 1003/1003 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 443 transition count 718
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 443 transition count 718
Applied a total of 30 rules in 11 ms. Remains 443 /458 variables (removed 15) and now considering 718/1003 (removed 285) transitions.
// Phase 1: matrix 718 rows 443 cols
[2023-04-07 01:44:16] [INFO ] Computed 23 invariants in 5 ms
[2023-04-07 01:44:16] [INFO ] Implicit Places using invariants in 362 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 363 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/458 places, 718/1003 transitions.
Applied a total of 0 rules in 5 ms. Remains 442 /442 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 381 ms. Remains : 442/458 places, 718/1003 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(OR (EQ s13 0) (EQ s39 0)), p1:(OR (EQ s27 0) (EQ s31 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 141 ms.
Product exploration explored 100000 steps with 0 reset in 190 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X p0), (X (AND p1 p0)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (AND p1 p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 84 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Finished Best-First random walk after 797 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=398 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X p0), (X (AND p1 p0)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (AND p1 p0)))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 8 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-10-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-10-LTLFireability-05 finished in 1155 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(!p0) U !p1) U X((p2||X(p0)))))'
Support contains 5 out of 458 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 458/458 places, 1003/1003 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 443 transition count 718
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 443 transition count 718
Applied a total of 30 rules in 21 ms. Remains 443 /458 variables (removed 15) and now considering 718/1003 (removed 285) transitions.
// Phase 1: matrix 718 rows 443 cols
[2023-04-07 01:44:17] [INFO ] Computed 23 invariants in 7 ms
[2023-04-07 01:44:17] [INFO ] Implicit Places using invariants in 336 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 337 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/458 places, 718/1003 transitions.
Applied a total of 0 rules in 6 ms. Remains 442 /442 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 366 ms. Remains : 442/458 places, 718/1003 transitions.
Stuttering acceptance computed with spot in 581 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, (AND p1 (NOT p0)), p0, p1]
Running random walk in product with property : Anderson-PT-10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 6}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 7}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 8}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 9}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 10}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 9}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 4}], [{ cond=(NOT p0), acceptance={} source=9 dest: 11}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=10 dest: 12}], [{ cond=p0, acceptance={} source=11 dest: 5}, { cond=(NOT p0), acceptance={} source=11 dest: 11}], [{ cond=(AND p1 p0), acceptance={0} source=12 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={0} source=12 dest: 11}, { cond=(AND p1 (NOT p0)), acceptance={0} source=12 dest: 12}]], initial=0, aps=[p1:(AND (EQ s28 1) (EQ s39 1)), p0:(AND (EQ s27 1) (EQ s33 1)), p2:(AND (EQ s12 1) (EQ s33 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, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 160 ms.
Stack based approach found an accepted trace after 209 steps with 0 reset with depth 210 and stack size 210 in 1 ms.
FORMULA Anderson-PT-10-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-07 finished in 1137 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||(!p0&&F(G(!p1)))))'
Support contains 6 out of 458 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 458/458 places, 1003/1003 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 458 transition count 913
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 368 transition count 913
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 195 place count 353 transition count 628
Iterating global reduction 0 with 15 rules applied. Total rules applied 210 place count 353 transition count 628
Applied a total of 210 rules in 26 ms. Remains 353 /458 variables (removed 105) and now considering 628/1003 (removed 375) transitions.
// Phase 1: matrix 628 rows 353 cols
[2023-04-07 01:44:18] [INFO ] Computed 23 invariants in 8 ms
[2023-04-07 01:44:18] [INFO ] Implicit Places using invariants in 369 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 371 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 352/458 places, 628/1003 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 352 transition count 530
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 196 place count 254 transition count 530
Applied a total of 196 rules in 10 ms. Remains 254 /352 variables (removed 98) and now considering 530/628 (removed 98) transitions.
// Phase 1: matrix 530 rows 254 cols
[2023-04-07 01:44:18] [INFO ] Computed 22 invariants in 3 ms
[2023-04-07 01:44:19] [INFO ] Implicit Places using invariants in 183 ms returned []
[2023-04-07 01:44:19] [INFO ] Invariant cache hit.
[2023-04-07 01:44:19] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 01:44:19] [INFO ] Implicit Places using invariants and state equation in 628 ms returned []
Implicit Place search using SMT with State Equation took 813 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 254/458 places, 530/1003 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1221 ms. Remains : 254/458 places, 530/1003 transitions.
Stuttering acceptance computed with spot in 115 ms :[p0, true, (AND p0 p1), p1]
Running random walk in product with property : Anderson-PT-10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (NOT (AND (EQ s18 1) (EQ s36 1))) (EQ s28 1) (EQ s41 1)), p1:(AND (EQ s26 1) (EQ s81 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 147 ms.
Product exploration explored 100000 steps with 0 reset in 256 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 80 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND p0 p1), p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-04-07 01:44:20] [INFO ] Invariant cache hit.
[2023-04-07 01:44:20] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 01:44:20] [INFO ] [Real]Absence check using 12 positive and 10 generalized place invariants in 7 ms returned sat
[2023-04-07 01:44:20] [INFO ] After 218ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:44:20] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 01:44:20] [INFO ] [Nat]Absence check using 12 positive and 10 generalized place invariants in 8 ms returned sat
[2023-04-07 01:44:20] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 01:44:20] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 01:44:21] [INFO ] After 88ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 01:44:21] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-04-07 01:44:21] [INFO ] After 405ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 530/530 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 254 transition count 528
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 252 transition count 528
Applied a total of 4 rules in 18 ms. Remains 252 /254 variables (removed 2) and now considering 528/530 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 252/254 places, 528/530 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1075200 steps, run timeout after 3001 ms. (steps per millisecond=358 ) properties seen :{}
Probabilistic random walk after 1075200 steps, saw 769659 distinct states, run finished after 3001 ms. (steps per millisecond=358 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 528 rows 252 cols
[2023-04-07 01:44:24] [INFO ] Computed 22 invariants in 6 ms
[2023-04-07 01:44:24] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 01:44:24] [INFO ] [Real]Absence check using 12 positive and 10 generalized place invariants in 8 ms returned sat
[2023-04-07 01:44:24] [INFO ] After 219ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:44:24] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 01:44:24] [INFO ] [Nat]Absence check using 12 positive and 10 generalized place invariants in 8 ms returned sat
[2023-04-07 01:44:24] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 01:44:24] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 01:44:24] [INFO ] After 67ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 01:44:24] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-04-07 01:44:24] [INFO ] After 338ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 528/528 transitions.
Applied a total of 0 rules in 6 ms. Remains 252 /252 variables (removed 0) and now considering 528/528 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 252/252 places, 528/528 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 528/528 transitions.
Applied a total of 0 rules in 6 ms. Remains 252 /252 variables (removed 0) and now considering 528/528 (removed 0) transitions.
[2023-04-07 01:44:24] [INFO ] Invariant cache hit.
[2023-04-07 01:44:24] [INFO ] Implicit Places using invariants in 186 ms returned []
[2023-04-07 01:44:24] [INFO ] Invariant cache hit.
[2023-04-07 01:44:25] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 01:44:25] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 770 ms to find 0 implicit places.
[2023-04-07 01:44:25] [INFO ] Redundant transitions in 12 ms returned []
[2023-04-07 01:44:25] [INFO ] Invariant cache hit.
[2023-04-07 01:44:25] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1035 ms. Remains : 252/252 places, 528/528 transitions.
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 100 Pre rules applied. Total rules applied 0 place count 252 transition count 428
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 152 transition count 428
Applied a total of 200 rules in 7 ms. Remains 152 /252 variables (removed 100) and now considering 428/528 (removed 100) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 428 rows 152 cols
[2023-04-07 01:44:25] [INFO ] Computed 22 invariants in 4 ms
[2023-04-07 01:44:25] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-04-07 01:44:25] [INFO ] [Real]Absence check using 13 positive and 9 generalized place invariants in 7 ms returned sat
[2023-04-07 01:44:25] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:44:26] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-04-07 01:44:26] [INFO ] [Nat]Absence check using 13 positive and 9 generalized place invariants in 7 ms returned sat
[2023-04-07 01:44:26] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 01:44:26] [INFO ] After 132ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-04-07 01:44:26] [INFO ] After 201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 104 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND p0 p1), p1]
Stuttering acceptance computed with spot in 67 ms :[(AND p0 p1), p1]
Support contains 6 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 530/530 transitions.
Applied a total of 0 rules in 12 ms. Remains 254 /254 variables (removed 0) and now considering 530/530 (removed 0) transitions.
// Phase 1: matrix 530 rows 254 cols
[2023-04-07 01:44:26] [INFO ] Computed 22 invariants in 4 ms
[2023-04-07 01:44:26] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-04-07 01:44:26] [INFO ] Invariant cache hit.
[2023-04-07 01:44:26] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 01:44:27] [INFO ] Implicit Places using invariants and state equation in 625 ms returned []
Implicit Place search using SMT with State Equation took 823 ms to find 0 implicit places.
[2023-04-07 01:44:27] [INFO ] Redundant transitions in 16 ms returned []
[2023-04-07 01:44:27] [INFO ] Invariant cache hit.
[2023-04-07 01:44:27] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1106 ms. Remains : 254/254 places, 530/530 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 73 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND p0 p1), p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-04-07 01:44:27] [INFO ] Invariant cache hit.
[2023-04-07 01:44:27] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 01:44:27] [INFO ] [Real]Absence check using 12 positive and 10 generalized place invariants in 7 ms returned sat
[2023-04-07 01:44:28] [INFO ] After 227ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:44:28] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 01:44:28] [INFO ] [Nat]Absence check using 12 positive and 10 generalized place invariants in 8 ms returned sat
[2023-04-07 01:44:28] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 01:44:28] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 01:44:28] [INFO ] After 82ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 01:44:28] [INFO ] After 125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-04-07 01:44:28] [INFO ] After 371ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 530/530 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 254 transition count 528
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 252 transition count 528
Applied a total of 4 rules in 16 ms. Remains 252 /254 variables (removed 2) and now considering 528/530 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 252/254 places, 528/530 transitions.
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1066478 steps, run timeout after 3001 ms. (steps per millisecond=355 ) properties seen :{}
Probabilistic random walk after 1066478 steps, saw 763597 distinct states, run finished after 3001 ms. (steps per millisecond=355 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 528 rows 252 cols
[2023-04-07 01:44:31] [INFO ] Computed 22 invariants in 9 ms
[2023-04-07 01:44:31] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 01:44:31] [INFO ] [Real]Absence check using 12 positive and 10 generalized place invariants in 10 ms returned sat
[2023-04-07 01:44:31] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:44:31] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 01:44:31] [INFO ] [Nat]Absence check using 12 positive and 10 generalized place invariants in 14 ms returned sat
[2023-04-07 01:44:31] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 01:44:31] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 01:44:31] [INFO ] After 71ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 01:44:31] [INFO ] After 107ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-04-07 01:44:31] [INFO ] After 321ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 528/528 transitions.
Applied a total of 0 rules in 7 ms. Remains 252 /252 variables (removed 0) and now considering 528/528 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 252/252 places, 528/528 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 528/528 transitions.
Applied a total of 0 rules in 6 ms. Remains 252 /252 variables (removed 0) and now considering 528/528 (removed 0) transitions.
[2023-04-07 01:44:32] [INFO ] Invariant cache hit.
[2023-04-07 01:44:32] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-04-07 01:44:32] [INFO ] Invariant cache hit.
[2023-04-07 01:44:32] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 01:44:32] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 756 ms to find 0 implicit places.
[2023-04-07 01:44:32] [INFO ] Redundant transitions in 3 ms returned []
[2023-04-07 01:44:32] [INFO ] Invariant cache hit.
[2023-04-07 01:44:33] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1016 ms. Remains : 252/252 places, 528/528 transitions.
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 100 Pre rules applied. Total rules applied 0 place count 252 transition count 428
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 152 transition count 428
Applied a total of 200 rules in 10 ms. Remains 152 /252 variables (removed 100) and now considering 428/528 (removed 100) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 428 rows 152 cols
[2023-04-07 01:44:33] [INFO ] Computed 22 invariants in 3 ms
[2023-04-07 01:44:33] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-04-07 01:44:33] [INFO ] [Real]Absence check using 13 positive and 9 generalized place invariants in 8 ms returned sat
[2023-04-07 01:44:33] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 01:44:33] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-04-07 01:44:33] [INFO ] [Nat]Absence check using 13 positive and 9 generalized place invariants in 12 ms returned sat
[2023-04-07 01:44:33] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 01:44:33] [INFO ] After 135ms 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-04-07 01:44:33] [INFO ] After 215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 104 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND p0 p1), p1]
Stuttering acceptance computed with spot in 69 ms :[(AND p0 p1), p1]
Stuttering acceptance computed with spot in 66 ms :[(AND p0 p1), p1]
Product exploration explored 100000 steps with 0 reset in 174 ms.
Product exploration explored 100000 steps with 0 reset in 201 ms.
Support contains 6 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 530/530 transitions.
Applied a total of 0 rules in 5 ms. Remains 254 /254 variables (removed 0) and now considering 530/530 (removed 0) transitions.
// Phase 1: matrix 530 rows 254 cols
[2023-04-07 01:44:34] [INFO ] Computed 22 invariants in 6 ms
[2023-04-07 01:44:34] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-04-07 01:44:34] [INFO ] Invariant cache hit.
[2023-04-07 01:44:34] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 01:44:34] [INFO ] Implicit Places using invariants and state equation in 660 ms returned []
Implicit Place search using SMT with State Equation took 854 ms to find 0 implicit places.
[2023-04-07 01:44:34] [INFO ] Redundant transitions in 14 ms returned []
[2023-04-07 01:44:34] [INFO ] Invariant cache hit.
[2023-04-07 01:44:35] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1122 ms. Remains : 254/254 places, 530/530 transitions.
Treatment of property Anderson-PT-10-LTLFireability-08 finished in 16859 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(X(G(p0))) U (p1||F(p2)))))))'
Support contains 6 out of 458 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 458/458 places, 1003/1003 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 444 transition count 737
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 444 transition count 737
Applied a total of 28 rules in 12 ms. Remains 444 /458 variables (removed 14) and now considering 737/1003 (removed 266) transitions.
// Phase 1: matrix 737 rows 444 cols
[2023-04-07 01:44:35] [INFO ] Computed 23 invariants in 6 ms
[2023-04-07 01:44:35] [INFO ] Implicit Places using invariants in 298 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 300 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 443/458 places, 737/1003 transitions.
Applied a total of 0 rules in 5 ms. Remains 443 /443 variables (removed 0) and now considering 737/737 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 317 ms. Remains : 443/458 places, 737/1003 transitions.
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s11 1) (EQ s36 1)), p2:(AND (EQ s13 1) (EQ s40 1)), p0:(AND (EQ s28 1) (EQ s32 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, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 126 ms.
Stack based approach found an accepted trace after 77 steps with 0 reset with depth 78 and stack size 78 in 0 ms.
FORMULA Anderson-PT-10-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-09 finished in 695 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 458 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 458/458 places, 1003/1003 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 441 transition count 680
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 441 transition count 680
Applied a total of 34 rules in 18 ms. Remains 441 /458 variables (removed 17) and now considering 680/1003 (removed 323) transitions.
// Phase 1: matrix 680 rows 441 cols
[2023-04-07 01:44:36] [INFO ] Computed 23 invariants in 7 ms
[2023-04-07 01:44:36] [INFO ] Implicit Places using invariants in 329 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 330 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 440/458 places, 680/1003 transitions.
Applied a total of 0 rules in 5 ms. Remains 440 /440 variables (removed 0) and now considering 680/680 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 354 ms. Remains : 440/458 places, 680/1003 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-10 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 (EQ s3 1) (EQ s256 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 0 ms.
FORMULA Anderson-PT-10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-10-LTLFireability-10 finished in 469 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 458 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 458/458 places, 1003/1003 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 458 transition count 913
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 368 transition count 913
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 197 place count 351 transition count 590
Iterating global reduction 0 with 17 rules applied. Total rules applied 214 place count 351 transition count 590
Applied a total of 214 rules in 22 ms. Remains 351 /458 variables (removed 107) and now considering 590/1003 (removed 413) transitions.
// Phase 1: matrix 590 rows 351 cols
[2023-04-07 01:44:36] [INFO ] Computed 23 invariants in 9 ms
[2023-04-07 01:44:36] [INFO ] Implicit Places using invariants in 281 ms returned []
[2023-04-07 01:44:36] [INFO ] Invariant cache hit.
[2023-04-07 01:44:37] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 01:44:37] [INFO ] Implicit Places using invariants and state equation in 1134 ms returned []
Implicit Place search using SMT with State Equation took 1417 ms to find 0 implicit places.
[2023-04-07 01:44:37] [INFO ] Redundant transitions in 17 ms returned []
[2023-04-07 01:44:37] [INFO ] Invariant cache hit.
[2023-04-07 01:44:38] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 351/458 places, 590/1003 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1812 ms. Remains : 351/458 places, 590/1003 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-11 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 (EQ s0 1) (EQ s257 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 174 ms.
Stack based approach found an accepted trace after 57 steps with 0 reset with depth 58 and stack size 58 in 0 ms.
FORMULA Anderson-PT-10-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-11 finished in 2033 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(p1&&F(p2)))))'
Support contains 6 out of 458 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 458/458 places, 1003/1003 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 443 transition count 718
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 443 transition count 718
Applied a total of 30 rules in 20 ms. Remains 443 /458 variables (removed 15) and now considering 718/1003 (removed 285) transitions.
// Phase 1: matrix 718 rows 443 cols
[2023-04-07 01:44:38] [INFO ] Computed 23 invariants in 7 ms
[2023-04-07 01:44:38] [INFO ] Implicit Places using invariants in 331 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 332 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/458 places, 718/1003 transitions.
Applied a total of 0 rules in 5 ms. Remains 442 /442 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 357 ms. Remains : 442/458 places, 718/1003 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Anderson-PT-10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s274 1)), p1:(OR (EQ s18 0) (EQ s38 0)), p2:(AND (EQ s13 1) (EQ s35 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][false, false, false, false]]
Product exploration explored 100000 steps with 17 reset in 167 ms.
Stack based approach found an accepted trace after 77 steps with 0 reset with depth 78 and stack size 78 in 1 ms.
FORMULA Anderson-PT-10-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-14 finished in 682 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||(!p0&&F(G(!p1)))))'
[2023-04-07 01:44:39] [INFO ] Flatten gal took : 51 ms
[2023-04-07 01:44:39] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-04-07 01:44:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 458 places, 1003 transitions and 3832 arcs took 6 ms.
Total runtime 67247 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Anderson-PT-10
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/367
LTLFireability

BK_STOP 1680831955576

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

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 3/32 Anderson-PT-10-LTLFireability-08 181637 m, 36327 m/sec, 201911 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 5/32 Anderson-PT-10-LTLFireability-08 361096 m, 35891 m/sec, 402092 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3600 7/32 Anderson-PT-10-LTLFireability-08 542091 m, 36199 m/sec, 603856 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3600 9/32 Anderson-PT-10-LTLFireability-08 722924 m, 36166 m/sec, 805469 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3600 11/32 Anderson-PT-10-LTLFireability-08 901530 m, 35721 m/sec, 1005108 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3600 14/32 Anderson-PT-10-LTLFireability-08 1078862 m, 35466 m/sec, 1203710 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3600 16/32 Anderson-PT-10-LTLFireability-08 1255394 m, 35306 m/sec, 1401954 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3600 18/32 Anderson-PT-10-LTLFireability-08 1434035 m, 35728 m/sec, 1602334 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3600 20/32 Anderson-PT-10-LTLFireability-08 1610820 m, 35357 m/sec, 1800862 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3600 22/32 Anderson-PT-10-LTLFireability-08 1788294 m, 35494 m/sec, 1999605 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3600 24/32 Anderson-PT-10-LTLFireability-08 1966552 m, 35651 m/sec, 2199852 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3600 26/32 Anderson-PT-10-LTLFireability-08 2144309 m, 35551 m/sec, 2399868 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/3600 28/32 Anderson-PT-10-LTLFireability-08 2319598 m, 35057 m/sec, 2596960 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/3600 30/32 Anderson-PT-10-LTLFireability-08 2494452 m, 34970 m/sec, 2794091 t fired, .

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

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

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

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

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


Time elapsed: 75 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is Anderson-PT-10, 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 r519-tall-167987244700052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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