fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r083-tall-162048874800020
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for Diffusion2D-PT-D05N100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
373.079 17154.00 27865.00 236.60 TFFFTTFFFFTFTFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r083-tall-162048874800020.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Diffusion2D-PT-D05N100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048874800020
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 19K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 138K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Mar 28 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 10:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 10:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Mar 22 17:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 22 17:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 8 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 55K May 5 16:51 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-D05N100-00
FORMULA_NAME Diffusion2D-PT-D05N100-01
FORMULA_NAME Diffusion2D-PT-D05N100-02
FORMULA_NAME Diffusion2D-PT-D05N100-03
FORMULA_NAME Diffusion2D-PT-D05N100-04
FORMULA_NAME Diffusion2D-PT-D05N100-05
FORMULA_NAME Diffusion2D-PT-D05N100-06
FORMULA_NAME Diffusion2D-PT-D05N100-07
FORMULA_NAME Diffusion2D-PT-D05N100-08
FORMULA_NAME Diffusion2D-PT-D05N100-09
FORMULA_NAME Diffusion2D-PT-D05N100-10
FORMULA_NAME Diffusion2D-PT-D05N100-11
FORMULA_NAME Diffusion2D-PT-D05N100-12
FORMULA_NAME Diffusion2D-PT-D05N100-13
FORMULA_NAME Diffusion2D-PT-D05N100-14
FORMULA_NAME Diffusion2D-PT-D05N100-15

=== Now, execution of the tool begins

BK_START 1620530269122

