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

About the Execution of LoLa+red for Diffusion2D-PT-D20N100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
933.863 74766.00 107949.00 894.50 FTFFFFFTTFFFFFFF normal

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.r135-smll-167819413700172.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 Diffusion2D-PT-D20N100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-smll-167819413700172
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 11K Feb 26 04:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 26 04:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 04:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 04:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 15:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 04:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 26 04:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 04:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 26 04:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.2M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678288820735

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=Diffusion2D-PT-D20N100
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 15:20:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 15:20:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 15:20:25] [INFO ] Load time of PNML (sax parser for PT used): 353 ms
[2023-03-08 15:20:25] [INFO ] Transformed 400 places.
[2023-03-08 15:20:25] [INFO ] Transformed 2964 transitions.
[2023-03-08 15:20:25] [INFO ] Parsed PT model containing 400 places and 2964 transitions and 5928 arcs in 524 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Diffusion2D-PT-D20N100-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D20N100-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D20N100-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 2964/2964 transitions.
Applied a total of 0 rules in 112 ms. Remains 400 /400 variables (removed 0) and now considering 2964/2964 (removed 0) transitions.
// Phase 1: matrix 2964 rows 400 cols
[2023-03-08 15:20:25] [INFO ] Computed 1 place invariants in 57 ms
[2023-03-08 15:20:25] [INFO ] Implicit Places using invariants in 349 ms returned []
[2023-03-08 15:20:25] [INFO ] Invariant cache hit.
[2023-03-08 15:20:26] [INFO ] Implicit Places using invariants and state equation in 954 ms returned []
Implicit Place search using SMT with State Equation took 1345 ms to find 0 implicit places.
[2023-03-08 15:20:26] [INFO ] Invariant cache hit.
[2023-03-08 15:20:28] [INFO ] Dead Transitions using invariants and state equation in 2009 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3469 ms. Remains : 400/400 places, 2964/2964 transitions.
Support contains 23 out of 400 places after structural reductions.
[2023-03-08 15:20:29] [INFO ] Flatten gal took : 249 ms
[2023-03-08 15:20:29] [INFO ] Flatten gal took : 158 ms
[2023-03-08 15:20:29] [INFO ] Input system was already deterministic with 2964 transitions.
Incomplete random walk after 10004 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 22) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2023-03-08 15:20:30] [INFO ] Invariant cache hit.
[2023-03-08 15:20:30] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-08 15:20:31] [INFO ] After 885ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:15
[2023-03-08 15:20:31] [INFO ] After 1031ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:15
Attempting to minimize the solution found.
Minimization took 79 ms.
[2023-03-08 15:20:31] [INFO ] After 1505ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-08 15:20:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-08 15:20:34] [INFO ] After 2500ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-08 15:20:37] [INFO ] After 5398ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 1595 ms.
[2023-03-08 15:20:39] [INFO ] After 7513ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Fused 16 Parikh solutions to 8 different solutions.
Finished Parikh walk after 766 steps, including 0 resets, run visited all 1 properties in 14 ms. (steps per millisecond=54 )
Parikh walk visited 16 properties in 386 ms.
FORMULA Diffusion2D-PT-D20N100-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Diffusion2D-PT-D20N100-LTLFireability-05 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' '!(G(((p0 U p1)||(p2 U X((p3||G(!p1)))))))'
Support contains 4 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 2964/2964 transitions.
Applied a total of 0 rules in 314 ms. Remains 400 /400 variables (removed 0) and now considering 2964/2964 (removed 0) transitions.
[2023-03-08 15:20:40] [INFO ] Invariant cache hit.
[2023-03-08 15:20:40] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-08 15:20:40] [INFO ] Invariant cache hit.
[2023-03-08 15:20:41] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
[2023-03-08 15:20:41] [INFO ] Invariant cache hit.
[2023-03-08 15:20:42] [INFO ] Dead Transitions using invariants and state equation in 1745 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2721 ms. Remains : 400/400 places, 2964/2964 transitions.
Stuttering acceptance computed with spot in 399 ms :[false, (AND p1 (NOT p3)), (AND p1 (NOT p3)), false, true, p1, false]
Running random walk in product with property : Diffusion2D-PT-D20N100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2 (NOT p3)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(GEQ s39 1), p0:(GEQ s41 1), p2:(GEQ s380 1), p3:(LT s169 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 32883 reset in 850 ms.
Product exploration explored 100000 steps with 32893 reset in 752 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) p3), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (X (NOT (AND p1 p2 (NOT p3))))), true, (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p3)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 14 factoid took 1019 ms. Reduced automaton from 7 states, 16 edges and 4 AP (stutter sensitive) to 7 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 358 ms :[false, (AND p1 (NOT p3)), (AND p1 (NOT p3)), false, true, p1, false]
Incomplete random walk after 10090 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=373 ) properties (out of 13) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-08 15:20:46] [INFO ] Invariant cache hit.
[2023-03-08 15:20:46] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-08 15:20:47] [INFO ] After 945ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:5
[2023-03-08 15:20:47] [INFO ] After 1210ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:6
Attempting to minimize the solution found.
Minimization took 119 ms.
[2023-03-08 15:20:48] [INFO ] After 1485ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:6
[2023-03-08 15:20:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-08 15:20:49] [INFO ] After 1492ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-08 15:20:51] [INFO ] After 2804ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 772 ms.
[2023-03-08 15:20:51] [INFO ] After 3859ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 6 different solutions.
Finished Parikh walk after 2843 steps, including 0 resets, run visited all 1 properties in 27 ms. (steps per millisecond=105 )
Parikh walk visited 7 properties in 372 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) p3), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (X (NOT (AND p1 p2 (NOT p3))))), true, (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p3)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND p2 p1 (NOT p3))), (F (AND p0 (NOT p1) (NOT p3))), (F (AND (NOT p1) (NOT p3))), (F (AND p1 (NOT p3))), (F (AND p2 (NOT p1) (NOT p3))), (F (AND p0 (NOT p1))), (F (AND (NOT p2) (NOT p3))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (AND p0 (NOT p2) (NOT p1))), (F (AND (NOT p0) p2 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 14 factoid took 1712 ms. Reduced automaton from 7 states, 16 edges and 4 AP (stutter sensitive) to 7 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 339 ms :[false, (AND p1 (NOT p3)), (AND p1 (NOT p3)), false, true, p1, false]
Stuttering acceptance computed with spot in 337 ms :[false, (AND p1 (NOT p3)), (AND p1 (NOT p3)), false, true, p1, false]
Support contains 4 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 2964/2964 transitions.
Applied a total of 0 rules in 32 ms. Remains 400 /400 variables (removed 0) and now considering 2964/2964 (removed 0) transitions.
[2023-03-08 15:20:54] [INFO ] Invariant cache hit.
[2023-03-08 15:20:54] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-08 15:20:54] [INFO ] Invariant cache hit.
[2023-03-08 15:20:55] [INFO ] Implicit Places using invariants and state equation in 745 ms returned []
Implicit Place search using SMT with State Equation took 885 ms to find 0 implicit places.
[2023-03-08 15:20:55] [INFO ] Invariant cache hit.
[2023-03-08 15:20:57] [INFO ] Dead Transitions using invariants and state equation in 1726 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2647 ms. Remains : 400/400 places, 2964/2964 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) p3), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p2 (NOT p1) (NOT p3)))), (X (NOT (AND p2 p1 (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), true, (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p3)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 14 factoid took 904 ms. Reduced automaton from 7 states, 16 edges and 4 AP (stutter sensitive) to 7 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 335 ms :[false, (AND p1 (NOT p3)), (AND p1 (NOT p3)), false, true, p1, false]
Incomplete random walk after 10002 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-08 15:20:58] [INFO ] Invariant cache hit.
[2023-03-08 15:20:58] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2023-03-08 15:21:00] [INFO ] After 1153ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-08 15:21:00] [INFO ] After 1280ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 15:21:00] [INFO ] After 1489ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 15:21:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-08 15:21:01] [INFO ] After 1218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 15:21:02] [INFO ] After 1760ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 440 ms.
[2023-03-08 15:21:02] [INFO ] After 2340ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 2686 steps, including 0 resets, run visited all 4 properties in 154 ms. (steps per millisecond=17 )
Parikh walk visited 4 properties in 155 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) p3), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p2 (NOT p1) (NOT p3)))), (X (NOT (AND p2 p1 (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), true, (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p3)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND p2 p1 (NOT p3))), (F (AND p0 (NOT p1) (NOT p3))), (F (AND (NOT p1) (NOT p3))), (F (AND p1 (NOT p3))), (F (AND p2 (NOT p1) (NOT p3))), (F (AND p0 (NOT p1))), (F (AND (NOT p2) (NOT p3))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (AND p0 (NOT p2) (NOT p1))), (F (AND (NOT p0) p2 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 14 factoid took 1638 ms. Reduced automaton from 7 states, 16 edges and 4 AP (stutter sensitive) to 7 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 330 ms :[false, (AND p1 (NOT p3)), (AND p1 (NOT p3)), false, true, p1, false]
Stuttering acceptance computed with spot in 329 ms :[false, (AND p1 (NOT p3)), (AND p1 (NOT p3)), false, true, p1, false]
Stuttering acceptance computed with spot in 335 ms :[false, (AND p1 (NOT p3)), (AND p1 (NOT p3)), false, true, p1, false]
Product exploration explored 100000 steps with 32849 reset in 763 ms.
Product exploration explored 100000 steps with 32693 reset in 547 ms.
Applying partial POR strategy [false, true, false, true, true, true, true]
Stuttering acceptance computed with spot in 334 ms :[false, (AND p1 (NOT p3)), (AND p1 (NOT p3)), false, true, p1, false]
Support contains 4 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 2964/2964 transitions.
Graph (trivial) has 2900 edges and 400 vertex of which 396 / 400 are part of one of the 1 SCC in 12 ms
Free SCC test removed 395 places
Ensure Unique test removed 2955 transitions
Reduce isomorphic transitions removed 2955 transitions.
Applied a total of 1 rules in 32 ms. Remains 5 /400 variables (removed 395) and now considering 9/2964 (removed 2955) transitions.
[2023-03-08 15:21:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 5 cols
[2023-03-08 15:21:07] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-08 15:21:07] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/400 places, 9/2964 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72 ms. Remains : 5/400 places, 9/2964 transitions.
Support contains 4 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 2964/2964 transitions.
Applied a total of 0 rules in 99 ms. Remains 400 /400 variables (removed 0) and now considering 2964/2964 (removed 0) transitions.
// Phase 1: matrix 2964 rows 400 cols
[2023-03-08 15:21:07] [INFO ] Computed 1 place invariants in 35 ms
[2023-03-08 15:21:07] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-08 15:21:07] [INFO ] Invariant cache hit.
[2023-03-08 15:21:08] [INFO ] Implicit Places using invariants and state equation in 716 ms returned []
Implicit Place search using SMT with State Equation took 869 ms to find 0 implicit places.
[2023-03-08 15:21:08] [INFO ] Invariant cache hit.
[2023-03-08 15:21:10] [INFO ] Dead Transitions using invariants and state equation in 1604 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2583 ms. Remains : 400/400 places, 2964/2964 transitions.
Treatment of property Diffusion2D-PT-D20N100-LTLFireability-00 finished in 30141 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||X(G(p1))) U p2)))'
Support contains 3 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 2964/2964 transitions.
Applied a total of 0 rules in 22 ms. Remains 400 /400 variables (removed 0) and now considering 2964/2964 (removed 0) transitions.
[2023-03-08 15:21:10] [INFO ] Invariant cache hit.
[2023-03-08 15:21:10] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-08 15:21:10] [INFO ] Invariant cache hit.
[2023-03-08 15:21:11] [INFO ] Implicit Places using invariants and state equation in 668 ms returned []
Implicit Place search using SMT with State Equation took 750 ms to find 0 implicit places.
[2023-03-08 15:21:11] [INFO ] Invariant cache hit.
[2023-03-08 15:21:13] [INFO ] Dead Transitions using invariants and state equation in 2063 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2837 ms. Remains : 400/400 places, 2964/2964 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p2), (NOT p2), (NOT p1), true]
Running random walk in product with property : Diffusion2D-PT-D20N100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s114 1) (OR (GEQ s90 1) (GEQ s176 1))), p0:(GEQ s90 1), p1:(GEQ s176 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D20N100-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D20N100-LTLFireability-03 finished in 2984 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 2964/2964 transitions.
Graph (trivial) has 2948 edges and 400 vertex of which 399 / 400 are part of one of the 1 SCC in 4 ms
Free SCC test removed 398 places
Ensure Unique test removed 2961 transitions
Reduce isomorphic transitions removed 2961 transitions.
Applied a total of 1 rules in 12 ms. Remains 2 /400 variables (removed 398) and now considering 3/2964 (removed 2961) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-08 15:21:13] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-08 15:21:13] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-08 15:21:13] [INFO ] Invariant cache hit.
[2023-03-08 15:21:13] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2023-03-08 15:21:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 15:21:13] [INFO ] Invariant cache hit.
[2023-03-08 15:21:13] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/400 places, 3/2964 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73 ms. Remains : 2/400 places, 3/2964 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D20N100-LTLFireability-04 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 1 steps with 0 reset in 1 ms.
FORMULA Diffusion2D-PT-D20N100-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D20N100-LTLFireability-04 finished in 151 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(p1))))'
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 2964/2964 transitions.
Applied a total of 0 rules in 25 ms. Remains 400 /400 variables (removed 0) and now considering 2964/2964 (removed 0) transitions.
// Phase 1: matrix 2964 rows 400 cols
[2023-03-08 15:21:13] [INFO ] Computed 1 place invariants in 27 ms
[2023-03-08 15:21:13] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-08 15:21:13] [INFO ] Invariant cache hit.
[2023-03-08 15:21:14] [INFO ] Implicit Places using invariants and state equation in 728 ms returned []
Implicit Place search using SMT with State Equation took 866 ms to find 0 implicit places.
[2023-03-08 15:21:14] [INFO ] Invariant cache hit.
[2023-03-08 15:21:15] [INFO ] Dead Transitions using invariants and state equation in 1587 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2481 ms. Remains : 400/400 places, 2964/2964 transitions.
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Diffusion2D-PT-D20N100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(LT s354 1), p0:(GEQ s367 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 681 ms.
Product exploration explored 100000 steps with 50000 reset in 571 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 (NOT p0) (NOT p1)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 3 factoid took 56 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Diffusion2D-PT-D20N100-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Diffusion2D-PT-D20N100-LTLFireability-07 finished in 3949 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)))'
Support contains 1 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 2964/2964 transitions.
Applied a total of 0 rules in 16 ms. Remains 400 /400 variables (removed 0) and now considering 2964/2964 (removed 0) transitions.
[2023-03-08 15:21:17] [INFO ] Invariant cache hit.
[2023-03-08 15:21:17] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-08 15:21:17] [INFO ] Invariant cache hit.
[2023-03-08 15:21:17] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
[2023-03-08 15:21:17] [INFO ] Invariant cache hit.
[2023-03-08 15:21:19] [INFO ] Dead Transitions using invariants and state equation in 1567 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2110 ms. Remains : 400/400 places, 2964/2964 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D20N100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s296 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 explored 100000 steps with 50000 reset in 601 ms.
Product exploration explored 100000 steps with 50000 reset in 584 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, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Diffusion2D-PT-D20N100-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Diffusion2D-PT-D20N100-LTLFireability-08 finished in 3528 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(X(X(G(p0))))))'
Support contains 1 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 2964/2964 transitions.
Applied a total of 0 rules in 15 ms. Remains 400 /400 variables (removed 0) and now considering 2964/2964 (removed 0) transitions.
[2023-03-08 15:21:20] [INFO ] Invariant cache hit.
[2023-03-08 15:21:20] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-08 15:21:20] [INFO ] Invariant cache hit.
[2023-03-08 15:21:21] [INFO ] Implicit Places using invariants and state equation in 740 ms returned []
Implicit Place search using SMT with State Equation took 843 ms to find 0 implicit places.
[2023-03-08 15:21:21] [INFO ] Invariant cache hit.
[2023-03-08 15:21:23] [INFO ] Dead Transitions using invariants and state equation in 1647 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2509 ms. Remains : 400/400 places, 2964/2964 transitions.
Stuttering acceptance computed with spot in 245 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D20N100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(LT s368 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 416 steps with 0 reset in 5 ms.
FORMULA Diffusion2D-PT-D20N100-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D20N100-LTLFireability-09 finished in 2777 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 2964/2964 transitions.
Graph (trivial) has 2948 edges and 400 vertex of which 399 / 400 are part of one of the 1 SCC in 6 ms
Free SCC test removed 398 places
Ensure Unique test removed 2961 transitions
Reduce isomorphic transitions removed 2961 transitions.
Applied a total of 1 rules in 17 ms. Remains 2 /400 variables (removed 398) and now considering 3/2964 (removed 2961) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-08 15:21:23] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-08 15:21:23] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-08 15:21:23] [INFO ] Invariant cache hit.
[2023-03-08 15:21:23] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-08 15:21:23] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 15:21:23] [INFO ] Invariant cache hit.
[2023-03-08 15:21:23] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/400 places, 3/2964 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96 ms. Remains : 2/400 places, 3/2964 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D20N100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D20N100-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D20N100-LTLFireability-10 finished in 159 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 2964/2964 transitions.
Graph (trivial) has 2932 edges and 400 vertex of which 398 / 400 are part of one of the 1 SCC in 6 ms
Free SCC test removed 397 places
Ensure Unique test removed 2959 transitions
Reduce isomorphic transitions removed 2959 transitions.
Applied a total of 1 rules in 17 ms. Remains 3 /400 variables (removed 397) and now considering 5/2964 (removed 2959) transitions.
// Phase 1: matrix 5 rows 3 cols
[2023-03-08 15:21:23] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-08 15:21:23] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-08 15:21:23] [INFO ] Invariant cache hit.
[2023-03-08 15:21:23] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-08 15:21:23] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 15:21:23] [INFO ] Invariant cache hit.
[2023-03-08 15:21:23] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/400 places, 5/2964 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 97 ms. Remains : 3/400 places, 5/2964 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Diffusion2D-PT-D20N100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s1 1), p0:(GEQ s0 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 0 steps with 0 reset in 1 ms.
FORMULA Diffusion2D-PT-D20N100-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D20N100-LTLFireability-11 finished in 219 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 2964/2964 transitions.
Graph (trivial) has 2932 edges and 400 vertex of which 398 / 400 are part of one of the 1 SCC in 7 ms
Free SCC test removed 397 places
Ensure Unique test removed 2959 transitions
Reduce isomorphic transitions removed 2959 transitions.
Applied a total of 1 rules in 17 ms. Remains 3 /400 variables (removed 397) and now considering 5/2964 (removed 2959) transitions.
// Phase 1: matrix 5 rows 3 cols
[2023-03-08 15:21:24] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-08 15:21:24] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-08 15:21:24] [INFO ] Invariant cache hit.
[2023-03-08 15:21:24] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-08 15:21:24] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 15:21:24] [INFO ] Invariant cache hit.
[2023-03-08 15:21:24] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/400 places, 5/2964 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 99 ms. Remains : 3/400 places, 5/2964 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Diffusion2D-PT-D20N100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(LT s1 1), p1:(LT s0 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D20N100-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D20N100-LTLFireability-12 finished in 170 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||F(G(p0))) U (p1||X(F(!p2)))))'
Support contains 3 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 2964/2964 transitions.
Applied a total of 0 rules in 26 ms. Remains 400 /400 variables (removed 0) and now considering 2964/2964 (removed 0) transitions.
// Phase 1: matrix 2964 rows 400 cols
[2023-03-08 15:21:24] [INFO ] Computed 1 place invariants in 28 ms
[2023-03-08 15:21:24] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-08 15:21:24] [INFO ] Invariant cache hit.
[2023-03-08 15:21:25] [INFO ] Implicit Places using invariants and state equation in 718 ms returned []
Implicit Place search using SMT with State Equation took 854 ms to find 0 implicit places.
[2023-03-08 15:21:25] [INFO ] Invariant cache hit.
[2023-03-08 15:21:26] [INFO ] Dead Transitions using invariants and state equation in 1738 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2621 ms. Remains : 400/400 places, 2964/2964 transitions.
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) p2), (AND (NOT p0) p2), (AND (NOT p1) p2)]
Running random walk in product with property : Diffusion2D-PT-D20N100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s248 1), p0:(GEQ s101 1), p2:(LT s296 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 78 reset in 1979 ms.
Stack based approach found an accepted trace after 62 steps with 0 reset with depth 63 and stack size 63 in 1 ms.
FORMULA Diffusion2D-PT-D20N100-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D20N100-LTLFireability-13 finished in 4777 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((X(p0)||(G(F(p1)) U p0)))))'
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 2964/2964 transitions.
Applied a total of 0 rules in 15 ms. Remains 400 /400 variables (removed 0) and now considering 2964/2964 (removed 0) transitions.
[2023-03-08 15:21:28] [INFO ] Invariant cache hit.
[2023-03-08 15:21:29] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-08 15:21:29] [INFO ] Invariant cache hit.
[2023-03-08 15:21:29] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
[2023-03-08 15:21:29] [INFO ] Invariant cache hit.
[2023-03-08 15:21:31] [INFO ] Dead Transitions using invariants and state equation in 1777 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2392 ms. Remains : 400/400 places, 2964/2964 transitions.
Stuttering acceptance computed with spot in 352 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : Diffusion2D-PT-D20N100-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(NOT p0), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s123 1), p1:(GEQ s265 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 71 reset in 1920 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA Diffusion2D-PT-D20N100-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D20N100-LTLFireability-14 finished in 4689 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U p1)||(p2 U X((p3||G(!p1)))))))'
Found a Lengthening insensitive property : Diffusion2D-PT-D20N100-LTLFireability-00
Stuttering acceptance computed with spot in 277 ms :[false, (AND p1 (NOT p3)), (AND p1 (NOT p3)), false, true, p1, false]
Support contains 4 out of 400 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 400/400 places, 2964/2964 transitions.
Graph (trivial) has 2900 edges and 400 vertex of which 396 / 400 are part of one of the 1 SCC in 6 ms
Free SCC test removed 395 places
Ensure Unique test removed 2955 transitions
Reduce isomorphic transitions removed 2955 transitions.
Applied a total of 1 rules in 14 ms. Remains 5 /400 variables (removed 395) and now considering 9/2964 (removed 2955) transitions.
// Phase 1: matrix 9 rows 5 cols
[2023-03-08 15:21:34] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-08 15:21:34] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-08 15:21:34] [INFO ] Invariant cache hit.
[2023-03-08 15:21:34] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-08 15:21:34] [INFO ] Invariant cache hit.
[2023-03-08 15:21:34] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 5/400 places, 9/2964 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 101 ms. Remains : 5/400 places, 9/2964 transitions.
Running random walk in product with property : Diffusion2D-PT-D20N100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2 (NOT p3)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(GEQ s0 1), p0:(GEQ s1 1), p2:(GEQ s3 1), p3:(LT s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 19 steps with 2 reset in 1 ms.
Treatment of property Diffusion2D-PT-D20N100-LTLFireability-00 finished in 506 ms.
FORMULA Diffusion2D-PT-D20N100-LTLFireability-00 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-08 15:21:34] [INFO ] Flatten gal took : 126 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 69799 ms.
ITS solved all properties within timeout

BK_STOP 1678288895501

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

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="Diffusion2D-PT-D20N100"
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 Diffusion2D-PT-D20N100, 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 r135-smll-167819413700172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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