Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r153-tall-171631151300217.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Diffusion2D-PT-D50N100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-171631151300217
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.8M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K Apr 22 14:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 19 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 14:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 14:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 14:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 11 14:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 7.3M May 18 16:42 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-D50N100-LTLCardinality-00
FORMULA_NAME Diffusion2D-PT-D50N100-LTLCardinality-01
FORMULA_NAME Diffusion2D-PT-D50N100-LTLCardinality-02
FORMULA_NAME Diffusion2D-PT-D50N100-LTLCardinality-03
FORMULA_NAME Diffusion2D-PT-D50N100-LTLCardinality-04
FORMULA_NAME Diffusion2D-PT-D50N100-LTLCardinality-05
FORMULA_NAME Diffusion2D-PT-D50N100-LTLCardinality-06
FORMULA_NAME Diffusion2D-PT-D50N100-LTLCardinality-07
FORMULA_NAME Diffusion2D-PT-D50N100-LTLCardinality-08
FORMULA_NAME Diffusion2D-PT-D50N100-LTLCardinality-09
FORMULA_NAME Diffusion2D-PT-D50N100-LTLCardinality-10
FORMULA_NAME Diffusion2D-PT-D50N100-LTLCardinality-11
FORMULA_NAME Diffusion2D-PT-D50N100-LTLCardinality-12
FORMULA_NAME Diffusion2D-PT-D50N100-LTLCardinality-13
FORMULA_NAME Diffusion2D-PT-D50N100-LTLCardinality-14
FORMULA_NAME Diffusion2D-PT-D50N100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716420239935

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Diffusion2D-PT-D50N100
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-22 23:24:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 23:24:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:24:01] [INFO ] Load time of PNML (sax parser for PT used): 406 ms
[2024-05-22 23:24:01] [INFO ] Transformed 2500 places.
[2024-05-22 23:24:02] [INFO ] Transformed 19404 transitions.
[2024-05-22 23:24:02] [INFO ] Parsed PT model containing 2500 places and 19404 transitions and 38808 arcs in 626 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Diffusion2D-PT-D50N100-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D50N100-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D50N100-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 55 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 765 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2024-05-22 23:24:03] [INFO ] Computed 1 invariants in 152 ms
[2024-05-22 23:24:03] [INFO ] Implicit Places using invariants in 616 ms returned []
Implicit Place search using SMT only with invariants took 640 ms to find 0 implicit places.
[2024-05-22 23:24:03] [INFO ] Invariant cache hit.
[2024-05-22 23:24:11] [INFO ] Dead Transitions using invariants and state equation in 7371 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8781 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Support contains 55 out of 2500 places after structural reductions.
[2024-05-22 23:24:12] [INFO ] Flatten gal took : 563 ms
[2024-05-22 23:24:12] [INFO ] Flatten gal took : 324 ms
[2024-05-22 23:24:13] [INFO ] Input system was already deterministic with 19404 transitions.
Support contains 50 out of 2500 places (down from 55) after GAL structural reductions.
Incomplete random walk after 10016 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 29) seen :0
Interrupted probabilistic random walk after 125182 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{8=1}
Probabilistic random walk after 125182 steps, saw 103605 distinct states, run finished after 3002 ms. (steps per millisecond=41 ) properties seen :1
Running SMT prover for 28 properties.
[2024-05-22 23:24:16] [INFO ] Invariant cache hit.
[2024-05-22 23:24:18] [INFO ] [Real]Absence check using 1 positive place invariants in 19 ms returned sat
[2024-05-22 23:24:18] [INFO ] After 1439ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:28
[2024-05-22 23:24:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 20 ms returned sat
[2024-05-22 23:24:41] [INFO ] After 21067ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :28
[2024-05-22 23:24:43] [INFO ] After 22871ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :28
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-22 23:24:43] [INFO ] After 25095ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :28
Parikh walk visited 27 properties in 31750 ms.
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19388 edges and 2500 vertex of which 2499 / 2500 are part of one of the 1 SCC in 25 ms
Free SCC test removed 2498 places
Drop transitions removed 19388 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 19402 transitions.
Applied a total of 1 rules in 57 ms. Remains 2 /2500 variables (removed 2498) and now considering 2/19404 (removed 19402) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 2/2500 places, 2/19404 transitions.
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1)&&(G(p2)||(p0 U p1)))))'
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 420 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2024-05-22 23:25:15] [INFO ] Invariant cache hit.
[2024-05-22 23:25:16] [INFO ] Implicit Places using invariants in 285 ms returned []
Implicit Place search using SMT only with invariants took 288 ms to find 0 implicit places.
[2024-05-22 23:25:16] [INFO ] Invariant cache hit.
[2024-05-22 23:25:23] [INFO ] Dead Transitions using invariants and state equation in 7192 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7905 ms. Remains : 2500/2500 places, 19404/19404 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 409 ms :[(NOT p2), (OR (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 6}], [{ cond=(AND p1 p2), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=6 dest: 6}]], initial=4, aps=[p2:(LEQ 3 s2174), p0:(LEQ 2 s262), p1:(LEQ s1525 s1804)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 14 ms.
FORMULA Diffusion2D-PT-D50N100-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLCardinality-00 finished in 8432 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F((p1&&X(F(p1)))))))'
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 377 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2024-05-22 23:25:24] [INFO ] Invariant cache hit.
[2024-05-22 23:25:24] [INFO ] Implicit Places using invariants in 385 ms returned []
Implicit Place search using SMT only with invariants took 395 ms to find 0 implicit places.
[2024-05-22 23:25:24] [INFO ] Invariant cache hit.
[2024-05-22 23:25:31] [INFO ] Dead Transitions using invariants and state equation in 6969 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7751 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 226 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(GT 2 s66), p0:(OR (GT s1655 s432) (GT s1403 s1658))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1895 ms.
Product exploration explored 100000 steps with 33333 reset in 1598 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 23 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Diffusion2D-PT-D50N100-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Diffusion2D-PT-D50N100-LTLCardinality-02 finished in 11591 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p1&&X((p1 U (p2||G(p1))))))))'
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 371 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2024-05-22 23:25:35] [INFO ] Invariant cache hit.
[2024-05-22 23:25:36] [INFO ] Implicit Places using invariants in 266 ms returned []
Implicit Place search using SMT only with invariants took 270 ms to find 0 implicit places.
[2024-05-22 23:25:36] [INFO ] Invariant cache hit.
[2024-05-22 23:25:43] [INFO ] Dead Transitions using invariants and state equation in 7076 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7719 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 226 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(LEQ s1975 s2466), p1:(GT 2 s31), p2:(LEQ 3 s592)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 41348 steps with 0 reset in 1879 ms.
FORMULA Diffusion2D-PT-D50N100-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLCardinality-03 finished in 9871 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 370 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2024-05-22 23:25:45] [INFO ] Invariant cache hit.
[2024-05-22 23:25:45] [INFO ] Implicit Places using invariants in 238 ms returned []
Implicit Place search using SMT only with invariants took 239 ms to find 0 implicit places.
[2024-05-22 23:25:45] [INFO ] Invariant cache hit.
[2024-05-22 23:25:53] [INFO ] Dead Transitions using invariants and state equation in 7132 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7746 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ 3 s1462) (LEQ s1478 s202))], 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 2188 ms.
Product exploration explored 100000 steps with 50000 reset in 2191 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Diffusion2D-PT-D50N100-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Diffusion2D-PT-D50N100-LTLCardinality-04 finished in 12319 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&F((G(F(p1))||(F(p1)&&G(p2)))))))'
Support contains 7 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 363 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2024-05-22 23:25:57] [INFO ] Invariant cache hit.
[2024-05-22 23:25:58] [INFO ] Implicit Places using invariants in 266 ms returned []
Implicit Place search using SMT only with invariants took 269 ms to find 0 implicit places.
[2024-05-22 23:25:58] [INFO ] Invariant cache hit.
[2024-05-22 23:26:04] [INFO ] Dead Transitions using invariants and state equation in 6508 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7142 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}, { cond=p2, acceptance={} source=1 dest: 5}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=p2, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(GT s652 s1614), p1:(GT s1780 s1311), p0:(AND (LEQ 2 s928) (LEQ s2233 s597))], nbAcceptance=1, 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 3 reset in 4684 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 1 ms.
FORMULA Diffusion2D-PT-D50N100-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLCardinality-05 finished in 12168 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19388 edges and 2500 vertex of which 2499 / 2500 are part of one of the 1 SCC in 12 ms
Free SCC test removed 2498 places
Ensure Unique test removed 19401 transitions
Reduce isomorphic transitions removed 19401 transitions.
Applied a total of 1 rules in 31 ms. Remains 2 /2500 variables (removed 2498) and now considering 3/19404 (removed 19401) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-22 23:26:09] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 23:26:09] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-22 23:26:09] [INFO ] Invariant cache hit.
[2024-05-22 23:26:09] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-22 23:26:09] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:26:09] [INFO ] Invariant cache hit.
[2024-05-22 23:26:09] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/2500 places, 3/19404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106 ms. Remains : 2/2500 places, 3/19404 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLCardinality-06 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:(LEQ 3 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 0 steps with 0 reset in 1 ms.
FORMULA Diffusion2D-PT-D50N100-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLCardinality-06 finished in 215 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||p0)))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 370 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2024-05-22 23:26:10] [INFO ] Computed 1 invariants in 93 ms
[2024-05-22 23:26:10] [INFO ] Implicit Places using invariants in 354 ms returned []
Implicit Place search using SMT only with invariants took 365 ms to find 0 implicit places.
[2024-05-22 23:26:10] [INFO ] Invariant cache hit.
[2024-05-22 23:26:17] [INFO ] Dead Transitions using invariants and state equation in 7142 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7879 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(GT 2 s1034), p0:(OR (LEQ 2 s1034) (GT s645 s1010))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 14004 steps with 0 reset in 509 ms.
FORMULA Diffusion2D-PT-D50N100-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLCardinality-07 finished in 8584 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 355 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2024-05-22 23:26:18] [INFO ] Invariant cache hit.
[2024-05-22 23:26:19] [INFO ] Implicit Places using invariants in 263 ms returned []
Implicit Place search using SMT only with invariants took 269 ms to find 0 implicit places.
[2024-05-22 23:26:19] [INFO ] Invariant cache hit.
[2024-05-22 23:26:26] [INFO ] Dead Transitions using invariants and state equation in 7167 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7796 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 s1234)], 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 1 reset in 5210 ms.
Stack based approach found an accepted trace after 36 steps with 0 reset with depth 37 and stack size 37 in 1 ms.
FORMULA Diffusion2D-PT-D50N100-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLCardinality-08 finished in 13117 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||X((p1||F(p2))))))))'
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 365 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2024-05-22 23:26:32] [INFO ] Invariant cache hit.
[2024-05-22 23:26:32] [INFO ] Implicit Places using invariants in 273 ms returned []
Implicit Place search using SMT only with invariants took 274 ms to find 0 implicit places.
[2024-05-22 23:26:32] [INFO ] Invariant cache hit.
[2024-05-22 23:26:39] [INFO ] Dead Transitions using invariants and state equation in 6918 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7559 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(GT s1699 s2007), p1:(GT 2 s703), p2:(GT 1 s797)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 1481 ms.
Product exploration explored 100000 steps with 25000 reset in 1482 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 4 states, 4 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 308015 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{}
Probabilistic random walk after 308015 steps, saw 247308 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 23:26:45] [INFO ] Invariant cache hit.
[2024-05-22 23:26:46] [INFO ] [Real]Absence check using 1 positive place invariants in 21 ms returned sat
[2024-05-22 23:26:53] [INFO ] After 7827ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:26:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 19 ms returned sat
[2024-05-22 23:27:00] [INFO ] After 6880ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:27:01] [INFO ] After 7495ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 348 ms.
[2024-05-22 23:27:01] [INFO ] After 8145ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 21826 steps, including 0 resets, run visited all 1 properties in 286 ms. (steps per millisecond=76 )
Parikh walk visited 1 properties in 288 ms.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0) (NOT p2)))]
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 4 states, 4 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 352 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2024-05-22 23:27:02] [INFO ] Invariant cache hit.
[2024-05-22 23:27:03] [INFO ] Implicit Places using invariants in 251 ms returned []
Implicit Place search using SMT only with invariants took 252 ms to find 0 implicit places.
[2024-05-22 23:27:03] [INFO ] Invariant cache hit.
[2024-05-22 23:27:09] [INFO ] Dead Transitions using invariants and state equation in 6633 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7238 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 4 states, 4 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10092 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2018 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 312163 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :{}
Probabilistic random walk after 312163 steps, saw 250726 distinct states, run finished after 3003 ms. (steps per millisecond=103 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 23:27:13] [INFO ] Invariant cache hit.
[2024-05-22 23:27:13] [INFO ] [Real]Absence check using 1 positive place invariants in 16 ms returned sat
[2024-05-22 23:27:20] [INFO ] After 7637ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:27:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 17 ms returned sat
[2024-05-22 23:27:27] [INFO ] After 6859ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:27:28] [INFO ] After 7495ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 367 ms.
[2024-05-22 23:27:28] [INFO ] After 8155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 21886 steps, including 0 resets, run visited all 1 properties in 275 ms. (steps per millisecond=79 )
Parikh walk visited 1 properties in 278 ms.
Knowledge obtained : [(AND p1 (NOT p0) p2), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 2 factoid took 109 ms. Reduced automaton from 4 states, 4 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 25000 reset in 1474 ms.
Product exploration explored 100000 steps with 25000 reset in 1460 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19340 edges and 2500 vertex of which 2496 / 2500 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2495 places
Ensure Unique test removed 19395 transitions
Reduce isomorphic transitions removed 19395 transitions.
Applied a total of 1 rules in 22 ms. Remains 5 /2500 variables (removed 2495) and now considering 9/19404 (removed 19395) transitions.
[2024-05-22 23:27:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 5 cols
[2024-05-22 23:27:32] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 23:27:32] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/2500 places, 9/19404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70 ms. Remains : 5/2500 places, 9/19404 transitions.
Built C files in :
/tmp/ltsmin8261371065425873914
[2024-05-22 23:27:33] [INFO ] Built C files in 192ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8261371065425873914
Running compilation step : cd /tmp/ltsmin8261371065425873914;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8261371065425873914;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8261371065425873914;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 504 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2024-05-22 23:27:36] [INFO ] Computed 1 invariants in 103 ms
[2024-05-22 23:27:37] [INFO ] Implicit Places using invariants in 348 ms returned []
Implicit Place search using SMT only with invariants took 349 ms to find 0 implicit places.
[2024-05-22 23:27:37] [INFO ] Invariant cache hit.
[2024-05-22 23:27:43] [INFO ] Dead Transitions using invariants and state equation in 6751 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7607 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Built C files in :
/tmp/ltsmin4180277503371798133
[2024-05-22 23:27:44] [INFO ] Built C files in 144ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4180277503371798133
Running compilation step : cd /tmp/ltsmin4180277503371798133;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4180277503371798133;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4180277503371798133;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-22 23:27:47] [INFO ] Flatten gal took : 281 ms
[2024-05-22 23:27:48] [INFO ] Flatten gal took : 272 ms
[2024-05-22 23:27:48] [INFO ] Time to serialize gal into /tmp/LTL14971036839686481960.gal : 89 ms
[2024-05-22 23:27:48] [INFO ] Time to serialize properties into /tmp/LTL16359827484466659379.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14971036839686481960.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2787642934405366903.hoa' '-atoms' '/tmp/LTL16359827484466659379.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16359827484466659379.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2787642934405366903.hoa
Detected timeout of ITS tools.
[2024-05-22 23:28:03] [INFO ] Flatten gal took : 249 ms
[2024-05-22 23:28:03] [INFO ] Flatten gal took : 264 ms
[2024-05-22 23:28:03] [INFO ] Time to serialize gal into /tmp/LTL17869894682810060697.gal : 44 ms
[2024-05-22 23:28:03] [INFO ] Time to serialize properties into /tmp/LTL3942957009280361969.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17869894682810060697.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3942957009280361969.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("(cAMP__40_9_>cAMP__47_17_)")||(X(("(cAMP__23_13_<2)")||(F("(cAMP__24_7_<1)")))))))))
Formula 0 simplified : XXG(!"(cAMP__40_9_>cAMP__47_17_)" & X(!"(cAMP__23_13_<2)" & G!"(cAMP__24_7_<1)"))
Detected timeout of ITS tools.
[2024-05-22 23:28:19] [INFO ] Flatten gal took : 249 ms
[2024-05-22 23:28:19] [INFO ] Applying decomposition
[2024-05-22 23:28:19] [INFO ] Flatten gal took : 264 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17759703873393981871.txt' '-o' '/tmp/graph17759703873393981871.bin' '-w' '/tmp/graph17759703873393981871.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17759703873393981871.bin' '-l' '-1' '-v' '-w' '/tmp/graph17759703873393981871.weights' '-q' '0' '-e' '0.001'
[2024-05-22 23:28:20] [INFO ] Decomposing Gal with order
[2024-05-22 23:28:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 23:28:21] [INFO ] Removed a total of 13792 redundant transitions.
[2024-05-22 23:28:22] [INFO ] Flatten gal took : 986 ms
[2024-05-22 23:28:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 156 labels/synchronizations in 157 ms.
[2024-05-22 23:28:23] [INFO ] Time to serialize gal into /tmp/LTL16327566724344194036.gal : 104 ms
[2024-05-22 23:28:23] [INFO ] Time to serialize properties into /tmp/LTL15265761993470577781.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16327566724344194036.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15265761993470577781.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("(gu305.cAMP__40_9_>gu305.cAMP__47_17_)")||(X(("(gi1.gu117.cAMP__23_13_<2)")||(F("(gi1.gu126.cAMP__24_7_<1)")))))))))
Formula 0 simplified : XXG(!"(gu305.cAMP__40_9_>gu305.cAMP__47_17_)" & X(!"(gi1.gu117.cAMP__23_13_<2)" & G!"(gi1.gu126.cAMP__24_7_<1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10416133060644158387
[2024-05-22 23:28:38] [INFO ] Built C files in 126ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10416133060644158387
Running compilation step : cd /tmp/ltsmin10416133060644158387;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10416133060644158387;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10416133060644158387;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Diffusion2D-PT-D50N100-LTLCardinality-10 finished in 129800 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(X(G(p2))||p1))))'
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 523 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2024-05-22 23:28:42] [INFO ] Invariant cache hit.
[2024-05-22 23:28:42] [INFO ] Implicit Places using invariants in 259 ms returned []
Implicit Place search using SMT only with invariants took 260 ms to find 0 implicit places.
[2024-05-22 23:28:42] [INFO ] Invariant cache hit.
[2024-05-22 23:28:48] [INFO ] Dead Transitions using invariants and state equation in 6715 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7504 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLCardinality-11 automaton TGBA Formula[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=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ 1 s1250), p1:(OR (GT 1 s1250) (LEQ s1130 s2225)), p2:(LEQ s2346 s1696)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 1 steps with 0 reset in 1 ms.
FORMULA Diffusion2D-PT-D50N100-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLCardinality-11 finished in 7704 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||G((p1 U p2))) U X(G(p3))))'
Support contains 6 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 518 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2024-05-22 23:28:49] [INFO ] Invariant cache hit.
[2024-05-22 23:28:49] [INFO ] Implicit Places using invariants in 239 ms returned []
Implicit Place search using SMT only with invariants took 241 ms to find 0 implicit places.
[2024-05-22 23:28:49] [INFO ] Invariant cache hit.
[2024-05-22 23:28:56] [INFO ] Dead Transitions using invariants and state equation in 6880 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7649 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 227 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), true, (NOT p2), (NOT p2)]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p2) (NOT p1) p3), acceptance={} source=1 dest: 0}, { cond=(OR (AND p0 p2 p3) (AND p0 p1 p3)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=2 dest: 1}, { cond=(OR (AND p0 p3) (AND p2 p3) (AND p1 p3)), acceptance={} source=2 dest: 2}, { cond=(OR (AND p0 (NOT p3)) (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 4}, { cond=(OR p2 p1), acceptance={} source=5 dest: 5}]], initial=2, aps=[p3:(OR (LEQ 2 s1662) (LEQ s725 s2255)), p0:(AND (LEQ 2 s361) (LEQ s525 s2264)), p2:(LEQ s725 s2255), p1:(LEQ s525 s2264)], nbAcceptance=1, 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 33350 reset in 1824 ms.
Product exploration explored 100000 steps with 33331 reset in 1576 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 p3 (NOT p0) p2 p1), (X p3), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (OR (AND p0 p2 p3) (AND p0 p1 p3)))), (X (NOT (OR (AND p2 (NOT p3)) (AND p1 (NOT p3))))), (X (NOT (AND (NOT p2) p1 (NOT p3)))), (X (NOT (AND p0 (NOT p2) (NOT p1) p3))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (X (NOT (OR (AND p0 (NOT p3)) (AND p2 (NOT p3)) (AND p1 (NOT p3))))), (X (OR (AND p0 p3) (AND p2 p3) (AND p1 p3))), (X (X p3)), (X (X (NOT (AND p0 (NOT p2) (NOT p1) p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), true, (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND p0 p2 p3) (AND p0 p1 p3))))), (X (X (NOT (OR (AND p2 (NOT p3)) (AND p1 (NOT p3)))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR p2 p1))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X (NOT (OR (AND p0 (NOT p3)) (AND p2 (NOT p3)) (AND p1 (NOT p3)))))), (X (X (OR (AND p0 p3) (AND p2 p3) (AND p1 p3))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 25 factoid took 167 ms. Reduced automaton from 6 states, 17 edges and 4 AP (stutter sensitive) to 6 states, 20 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 296 ms :[(NOT p3), (AND p0 (NOT p2) (NOT p3)), (NOT p3), true, (NOT p2), (OR (AND (NOT p2) p3) (AND p0 (NOT p2)))]
Incomplete random walk after 10002 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) 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 18) seen :0
Interrupted probabilistic random walk after 52791 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 52791 steps, saw 43643 distinct states, run finished after 3001 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 18 properties.
[2024-05-22 23:29:04] [INFO ] Invariant cache hit.
[2024-05-22 23:29:05] [INFO ] After 856ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:16
[2024-05-22 23:29:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 18 ms returned sat
[2024-05-22 23:29:27] [INFO ] After 20539ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :16
[2024-05-22 23:29:30] [INFO ] After 23624ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :15
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-22 23:29:30] [INFO ] After 25048ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :15
Fused 18 Parikh solutions to 16 different solutions.
Finished Parikh walk after 58465 steps, including 0 resets, run visited all 5 properties in 1172 ms. (steps per millisecond=49 )
Parikh walk visited 14 properties in 3176 ms.
Support contains 6 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19314 edges and 2500 vertex of which 2494 / 2500 are part of one of the 1 SCC in 7 ms
Free SCC test removed 2493 places
Drop transitions removed 19314 transitions
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 19392 transitions.
Applied a total of 1 rules in 21 ms. Remains 7 /2500 variables (removed 2493) and now considering 12/19404 (removed 19392) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 7/2500 places, 12/19404 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5000 ) properties (out of 2) seen :1
Finished Best-First random walk after 39 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=39 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p3 (NOT p0) p2 p1), (X p3), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (OR (AND p0 p2 p3) (AND p0 p1 p3)))), (X (NOT (OR (AND p2 (NOT p3)) (AND p1 (NOT p3))))), (X (NOT (AND (NOT p2) p1 (NOT p3)))), (X (NOT (AND p0 (NOT p2) (NOT p1) p3))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (X (NOT (OR (AND p0 (NOT p3)) (AND p2 (NOT p3)) (AND p1 (NOT p3))))), (X (OR (AND p0 p3) (AND p2 p3) (AND p1 p3))), (X (X p3)), (X (X (NOT (AND p0 (NOT p2) (NOT p1) p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), true, (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND p0 p2 p3) (AND p0 p1 p3))))), (X (X (NOT (OR (AND p2 (NOT p3)) (AND p1 (NOT p3)))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR p2 p1))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X (NOT (OR (AND p0 (NOT p3)) (AND p2 (NOT p3)) (AND p1 (NOT p3)))))), (X (X (OR (AND p0 p3) (AND p2 p3) (AND p1 p3))))]
False Knowledge obtained : [(F (NOT (OR (AND p0 p3) (AND p2 p3) (AND p1 p3)))), (F (NOT (OR (AND (NOT p0) p2 p3) (AND (NOT p0) p1 p3)))), (F (OR (AND p0 (NOT p3)) (AND p2 (NOT p3)) (AND p1 (NOT p3)))), (F (OR (AND p0 (NOT p2) (NOT p1)) (AND (NOT p2) (NOT p1) p3))), (F (AND p0 (NOT p2) p1 (NOT p3))), (F (AND p0 (NOT p2) (NOT p1) (NOT p3))), (F (AND (NOT p2) p1)), (F (AND (NOT p0) (NOT p2) (NOT p1) p3)), (F (AND (NOT p2) (NOT p1))), (F (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) p1 (NOT p3)))), (F (OR (AND p0 p2 (NOT p3)) (AND p0 p1 (NOT p3)))), (F (NOT p3)), (F (OR (AND p0 p2 p3) (AND p0 p1 p3))), (F (NOT (OR (AND p0 p2) (AND p0 p1) (AND p2 p3) (AND p1 p3)))), (F (AND p0 (NOT p2) (NOT p1) p3)), (F (OR (AND p0 (NOT p2) p1) (AND (NOT p2) p1 p3))), (F (AND (NOT p0) (NOT p2) p1 (NOT p3))), (F (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)))]
Property proved to be false thanks to negative knowledge :(F (AND p0 (NOT p2) (NOT p1) (NOT p3)))
Knowledge based reduction with 25 factoid took 354 ms. Reduced automaton from 6 states, 20 edges and 4 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Diffusion2D-PT-D50N100-LTLCardinality-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Diffusion2D-PT-D50N100-LTLCardinality-13 finished in 44673 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 506 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2024-05-22 23:29:34] [INFO ] Invariant cache hit.
[2024-05-22 23:29:34] [INFO ] Implicit Places using invariants in 257 ms returned []
Implicit Place search using SMT only with invariants took 258 ms to find 0 implicit places.
[2024-05-22 23:29:34] [INFO ] Invariant cache hit.
[2024-05-22 23:29:41] [INFO ] Dead Transitions using invariants and state equation in 6562 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7327 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLCardinality-14 automaton TGBA Formula[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:(GT s1756 s1860)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N100-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLCardinality-14 finished in 7434 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 531 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2024-05-22 23:29:41] [INFO ] Invariant cache hit.
[2024-05-22 23:29:42] [INFO ] Implicit Places using invariants in 229 ms returned []
Implicit Place search using SMT only with invariants took 231 ms to find 0 implicit places.
[2024-05-22 23:29:42] [INFO ] Invariant cache hit.
[2024-05-22 23:29:48] [INFO ] Dead Transitions using invariants and state equation in 6759 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7524 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(LEQ 2 s311), p0:(AND (GT s2271 s1861) (GT s2355 s1784))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1 reset in 4664 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA Diffusion2D-PT-D50N100-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLCardinality-15 finished in 12313 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||X((p1||F(p2))))))))'
Found a Shortening insensitive property : Diffusion2D-PT-D50N100-LTLCardinality-10
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19340 edges and 2500 vertex of which 2496 / 2500 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2495 places
Ensure Unique test removed 19395 transitions
Reduce isomorphic transitions removed 19395 transitions.
Applied a total of 1 rules in 13 ms. Remains 5 /2500 variables (removed 2495) and now considering 9/19404 (removed 19395) transitions.
// Phase 1: matrix 9 rows 5 cols
[2024-05-22 23:29:53] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 23:29:53] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-22 23:29:53] [INFO ] Invariant cache hit.
[2024-05-22 23:29:53] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-05-22 23:29:53] [INFO ] Invariant cache hit.
[2024-05-22 23:29:53] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 5/2500 places, 9/19404 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 70 ms. Remains : 5/2500 places, 9/19404 transitions.
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(GT s2 s3), p1:(GT 2 s0), p2:(GT 1 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 33 steps with 8 reset in 0 ms.
Treatment of property Diffusion2D-PT-D50N100-LTLCardinality-10 finished in 340 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-05-22 23:29:54] [INFO ] Flatten gal took : 411 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2350757980153573167
[2024-05-22 23:29:54] [INFO ] Too many transitions (19404) to apply POR reductions. Disabling POR matrices.
[2024-05-22 23:29:54] [INFO ] Built C files in 138ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2350757980153573167
Running compilation step : cd /tmp/ltsmin2350757980153573167;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-22 23:29:54] [INFO ] Applying decomposition
[2024-05-22 23:29:54] [INFO ] Flatten gal took : 289 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8247661930977412809.txt' '-o' '/tmp/graph8247661930977412809.bin' '-w' '/tmp/graph8247661930977412809.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8247661930977412809.bin' '-l' '-1' '-v' '-w' '/tmp/graph8247661930977412809.weights' '-q' '0' '-e' '0.001'
[2024-05-22 23:29:55] [INFO ] Decomposing Gal with order
[2024-05-22 23:29:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 23:29:56] [INFO ] Removed a total of 13656 redundant transitions.
[2024-05-22 23:29:56] [INFO ] Flatten gal took : 658 ms
[2024-05-22 23:29:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 116 labels/synchronizations in 122 ms.
[2024-05-22 23:29:57] [INFO ] Time to serialize gal into /tmp/LTLCardinality11067516515914249698.gal : 63 ms
[2024-05-22 23:29:57] [INFO ] Time to serialize properties into /tmp/LTLCardinality560498017769020306.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11067516515914249698.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality560498017769020306.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("(gu295.cAMP__40_9_>gu295.cAMP__47_17_)")||(X(("(gi1.gu110.cAMP__23_13_<2)")||(F("(gi1.gu127.cAMP__24_7_<1)")))))))))
Formula 0 simplified : XXG(!"(gu295.cAMP__40_9_>gu295.cAMP__47_17_)" & X(!"(gi1.gu110.cAMP__23_13_<2)" & G!"(gi1.gu127.cAMP__24_7_<1)"))
Compilation finished in 176357 ms.
Running link step : cd /tmp/ltsmin2350757980153573167;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 148 ms.
Running LTSmin : cd /tmp/ltsmin2350757980153573167;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(((LTLAPp0==true)||X(((LTLAPp1==true)||<>((LTLAPp2==true))))))))' '--buchi-type=spotba'
LTSmin run took 16025 ms.
FORMULA Diffusion2D-PT-D50N100-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 545911 ms.

BK_STOP 1716420788196

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-D50N100"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is Diffusion2D-PT-D50N100, 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 r153-tall-171631151300217"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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