Running Version 0
[2021-05-09 03:17:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 03:17:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 03:17:50] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2021-05-09 03:17:50] [INFO ] Transformed 25 places.
[2021-05-09 03:17:50] [INFO ] Transformed 144 transitions.
[2021-05-09 03:17:50] [INFO ] Parsed PT model containing 25 places and 144 transitions in 81 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 03:17:50] [INFO ] Initial state test concluded for 4 properties.
FORMULA Diffusion2D-PT-D05N100-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D05N100-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 144/144 transitions.
Applied a total of 0 rules in 16 ms. Remains 25 /25 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 25 cols
[2021-05-09 03:17:50] [INFO ] Computed 1 place invariants in 7 ms
[2021-05-09 03:17:50] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 144 rows 25 cols
[2021-05-09 03:17:50] [INFO ] Computed 1 place invariants in 3 ms
[2021-05-09 03:17:51] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
// Phase 1: matrix 144 rows 25 cols
[2021-05-09 03:17:51] [INFO ] Computed 1 place invariants in 4 ms
[2021-05-09 03:17:51] [INFO ] Dead Transitions using invariants and state equation in 85 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 144/144 transitions.
[2021-05-09 03:17:51] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-09 03:17:51] [INFO ] Flatten gal took : 32 ms
FORMULA Diffusion2D-PT-D05N100-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D05N100-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D05N100-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 03:17:51] [INFO ] Flatten gal took : 12 ms
[2021-05-09 03:17:51] [INFO ] Input system was already deterministic with 144 transitions.
Finished random walk after 8598 steps, including 0 resets, run visited all 28 properties in 9 ms. (steps per millisecond=955 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F((p0&&F((p1 U (p2||G(p1)))))) U (p3||F(p4))))], workingDir=/home/mcc/execution]
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 144/144 transitions.
Graph (trivial) has 70 edges and 25 vertex of which 19 / 25 are part of one of the 1 SCC in 6 ms
Free SCC test removed 18 places
Ensure Unique test removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Applied a total of 1 rules in 23 ms. Remains 7 /25 variables (removed 18) and now considering 23/144 (removed 121) transitions.
// Phase 1: matrix 23 rows 7 cols
[2021-05-09 03:17:51] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 03:17:51] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 23 rows 7 cols
[2021-05-09 03:17:51] [INFO ] Computed 1 place invariants in 8 ms
[2021-05-09 03:17:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 03:17:51] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2021-05-09 03:17:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 23 rows 7 cols
[2021-05-09 03:17:51] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 03:17:51] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/25 places, 23/144 transitions.
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p3) (NOT p4)), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p4))), (AND (NOT p4) (NOT p2) (NOT p1))]
Running random walk in product with property : Diffusion2D-PT-D05N100-01 automaton TGBA [mat=[[{ cond=(AND (NOT p3) (NOT p4)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p4) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p4) p0 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p4) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p4) p0 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p4) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p4) (NOT p2) p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p3:(LEQ 1 s0), p4:(LEQ s2 s1), p0:(LEQ 2 s5), p2:(AND (GT 2 s5) (GT s3 s4)), p1:(GT s3 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 2 ms.
FORMULA Diffusion2D-PT-D05N100-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D05N100-01 finished in 367 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((p0||(p1&&X(p1)))) U (!p0 U X(!p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 144/144 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 25 cols
[2021-05-09 03:17:51] [INFO ] Computed 1 place invariants in 3 ms
[2021-05-09 03:17:51] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 144 rows 25 cols
[2021-05-09 03:17:51] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-09 03:17:51] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
// Phase 1: matrix 144 rows 25 cols
[2021-05-09 03:17:51] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 03:17:51] [INFO ] Dead Transitions using invariants and state equation in 112 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 144/144 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p1) p0), (NOT p1), (AND (NOT p1) (NOT p0)), p0, p0, p0, p0, true, p0]
Running random walk in product with property : Diffusion2D-PT-D05N100-02 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 7}], [{ cond=p0, acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 6}], [{ cond=p0, acceptance={} source=4 dest: 0}], [{ cond=p0, acceptance={} source=5 dest: 8}], [{ cond=(AND p0 p1), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 8}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=p0, acceptance={} source=8 dest: 7}]], initial=3, aps=[p0:(GT s16 s0), p1:(GT s8 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 38 steps with 18 reset in 1 ms.
FORMULA Diffusion2D-PT-D05N100-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D05N100-02 finished in 417 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 144/144 transitions.
Graph (trivial) has 112 edges and 25 vertex of which 22 / 25 are part of one of the 1 SCC in 1 ms
Free SCC test removed 21 places
Ensure Unique test removed 137 transitions
Reduce isomorphic transitions removed 137 transitions.
Applied a total of 1 rules in 1 ms. Remains 4 /25 variables (removed 21) and now considering 7/144 (removed 137) transitions.
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 03:17:52] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 03:17:52] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 03:17:52] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 03:17:52] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
[2021-05-09 03:17:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 03:17:52] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 03:17:52] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/25 places, 7/144 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D05N100-03 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LEQ s3 s0) (LEQ 3 s1))], 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-D05N100-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D05N100-03 finished in 76 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p1)||G(p2)||p0)))], workingDir=/home/mcc/execution]
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 144/144 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 25 cols
[2021-05-09 03:17:52] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 03:17:52] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 144 rows 25 cols
[2021-05-09 03:17:52] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-09 03:17:52] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
// Phase 1: matrix 144 rows 25 cols
[2021-05-09 03:17:52] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 03:17:52] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 144/144 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : Diffusion2D-PT-D05N100-04 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(LEQ s24 s1), p2:(LEQ s16 s17), p0:(OR (LEQ s16 s17) (LEQ s3 s0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 208 ms.
Product exploration explored 100000 steps with 50000 reset in 151 ms.
Knowledge obtained : [p1, p2, p0]
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 117 ms.
Product exploration explored 100000 steps with 50000 reset in 132 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 6 out of 25 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 25/25 places, 144/144 transitions.
Graph (trivial) has 84 edges and 25 vertex of which 19 / 25 are part of one of the 1 SCC in 1 ms
Free SCC test removed 18 places
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Applied a total of 1 rules in 1 ms. Remains 7 /25 variables (removed 18) and now considering 17/144 (removed 127) transitions.
[2021-05-09 03:17:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 7 cols
[2021-05-09 03:17:53] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 03:17:53] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/25 places, 17/144 transitions.
Product exploration explored 100000 steps with 50000 reset in 186 ms.
Product exploration explored 100000 steps with 50000 reset in 154 ms.
[2021-05-09 03:17:53] [INFO ] Flatten gal took : 7 ms
[2021-05-09 03:17:53] [INFO ] Flatten gal took : 7 ms
[2021-05-09 03:17:53] [INFO ] Time to serialize gal into /tmp/LTL16239666500127854356.gal : 4 ms
[2021-05-09 03:17:53] [INFO ] Time to serialize properties into /tmp/LTL15723257995770770438.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16239666500127854356.gal, -t, CGAL, -LTL, /tmp/LTL15723257995770770438.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL16239666500127854356.gal -t CGAL -LTL /tmp/LTL15723257995770770438.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((("((cAMP__4_2_<=cAMP__4_3_)||(cAMP__1_4_<=cAMP__1_1_))")||(F("(cAMP__5_5_<=cAMP__1_2_)")))||(G("(cAMP__4_2_<=cAMP__4_3_)")))))
Formula 0 simplified : !X("((cAMP__4_2_<=cAMP__4_3_)||(cAMP__1_4_<=cAMP__1_1_))" | F"(cAMP__5_5_<=cAMP__1_2_)" | G"(cAMP__4_2_<=cAMP__4_3_)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
694 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.95725,98444,1,0,6,536802,27,0,3382,516890,9
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Diffusion2D-PT-D05N100-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property Diffusion2D-PT-D05N100-04 finished in 9060 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X((F(p1)||(p2&&G(p0))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 144/144 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 25 cols
[2021-05-09 03:18:01] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 03:18:01] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 144 rows 25 cols
[2021-05-09 03:18:01] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 03:18:01] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
// Phase 1: matrix 144 rows 25 cols
[2021-05-09 03:18:01] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 03:18:01] [INFO ] Dead Transitions using invariants and state equation in 73 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 144/144 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Diffusion2D-PT-D05N100-06 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ 3 s3), p0:(GT 1 s3), p2:(LEQ s7 s23)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 264 reset in 485 ms.
Stack based approach found an accepted trace after 58 steps with 0 reset with depth 59 and stack size 58 in 1 ms.
FORMULA Diffusion2D-PT-D05N100-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D05N100-06 finished in 793 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U G((F(p0)&&(p1 U (p2||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 144/144 transitions.
Graph (trivial) has 106 edges and 25 vertex of which 20 / 25 are part of one of the 1 SCC in 1 ms
Free SCC test removed 19 places
Ensure Unique test removed 129 transitions
Reduce isomorphic transitions removed 129 transitions.
Applied a total of 1 rules in 5 ms. Remains 6 /25 variables (removed 19) and now considering 15/144 (removed 129) transitions.
// Phase 1: matrix 15 rows 6 cols
[2021-05-09 03:18:02] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 03:18:02] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 15 rows 6 cols
[2021-05-09 03:18:02] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 03:18:02] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2021-05-09 03:18:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 6 cols
[2021-05-09 03:18:02] [INFO ] Computed 1 place invariants in 6 ms
[2021-05-09 03:18:02] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/25 places, 15/144 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Diffusion2D-PT-D05N100-07 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=0 dest: 5}], [{ cond=true, acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=4 dest: 2}, { cond=(OR p2 p1), acceptance={} source=4 dest: 4}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s0 s2), p2:(AND (GT 2 s5) (GT s4 s1)), p1:(GT s4 s1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA Diffusion2D-PT-D05N100-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D05N100-07 finished in 255 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((X(p1)||p0)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 144/144 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 25 cols
[2021-05-09 03:18:02] [INFO ] Computed 1 place invariants in 6 ms
[2021-05-09 03:18:02] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 144 rows 25 cols
[2021-05-09 03:18:02] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 03:18:02] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
// Phase 1: matrix 144 rows 25 cols
[2021-05-09 03:18:02] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 03:18:02] [INFO ] Dead Transitions using invariants and state equation in 81 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 144/144 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : Diffusion2D-PT-D05N100-08 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ 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={0} source=4 dest: 4}]], initial=3, aps=[p0:(OR (GT s5 s21) (GT s4 s18)), p1:(LEQ s15 s23)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 135 steps with 0 reset in 1 ms.
FORMULA Diffusion2D-PT-D05N100-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D05N100-08 finished in 297 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 144/144 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 25 cols
[2021-05-09 03:18:02] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 03:18:02] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 144 rows 25 cols
[2021-05-09 03:18:02] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 03:18:02] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
// Phase 1: matrix 144 rows 25 cols
[2021-05-09 03:18:02] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 03:18:02] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 144/144 transitions.
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D05N100-09 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s17 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 1 ms.
FORMULA Diffusion2D-PT-D05N100-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D05N100-09 finished in 193 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X((X(X(X(p0)))||F(p1))) U ((X((X(X(X(p0)))||F(p1)))&&G(p2))||X(G((X(X(X(p0)))||F(p1)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 144/144 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 25 cols
[2021-05-09 03:18:02] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 03:18:02] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 144 rows 25 cols
[2021-05-09 03:18:02] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 03:18:02] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
// Phase 1: matrix 144 rows 25 cols
[2021-05-09 03:18:02] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 03:18:02] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 144/144 transitions.
Stuttering acceptance computed with spot in 1368 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), false, false, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Diffusion2D-PT-D05N100-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=(NOT p1), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 9}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 10}, { cond=(AND p2 (NOT p1)), acceptance={1} source=6 dest: 11}, { cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 12}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 13}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=6 dest: 14}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 15}], [{ cond=(AND p2 (NOT p1)), acceptance={1} source=7 dest: 11}, { cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 12}, { cond=(NOT p1), acceptance={} source=7 dest: 13}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=7 dest: 14}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=7 dest: 15}], [{ cond=(NOT p1), acceptance={} source=8 dest: 16}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=9 dest: 8}, { cond=(AND p2 (NOT p1)), acceptance={} source=9 dest: 17}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=10 dest: 18}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=10 dest: 19}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=11 dest: 20}, { cond=(AND p2 (NOT p1)), acceptance={1} source=11 dest: 21}, { cond=(AND p2 (NOT p1)), acceptance={} source=11 dest: 22}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=11 dest: 23}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=11 dest: 24}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=11 dest: 25}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=12 dest: 26}, { cond=(AND p2 (NOT p1)), acceptance={1} source=12 dest: 27}, { cond=(AND p2 (NOT p1)), acceptance={} source=12 dest: 28}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=12 dest: 29}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=12 dest: 30}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=12 dest: 31}], [{ cond=(NOT p1), acceptance={} source=13 dest: 19}], [{ cond=(AND p2 (NOT p1)), acceptance={1} source=14 dest: 21}, { cond=(AND p2 (NOT p1)), acceptance={} source=14 dest: 22}, { cond=(NOT p1), acceptance={} source=14 dest: 23}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=14 dest: 24}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=14 dest: 25}], [{ cond=(AND p2 (NOT p1)), acceptance={1} source=15 dest: 27}, { cond=(AND p2 (NOT p1)), acceptance={} source=15 dest: 28}, { cond=(NOT p1), acceptance={} source=15 dest: 29}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=15 dest: 30}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=15 dest: 31}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=16 dest: 32}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=17 dest: 16}, { cond=(AND p2 (NOT p1)), acceptance={} source=17 dest: 33}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=18 dest: 8}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=18 dest: 17}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=19 dest: 8}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=20 dest: 18}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=20 dest: 19}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=21 dest: 20}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={1} source=21 dest: 21}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=21 dest: 22}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=21 dest: 23}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=21 dest: 24}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=21 dest: 25}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=22 dest: 26}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={1} source=22 dest: 27}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=22 dest: 28}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=22 dest: 29}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=22 dest: 30}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=22 dest: 31}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=23 dest: 19}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={1} source=24 dest: 21}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=24 dest: 22}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=24 dest: 23}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=24 dest: 24}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=24 dest: 25}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={1} source=25 dest: 27}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=25 dest: 28}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=25 dest: 29}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=25 dest: 30}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=25 dest: 31}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=26 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=26 dest: 9}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=27 dest: 10}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={1} source=27 dest: 11}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=27 dest: 12}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=27 dest: 13}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=27 dest: 14}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=27 dest: 15}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=28 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=28 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={1} source=28 dest: 6}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=28 dest: 7}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=28 dest: 34}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=28 dest: 35}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=29 dest: 4}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={1} source=30 dest: 11}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=30 dest: 12}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=30 dest: 13}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=30 dest: 14}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=30 dest: 15}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=31 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={1} source=31 dest: 6}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=31 dest: 7}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=31 dest: 34}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=31 dest: 35}], [{ cond=(NOT p1), acceptance={0, 1} source=32 dest: 32}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=33 dest: 32}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=33 dest: 36}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=34 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=34 dest: 5}, { cond=(AND p2 (NOT p1) p0), acceptance={1} source=34 dest: 6}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=34 dest: 7}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=34 dest: 34}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=34 dest: 35}], [{ cond=(AND (NOT p1) p0), acceptance={} source=35 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={1} source=35 dest: 6}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=35 dest: 7}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=35 dest: 34}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=35 dest: 35}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=36 dest: 32}, { cond=(AND p2 (NOT p1)), acceptance={} source=36 dest: 36}]], initial=0, aps=[p2:(GT 2 s2), p1:(GT s24 s18), p0:(LEQ 1 s9)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1344 reset in 342 ms.
Stack based approach found an accepted trace after 165 steps with 5 reset with depth 13 and stack size 13 in 2 ms.
FORMULA Diffusion2D-PT-D05N100-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D05N100-11 finished in 1845 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X((p0&&F(p1))) U G((p2||(!p0 U p3)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 144/144 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 25 cols
[2021-05-09 03:18:04] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 03:18:04] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 144 rows 25 cols
[2021-05-09 03:18:04] [INFO ] Computed 1 place invariants in 8 ms
[2021-05-09 03:18:04] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
// Phase 1: matrix 144 rows 25 cols
[2021-05-09 03:18:04] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 03:18:04] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 144/144 transitions.
Stuttering acceptance computed with spot in 361 ms :[(AND (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p3)), true, (NOT p1), (NOT p3), (AND (NOT p2) (NOT p3) p0), (AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3) p0)]
Running random walk in product with property : Diffusion2D-PT-D05N100-13 automaton TGBA [mat=[[{ cond=(AND (NOT p2) (NOT p3) p0), acceptance={0} source=0 dest: 0}, { cond=(OR p2 p3 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={} source=0 dest: 1}, { cond=(OR p2 p3 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={0} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=2 dest: 7}, { cond=(NOT p0), acceptance={} source=2 dest: 8}, { cond=(OR (AND p2 p0 (NOT p1)) (AND p3 p0 (NOT p1))), acceptance={} source=2 dest: 9}], [{ cond=(AND (NOT p3) p0 (NOT p1)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p2) (NOT p3) p0), acceptance={0} source=4 dest: 0}, { cond=(AND p2 (NOT p3) p0), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p3) p0), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={0} source=4 dest: 4}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=4 dest: 10}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p3) p0), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p3) p0), acceptance={} source=8 dest: 5}, { cond=(OR (AND p2 p0) (AND p3 p0)), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=9 dest: 11}], [{ cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={} source=10 dest: 6}, { cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=10 dest: 7}, { cond=(AND p2 (NOT p3) p0 (NOT p1)), acceptance={} source=10 dest: 9}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=10 dest: 12}], [{ cond=(AND (NOT p3) p0 (NOT p1)), acceptance={} source=11 dest: 6}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={0} source=11 dest: 11}], [{ cond=(AND (NOT p2) (NOT p3) p0), acceptance={} source=12 dest: 5}, { cond=(AND p2 (NOT p3) p0), acceptance={} source=12 dest: 8}]], initial=0, aps=[p2:(LEQ s8 s24), p3:(LEQ s10 s22), p0:(GT 3 s4), p1:(OR (LEQ 3 s4) (LEQ 3 s10))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22123 reset in 191 ms.
Stack based approach found an accepted trace after 573 steps with 131 reset with depth 8 and stack size 8 in 2 ms.
FORMULA Diffusion2D-PT-D05N100-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D05N100-13 finished in 701 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 144/144 transitions.
Graph (trivial) has 128 edges and 25 vertex of which 23 / 25 are part of one of the 1 SCC in 1 ms
Free SCC test removed 22 places
Ensure Unique test removed 139 transitions
Reduce isomorphic transitions removed 139 transitions.
Applied a total of 1 rules in 2 ms. Remains 3 /25 variables (removed 22) and now considering 5/144 (removed 139) transitions.
// Phase 1: matrix 5 rows 3 cols
[2021-05-09 03:18:05] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 03:18:05] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-09 03:18:05] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 03:18:05] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
[2021-05-09 03:18:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-09 03:18:05] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 03:18:05] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/25 places, 5/144 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D05N100-15 automaton TGBA [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:(LEQ s1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D05N100-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D05N100-15 finished in 91 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620530286276

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-D05N100"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Diffusion2D-PT-D05N100, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r083-tall-162048874800020"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D05N100.tgz
mv Diffusion2D-PT-D05N100 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;