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.r263-smll-167863537700108.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 NeighborGrid-PT-d5n4m1t35, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863537700108
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 59M
-rw-r--r-- 1 mcc users 7.6K Feb 26 09:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 09:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 09:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 09:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 10:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 26 10:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 10:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 26 10:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rwxr-xr-x 1 mcc users 59M Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLFireability-00
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLFireability-01
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLFireability-02
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLFireability-03
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLFireability-04
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLFireability-05
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLFireability-06
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLFireability-07
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLFireability-08
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLFireability-09
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLFireability-10
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLFireability-11
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLFireability-12
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLFireability-13
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLFireability-14
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678719507734

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=NeighborGrid-PT-d5n4m1t35
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-13 14:58:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 14:58:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 14:58:33] [INFO ] Load time of PNML (sax parser for PT used): 2520 ms
[2023-03-13 14:58:33] [INFO ] Transformed 1024 places.
[2023-03-13 14:58:34] [INFO ] Transformed 196608 transitions.
[2023-03-13 14:58:34] [INFO ] Parsed PT model containing 1024 places and 196608 transitions and 393216 arcs in 3046 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 48 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA NeighborGrid-PT-d5n4m1t35-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d5n4m1t35-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d5n4m1t35-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 8716 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
// Phase 1: matrix 196608 rows 1024 cols
[2023-03-13 14:58:47] [INFO ] Computed 1 place invariants in 3946 ms
[2023-03-13 14:58:48] [INFO ] Implicit Places using invariants in 4506 ms returned []
Implicit Place search using SMT only with invariants took 4541 ms to find 0 implicit places.
[2023-03-13 14:58:48] [INFO ] Invariant cache hit.
[2023-03-13 14:59:18] [INFO ] Performed 58158/196608 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-13 14:59:48] [INFO ] Dead Transitions with SMT raised an exceptionSMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... after 60162 ms
Finished structural reductions in LTL mode , in 1 iterations and 73441 ms. Remains : 1024/1024 places, 196608/196608 transitions.
Support contains 31 out of 1024 places after structural reductions.
[2023-03-13 14:59:52] [INFO ] Flatten gal took : 3330 ms
[2023-03-13 14:59:54] [INFO ] Flatten gal took : 2687 ms
[2023-03-13 15:00:01] [INFO ] Input system was already deterministic with 196608 transitions.
Interrupted random walk after 3588 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=0 ) properties seen 28
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-13 15:00:32] [INFO ] Invariant cache hit.
[2023-03-13 15:00:32] [INFO ] [Real]Absence check using 1 positive place invariants in 18 ms returned sat
[2023-03-13 15:00:57] [INFO ] After 24676ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 15:00:57] [INFO ] After 24828ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-13 15:00:57] [INFO ] After 25230ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 1024 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Graph (trivial) has 195458 edges and 1024 vertex of which 1021 / 1024 are part of one of the 1 SCC in 277 ms
Free SCC test removed 1020 places
Drop transitions removed 195458 transitions
Ensure Unique test removed 1142 transitions
Reduce isomorphic transitions removed 196600 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 4 transition count 6
Applied a total of 3 rules in 717 ms. Remains 4 /1024 variables (removed 1020) and now considering 6/196608 (removed 196602) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 717 ms. Remains : 4/1024 places, 6/196608 transitions.
Finished random walk after 2051 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=1025 )
FORMULA NeighborGrid-PT-d5n4m1t35-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA NeighborGrid-PT-d5n4m1t35-LTLFireability-06 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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 12865 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
[2023-03-13 15:01:12] [INFO ] Invariant cache hit.
[2023-03-13 15:01:12] [INFO ] Implicit Places using invariants in 338 ms returned []
Implicit Place search using SMT only with invariants took 340 ms to find 0 implicit places.
[2023-03-13 15:01:12] [INFO ] Invariant cache hit.
[2023-03-13 15:01:42] [INFO ] Performed 57427/196608 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-13 15:02:12] [INFO ] Dead Transitions using invariants and state equation in 60097 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73315 ms. Remains : 1024/1024 places, 196608/196608 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s489 1) (GEQ s597 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][false, false]]
Product exploration timeout after 1650 steps with 764 reset in 11422 ms.
Product exploration timeout after 980 steps with 227 reset in 10067 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 : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 1 factoid took 102 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Finished random walk after 533 steps, including 0 resets, run visited all 1 properties in 6120 ms. (steps per millisecond=0 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 107 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 7117 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
[2023-03-13 15:02:52] [INFO ] Invariant cache hit.
[2023-03-13 15:02:52] [INFO ] Implicit Places using invariants in 319 ms returned []
Implicit Place search using SMT only with invariants took 320 ms to find 0 implicit places.
[2023-03-13 15:02:52] [INFO ] Invariant cache hit.
[2023-03-13 15:03:22] [INFO ] Performed 50528/196608 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-13 15:03:52] [INFO ] Dead Transitions using invariants and state equation in 60089 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67530 ms. Remains : 1024/1024 places, 196608/196608 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 : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 1 factoid took 100 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0)]
Finished random walk after 763 steps, including 0 resets, run visited all 1 properties in 8604 ms. (steps per millisecond=0 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 116 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration timeout after 1550 steps with 775 reset in 10048 ms.
Product exploration timeout after 1090 steps with 363 reset in 10025 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Graph (trivial) has 195840 edges and 1024 vertex of which 1022 / 1024 are part of one of the 1 SCC in 42 ms
Free SCC test removed 1021 places
Ensure Unique test removed 196603 transitions
Reduce isomorphic transitions removed 196603 transitions.
Applied a total of 1 rules in 276 ms. Remains 3 /1024 variables (removed 1021) and now considering 5/196608 (removed 196603) transitions.
[2023-03-13 15:04:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2023-03-13 15:04:26] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 15:04:26] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/1024 places, 5/196608 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 335 ms. Remains : 3/1024 places, 5/196608 transitions.
Support contains 2 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 7245 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
// Phase 1: matrix 196608 rows 1024 cols
[2023-03-13 15:04:37] [INFO ] Computed 1 place invariants in 3309 ms
[2023-03-13 15:04:37] [INFO ] Implicit Places using invariants in 3550 ms returned []
Implicit Place search using SMT only with invariants took 3551 ms to find 0 implicit places.
[2023-03-13 15:04:37] [INFO ] Invariant cache hit.
[2023-03-13 15:05:07] [INFO ] Performed 53558/196608 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-13 15:05:37] [INFO ] Dead Transitions with SMT raised an exceptionSMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... after 60085 ms
Finished structural reductions in LTL mode , in 1 iterations and 70889 ms. Remains : 1024/1024 places, 196608/196608 transitions.
Treatment of property NeighborGrid-PT-d5n4m1t35-LTLFireability-01 finished in 283233 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(F((p1 U (p2||G(p1))))))))'
Support contains 3 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 6770 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
[2023-03-13 15:05:49] [INFO ] Invariant cache hit.
[2023-03-13 15:05:49] [INFO ] Implicit Places using invariants in 251 ms returned []
Implicit Place search using SMT only with invariants took 252 ms to find 0 implicit places.
[2023-03-13 15:05:49] [INFO ] Invariant cache hit.
[2023-03-13 15:06:19] [INFO ] Performed 61289/196608 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-13 15:06:49] [INFO ] Dead Transitions using invariants and state equation in 60157 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67190 ms. Remains : 1024/1024 places, 196608/196608 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (GEQ s190 1) (GEQ s336 1)), p2:(AND (LT s336 1) (LT s826 1)), p1:(LT s826 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 710 steps with 0 reset in 10011 ms.
Product exploration timeout after 720 steps with 0 reset in 10111 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 (NOT p2) (NOT p1)), (X p0)]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND (NOT p1) (NOT p2))]
Finished random walk after 1177 steps, including 0 resets, run visited all 3 properties in 13685 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 2 factoid took 155 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND (NOT p1) (NOT p2))]
[2023-03-13 15:07:29] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 3 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 7096 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
[2023-03-13 15:07:52] [INFO ] Invariant cache hit.
[2023-03-13 15:07:52] [INFO ] Implicit Places using invariants in 244 ms returned []
Implicit Place search using SMT only with invariants took 259 ms to find 0 implicit places.
[2023-03-13 15:07:52] [INFO ] Invariant cache hit.
[2023-03-13 15:08:22] [INFO ] Performed 40131/196608 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-13 15:08:52] [INFO ] Dead Transitions using invariants and state equation in 60088 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67449 ms. Remains : 1024/1024 places, 196608/196608 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 p0 (NOT p1) (NOT p2))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 61 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND (NOT p1) (NOT p2))]
Interrupted random walk after 3859 steps, including 1 resets, run timeout after 30009 ms. (steps per millisecond=0 ) properties seen 2
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-13 15:09:27] [INFO ] Invariant cache hit.
[2023-03-13 15:09:27] [INFO ] [Real]Absence check using 1 positive place invariants in 10 ms returned sat
[2023-03-13 15:09:52] [INFO ] After 25017ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1024 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Graph (trivial) has 195840 edges and 1024 vertex of which 1022 / 1024 are part of one of the 1 SCC in 36 ms
Free SCC test removed 1021 places
Drop transitions removed 195840 transitions
Ensure Unique test removed 764 transitions
Reduce isomorphic transitions removed 196604 transitions.
Applied a total of 1 rules in 250 ms. Remains 3 /1024 variables (removed 1021) and now considering 4/196608 (removed 196604) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 250 ms. Remains : 3/1024 places, 4/196608 transitions.
Finished random walk after 2051 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2051 )
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 1 factoid took 130 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND (NOT p1) (NOT p2))]
[2023-03-13 15:09:54] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND (NOT p1) (NOT p2))]
Product exploration timeout after 730 steps with 0 reset in 10133 ms.
Product exploration timeout after 730 steps with 0 reset in 10142 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Graph (trivial) has 195456 edges and 1024 vertex of which 1021 / 1024 are part of one of the 1 SCC in 30 ms
Free SCC test removed 1020 places
Ensure Unique test removed 196601 transitions
Reduce isomorphic transitions removed 196601 transitions.
Applied a total of 1 rules in 235 ms. Remains 4 /1024 variables (removed 1020) and now considering 7/196608 (removed 196601) transitions.
[2023-03-13 15:10:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2023-03-13 15:10:30] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 15:10:30] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/1024 places, 7/196608 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 279 ms. Remains : 4/1024 places, 7/196608 transitions.
Support contains 3 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 7199 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
// Phase 1: matrix 196608 rows 1024 cols
[2023-03-13 15:10:42] [INFO ] Computed 1 place invariants in 4403 ms
[2023-03-13 15:10:42] [INFO ] Implicit Places using invariants in 4732 ms returned []
Implicit Place search using SMT only with invariants took 4738 ms to find 0 implicit places.
[2023-03-13 15:10:42] [INFO ] Invariant cache hit.
[2023-03-13 15:11:13] [INFO ] Performed 66657/196608 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-13 15:11:42] [INFO ] Dead Transitions using invariants and state equation in 60123 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72070 ms. Remains : 1024/1024 places, 196608/196608 transitions.
Treatment of property NeighborGrid-PT-d5n4m1t35-LTLFireability-02 finished in 365250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G(p1))))'
Support contains 3 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Graph (trivial) has 195460 edges and 1024 vertex of which 1021 / 1024 are part of one of the 1 SCC in 58 ms
Free SCC test removed 1020 places
Ensure Unique test removed 196597 transitions
Reduce isomorphic transitions removed 196597 transitions.
Applied a total of 1 rules in 317 ms. Remains 4 /1024 variables (removed 1020) and now considering 11/196608 (removed 196597) transitions.
// Phase 1: matrix 11 rows 4 cols
[2023-03-13 15:11:48] [INFO ] Computed 1 place invariants in 3 ms
[2023-03-13 15:11:48] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-13 15:11:48] [INFO ] Invariant cache hit.
[2023-03-13 15:11:48] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-13 15:11:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-13 15:11:48] [INFO ] Invariant cache hit.
[2023-03-13 15:11:48] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/1024 places, 11/196608 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 395 ms. Remains : 4/1024 places, 11/196608 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s2 1), p1:(AND (GEQ s0 1) (GEQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA NeighborGrid-PT-d5n4m1t35-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d5n4m1t35-LTLFireability-05 finished in 692 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(((p2 U X(p3))&&p1)))))'
Support contains 3 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 8431 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
// Phase 1: matrix 196608 rows 1024 cols
[2023-03-13 15:12:01] [INFO ] Computed 1 place invariants in 4134 ms
[2023-03-13 15:12:01] [INFO ] Implicit Places using invariants in 4444 ms returned []
Implicit Place search using SMT only with invariants took 4452 ms to find 0 implicit places.
[2023-03-13 15:12:01] [INFO ] Invariant cache hit.
[2023-03-13 15:12:31] [INFO ] Performed 62279/196608 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-13 15:13:01] [INFO ] Dead Transitions using invariants and state equation in 60135 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73034 ms. Remains : 1024/1024 places, 196608/196608 transitions.
Stuttering acceptance computed with spot in 398 ms :[(OR (NOT p3) (NOT p1)), (OR (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1)), true, (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p1 p2), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=2 dest: 7}, { cond=(AND p0 p1 p2), acceptance={0} source=2 dest: 8}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={0} source=5 dest: 5}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=6 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=6 dest: 4}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=6 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=7 dest: 1}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=7 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0} source=7 dest: 2}, { cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={} source=7 dest: 5}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={0} source=7 dest: 7}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={0} source=7 dest: 8}], [{ cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=8 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={0} source=8 dest: 7}, { cond=(AND p0 p2 (NOT p3)), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p0:(LT s368 1), p1:(AND (GEQ s140 1) (GEQ s368 1)), p2:(LT s140 1), p3:(GEQ s411 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration timeout after 1110 steps with 284 reset in 10011 ms.
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 71 ms.
FORMULA NeighborGrid-PT-d5n4m1t35-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d5n4m1t35-LTLFireability-07 finished in 83747 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0)) U (p1&&X(p2)))))'
Support contains 3 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 6905 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
[2023-03-13 15:13:19] [INFO ] Invariant cache hit.
[2023-03-13 15:13:19] [INFO ] Implicit Places using invariants in 265 ms returned []
Implicit Place search using SMT only with invariants took 267 ms to find 0 implicit places.
[2023-03-13 15:13:19] [INFO ] Invariant cache hit.
[2023-03-13 15:13:49] [INFO ] Performed 66549/196608 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-13 15:14:19] [INFO ] Dead Transitions using invariants and state equation in 60111 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67290 ms. Remains : 1024/1024 places, 196608/196608 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s840 1), p0:(GEQ s100 1), p2:(GEQ s358 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 1230 steps with 410 reset in 10051 ms.
Product exploration timeout after 780 steps with 34 reset in 10017 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 p1 p0 p2)]
False Knowledge obtained : [(X (NOT p1)), (X p1)]
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
Interrupted random walk after 3947 steps, including 1 resets, run timeout after 30008 ms. (steps per millisecond=0 ) properties seen 4
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-13 15:15:14] [INFO ] Invariant cache hit.
[2023-03-13 15:15:14] [INFO ] [Real]Absence check using 1 positive place invariants in 14 ms returned sat
[2023-03-13 15:15:39] [INFO ] After 25018ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1024 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Graph (trivial) has 195840 edges and 1024 vertex of which 1022 / 1024 are part of one of the 1 SCC in 37 ms
Free SCC test removed 1021 places
Drop transitions removed 195840 transitions
Ensure Unique test removed 764 transitions
Reduce isomorphic transitions removed 196604 transitions.
Applied a total of 1 rules in 250 ms. Remains 3 /1024 variables (removed 1021) and now considering 4/196608 (removed 196604) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 254 ms. Remains : 3/1024 places, 4/196608 transitions.
Finished random walk after 2050 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1025 )
Knowledge obtained : [(AND p1 p0 p2)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (F (AND p1 (NOT p2))), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (F (NOT p1)), (F (AND (NOT p1) (NOT p2))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 220 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
Support contains 3 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 7022 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
[2023-03-13 15:15:47] [INFO ] Invariant cache hit.
[2023-03-13 15:15:47] [INFO ] Implicit Places using invariants in 250 ms returned []
Implicit Place search using SMT only with invariants took 253 ms to find 0 implicit places.
[2023-03-13 15:15:47] [INFO ] Invariant cache hit.
[2023-03-13 15:16:17] [INFO ] Performed 52190/196608 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-13 15:16:47] [INFO ] Dead Transitions using invariants and state equation in 60110 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67392 ms. Remains : 1024/1024 places, 196608/196608 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 p1 p0 p2)]
False Knowledge obtained : [(X (NOT p1)), (X p1)]
Knowledge based reduction with 1 factoid took 157 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
Finished random walk after 2620 steps, including 0 resets, run visited all 5 properties in 22414 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p1 p0 p2)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (F (AND p1 (NOT p2))), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (F (NOT p1)), (F (AND (NOT p1) (NOT p2))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 300 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
Product exploration timeout after 1130 steps with 355 reset in 10009 ms.
Product exploration timeout after 1010 steps with 215 reset in 10057 ms.
Applying partial POR strategy [false, false, true, false]
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2)]
Support contains 3 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Graph (trivial) has 195456 edges and 1024 vertex of which 1021 / 1024 are part of one of the 1 SCC in 31 ms
Free SCC test removed 1020 places
Ensure Unique test removed 196601 transitions
Reduce isomorphic transitions removed 196601 transitions.
Applied a total of 1 rules in 179 ms. Remains 4 /1024 variables (removed 1020) and now considering 7/196608 (removed 196601) transitions.
[2023-03-13 15:17:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2023-03-13 15:17:35] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 15:17:35] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/1024 places, 7/196608 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 208 ms. Remains : 4/1024 places, 7/196608 transitions.
Support contains 3 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 6629 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
// Phase 1: matrix 196608 rows 1024 cols
[2023-03-13 15:17:45] [INFO ] Computed 1 place invariants in 3080 ms
[2023-03-13 15:17:45] [INFO ] Implicit Places using invariants in 3304 ms returned []
Implicit Place search using SMT only with invariants took 3308 ms to find 0 implicit places.
[2023-03-13 15:17:46] [INFO ] Invariant cache hit.
[2023-03-13 15:18:16] [INFO ] Performed 61317/196608 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-13 15:18:46] [INFO ] Dead Transitions using invariants and state equation in 60082 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70028 ms. Remains : 1024/1024 places, 196608/196608 transitions.
Treatment of property NeighborGrid-PT-d5n4m1t35-LTLFireability-09 finished in 338440 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||(p0&&G(F((p1 U (p2||G(p1))))))||(p3 U (p4||G(p3))))))'
Support contains 5 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Graph (trivial) has 194692 edges and 1024 vertex of which 1019 / 1024 are part of one of the 1 SCC in 30 ms
Free SCC test removed 1018 places
Ensure Unique test removed 196593 transitions
Reduce isomorphic transitions removed 196593 transitions.
Applied a total of 1 rules in 381 ms. Remains 6 /1024 variables (removed 1018) and now considering 15/196608 (removed 196593) transitions.
// Phase 1: matrix 15 rows 6 cols
[2023-03-13 15:18:50] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 15:18:50] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-13 15:18:50] [INFO ] Invariant cache hit.
[2023-03-13 15:18:50] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-13 15:18:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-13 15:18:50] [INFO ] Invariant cache hit.
[2023-03-13 15:18:51] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/1024 places, 15/196608 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 489 ms. Remains : 6/1024 places, 15/196608 transitions.
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p0) (NOT p3) (NOT p4)), true, (AND p0 (NOT p4) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR p0 p4 p3), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p4) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p4) p3), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p4) (NOT p3)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p4) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p4) p3), acceptance={} source=2 dest: 2}], [{ cond=(OR (AND p0 p4) (AND p0 p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s3 1), p4:(AND (LT s2 1) (GEQ s1 1)), p3:(GEQ s1 1), p2:(AND (LT s4 1) (LT s0 1)), p1:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 85 steps with 5 reset in 4 ms.
FORMULA NeighborGrid-PT-d5n4m1t35-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d5n4m1t35-LTLFireability-10 finished in 838 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p1 U p2)&&p0))))'
Support contains 3 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Graph (trivial) has 195458 edges and 1024 vertex of which 1021 / 1024 are part of one of the 1 SCC in 38 ms
Free SCC test removed 1020 places
Ensure Unique test removed 196599 transitions
Reduce isomorphic transitions removed 196599 transitions.
Applied a total of 1 rules in 220 ms. Remains 4 /1024 variables (removed 1020) and now considering 9/196608 (removed 196599) transitions.
// Phase 1: matrix 9 rows 4 cols
[2023-03-13 15:18:51] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 15:18:51] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-13 15:18:51] [INFO ] Invariant cache hit.
[2023-03-13 15:18:51] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-13 15:18:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-13 15:18:51] [INFO ] Invariant cache hit.
[2023-03-13 15:18:51] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/1024 places, 9/196608 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 294 ms. Remains : 4/1024 places, 9/196608 transitions.
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p0) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(GEQ s2 1), p0:(AND (GEQ s1 1) (GEQ s0 1)), p1:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NeighborGrid-PT-d5n4m1t35-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d5n4m1t35-LTLFireability-11 finished in 493 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(F(p0))||(p0&&F(p1))))))'
Support contains 1 out of 1024 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Graph (trivial) has 195840 edges and 1024 vertex of which 1022 / 1024 are part of one of the 1 SCC in 35 ms
Free SCC test removed 1021 places
Ensure Unique test removed 196603 transitions
Reduce isomorphic transitions removed 196603 transitions.
Applied a total of 1 rules in 200 ms. Remains 3 /1024 variables (removed 1021) and now considering 5/196608 (removed 196603) transitions.
// Phase 1: matrix 5 rows 3 cols
[2023-03-13 15:18:52] [INFO ] Computed 1 place invariants in 40 ms
[2023-03-13 15:18:52] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-13 15:18:52] [INFO ] Invariant cache hit.
[2023-03-13 15:18:52] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-13 15:18:52] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-13 15:18:52] [INFO ] Invariant cache hit.
[2023-03-13 15:18:52] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/1024 places, 5/196608 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 302 ms. Remains : 3/1024 places, 5/196608 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NeighborGrid-PT-d5n4m1t35-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d5n4m1t35-LTLFireability-12 finished in 458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F((p1&&X(p1)))))))'
Support contains 2 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 6824 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
// Phase 1: matrix 196608 rows 1024 cols
[2023-03-13 15:19:02] [INFO ] Computed 1 place invariants in 3559 ms
[2023-03-13 15:19:02] [INFO ] Implicit Places using invariants in 3788 ms returned []
Implicit Place search using SMT only with invariants took 3790 ms to find 0 implicit places.
[2023-03-13 15:19:03] [INFO ] Invariant cache hit.
[2023-03-13 15:19:33] [INFO ] Performed 44385/196608 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-13 15:20:03] [INFO ] Dead Transitions using invariants and state equation in 60115 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70735 ms. Remains : 1024/1024 places, 196608/196608 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 3}]], initial=0, aps=[p0:(LT s363 1), p1:(LT s657 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 25 ms.
FORMULA NeighborGrid-PT-d5n4m1t35-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d5n4m1t35-LTLFireability-13 finished in 71140 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(G(p1)))))'
Support contains 2 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 7125 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
[2023-03-13 15:20:10] [INFO ] Invariant cache hit.
[2023-03-13 15:20:10] [INFO ] Implicit Places using invariants in 343 ms returned []
Implicit Place search using SMT only with invariants took 344 ms to find 0 implicit places.
[2023-03-13 15:20:11] [INFO ] Invariant cache hit.
[2023-03-13 15:20:41] [INFO ] Performed 52457/196608 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-13 15:21:11] [INFO ] Dead Transitions using invariants and state equation in 60089 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67565 ms. Remains : 1024/1024 places, 196608/196608 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s874 1), p1:(LT s647 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 700 steps with 0 reset in 10033 ms.
Product exploration timeout after 690 steps with 0 reset in 10083 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 (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Property proved to be false thanks to negative knowledge :(X (NOT p0))
Knowledge based reduction with 1 factoid took 35 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA NeighborGrid-PT-d5n4m1t35-LTLFireability-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property NeighborGrid-PT-d5n4m1t35-LTLFireability-14 finished in 91620 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
Support contains 2 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 7081 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
[2023-03-13 15:21:42] [INFO ] Invariant cache hit.
[2023-03-13 15:21:42] [INFO ] Implicit Places using invariants in 250 ms returned []
Implicit Place search using SMT only with invariants took 253 ms to find 0 implicit places.
[2023-03-13 15:21:42] [INFO ] Invariant cache hit.
[2023-03-13 15:22:12] [INFO ] Performed 59084/196608 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-13 15:22:42] [INFO ] Dead Transitions using invariants and state equation in 60099 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67440 ms. Remains : 1024/1024 places, 196608/196608 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s470 1), p0:(LT s215 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 710 steps with 90 reset in 10021 ms.
Product exploration timeout after 870 steps with 148 reset in 10092 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 p1 (NOT p0)), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1)]
Finished random walk after 350 steps, including 0 resets, run visited all 1 properties in 4102 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 141 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 1024 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 6926 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
[2023-03-13 15:23:18] [INFO ] Invariant cache hit.
[2023-03-13 15:23:18] [INFO ] Implicit Places using invariants in 235 ms returned []
Implicit Place search using SMT only with invariants took 240 ms to find 0 implicit places.
[2023-03-13 15:23:18] [INFO ] Invariant cache hit.
[2023-03-13 15:23:48] [INFO ] Performed 58162/196608 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-13 15:24:18] [INFO ] Dead Transitions using invariants and state equation in 60082 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67254 ms. Remains : 1024/1024 places, 196608/196608 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 : [p1]
False Knowledge obtained : [(X (NOT p1)), (X p1)]
Knowledge based reduction with 1 factoid took 93 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Finished random walk after 2280 steps, including 0 resets, run visited all 1 properties in 21605 ms. (steps per millisecond=0 )
Knowledge obtained : [p1]
False Knowledge obtained : [(X (NOT p1)), (X p1), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 118 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Product exploration timeout after 1580 steps with 790 reset in 10039 ms.
Product exploration timeout after 1430 steps with 641 reset in 10001 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Graph (trivial) has 196224 edges and 1024 vertex of which 1023 / 1024 are part of one of the 1 SCC in 32 ms
Free SCC test removed 1022 places
Ensure Unique test removed 196605 transitions
Reduce isomorphic transitions removed 196605 transitions.
Applied a total of 1 rules in 218 ms. Remains 2 /1024 variables (removed 1022) and now considering 3/196608 (removed 196605) transitions.
[2023-03-13 15:25:05] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2023-03-13 15:25:05] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 15:25:05] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/1024 places, 3/196608 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 260 ms. Remains : 2/1024 places, 3/196608 transitions.
Support contains 1 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 7053 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
// Phase 1: matrix 196608 rows 1024 cols
[2023-03-13 15:25:15] [INFO ] Computed 1 place invariants in 3119 ms
[2023-03-13 15:25:15] [INFO ] Implicit Places using invariants in 3340 ms returned []
Implicit Place search using SMT only with invariants took 3342 ms to find 0 implicit places.
[2023-03-13 15:25:15] [INFO ] Invariant cache hit.
[2023-03-13 15:25:46] [INFO ] Performed 54367/196608 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-13 15:26:15] [INFO ] Dead Transitions using invariants and state equation in 60082 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70482 ms. Remains : 1024/1024 places, 196608/196608 transitions.
Treatment of property NeighborGrid-PT-d5n4m1t35-LTLFireability-15 finished in 285277 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : NeighborGrid-PT-d5n4m1t35-LTLFireability-01
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Graph (trivial) has 195840 edges and 1024 vertex of which 1022 / 1024 are part of one of the 1 SCC in 32 ms
Free SCC test removed 1021 places
Ensure Unique test removed 196603 transitions
Reduce isomorphic transitions removed 196603 transitions.
Applied a total of 1 rules in 303 ms. Remains 3 /1024 variables (removed 1021) and now considering 5/196608 (removed 196603) transitions.
// Phase 1: matrix 5 rows 3 cols
[2023-03-13 15:26:20] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 15:26:20] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-13 15:26:20] [INFO ] Invariant cache hit.
[2023-03-13 15:26:20] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-13 15:26:20] [INFO ] Invariant cache hit.
[2023-03-13 15:26:20] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 3/1024 places, 5/196608 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 363 ms. Remains : 3/1024 places, 5/196608 transitions.
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s0 1) (GEQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 5 steps with 2 reset in 0 ms.
Treatment of property NeighborGrid-PT-d5n4m1t35-LTLFireability-01 finished in 593 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(F((p1 U (p2||G(p1))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0)) U (p1&&X(p2)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
[2023-03-13 15:26:24] [INFO ] Flatten gal took : 2728 ms
[2023-03-13 15:26:24] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-13 15:26:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1024 places, 196608 transitions and 393216 arcs took 457 ms.
Total runtime 1674018 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT NeighborGrid-PT-d5n4m1t35
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

BK_STOP 1678721475865

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:433
lola: rewrite Frontend/Parser/formula_rewrite.k:550
lola: Created skeleton in 2.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 2.000000 secs.
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 0 0 0 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 0 0 0 0 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 0 0 0 0 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 0 0 0 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 0 0 0 0 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 0 0 0 0 0 0 0

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

Time elapsed: 35 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 4
lola: Created skeleton in 8.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 0 0 0 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 0 0 0 0 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 0 0 0 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 0 0 0 0 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 0 0 0 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 0 0 0 0 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 0 0 0 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 0 0 0 0 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 0 0 0 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 0 0 0 0 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 0 0 0 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 0 0 0 0 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 0 0 0 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 0 0 0 0 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 0 0 0 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 0 0 0 0 0 0 0

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

Time elapsed: 75 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 4
lola: Created skeleton in 1.000000 secs.
lola: Created skeleton in 1.000000 secs.
lola: NOTDEADLOCKFREE
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 16 (type SKEL/SRCH) for 3 NeighborGrid-PT-d5n4m1t35-LTLFireability-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: NOTDEADLOCKFREE
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 1 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
16 LTL SRCH 0/3520 1/5 NeighborGrid-PT-d5n4m1t35-LTLFireability-02 12211 m, 2442 m/sec, 16694 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 1 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
16 LTL SRCH 5/3520 1/5 NeighborGrid-PT-d5n4m1t35-LTLFireability-02 93825 m, 16322 m/sec, 138851 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 1 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
16 LTL SRCH 10/3520 1/5 NeighborGrid-PT-d5n4m1t35-LTLFireability-02 181879 m, 17610 m/sec, 270975 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 1 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
16 LTL SRCH 15/3520 1/5 NeighborGrid-PT-d5n4m1t35-LTLFireability-02 273750 m, 18374 m/sec, 408622 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 1 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
16 LTL SRCH 20/3520 1/5 NeighborGrid-PT-d5n4m1t35-LTLFireability-02 360189 m, 17287 m/sec, 538204 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 1 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
16 LTL SRCH 25/3520 1/5 NeighborGrid-PT-d5n4m1t35-LTLFireability-02 441521 m, 16266 m/sec, 660050 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 1 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
16 LTL SRCH 30/3520 1/5 NeighborGrid-PT-d5n4m1t35-LTLFireability-02 525937 m, 16883 m/sec, 786673 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 1 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
16 LTL SRCH 35/3520 1/5 NeighborGrid-PT-d5n4m1t35-LTLFireability-02 616106 m, 18033 m/sec, 921821 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 1 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
16 LTL SRCH 40/3520 1/5 NeighborGrid-PT-d5n4m1t35-LTLFireability-02 704690 m, 17716 m/sec, 1054468 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 1 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
16 LTL SRCH 45/3520 1/5 NeighborGrid-PT-d5n4m1t35-LTLFireability-02 776463 m, 14354 m/sec, 1162127 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 1 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
16 LTL SRCH 50/3520 1/5 NeighborGrid-PT-d5n4m1t35-LTLFireability-02 854366 m, 15580 m/sec, 1278842 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 1 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
16 LTL SRCH 55/3520 1/5 NeighborGrid-PT-d5n4m1t35-LTLFireability-02 938827 m, 16892 m/sec, 1405418 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 1 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
16 LTL SRCH 60/3520 1/5 NeighborGrid-PT-d5n4m1t35-LTLFireability-02 1016243 m, 15483 m/sec, 1521413 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 1 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
16 LTL SRCH 65/3520 1/5 NeighborGrid-PT-d5n4m1t35-LTLFireability-02 1104661 m, 17683 m/sec, 1653876 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 1 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
16 LTL SRCH 70/3520 1/5 NeighborGrid-PT-d5n4m1t35-LTLFireability-02 1185556 m, 16179 m/sec, 1774984 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 1 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
16 LTL SRCH 75/3520 1/5 NeighborGrid-PT-d5n4m1t35-LTLFireability-02 1262110 m, 15310 m/sec, 1889597 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 1 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
16 LTL SRCH 80/3520 1/5 NeighborGrid-PT-d5n4m1t35-LTLFireability-02 1342859 m, 16149 m/sec, 2010482 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 1 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
16 LTL SRCH 85/3520 1/5 NeighborGrid-PT-d5n4m1t35-LTLFireability-02 1424266 m, 16281 m/sec, 2130687 t fired, .

Time elapsed: 165 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 4
lola: FINISHED task # 16 (type SKEL/SRCH) for NeighborGrid-PT-d5n4m1t35-LTLFireability-02
lola: result : false
lola: markings : 1485983
lola: fired transitions : 2210350
lola: time used : 88.000000
lola: memory pages used : 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 0 0 2 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 0 0 2 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 0 0 2 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 0 0 2 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 0 0 2 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 0 0 2 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 0 0 2 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 0 0 2 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 0 0 0 1 0 0 0

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

Time elapsed: 205 secs. Pages in use: 1
# running tasks: 0 of 4 Visible: 4
lola: LAUNCH task # 8 (type EXCL) for 3 NeighborGrid-PT-d5n4m1t35-LTLFireability-02
lola: time limit : 678 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
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 1 0 2 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 3/678 1/32 NeighborGrid-PT-d5n4m1t35-LTLFireability-02 2671 m, 534 m/sec, 2670 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 1 0 2 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 10/678 1/32 NeighborGrid-PT-d5n4m1t35-LTLFireability-02 6533 m, 772 m/sec, 6532 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 1 0 2 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 15/678 1/32 NeighborGrid-PT-d5n4m1t35-LTLFireability-02 9706 m, 634 m/sec, 9705 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 1 0 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 1 0 2 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 20/678 1/32 NeighborGrid-PT-d5n4m1t35-LTLFireability-02 11283 m, 315 m/sec, 11282 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 1 0 2 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 25/678 1/32 NeighborGrid-PT-d5n4m1t35-LTLFireability-02 11749 m, 93 m/sec, 11748 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 1 0 2 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 30/678 1/32 NeighborGrid-PT-d5n4m1t35-LTLFireability-02 12347 m, 119 m/sec, 12346 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 0 1 0 2 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 35/678 1/32 NeighborGrid-PT-d5n4m1t35-LTLFireability-02 12942 m, 119 m/sec, 12941 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 1 1 0 2 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 40/678 1/32 NeighborGrid-PT-d5n4m1t35-LTLFireability-02 19013 m, 1214 m/sec, 19012 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 1 1 0 2 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 45/678 1/32 NeighborGrid-PT-d5n4m1t35-LTLFireability-02 25895 m, 1376 m/sec, 25894 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 1 1 0 2 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 50/678 1/32 NeighborGrid-PT-d5n4m1t35-LTLFireability-02 34698 m, 1760 m/sec, 34697 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 1 1 0 2 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 55/678 1/32 NeighborGrid-PT-d5n4m1t35-LTLFireability-02 45983 m, 2257 m/sec, 45982 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 1 1 0 2 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 60/678 1/32 NeighborGrid-PT-d5n4m1t35-LTLFireability-02 54955 m, 1794 m/sec, 54954 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 1 1 0 2 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 65/678 1/32 NeighborGrid-PT-d5n4m1t35-LTLFireability-02 66617 m, 2332 m/sec, 66616 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 1 1 0 2 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 70/678 2/32 NeighborGrid-PT-d5n4m1t35-LTLFireability-02 78100 m, 2296 m/sec, 78099 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 1 1 0 2 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 75/678 2/32 NeighborGrid-PT-d5n4m1t35-LTLFireability-02 89252 m, 2230 m/sec, 89251 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NeighborGrid-PT-d5n4m1t35-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-02: CONJ 0 1 1 0 2 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
NeighborGrid-PT-d5n4m1t35-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 80/678 2/32 NeighborGrid-PT-d5n4m1t35-LTLFireability-02 90580 m, 265 m/sec, 90579 t fired, .

Time elapsed: 287 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 4
/home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin//../BenchKit_head.sh: line 63: 1542 Killed lola --conf=$BIN_DIR/configfiles/ltlfireabilityconf --formula=$DIR/LTLFireability.xml --verdictfile=$DIR/GenericPropertiesVerdict.xml $DIR/model.pnml

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="NeighborGrid-PT-d5n4m1t35"
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 NeighborGrid-PT-d5n4m1t35, 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 r263-smll-167863537700108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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