About the Execution of ITS-Tools for Diffusion2D-PT-D30N150
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2764.995 | 190742.00 | 423027.00 | 853.60 | FFFTTFTFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r060-tall-165254772500803.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Diffusion2D-PT-D30N150, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r060-tall-165254772500803
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.3M
-rw-r--r-- 1 mcc users 8.3K Apr 30 04:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 30 04:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 30 04:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 30 04:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K May 9 07:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 9 07:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 07:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 8 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 3.0M May 10 09:33 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-D30N150-LTLCardinality-00
FORMULA_NAME Diffusion2D-PT-D30N150-LTLCardinality-01
FORMULA_NAME Diffusion2D-PT-D30N150-LTLCardinality-02
FORMULA_NAME Diffusion2D-PT-D30N150-LTLCardinality-03
FORMULA_NAME Diffusion2D-PT-D30N150-LTLCardinality-04
FORMULA_NAME Diffusion2D-PT-D30N150-LTLCardinality-05
FORMULA_NAME Diffusion2D-PT-D30N150-LTLCardinality-06
FORMULA_NAME Diffusion2D-PT-D30N150-LTLCardinality-07
FORMULA_NAME Diffusion2D-PT-D30N150-LTLCardinality-08
FORMULA_NAME Diffusion2D-PT-D30N150-LTLCardinality-09
FORMULA_NAME Diffusion2D-PT-D30N150-LTLCardinality-10
FORMULA_NAME Diffusion2D-PT-D30N150-LTLCardinality-11
FORMULA_NAME Diffusion2D-PT-D30N150-LTLCardinality-12
FORMULA_NAME Diffusion2D-PT-D30N150-LTLCardinality-13
FORMULA_NAME Diffusion2D-PT-D30N150-LTLCardinality-14
FORMULA_NAME Diffusion2D-PT-D30N150-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652656807679
Running Version 202205111006
[2022-05-15 23:20:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 23:20:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 23:20:09] [INFO ] Load time of PNML (sax parser for PT used): 239 ms
[2022-05-15 23:20:09] [INFO ] Transformed 900 places.
[2022-05-15 23:20:09] [INFO ] Transformed 6844 transitions.
[2022-05-15 23:20:09] [INFO ] Parsed PT model containing 900 places and 6844 transitions in 373 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Diffusion2D-PT-D30N150-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D30N150-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D30N150-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D30N150-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D30N150-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D30N150-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D30N150-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Applied a total of 0 rules in 220 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:20:09] [INFO ] Computed 1 place invariants in 71 ms
[2022-05-15 23:20:09] [INFO ] Implicit Places using invariants in 301 ms returned []
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:20:09] [INFO ] Computed 1 place invariants in 41 ms
[2022-05-15 23:20:10] [INFO ] Implicit Places using invariants and state equation in 833 ms returned []
Implicit Place search using SMT with State Equation took 1165 ms to find 0 implicit places.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:20:10] [INFO ] Computed 1 place invariants in 31 ms
[2022-05-15 23:20:12] [INFO ] Dead Transitions using invariants and state equation in 1875 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 900/900 places, 6844/6844 transitions.
Support contains 35 out of 900 places after structural reductions.
[2022-05-15 23:20:13] [INFO ] Flatten gal took : 349 ms
[2022-05-15 23:20:13] [INFO ] Flatten gal took : 158 ms
[2022-05-15 23:20:13] [INFO ] Input system was already deterministic with 6844 transitions.
Support contains 34 out of 900 places (down from 35) after GAL structural reductions.
Incomplete random walk after 10121 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=168 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 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 9 ms. (steps per millisecond=111 ) 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 10 ms. (steps per millisecond=100 ) 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 11 ms. (steps per millisecond=91 ) 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 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 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 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 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
Interrupted probabilistic random walk after 162804 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{3=1, 5=1, 10=1, 16=1}
Probabilistic random walk after 162804 steps, saw 131216 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :4
Running SMT prover for 14 properties.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:20:16] [INFO ] Computed 1 place invariants in 23 ms
[2022-05-15 23:20:17] [INFO ] After 324ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2022-05-15 23:20:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2022-05-15 23:20:20] [INFO ] After 3138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2022-05-15 23:20:23] [INFO ] After 6084ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 1647 ms.
[2022-05-15 23:20:25] [INFO ] After 8252ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Finished Parikh walk after 1849 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=142 )
Parikh walk visited 14 properties in 2583 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(p0))||p1)))'
Support contains 5 out of 900 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Graph (trivial) has 6770 edges and 900 vertex of which 895 / 900 are part of one of the 1 SCC in 8 ms
Free SCC test removed 894 places
Ensure Unique test removed 6833 transitions
Reduce isomorphic transitions removed 6833 transitions.
Applied a total of 1 rules in 24 ms. Remains 6 /900 variables (removed 894) and now considering 11/6844 (removed 6833) transitions.
// Phase 1: matrix 11 rows 6 cols
[2022-05-15 23:20:28] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:20:28] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 11 rows 6 cols
[2022-05-15 23:20:28] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:20:28] [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.
[2022-05-15 23:20:28] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 6 cols
[2022-05-15 23:20:28] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:20:28] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/900 places, 11/6844 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/900 places, 11/6844 transitions.
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Diffusion2D-PT-D30N150-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (GT s3 s0) (LEQ s1 s4)) (LEQ s3 s0)), p1:(LEQ 2 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 8 steps with 1 reset in 3 ms.
FORMULA Diffusion2D-PT-D30N150-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D30N150-LTLCardinality-00 finished in 272 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)||p1) U !(p2 U X(!X(p3)))))'
Support contains 6 out of 900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Applied a total of 0 rules in 65 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:20:28] [INFO ] Computed 1 place invariants in 38 ms
[2022-05-15 23:20:28] [INFO ] Implicit Places using invariants in 148 ms returned []
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:20:28] [INFO ] Computed 1 place invariants in 33 ms
[2022-05-15 23:20:29] [INFO ] Implicit Places using invariants and state equation in 735 ms returned []
Implicit Place search using SMT with State Equation took 886 ms to find 0 implicit places.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:20:29] [INFO ] Computed 1 place invariants in 32 ms
[2022-05-15 23:20:31] [INFO ] Dead Transitions using invariants and state equation in 1774 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 900/900 places, 6844/6844 transitions.
Stuttering acceptance computed with spot in 756 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p0)), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (NOT p3), true, (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p0)), (NOT p3), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (NOT p3), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D30N150-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}, { cond=(OR p1 p0), acceptance={0} source=0 dest: 4}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 6}, { cond=p0, acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 9}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 10}, { cond=(OR p1 p0), acceptance={0} source=4 dest: 11}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 12}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=4 dest: 13}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=4 dest: 14}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p1 p0), acceptance={} source=5 dest: 3}, { cond=(AND p2 p1 p0), acceptance={} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=8 dest: 7}, { cond=(AND p0 (NOT p3)), acceptance={} source=8 dest: 15}], [{ cond=(NOT p3), acceptance={} source=9 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=10 dest: 6}, { cond=(AND p0 (NOT p3)), acceptance={} source=10 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=11 dest: 10}, { cond=(OR (AND p1 (NOT p3)) (AND p0 (NOT p3))), acceptance={0} source=11 dest: 11}, { cond=(AND p2 (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=11 dest: 12}, { cond=(AND p2 (NOT p1) p0 (NOT p3)), acceptance={} source=11 dest: 13}, { cond=(OR (AND p2 p1 (NOT p3)) (AND p2 p0 (NOT p3))), acceptance={} source=11 dest: 14}], [{ cond=(NOT p3), acceptance={} source=12 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=12 dest: 2}], [{ cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=13 dest: 1}, { cond=(AND p2 p1 (NOT p0) (NOT p3)), acceptance={} source=13 dest: 2}, { cond=(AND p1 p0 (NOT p3)), acceptance={} source=13 dest: 3}, { cond=(AND p2 p1 p0 (NOT p3)), acceptance={} source=13 dest: 5}], [{ cond=(OR (AND p2 p1 (NOT p3)) (AND p2 p0 (NOT p3))), acceptance={} source=14 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=14 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=14 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=14 dest: 3}, { cond=(OR (AND p1 (NOT p3)) (AND p0 (NOT p3))), acceptance={0} source=14 dest: 4}, { cond=(AND p2 (NOT p1) p0 (NOT p3)), acceptance={} source=14 dest: 5}], [{ cond=(NOT p0), acceptance={} source=15 dest: 7}, { cond=p0, acceptance={} source=15 dest: 15}]], initial=0, aps=[p2:(GT 3 s650), p1:(LEQ s660 s62), p0:(LEQ 2 s669), p3:(LEQ s534 s864)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24992 reset in 764 ms.
Product exploration explored 100000 steps with 25068 reset in 667 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0) p3), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X p2), (X (NOT (AND p2 p1 p0))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (OR (AND p2 p1) (AND p2 p0))), (X (AND p1 (NOT p0))), (X (AND p2 p1 (NOT p0))), (X (X p2)), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p2 (NOT p1) p0 (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p0 (NOT p3)))))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (NOT (AND p2 p1 p0 (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (OR (AND p2 p1 (NOT p3)) (AND p2 p0 (NOT p3)))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p2 p1 (NOT p0) (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (OR (AND p2 p1) (AND p2 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (OR p1 p0))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (AND p2 p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 40 factoid took 3422 ms. Reduced automaton from 16 states, 48 edges and 4 AP to 16 states, 48 edges and 4 AP.
Stuttering acceptance computed with spot in 578 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p0)), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (NOT p3), true, (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p0)), (NOT p3), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (NOT p3), (NOT p0)]
Incomplete random walk after 10132 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1266 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 26) 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 26) 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 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 26) 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 26) 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 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 26) 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 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 26) 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 26) 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 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 26) seen :0
Interrupted probabilistic random walk after 161902 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{0=1, 1=1, 2=1, 4=1, 8=1, 9=1, 12=1, 13=1, 17=1, 20=1, 21=1, 22=1, 23=1}
Probabilistic random walk after 161902 steps, saw 130564 distinct states, run finished after 3005 ms. (steps per millisecond=53 ) properties seen :13
Running SMT prover for 13 properties.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:20:40] [INFO ] Computed 1 place invariants in 33 ms
[2022-05-15 23:20:40] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2022-05-15 23:20:40] [INFO ] After 305ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2022-05-15 23:20:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2022-05-15 23:20:44] [INFO ] After 2817ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2022-05-15 23:20:47] [INFO ] After 5869ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 1568 ms.
[2022-05-15 23:20:48] [INFO ] After 7882ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Finished Parikh walk after 7950 steps, including 0 resets, run visited all 1 properties in 62 ms. (steps per millisecond=128 )
Parikh walk visited 13 properties in 610 ms.
Knowledge obtained : [(AND p2 p1 (NOT p0) p3), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X p2), (X (NOT (AND p2 p1 p0))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (OR (AND p2 p1) (AND p2 p0))), (X (AND p1 (NOT p0))), (X (AND p2 p1 (NOT p0))), (X (X p2)), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p2 (NOT p1) p0 (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p0 (NOT p3)))))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (NOT (AND p2 p1 p0 (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (OR (AND p2 p1 (NOT p3)) (AND p2 p0 (NOT p3)))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p2 p1 (NOT p0) (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (OR (AND p2 p1) (AND p2 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (OR p1 p0))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (AND p2 p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (AND p0 p1 p2 (NOT p3))), (F (AND p0 (NOT p1))), (F (AND p0 p1 (NOT p3))), (F (NOT p2)), (F (AND (NOT p0) p1 p2 (NOT p3))), (F (AND p0 (NOT p1) p2)), (F (NOT (OR (AND p0 p2) (AND p1 p2)))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1 (NOT p3))), (F (AND p2 (NOT p3))), (F (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3)))), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (AND (NOT p0) p1 p2))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND p0 (NOT p3))), (F (AND (NOT p0) (NOT p3))), (F (NOT p3)), (F (AND p0 (NOT p1) p2 (NOT p3))), (F (AND (NOT p0) (NOT p1) p2 (NOT p3))), (F (OR (AND p0 (NOT p3)) (AND p1 (NOT p3)))), (F (AND p0 (NOT p1) (NOT p3))), (F (AND p0 p1 p2)), (F (AND p0 p1))]
Knowledge based reduction with 40 factoid took 3832 ms. Reduced automaton from 16 states, 48 edges and 4 AP to 16 states, 48 edges and 4 AP.
Stuttering acceptance computed with spot in 619 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p0)), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (NOT p3), true, (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p0)), (NOT p3), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (NOT p3), (NOT p0)]
Stuttering acceptance computed with spot in 590 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p0)), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (NOT p3), true, (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p0)), (NOT p3), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (NOT p3), (NOT p0)]
Support contains 6 out of 900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Applied a total of 0 rules in 60 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:20:54] [INFO ] Computed 1 place invariants in 25 ms
[2022-05-15 23:20:54] [INFO ] Implicit Places using invariants in 134 ms returned []
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:20:54] [INFO ] Computed 1 place invariants in 21 ms
[2022-05-15 23:20:55] [INFO ] Implicit Places using invariants and state equation in 623 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:20:55] [INFO ] Computed 1 place invariants in 23 ms
[2022-05-15 23:20:57] [INFO ] Dead Transitions using invariants and state equation in 1761 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 900/900 places, 6844/6844 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1 p3), (X p2), (X (OR p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p1 p2)), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (OR (AND p0 p2) (AND p1 p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p2)), (X (X (OR p0 p1))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3)))))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p3)), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (OR (AND p0 (NOT p3)) (AND p1 (NOT p3)))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (OR (AND p0 p2) (AND p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 40 factoid took 3295 ms. Reduced automaton from 16 states, 48 edges and 4 AP to 16 states, 48 edges and 4 AP.
Stuttering acceptance computed with spot in 600 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p0)), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (NOT p3), true, (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p0)), (NOT p3), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (NOT p3), (NOT p0)]
Incomplete random walk after 10119 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=722 ) properties (out of 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) 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 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 26) 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 26) 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 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 26) 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 26) 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 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 26) 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 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 26) seen :0
Interrupted probabilistic random walk after 177799 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{0=1, 1=1, 2=1, 4=1, 7=1, 8=1, 9=1, 10=1, 11=1, 12=1, 13=1, 17=1, 20=1, 21=1, 22=1, 23=1}
Probabilistic random walk after 177799 steps, saw 142701 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :16
Running SMT prover for 10 properties.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:21:04] [INFO ] Computed 1 place invariants in 19 ms
[2022-05-15 23:21:04] [INFO ] After 221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-05-15 23:21:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2022-05-15 23:21:07] [INFO ] After 2284ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2022-05-15 23:21:09] [INFO ] After 4440ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 1234 ms.
[2022-05-15 23:21:10] [INFO ] After 6021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Finished Parikh walk after 14488 steps, including 0 resets, run visited all 2 properties in 153 ms. (steps per millisecond=94 )
Parikh walk visited 10 properties in 4295 ms.
Knowledge obtained : [(AND (NOT p0) p2 p1 p3), (X p2), (X (OR p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p1 p2)), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (OR (AND p0 p2) (AND p1 p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p2)), (X (X (OR p0 p1))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3)))))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p3)), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (OR (AND p0 (NOT p3)) (AND p1 (NOT p3)))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (OR (AND p0 p2) (AND p1 p2))))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (AND p0 (NOT p1))), (F (AND p0 p2 p1 (NOT p3))), (F (NOT p2)), (F (AND p0 p1 (NOT p3))), (F (AND (NOT p0) p2 p1 (NOT p3))), (F (AND p0 p2 (NOT p1))), (F (NOT (OR (AND p0 p2) (AND p2 p1)))), (F (AND (NOT p0) p2 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1 (NOT p3))), (F (AND p2 (NOT p3))), (F (OR (AND p0 p2 (NOT p3)) (AND p2 p1 (NOT p3)))), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (AND (NOT p0) p2 p1))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND p0 (NOT p3))), (F (AND (NOT p0) (NOT p3))), (F (NOT p3)), (F (AND p0 p2 (NOT p1) (NOT p3))), (F (AND (NOT p0) p2 (NOT p1) (NOT p3))), (F (OR (AND p0 (NOT p3)) (AND p1 (NOT p3)))), (F (AND p0 (NOT p1) (NOT p3))), (F (AND p0 p2 p1)), (F (AND p0 p1))]
Knowledge based reduction with 40 factoid took 3631 ms. Reduced automaton from 16 states, 48 edges and 4 AP to 16 states, 48 edges and 4 AP.
Stuttering acceptance computed with spot in 541 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p0)), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (NOT p3), true, (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p0)), (NOT p3), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (NOT p3), (NOT p0)]
Stuttering acceptance computed with spot in 528 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p0)), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (NOT p3), true, (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p0)), (NOT p3), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (NOT p3), (NOT p0)]
Stuttering acceptance computed with spot in 685 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p0)), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (NOT p3), true, (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p0)), (NOT p3), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (NOT p3), (NOT p0)]
Product exploration explored 100000 steps with 24893 reset in 635 ms.
Product exploration explored 100000 steps with 25063 reset in 645 ms.
Applying partial POR strategy [false, false, false, false, false, false, true, true, true, false, false, false, false, false, false, true]
Stuttering acceptance computed with spot in 580 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p0)), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (NOT p3), true, (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p0)), (NOT p3), (NOT p3), (AND (NOT p0) p1 (NOT p3)), (NOT p3), (NOT p0)]
Support contains 6 out of 900 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Graph (trivial) has 6760 edges and 900 vertex of which 894 / 900 are part of one of the 1 SCC in 6 ms
Free SCC test removed 893 places
Ensure Unique test removed 6831 transitions
Reduce isomorphic transitions removed 6831 transitions.
Applied a total of 1 rules in 17 ms. Remains 7 /900 variables (removed 893) and now considering 13/6844 (removed 6831) transitions.
[2022-05-15 23:21:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 7 cols
[2022-05-15 23:21:22] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:21:22] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/900 places, 13/6844 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/900 places, 13/6844 transitions.
Product exploration explored 100000 steps with 25036 reset in 690 ms.
Product exploration explored 100000 steps with 25003 reset in 665 ms.
Built C files in :
/tmp/ltsmin9303152672696486435
[2022-05-15 23:21:23] [INFO ] Built C files in 98ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9303152672696486435
Running compilation step : cd /tmp/ltsmin9303152672696486435;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin9303152672696486435;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin9303152672696486435;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 6 out of 900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Applied a total of 0 rules in 49 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:21:26] [INFO ] Computed 1 place invariants in 27 ms
[2022-05-15 23:21:26] [INFO ] Implicit Places using invariants in 120 ms returned []
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:21:26] [INFO ] Computed 1 place invariants in 21 ms
[2022-05-15 23:21:27] [INFO ] Implicit Places using invariants and state equation in 683 ms returned []
Implicit Place search using SMT with State Equation took 809 ms to find 0 implicit places.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:21:27] [INFO ] Computed 1 place invariants in 19 ms
[2022-05-15 23:21:29] [INFO ] Dead Transitions using invariants and state equation in 1768 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 900/900 places, 6844/6844 transitions.
Built C files in :
/tmp/ltsmin4134249991208020835
[2022-05-15 23:21:29] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4134249991208020835
Running compilation step : cd /tmp/ltsmin4134249991208020835;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin4134249991208020835;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin4134249991208020835;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 23:21:32] [INFO ] Flatten gal took : 147 ms
[2022-05-15 23:21:33] [INFO ] Flatten gal took : 170 ms
[2022-05-15 23:21:33] [INFO ] Time to serialize gal into /tmp/LTL15899598164395757685.gal : 49 ms
[2022-05-15 23:21:33] [INFO ] Time to serialize properties into /tmp/LTL12955740715071831005.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15899598164395757685.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12955740715071831005.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1589959...268
Read 1 LTL properties
Checking formula 0 : !((((G("(cAMP__30_19_>=2)"))||("(cAMP__30_10_<=cAMP__12_12_)"))U(!(("(cAMP__2_29_<3)")U(X(!(X("(cAMP__26_4_<=cAMP__8_4_)"))))))))
Formula 0 simplified : !(("(cAMP__30_10_<=cAMP__12_12_)" | G"(cAMP__30_19_>=2)") U !("(cAMP__2_29_<3)" U X!X"(cAMP__26_4_<=cAMP__8_4_)"))
Detected timeout of ITS tools.
[2022-05-15 23:21:48] [INFO ] Flatten gal took : 113 ms
[2022-05-15 23:21:48] [INFO ] Applying decomposition
[2022-05-15 23:21:48] [INFO ] Flatten gal took : 118 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1880413220536872215.txt' '-o' '/tmp/graph1880413220536872215.bin' '-w' '/tmp/graph1880413220536872215.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1880413220536872215.bin' '-l' '-1' '-v' '-w' '/tmp/graph1880413220536872215.weights' '-q' '0' '-e' '0.001'
[2022-05-15 23:21:48] [INFO ] Decomposing Gal with order
[2022-05-15 23:21:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 23:21:49] [INFO ] Removed a total of 4600 redundant transitions.
[2022-05-15 23:21:49] [INFO ] Flatten gal took : 433 ms
[2022-05-15 23:21:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 100 labels/synchronizations in 65 ms.
[2022-05-15 23:21:49] [INFO ] Time to serialize gal into /tmp/LTL10456200885699606685.gal : 20 ms
[2022-05-15 23:21:50] [INFO ] Time to serialize properties into /tmp/LTL15014091459995822524.ltl : 164 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10456200885699606685.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15014091459995822524.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1045620...268
Read 1 LTL properties
Checking formula 0 : !((((G("(gi2.gi4.gu101.cAMP__30_19_>=2)"))||("(gu17.cAMP__30_10_<=gu17.cAMP__12_12_)"))U(!(("(gi4.gi2.gu56.cAMP__2_29_<3)")U(X(!(X("(g...199
Formula 0 simplified : !(("(gu17.cAMP__30_10_<=gu17.cAMP__12_12_)" | G"(gi2.gi4.gu101.cAMP__30_19_>=2)") U !("(gi4.gi2.gu56.cAMP__2_29_<3)" U X!X"(gu127.cA...186
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2452355111597379579
[2022-05-15 23:22:05] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2452355111597379579
Running compilation step : cd /tmp/ltsmin2452355111597379579;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin2452355111597379579;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin2452355111597379579;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Diffusion2D-PT-D30N150-LTLCardinality-02 finished in 99580 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F((!G(p0) U !p0))&&p1))))'
Support contains 4 out of 900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Applied a total of 0 rules in 84 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:22:08] [INFO ] Computed 1 place invariants in 30 ms
[2022-05-15 23:22:08] [INFO ] Implicit Places using invariants in 128 ms returned []
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:22:08] [INFO ] Computed 1 place invariants in 19 ms
[2022-05-15 23:22:08] [INFO ] Implicit Places using invariants and state equation in 618 ms returned []
Implicit Place search using SMT with State Equation took 747 ms to find 0 implicit places.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:22:08] [INFO ] Computed 1 place invariants in 24 ms
[2022-05-15 23:22:10] [INFO ] Dead Transitions using invariants and state equation in 1815 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 900/900 places, 6844/6844 transitions.
Stuttering acceptance computed with spot in 180 ms :[p0, (OR (NOT p1) p0), (OR (NOT p1) p0), true, (OR (NOT p1) p0)]
Running random walk in product with property : Diffusion2D-PT-D30N150-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=4, aps=[p0:(LEQ s759 s804), p1:(LEQ s130 s82)], 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 29 reset in 1679 ms.
Stack based approach found an accepted trace after 64 steps with 0 reset with depth 65 and stack size 65 in 0 ms.
FORMULA Diffusion2D-PT-D30N150-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D30N150-LTLCardinality-05 finished in 4554 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X((X(G(p0))&&p1)))))'
Support contains 4 out of 900 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Graph (trivial) has 6780 edges and 900 vertex of which 896 / 900 are part of one of the 1 SCC in 4 ms
Free SCC test removed 895 places
Ensure Unique test removed 6835 transitions
Reduce isomorphic transitions removed 6835 transitions.
Applied a total of 1 rules in 12 ms. Remains 5 /900 variables (removed 895) and now considering 9/6844 (removed 6835) transitions.
// Phase 1: matrix 9 rows 5 cols
[2022-05-15 23:22:12] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:22:12] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 9 rows 5 cols
[2022-05-15 23:22:12] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:22:12] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2022-05-15 23:22:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 5 cols
[2022-05-15 23:22:12] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:22:12] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/900 places, 9/6844 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/900 places, 9/6844 transitions.
Stuttering acceptance computed with spot in 33 ms :[(OR (NOT p1) (NOT p0))]
Running random walk in product with property : Diffusion2D-PT-D30N150-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s3 s0), p1:(GT s2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D30N150-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D30N150-LTLCardinality-08 finished in 128 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&X(p1))))'
Support contains 3 out of 900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Applied a total of 0 rules in 60 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:22:12] [INFO ] Computed 1 place invariants in 28 ms
[2022-05-15 23:22:12] [INFO ] Implicit Places using invariants in 119 ms returned []
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:22:13] [INFO ] Computed 1 place invariants in 20 ms
[2022-05-15 23:22:13] [INFO ] Implicit Places using invariants and state equation in 660 ms returned []
Implicit Place search using SMT with State Equation took 783 ms to find 0 implicit places.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:22:13] [INFO ] Computed 1 place invariants in 23 ms
[2022-05-15 23:22:15] [INFO ] Dead Transitions using invariants and state equation in 1756 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 900/900 places, 6844/6844 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : Diffusion2D-PT-D30N150-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s260 s99), p1:(LEQ 3 s776)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D30N150-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D30N150-LTLCardinality-10 finished in 2759 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 900 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Graph (trivial) has 6828 edges and 900 vertex of which 899 / 900 are part of one of the 1 SCC in 14 ms
Free SCC test removed 898 places
Ensure Unique test removed 6841 transitions
Reduce isomorphic transitions removed 6841 transitions.
Applied a total of 1 rules in 43 ms. Remains 2 /900 variables (removed 898) and now considering 3/6844 (removed 6841) transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-15 23:22:15] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:22:15] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-15 23:22:15] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:22:15] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2022-05-15 23:22:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-15 23:22:15] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:22:15] [INFO ] Dead Transitions using invariants and state equation in 13 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/900 places, 3/6844 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/900 places, 3/6844 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D30N150-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D30N150-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D30N150-LTLCardinality-11 finished in 134 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(G((F(X(p0))&&G(p1))))))'
Support contains 4 out of 900 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Graph (trivial) has 6780 edges and 900 vertex of which 896 / 900 are part of one of the 1 SCC in 5 ms
Free SCC test removed 895 places
Ensure Unique test removed 6835 transitions
Reduce isomorphic transitions removed 6835 transitions.
Applied a total of 1 rules in 10 ms. Remains 5 /900 variables (removed 895) and now considering 9/6844 (removed 6835) transitions.
// Phase 1: matrix 9 rows 5 cols
[2022-05-15 23:22:15] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:22:15] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 9 rows 5 cols
[2022-05-15 23:22:15] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:22:15] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2022-05-15 23:22:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 5 cols
[2022-05-15 23:22:15] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-15 23:22:15] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/900 places, 9/6844 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/900 places, 9/6844 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D30N150-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 3 s1), p0:(OR (GT 2 s3) (GT s0 s2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D30N150-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D30N150-LTLCardinality-12 finished in 209 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F((G(X(p0))&&F(p1))))))'
Support contains 4 out of 900 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Graph (trivial) has 6792 edges and 900 vertex of which 896 / 900 are part of one of the 1 SCC in 3 ms
Free SCC test removed 895 places
Ensure Unique test removed 6835 transitions
Reduce isomorphic transitions removed 6835 transitions.
Applied a total of 1 rules in 10 ms. Remains 5 /900 variables (removed 895) and now considering 9/6844 (removed 6835) transitions.
// Phase 1: matrix 9 rows 5 cols
[2022-05-15 23:22:15] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:22:15] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 9 rows 5 cols
[2022-05-15 23:22:15] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:22:15] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2022-05-15 23:22:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 5 cols
[2022-05-15 23:22:15] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:22:15] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/900 places, 9/6844 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/900 places, 9/6844 transitions.
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D30N150-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GT s3 s2), p0:(GT s1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D30N150-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D30N150-LTLCardinality-13 finished in 152 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 2 out of 900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Applied a total of 0 rules in 52 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:22:16] [INFO ] Computed 1 place invariants in 36 ms
[2022-05-15 23:22:16] [INFO ] Implicit Places using invariants in 127 ms returned []
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:22:16] [INFO ] Computed 1 place invariants in 22 ms
[2022-05-15 23:22:16] [INFO ] Implicit Places using invariants and state equation in 669 ms returned []
Implicit Place search using SMT with State Equation took 802 ms to find 0 implicit places.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 23:22:16] [INFO ] Computed 1 place invariants in 23 ms
[2022-05-15 23:22:18] [INFO ] Dead Transitions using invariants and state equation in 1735 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 900/900 places, 6844/6844 transitions.
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D30N150-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:(LEQ s424 s888)], 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 2411 steps with 0 reset in 34 ms.
FORMULA Diffusion2D-PT-D30N150-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D30N150-LTLCardinality-14 finished in 2712 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)||p1) U !(p2 U X(!X(p3)))))'
[2022-05-15 23:22:19] [INFO ] Flatten gal took : 109 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12337390029210005867
[2022-05-15 23:22:19] [INFO ] Too many transitions (6844) to apply POR reductions. Disabling POR matrices.
[2022-05-15 23:22:19] [INFO ] Applying decomposition
[2022-05-15 23:22:19] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12337390029210005867
Running compilation step : cd /tmp/ltsmin12337390029210005867;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-15 23:22:19] [INFO ] Flatten gal took : 113 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph836438662632551488.txt' '-o' '/tmp/graph836438662632551488.bin' '-w' '/tmp/graph836438662632551488.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph836438662632551488.bin' '-l' '-1' '-v' '-w' '/tmp/graph836438662632551488.weights' '-q' '0' '-e' '0.001'
[2022-05-15 23:22:19] [INFO ] Decomposing Gal with order
[2022-05-15 23:22:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 23:22:19] [INFO ] Removed a total of 4532 redundant transitions.
[2022-05-15 23:22:19] [INFO ] Flatten gal took : 336 ms
[2022-05-15 23:22:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 110 labels/synchronizations in 53 ms.
[2022-05-15 23:22:20] [INFO ] Time to serialize gal into /tmp/LTLCardinality1299389386308731165.gal : 43 ms
[2022-05-15 23:22:20] [INFO ] Time to serialize properties into /tmp/LTLCardinality7864482714760979380.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1299389386308731165.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7864482714760979380.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...288
Read 1 LTL properties
Checking formula 0 : !((((G("(gi1.gi1.gi1.gu96.cAMP__30_19_>=2)"))||("(gu91.cAMP__30_10_<=gu91.cAMP__12_12_)"))U(!(("(gi0.gi1.gi1.gu54.cAMP__2_29_<3)")U(X(...204
Formula 0 simplified : !(("(gu91.cAMP__30_10_<=gu91.cAMP__12_12_)" | G"(gi1.gi1.gi1.gu96.cAMP__30_19_>=2)") U !("(gi0.gi1.gi1.gu54.cAMP__2_29_<3)" U X!X"(g...191
Compilation finished in 21594 ms.
Running link step : cd /tmp/ltsmin12337390029210005867;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin12337390029210005867;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(([]((LTLAPp0==true))||(LTLAPp1==true)) U !((LTLAPp2==true) U X(!X((LTLAPp3==true)))))' '--buchi-type=spotba'
LTSmin run took 37450 ms.
FORMULA Diffusion2D-PT-D30N150-LTLCardinality-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 189585 ms.
BK_STOP 1652656998421
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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-D30N150"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Diffusion2D-PT-D30N150, 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 r060-tall-165254772500803"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D30N150.tgz
mv Diffusion2D-PT-D30N150 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 '
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 ;