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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1953.548 193917.00 233033.00 1228.00 FFFFFTFFFTFFFFFF 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-167819413800236.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-D40N100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-smll-167819413800236
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.1M
-rw-r--r-- 1 mcc users 7.0K Feb 26 04:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 26 04:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 04:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 04:19 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.2K Feb 25 15:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 26 04:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 04:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 04:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 4.7M 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-D40N100-LTLFireability-00
FORMULA_NAME Diffusion2D-PT-D40N100-LTLFireability-01
FORMULA_NAME Diffusion2D-PT-D40N100-LTLFireability-02
FORMULA_NAME Diffusion2D-PT-D40N100-LTLFireability-03
FORMULA_NAME Diffusion2D-PT-D40N100-LTLFireability-04
FORMULA_NAME Diffusion2D-PT-D40N100-LTLFireability-05
FORMULA_NAME Diffusion2D-PT-D40N100-LTLFireability-06
FORMULA_NAME Diffusion2D-PT-D40N100-LTLFireability-07
FORMULA_NAME Diffusion2D-PT-D40N100-LTLFireability-08
FORMULA_NAME Diffusion2D-PT-D40N100-LTLFireability-09
FORMULA_NAME Diffusion2D-PT-D40N100-LTLFireability-10
FORMULA_NAME Diffusion2D-PT-D40N100-LTLFireability-11
FORMULA_NAME Diffusion2D-PT-D40N100-LTLFireability-12
FORMULA_NAME Diffusion2D-PT-D40N100-LTLFireability-13
FORMULA_NAME Diffusion2D-PT-D40N100-LTLFireability-14
FORMULA_NAME Diffusion2D-PT-D40N100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678300012242

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-D40N100
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 18:26:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 18:26:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 18:26:55] [INFO ] Load time of PNML (sax parser for PT used): 669 ms
[2023-03-08 18:26:55] [INFO ] Transformed 1600 places.
[2023-03-08 18:26:55] [INFO ] Transformed 12324 transitions.
[2023-03-08 18:26:56] [INFO ] Parsed PT model containing 1600 places and 12324 transitions and 24648 arcs in 991 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Diffusion2D-PT-D40N100-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 1600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Applied a total of 0 rules in 666 ms. Remains 1600 /1600 variables (removed 0) and now considering 12324/12324 (removed 0) transitions.
// Phase 1: matrix 12324 rows 1600 cols
[2023-03-08 18:26:57] [INFO ] Computed 1 place invariants in 165 ms
[2023-03-08 18:26:57] [INFO ] Implicit Places using invariants in 738 ms returned []
Implicit Place search using SMT only with invariants took 781 ms to find 0 implicit places.
[2023-03-08 18:26:57] [INFO ] Invariant cache hit.
[2023-03-08 18:27:04] [INFO ] Dead Transitions using invariants and state equation in 6855 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8311 ms. Remains : 1600/1600 places, 12324/12324 transitions.
Support contains 30 out of 1600 places after structural reductions.
[2023-03-08 18:27:05] [INFO ] Flatten gal took : 636 ms
[2023-03-08 18:27:05] [INFO ] Flatten gal took : 330 ms
[2023-03-08 18:27:06] [INFO ] Input system was already deterministic with 12324 transitions.
Incomplete random walk after 10094 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=81 ) properties (out of 31) seen :3
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 28) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 27) 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 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 27) 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 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) 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 27) 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 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Running SMT prover for 27 properties.
[2023-03-08 18:27:07] [INFO ] Invariant cache hit.
[2023-03-08 18:27:08] [INFO ] [Real]Absence check using 1 positive place invariants in 23 ms returned sat
[2023-03-08 18:27:24] [INFO ] After 14991ms SMT Verify possible using state equation in real domain returned unsat :0 sat :19 real:8
[2023-03-08 18:27:34] [INFO ] Deduced a trap composed of 1600 places in 2468 ms of which 8 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-08 18:27:34] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-08 18:27:34] [INFO ] After 27546ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 27 Parikh solutions to 20 different solutions.
Parikh walk visited 25 properties in 13534 ms.
Support contains 2 out of 1600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Graph (trivial) has 12292 edges and 1600 vertex of which 1598 / 1600 are part of one of the 1 SCC in 26 ms
Free SCC test removed 1597 places
Drop transitions removed 12292 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 12320 transitions.
Applied a total of 1 rules in 56 ms. Remains 3 /1600 variables (removed 1597) and now considering 4/12324 (removed 12320) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 3/1600 places, 4/12324 transitions.
Finished random walk after 405 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=405 )
FORMULA Diffusion2D-PT-D40N100-LTLFireability-04 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' '!(F(G((F(p0)||X(p1)))))'
Support contains 2 out of 1600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Graph (trivial) has 12298 edges and 1600 vertex of which 1598 / 1600 are part of one of the 1 SCC in 13 ms
Free SCC test removed 1597 places
Ensure Unique test removed 12319 transitions
Reduce isomorphic transitions removed 12319 transitions.
Applied a total of 1 rules in 41 ms. Remains 3 /1600 variables (removed 1597) and now considering 5/12324 (removed 12319) transitions.
// Phase 1: matrix 5 rows 3 cols
[2023-03-08 18:27:49] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-08 18:27:49] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-08 18:27:49] [INFO ] Invariant cache hit.
[2023-03-08 18:27:49] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-08 18:27:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 18:27:49] [INFO ] Invariant cache hit.
[2023-03-08 18:27:49] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/1600 places, 5/12324 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 132 ms. Remains : 3/1600 places, 5/12324 transitions.
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Diffusion2D-PT-D40N100-LTLFireability-00 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 s0 1), p0:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 3 ms.
FORMULA Diffusion2D-PT-D40N100-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D40N100-LTLFireability-00 finished in 462 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)&&F(G(p1)))))'
Support contains 2 out of 1600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Applied a total of 0 rules in 486 ms. Remains 1600 /1600 variables (removed 0) and now considering 12324/12324 (removed 0) transitions.
// Phase 1: matrix 12324 rows 1600 cols
[2023-03-08 18:27:50] [INFO ] Computed 1 place invariants in 158 ms
[2023-03-08 18:27:50] [INFO ] Implicit Places using invariants in 514 ms returned []
Implicit Place search using SMT only with invariants took 516 ms to find 0 implicit places.
[2023-03-08 18:27:50] [INFO ] Invariant cache hit.
[2023-03-08 18:28:01] [INFO ] Dead Transitions using invariants and state equation in 10716 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11723 ms. Remains : 1600/1600 places, 12324/12324 transitions.
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Diffusion2D-PT-D40N100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s165 1), p1:(GEQ s769 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 6277 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 2 ms.
FORMULA Diffusion2D-PT-D40N100-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D40N100-LTLFireability-01 finished in 18305 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(G(p0))))'
Support contains 1 out of 1600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Applied a total of 0 rules in 281 ms. Remains 1600 /1600 variables (removed 0) and now considering 12324/12324 (removed 0) transitions.
[2023-03-08 18:28:08] [INFO ] Invariant cache hit.
[2023-03-08 18:28:08] [INFO ] Implicit Places using invariants in 300 ms returned []
Implicit Place search using SMT only with invariants took 302 ms to find 0 implicit places.
[2023-03-08 18:28:08] [INFO ] Invariant cache hit.
[2023-03-08 18:28:17] [INFO ] Dead Transitions using invariants and state equation in 9155 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9746 ms. Remains : 1600/1600 places, 12324/12324 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D40N100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GEQ s694 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Diffusion2D-PT-D40N100-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D40N100-LTLFireability-02 finished in 9943 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(((G(p0)&&F(p1))||(p2&&G(p3))))))'
Support contains 3 out of 1600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Applied a total of 0 rules in 352 ms. Remains 1600 /1600 variables (removed 0) and now considering 12324/12324 (removed 0) transitions.
[2023-03-08 18:28:18] [INFO ] Invariant cache hit.
[2023-03-08 18:28:18] [INFO ] Implicit Places using invariants in 380 ms returned []
Implicit Place search using SMT only with invariants took 384 ms to find 0 implicit places.
[2023-03-08 18:28:18] [INFO ] Invariant cache hit.
[2023-03-08 18:28:29] [INFO ] Dead Transitions using invariants and state equation in 10925 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11675 ms. Remains : 1600/1600 places, 12324/12324 transitions.
Stuttering acceptance computed with spot in 480 ms :[true, (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p3)]
Running random walk in product with property : Diffusion2D-PT-D40N100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={} source=2 dest: 0}, { cond=(OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3))), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1) p2 p3), acceptance={} source=2 dest: 3}, { cond=(OR (AND p0 p1 (NOT p2)) (AND p0 p1 (NOT p3))), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1 p2 p3), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1 p3), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p3), acceptance={} source=3 dest: 8}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND p0 p3), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p3), acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={} source=7 dest: 2}], [{ cond=(NOT p3), acceptance={} source=8 dest: 0}, { cond=p3, acceptance={} source=8 dest: 8}]], initial=6, aps=[p0:(GEQ s96 1), p1:(GEQ s619 1), p2:(GEQ s894 1), p3:(AND (GEQ s96 1) (GEQ s894 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA Diffusion2D-PT-D40N100-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D40N100-LTLFireability-03 finished in 12234 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((G((p0||F(p1)))||((p0||F(p1))&&G(F(!p0)))))))'
Support contains 2 out of 1600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Applied a total of 0 rules in 234 ms. Remains 1600 /1600 variables (removed 0) and now considering 12324/12324 (removed 0) transitions.
[2023-03-08 18:28:30] [INFO ] Invariant cache hit.
[2023-03-08 18:28:30] [INFO ] Implicit Places using invariants in 358 ms returned []
Implicit Place search using SMT only with invariants took 359 ms to find 0 implicit places.
[2023-03-08 18:28:30] [INFO ] Invariant cache hit.
[2023-03-08 18:28:37] [INFO ] Dead Transitions using invariants and state equation in 7140 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7737 ms. Remains : 1600/1600 places, 12324/12324 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Diffusion2D-PT-D40N100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s15 1), p1:(LT s1162 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 1621 ms.
Product exploration explored 100000 steps with 50000 reset in 1317 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT 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 88 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Diffusion2D-PT-D40N100-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Diffusion2D-PT-D40N100-LTLFireability-05 finished in 10919 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 1600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Applied a total of 0 rules in 241 ms. Remains 1600 /1600 variables (removed 0) and now considering 12324/12324 (removed 0) transitions.
[2023-03-08 18:28:41] [INFO ] Invariant cache hit.
[2023-03-08 18:28:41] [INFO ] Implicit Places using invariants in 301 ms returned []
Implicit Place search using SMT only with invariants took 304 ms to find 0 implicit places.
[2023-03-08 18:28:41] [INFO ] Invariant cache hit.
[2023-03-08 18:28:48] [INFO ] Dead Transitions using invariants and state equation in 7458 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8012 ms. Remains : 1600/1600 places, 12324/12324 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D40N100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s784 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 21 reset in 2964 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 1 ms.
FORMULA Diffusion2D-PT-D40N100-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D40N100-LTLFireability-06 finished in 11082 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)) U p1))'
Support contains 2 out of 1600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Graph (trivial) has 12298 edges and 1600 vertex of which 1598 / 1600 are part of one of the 1 SCC in 12 ms
Free SCC test removed 1597 places
Ensure Unique test removed 12319 transitions
Reduce isomorphic transitions removed 12319 transitions.
Applied a total of 1 rules in 32 ms. Remains 3 /1600 variables (removed 1597) and now considering 5/12324 (removed 12319) transitions.
// Phase 1: matrix 5 rows 3 cols
[2023-03-08 18:28:51] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-08 18:28:52] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-08 18:28:52] [INFO ] Invariant cache hit.
[2023-03-08 18:28:52] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-08 18:28:52] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 18:28:52] [INFO ] Invariant cache hit.
[2023-03-08 18:28:52] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/1600 places, 5/12324 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 104 ms. Remains : 3/1600 places, 5/12324 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D40N100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s0 1), p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D40N100-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D40N100-LTLFireability-07 finished in 249 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(G((p0&&(p0 U (G(p0)||(p1&&G(p2))))))) U p3)))'
Support contains 4 out of 1600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Applied a total of 0 rules in 229 ms. Remains 1600 /1600 variables (removed 0) and now considering 12324/12324 (removed 0) transitions.
// Phase 1: matrix 12324 rows 1600 cols
[2023-03-08 18:28:52] [INFO ] Computed 1 place invariants in 82 ms
[2023-03-08 18:28:52] [INFO ] Implicit Places using invariants in 380 ms returned []
Implicit Place search using SMT only with invariants took 385 ms to find 0 implicit places.
[2023-03-08 18:28:52] [INFO ] Invariant cache hit.
[2023-03-08 18:29:02] [INFO ] Dead Transitions using invariants and state equation in 9221 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9838 ms. Remains : 1600/1600 places, 12324/12324 transitions.
Stuttering acceptance computed with spot in 361 ms :[(NOT p3), (NOT p3), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Diffusion2D-PT-D40N100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(NOT p3), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p3) p0 (NOT p1)) (AND (NOT p3) p0 (NOT p2))), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) p0 p1 p2), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={0, 1} source=2 dest: 2}, { cond=(NOT p0), acceptance={0, 1, 2} source=2 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0, 2} source=2 dest: 3}, { cond=(AND p0 p1 p2), acceptance={2} source=2 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0, 1, 2} source=3 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0, 2} source=3 dest: 3}, { cond=(AND p0 p1 p2), acceptance={2} source=3 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={1, 2} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=4 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0, 2} source=4 dest: 3}, { cond=(AND p0 p2), acceptance={2} source=4 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={1, 2} source=4 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=5 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0, 2} source=5 dest: 3}, { cond=(AND p0 p2), acceptance={2} source=5 dest: 4}, { cond=(AND p0 p2), acceptance={1} source=5 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={1, 2} source=5 dest: 5}]], initial=0, aps=[p3:(AND (GEQ s606 1) (GEQ s1212 1)), p0:(LT s606 1), p1:(LT s1124 1), p2:(LT s885 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 5863 ms.
Stack based approach found an accepted trace after 747 steps with 0 reset with depth 748 and stack size 743 in 12 ms.
FORMULA Diffusion2D-PT-D40N100-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D40N100-LTLFireability-08 finished in 16122 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 U (!p1 U (p2||G(!p1))))))'
Support contains 3 out of 1600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Applied a total of 0 rules in 203 ms. Remains 1600 /1600 variables (removed 0) and now considering 12324/12324 (removed 0) transitions.
[2023-03-08 18:29:08] [INFO ] Invariant cache hit.
[2023-03-08 18:29:08] [INFO ] Implicit Places using invariants in 228 ms returned []
Implicit Place search using SMT only with invariants took 229 ms to find 0 implicit places.
[2023-03-08 18:29:08] [INFO ] Invariant cache hit.
[2023-03-08 18:29:18] [INFO ] Dead Transitions using invariants and state equation in 9750 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10185 ms. Remains : 1600/1600 places, 12324/12324 transitions.
Stuttering acceptance computed with spot in 176 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), true, (AND (NOT p2) p1)]
Running random walk in product with property : Diffusion2D-PT-D40N100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (LT s1329 1) (NOT (AND (OR (GEQ s417 1) (GEQ s943 1)) (GEQ s943 1)))), p1:(AND (OR (GEQ s417 1) (GEQ s943 1)) (GEQ s943 1)), p0:(GEQ s943 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1729 ms.
Product exploration explored 100000 steps with 50000 reset in 1441 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 p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), true, (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p2 (NOT p1) (NOT p0))
Knowledge based reduction with 12 factoid took 582 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Diffusion2D-PT-D40N100-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Diffusion2D-PT-D40N100-LTLFireability-09 finished in 14187 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 1600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Graph (trivial) has 12308 edges and 1600 vertex of which 1599 / 1600 are part of one of the 1 SCC in 7 ms
Free SCC test removed 1598 places
Ensure Unique test removed 12321 transitions
Reduce isomorphic transitions removed 12321 transitions.
Applied a total of 1 rules in 24 ms. Remains 2 /1600 variables (removed 1598) and now considering 3/12324 (removed 12321) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-08 18:29:22] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-08 18:29:22] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-08 18:29:22] [INFO ] Invariant cache hit.
[2023-03-08 18:29:22] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-08 18:29:22] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 18:29:22] [INFO ] Invariant cache hit.
[2023-03-08 18:29:22] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/1600 places, 3/12324 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 2/1600 places, 3/12324 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D40N100-LTLFireability-10 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 0 ms.
FORMULA Diffusion2D-PT-D40N100-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D40N100-LTLFireability-10 finished in 271 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Graph (trivial) has 12308 edges and 1600 vertex of which 1599 / 1600 are part of one of the 1 SCC in 6 ms
Free SCC test removed 1598 places
Ensure Unique test removed 12321 transitions
Reduce isomorphic transitions removed 12321 transitions.
Applied a total of 1 rules in 23 ms. Remains 2 /1600 variables (removed 1598) and now considering 3/12324 (removed 12321) transitions.
[2023-03-08 18:29:22] [INFO ] Invariant cache hit.
[2023-03-08 18:29:22] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-08 18:29:22] [INFO ] Invariant cache hit.
[2023-03-08 18:29:22] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-08 18:29:22] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 18:29:22] [INFO ] Invariant cache hit.
[2023-03-08 18:29:22] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/1600 places, 3/12324 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 125 ms. Remains : 2/1600 places, 3/12324 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D40N100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D40N100-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D40N100-LTLFireability-11 finished in 208 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(G(((p0 U G(!p0))&&X(p1))))))'
Support contains 2 out of 1600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Applied a total of 0 rules in 336 ms. Remains 1600 /1600 variables (removed 0) and now considering 12324/12324 (removed 0) transitions.
// Phase 1: matrix 12324 rows 1600 cols
[2023-03-08 18:29:23] [INFO ] Computed 1 place invariants in 92 ms
[2023-03-08 18:29:23] [INFO ] Implicit Places using invariants in 464 ms returned []
Implicit Place search using SMT only with invariants took 475 ms to find 0 implicit places.
[2023-03-08 18:29:23] [INFO ] Invariant cache hit.
[2023-03-08 18:29:36] [INFO ] Dead Transitions using invariants and state equation in 12271 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13094 ms. Remains : 1600/1600 places, 12324/12324 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Running random walk in product with property : Diffusion2D-PT-D40N100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(OR p0 (NOT p1)), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p0:(LT s723 1), p1:(GEQ s96 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA Diffusion2D-PT-D40N100-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D40N100-LTLFireability-12 finished in 13388 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(G((p0&&X((p0 U ((p1 U (p2||G(p1)))||G(p0)))))))))'
Support contains 1 out of 1600 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Applied a total of 0 rules in 358 ms. Remains 1600 /1600 variables (removed 0) and now considering 12324/12324 (removed 0) transitions.
[2023-03-08 18:29:36] [INFO ] Invariant cache hit.
[2023-03-08 18:29:37] [INFO ] Implicit Places using invariants in 306 ms returned []
Implicit Place search using SMT only with invariants took 308 ms to find 0 implicit places.
[2023-03-08 18:29:37] [INFO ] Invariant cache hit.
[2023-03-08 18:29:48] [INFO ] Dead Transitions using invariants and state equation in 11508 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12181 ms. Remains : 1600/1600 places, 12324/12324 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D40N100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(LT s1129 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5892 steps with 0 reset in 154 ms.
FORMULA Diffusion2D-PT-D40N100-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D40N100-LTLFireability-13 finished in 12499 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p0))||F(G((!(p0 U p1)||F(p2))))))'
Support contains 3 out of 1600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 12324/12324 transitions.
Applied a total of 0 rules in 213 ms. Remains 1600 /1600 variables (removed 0) and now considering 12324/12324 (removed 0) transitions.
[2023-03-08 18:29:49] [INFO ] Invariant cache hit.
[2023-03-08 18:29:49] [INFO ] Implicit Places using invariants in 380 ms returned []
Implicit Place search using SMT only with invariants took 385 ms to find 0 implicit places.
[2023-03-08 18:29:49] [INFO ] Invariant cache hit.
[2023-03-08 18:29:56] [INFO ] Dead Transitions using invariants and state equation in 7426 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8031 ms. Remains : 1600/1600 places, 12324/12324 transitions.
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : Diffusion2D-PT-D40N100-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s1575 1), p1:(GEQ s31 1), p2:(GEQ s1103 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 6 reset in 4531 ms.
Stack based approach found an accepted trace after 71412 steps with 3 reset with depth 10643 and stack size 2976 in 3309 ms.
FORMULA Diffusion2D-PT-D40N100-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D40N100-LTLFireability-14 finished in 16130 ms.
All properties solved by simple procedures.
Total runtime 190007 ms.
ITS solved all properties within timeout

BK_STOP 1678300206159

--------------------
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-D40N100"
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-D40N100, 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-167819413800236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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