About the Execution of ITS-Tools for Diffusion2D-PT-D20N050
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3597.903 | 280294.00 | 442585.00 | 826.90 | TFFFTFFFFTFFFTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r083-tall-162048875000116.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Diffusion2D-PT-D20N050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875000116
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 19K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 80K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Mar 28 16:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 16:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Mar 23 10:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 23 10:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 22 17:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 17:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 8 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1.2M May 5 16:51 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Diffusion2D-PT-D20N050-00
FORMULA_NAME Diffusion2D-PT-D20N050-01
FORMULA_NAME Diffusion2D-PT-D20N050-02
FORMULA_NAME Diffusion2D-PT-D20N050-03
FORMULA_NAME Diffusion2D-PT-D20N050-04
FORMULA_NAME Diffusion2D-PT-D20N050-05
FORMULA_NAME Diffusion2D-PT-D20N050-06
FORMULA_NAME Diffusion2D-PT-D20N050-07
FORMULA_NAME Diffusion2D-PT-D20N050-08
FORMULA_NAME Diffusion2D-PT-D20N050-09
FORMULA_NAME Diffusion2D-PT-D20N050-10
FORMULA_NAME Diffusion2D-PT-D20N050-11
FORMULA_NAME Diffusion2D-PT-D20N050-12
FORMULA_NAME Diffusion2D-PT-D20N050-13
FORMULA_NAME Diffusion2D-PT-D20N050-14
FORMULA_NAME Diffusion2D-PT-D20N050-15
=== Now, execution of the tool begins
BK_START 1620542766152
Running Version 0
[2021-05-09 06:46:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 06:46:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 06:46:07] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2021-05-09 06:46:07] [INFO ] Transformed 400 places.
[2021-05-09 06:46:07] [INFO ] Transformed 2964 transitions.
[2021-05-09 06:46:07] [INFO ] Parsed PT model containing 400 places and 2964 transitions in 182 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 06:46:07] [INFO ] Initial state test concluded for 2 properties.
FORMULA Diffusion2D-PT-D20N050-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D20N050-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 400 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 400/400 places, 2964/2964 transitions.
Applied a total of 0 rules in 72 ms. Remains 400 /400 variables (removed 0) and now considering 2964/2964 (removed 0) transitions.
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 06:46:08] [INFO ] Computed 1 place invariants in 42 ms
[2021-05-09 06:46:08] [INFO ] Implicit Places using invariants in 198 ms returned []
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 06:46:08] [INFO ] Computed 1 place invariants in 17 ms
[2021-05-09 06:46:08] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 779 ms to find 0 implicit places.
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 06:46:08] [INFO ] Computed 1 place invariants in 17 ms
[2021-05-09 06:46:09] [INFO ] Dead Transitions using invariants and state equation in 1040 ms returned []
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 2964/2964 transitions.
[2021-05-09 06:46:10] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-09 06:46:10] [INFO ] Flatten gal took : 170 ms
FORMULA Diffusion2D-PT-D20N050-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 06:46:10] [INFO ] Flatten gal took : 104 ms
[2021-05-09 06:46:10] [INFO ] Input system was already deterministic with 2964 transitions.
Incomplete random walk after 100004 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=1052 ) properties (out of 32) seen :27
Running SMT prover for 5 properties.
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 06:46:10] [INFO ] Computed 1 place invariants in 40 ms
[2021-05-09 06:46:10] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2021-05-09 06:46:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:46:11] [INFO ] [Real]Absence check using state equation in 463 ms returned sat
[2021-05-09 06:46:11] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 171 ms.
[2021-05-09 06:46:11] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2021-05-09 06:46:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:46:12] [INFO ] [Real]Absence check using state equation in 425 ms returned sat
[2021-05-09 06:46:12] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 172 ms.
[2021-05-09 06:46:12] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2021-05-09 06:46:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:46:12] [INFO ] [Real]Absence check using state equation in 385 ms returned sat
[2021-05-09 06:46:13] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 150 ms.
[2021-05-09 06:46:13] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2021-05-09 06:46:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:46:13] [INFO ] [Real]Absence check using state equation in 384 ms returned sat
[2021-05-09 06:46:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:46:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2021-05-09 06:46:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:46:14] [INFO ] [Nat]Absence check using state equation in 380 ms returned sat
[2021-05-09 06:46:14] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 137 ms.
[2021-05-09 06:46:14] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2021-05-09 06:46:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:46:14] [INFO ] [Real]Absence check using state equation in 399 ms returned sat
[2021-05-09 06:46:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:46:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2021-05-09 06:46:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:46:15] [INFO ] [Nat]Absence check using state equation in 385 ms returned sat
[2021-05-09 06:46:15] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 158 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((F(p0)||(p1 U (p2||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 400 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 400/400 places, 2964/2964 transitions.
Graph (trivial) has 2900 edges and 400 vertex of which 396 / 400 are part of one of the 1 SCC in 6 ms
Free SCC test removed 395 places
Ensure Unique test removed 2955 transitions
Reduce isomorphic transitions removed 2955 transitions.
Applied a total of 1 rules in 17 ms. Remains 5 /400 variables (removed 395) and now considering 9/2964 (removed 2955) transitions.
// Phase 1: matrix 9 rows 5 cols
[2021-05-09 06:46:15] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 06:46:15] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 9 rows 5 cols
[2021-05-09 06:46:15] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 06:46:15] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
[2021-05-09 06:46:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 5 cols
[2021-05-09 06:46:15] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 06:46:15] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/400 places, 9/2964 transitions.
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : Diffusion2D-PT-D20N050-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s3), p1:(GT 2 s1), p2:(AND (GT s2 s0) (GT 2 s1))], 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 84 steps with 0 reset in 2 ms.
FORMULA Diffusion2D-PT-D20N050-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D20N050-01 finished in 309 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (G(p0)||(F(p2)&&p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 400 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 400/400 places, 2964/2964 transitions.
Graph (trivial) has 2916 edges and 400 vertex of which 397 / 400 are part of one of the 1 SCC in 3 ms
Free SCC test removed 396 places
Ensure Unique test removed 2957 transitions
Reduce isomorphic transitions removed 2957 transitions.
Applied a total of 1 rules in 11 ms. Remains 4 /400 variables (removed 396) and now considering 7/2964 (removed 2957) transitions.
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 06:46:15] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 06:46:15] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 06:46:15] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 06:46:15] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 17 ms to find 0 implicit places.
[2021-05-09 06:46:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 06:46:15] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 06:46:15] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/400 places, 7/2964 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p2), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : Diffusion2D-PT-D20N050-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=3, aps=[p2:(OR (GT 1 s2) (GT 3 s0)), p0:(GT 3 s1), p1:(AND (LEQ 3 s0) (GT 3 s1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 155 steps with 3 reset in 2 ms.
FORMULA Diffusion2D-PT-D20N050-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D20N050-02 finished in 165 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 400/400 places, 2964/2964 transitions.
Graph (trivial) has 2934 edges and 400 vertex of which 398 / 400 are part of one of the 1 SCC in 3 ms
Free SCC test removed 397 places
Ensure Unique test removed 2957 transitions
Reduce isomorphic transitions removed 2957 transitions.
Applied a total of 1 rules in 8 ms. Remains 3 /400 variables (removed 397) and now considering 7/2964 (removed 2957) transitions.
// Phase 1: matrix 7 rows 3 cols
[2021-05-09 06:46:15] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 06:46:15] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 7 rows 3 cols
[2021-05-09 06:46:15] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 06:46:15] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
[2021-05-09 06:46:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 3 cols
[2021-05-09 06:46:15] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 06:46:15] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/400 places, 7/2964 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D20N050-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s0 s1)], 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 5 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D20N050-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D20N050-03 finished in 87 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G(p0) U p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 400 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 400/400 places, 2964/2964 transitions.
Applied a total of 0 rules in 124 ms. Remains 400 /400 variables (removed 0) and now considering 2964/2964 (removed 0) transitions.
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 06:46:16] [INFO ] Computed 1 place invariants in 14 ms
[2021-05-09 06:46:16] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 06:46:16] [INFO ] Computed 1 place invariants in 15 ms
[2021-05-09 06:46:16] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 06:46:16] [INFO ] Computed 1 place invariants in 12 ms
[2021-05-09 06:46:17] [INFO ] Dead Transitions using invariants and state equation in 877 ms returned []
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 2964/2964 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D20N050-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ s357 s176), p0:(LEQ s53 s24)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 569 ms.
Product exploration explored 100000 steps with 33333 reset in 504 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 391 ms.
Product exploration explored 100000 steps with 33333 reset in 394 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Support contains 4 out of 400 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 400/400 places, 2964/2964 transitions.
Graph (trivial) has 2900 edges and 400 vertex of which 396 / 400 are part of one of the 1 SCC in 3 ms
Free SCC test removed 395 places
Ensure Unique test removed 2955 transitions
Reduce isomorphic transitions removed 2955 transitions.
Applied a total of 1 rules in 9 ms. Remains 5 /400 variables (removed 395) and now considering 9/2964 (removed 2955) transitions.
[2021-05-09 06:46:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 5 cols
[2021-05-09 06:46:19] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 06:46:19] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/400 places, 9/2964 transitions.
Product exploration explored 100000 steps with 33333 reset in 455 ms.
Product exploration explored 100000 steps with 33333 reset in 330 ms.
[2021-05-09 06:46:20] [INFO ] Flatten gal took : 74 ms
[2021-05-09 06:46:20] [INFO ] Flatten gal took : 78 ms
[2021-05-09 06:46:21] [INFO ] Time to serialize gal into /tmp/LTL18214867819286019576.gal : 35 ms
[2021-05-09 06:46:21] [INFO ] Time to serialize properties into /tmp/LTL8223049025837923848.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL18214867819286019576.gal, -t, CGAL, -LTL, /tmp/LTL8223049025837923848.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL18214867819286019576.gal -t CGAL -LTL /tmp/LTL8223049025837923848.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X((G("(cAMP__12_3_<=cAMP__11_14_)"))U("(cAMP__7_7_<=cAMP__18_6_)")))))
Formula 0 simplified : !XX(G"(cAMP__12_3_<=cAMP__11_14_)" U "(cAMP__7_7_<=cAMP__18_6_)")
Detected timeout of ITS tools.
[2021-05-09 06:46:36] [INFO ] Flatten gal took : 64 ms
[2021-05-09 06:46:36] [INFO ] Applying decomposition
[2021-05-09 06:46:36] [INFO ] Flatten gal took : 60 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6032249345876631583.txt, -o, /tmp/graph6032249345876631583.bin, -w, /tmp/graph6032249345876631583.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6032249345876631583.bin, -l, -1, -v, -w, /tmp/graph6032249345876631583.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 06:46:36] [INFO ] Decomposing Gal with order
[2021-05-09 06:46:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 06:46:36] [INFO ] Removed a total of 1994 redundant transitions.
[2021-05-09 06:46:36] [INFO ] Flatten gal took : 218 ms
[2021-05-09 06:46:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 27 ms.
[2021-05-09 06:46:37] [INFO ] Time to serialize gal into /tmp/LTL4511872962334235087.gal : 144 ms
[2021-05-09 06:46:37] [INFO ] Time to serialize properties into /tmp/LTL12475422200073532036.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4511872962334235087.gal, -t, CGAL, -LTL, /tmp/LTL12475422200073532036.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4511872962334235087.gal -t CGAL -LTL /tmp/LTL12475422200073532036.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X((G("(gu11.cAMP__12_3_<=gu11.cAMP__11_14_)"))U("(gu57.cAMP__7_7_<=gu57.cAMP__18_6_)")))))
Formula 0 simplified : !XX(G"(gu11.cAMP__12_3_<=gu11.cAMP__11_14_)" U "(gu57.cAMP__7_7_<=gu57.cAMP__18_6_)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10051277707486411015
[2021-05-09 06:46:52] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10051277707486411015
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10051277707486411015]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10051277707486411015] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10051277707486411015] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property Diffusion2D-PT-D20N050-04 finished in 37292 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X(G((p1&&(p2 U p3))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 400 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 400/400 places, 2964/2964 transitions.
Applied a total of 0 rules in 65 ms. Remains 400 /400 variables (removed 0) and now considering 2964/2964 (removed 0) transitions.
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 06:46:53] [INFO ] Computed 1 place invariants in 14 ms
[2021-05-09 06:46:53] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 06:46:53] [INFO ] Computed 1 place invariants in 22 ms
[2021-05-09 06:46:53] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 06:46:53] [INFO ] Computed 1 place invariants in 12 ms
[2021-05-09 06:46:54] [INFO ] Dead Transitions using invariants and state equation in 987 ms returned []
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 2964/2964 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1)), (OR (NOT p1) (NOT p3)), true, (NOT p3), (NOT p3)]
Running random walk in product with property : Diffusion2D-PT-D20N050-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(OR (AND p1 p3) (AND p1 p2)), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p1) (AND (NOT p3) (NOT p2))), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(OR (AND p0 p1 p3) (AND p0 p1 p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p3) p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s130 s72), p1:(LEQ 3 s242), p3:(LEQ s327 s129), p2:(LEQ s323 s109)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1459 steps with 0 reset in 22 ms.
FORMULA Diffusion2D-PT-D20N050-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D20N050-05 finished in 1804 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 400/400 places, 2964/2964 transitions.
Graph (trivial) has 2938 edges and 400 vertex of which 398 / 400 are part of one of the 1 SCC in 3 ms
Free SCC test removed 397 places
Ensure Unique test removed 2959 transitions
Reduce isomorphic transitions removed 2959 transitions.
Applied a total of 1 rules in 9 ms. Remains 3 /400 variables (removed 397) and now considering 5/2964 (removed 2959) transitions.
// Phase 1: matrix 5 rows 3 cols
[2021-05-09 06:46:55] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 06:46:55] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-09 06:46:55] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 06:46:55] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
[2021-05-09 06:46:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-09 06:46:55] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 06:46:55] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/400 places, 5/2964 transitions.
Stuttering acceptance computed with spot in 31 ms :[true, (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D20N050-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ s0 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D20N050-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D20N050-06 finished in 78 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&G(p1)&&((!p0 U (p2||G(!p0)))||(p3 U (p4||G(p3)))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 400 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 400/400 places, 2964/2964 transitions.
Graph (trivial) has 2870 edges and 400 vertex of which 394 / 400 are part of one of the 1 SCC in 3 ms
Free SCC test removed 393 places
Ensure Unique test removed 2949 transitions
Reduce isomorphic transitions removed 2949 transitions.
Applied a total of 1 rules in 10 ms. Remains 7 /400 variables (removed 393) and now considering 15/2964 (removed 2949) transitions.
// Phase 1: matrix 15 rows 7 cols
[2021-05-09 06:46:55] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 06:46:55] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 15 rows 7 cols
[2021-05-09 06:46:55] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 06:46:55] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
[2021-05-09 06:46:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 7 cols
[2021-05-09 06:46:55] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 06:46:55] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/400 places, 15/2964 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3) (NOT p4))), (NOT p1), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4))), (AND (NOT p1) (NOT p3) (NOT p4))]
Running random walk in product with property : Diffusion2D-PT-D20N050-07 automaton TGBA [mat=[[{ cond=(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p4) (NOT p3))), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND p0 p1 p2) (AND p0 p1 p4) (AND p0 p1 p3)), acceptance={1} source=0 dest: 1}, { cond=(AND p0 p1 (NOT p2) (NOT p4) p3), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0, 1} source=1 dest: 0}, { cond=p1, acceptance={1} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p4) (NOT p3)) (AND (NOT p1) (NOT p4) (NOT p3)) (AND (NOT p2) (NOT p4) (NOT p3))), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 p1 p2 (NOT p4) (NOT p3)), acceptance={1} source=2 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p4) p3) (AND (NOT p1) (NOT p4) p3) (AND (NOT p2) (NOT p4) p3)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1 p2 (NOT p4) p3), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p4) (NOT p3)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p1 (NOT p4) (NOT p3)), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p4) p3), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p4) p3), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 2 s2), p1:(LEQ 3 s4), p2:(AND (GT 2 s2) (LEQ s5 s0)), p4:(AND (GT s5 s0) (GT s1 s3)), p3:(GT s1 s3)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D20N050-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D20N050-07 finished in 246 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 400/400 places, 2964/2964 transitions.
Applied a total of 0 rules in 20 ms. Remains 400 /400 variables (removed 0) and now considering 2964/2964 (removed 0) transitions.
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 06:46:55] [INFO ] Computed 1 place invariants in 21 ms
[2021-05-09 06:46:55] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 06:46:55] [INFO ] Computed 1 place invariants in 11 ms
[2021-05-09 06:46:55] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 06:46:55] [INFO ] Computed 1 place invariants in 11 ms
[2021-05-09 06:46:56] [INFO ] Dead Transitions using invariants and state equation in 889 ms returned []
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 2964/2964 transitions.
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D20N050-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s29 s318)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D20N050-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D20N050-08 finished in 1473 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 400 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 400/400 places, 2964/2964 transitions.
Graph (trivial) has 2948 edges and 400 vertex of which 399 / 400 are part of one of the 1 SCC in 9 ms
Free SCC test removed 398 places
Ensure Unique test removed 2961 transitions
Reduce isomorphic transitions removed 2961 transitions.
Applied a total of 1 rules in 24 ms. Remains 2 /400 variables (removed 398) and now considering 3/2964 (removed 2961) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 06:46:56] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 06:46:56] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 06:46:56] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 06:46:56] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
[2021-05-09 06:46:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 06:46:56] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 06:46:56] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/400 places, 3/2964 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D20N050-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s0)], 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-D20N050-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D20N050-10 finished in 106 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||X((X(X(X(G((p1&&F(p2)))))) U (p0&&X(X(X(G((p1&&F(p2))))))))))))], workingDir=/home/mcc/execution]
Support contains 1 out of 400 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 400/400 places, 2964/2964 transitions.
Applied a total of 0 rules in 11 ms. Remains 400 /400 variables (removed 0) and now considering 2964/2964 (removed 0) transitions.
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 06:46:57] [INFO ] Computed 1 place invariants in 10 ms
[2021-05-09 06:46:57] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 06:46:57] [INFO ] Computed 1 place invariants in 12 ms
[2021-05-09 06:46:57] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 06:46:57] [INFO ] Computed 1 place invariants in 11 ms
[2021-05-09 06:46:58] [INFO ] Dead Transitions using invariants and state equation in 878 ms returned []
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 2964/2964 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D20N050-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null][false]]
Product exploration explored 100000 steps with 234 reset in 796 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA Diffusion2D-PT-D20N050-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D20N050-11 finished in 2256 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((F(p1)&&p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 400 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 400/400 places, 2964/2964 transitions.
Applied a total of 0 rules in 11 ms. Remains 400 /400 variables (removed 0) and now considering 2964/2964 (removed 0) transitions.
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 06:46:59] [INFO ] Computed 1 place invariants in 10 ms
[2021-05-09 06:46:59] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 06:46:59] [INFO ] Computed 1 place invariants in 17 ms
[2021-05-09 06:46:59] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 06:46:59] [INFO ] Computed 1 place invariants in 34 ms
[2021-05-09 06:47:00] [INFO ] Dead Transitions using invariants and state equation in 867 ms returned []
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 2964/2964 transitions.
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Diffusion2D-PT-D20N050-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GT s265 s227), p0:(AND (LEQ s265 s227) (GT 1 s320))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 69 reset in 1211 ms.
Stack based approach found an accepted trace after 131 steps with 0 reset with depth 132 and stack size 132 in 1 ms.
FORMULA Diffusion2D-PT-D20N050-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D20N050-12 finished in 2634 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||F((p1||G(p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 400 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 400/400 places, 2964/2964 transitions.
Applied a total of 0 rules in 11 ms. Remains 400 /400 variables (removed 0) and now considering 2964/2964 (removed 0) transitions.
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 06:47:01] [INFO ] Computed 1 place invariants in 9 ms
[2021-05-09 06:47:01] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 06:47:01] [INFO ] Computed 1 place invariants in 10 ms
[2021-05-09 06:47:02] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 06:47:02] [INFO ] Computed 1 place invariants in 9 ms
[2021-05-09 06:47:03] [INFO ] Dead Transitions using invariants and state equation in 897 ms returned []
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 2964/2964 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Diffusion2D-PT-D20N050-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GT 1 s215), p1:(LEQ s225 s10), p2:(OR (LEQ 3 s197) (LEQ 1 s215))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 416 ms.
Product exploration explored 100000 steps with 50000 reset in 411 ms.
Knowledge obtained : [p0, p1, (NOT p2)]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 50000 reset in 405 ms.
Product exploration explored 100000 steps with 50000 reset in 445 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 400 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 400/400 places, 2964/2964 transitions.
Graph (trivial) has 2918 edges and 400 vertex of which 396 / 400 are part of one of the 1 SCC in 1 ms
Free SCC test removed 395 places
Ensure Unique test removed 2955 transitions
Reduce isomorphic transitions removed 2955 transitions.
Applied a total of 1 rules in 4 ms. Remains 5 /400 variables (removed 395) and now considering 9/2964 (removed 2955) transitions.
[2021-05-09 06:47:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 5 cols
[2021-05-09 06:47:05] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 06:47:05] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/400 places, 9/2964 transitions.
Product exploration explored 100000 steps with 50000 reset in 457 ms.
Product exploration explored 100000 steps with 50000 reset in 416 ms.
[2021-05-09 06:47:06] [INFO ] Flatten gal took : 59 ms
[2021-05-09 06:47:06] [INFO ] Flatten gal took : 58 ms
[2021-05-09 06:47:06] [INFO ] Time to serialize gal into /tmp/LTL2779023317010990057.gal : 6 ms
[2021-05-09 06:47:06] [INFO ] Time to serialize properties into /tmp/LTL5661211341646051785.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2779023317010990057.gal, -t, CGAL, -LTL, /tmp/LTL5661211341646051785.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2779023317010990057.gal -t CGAL -LTL /tmp/LTL5661211341646051785.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((G("(cAMP__1_5_<1)"))||(F(("(cAMP__20_15_<=cAMP__10_1_)")||(G("((cAMP__19_7_>=3)||(cAMP__1_5_>=1))")))))))
Formula 0 simplified : !X(G"(cAMP__1_5_<1)" | F("(cAMP__20_15_<=cAMP__10_1_)" | G"((cAMP__19_7_>=3)||(cAMP__1_5_>=1))"))
Detected timeout of ITS tools.
[2021-05-09 06:47:21] [INFO ] Flatten gal took : 53 ms
[2021-05-09 06:47:21] [INFO ] Applying decomposition
[2021-05-09 06:47:21] [INFO ] Flatten gal took : 53 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6302524337489636613.txt, -o, /tmp/graph6302524337489636613.bin, -w, /tmp/graph6302524337489636613.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6302524337489636613.bin, -l, -1, -v, -w, /tmp/graph6302524337489636613.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 06:47:21] [INFO ] Decomposing Gal with order
[2021-05-09 06:47:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 06:47:21] [INFO ] Removed a total of 1900 redundant transitions.
[2021-05-09 06:47:21] [INFO ] Flatten gal took : 161 ms
[2021-05-09 06:47:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 19 ms.
[2021-05-09 06:47:22] [INFO ] Time to serialize gal into /tmp/LTL1525623962901553419.gal : 9 ms
[2021-05-09 06:47:22] [INFO ] Time to serialize properties into /tmp/LTL8545168074836612491.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL1525623962901553419.gal, -t, CGAL, -LTL, /tmp/LTL8545168074836612491.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1525623962901553419.gal -t CGAL -LTL /tmp/LTL8545168074836612491.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((G("(gi0.gi1.gu32.cAMP__1_5_<1)"))||(F(("(gu35.cAMP__20_15_<=gu35.cAMP__10_1_)")||(G("((gi1.gu39.cAMP__19_7_>=3)||(gi0.gi1.gu32.cAMP__1_5_>=1))")))))))
Formula 0 simplified : !X(G"(gi0.gi1.gu32.cAMP__1_5_<1)" | F("(gu35.cAMP__20_15_<=gu35.cAMP__10_1_)" | G"((gi1.gu39.cAMP__19_7_>=3)||(gi0.gi1.gu32.cAMP__1_5_>=1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10013590818084689312
[2021-05-09 06:47:37] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10013590818084689312
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10013590818084689312]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10013590818084689312] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10013590818084689312] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property Diffusion2D-PT-D20N050-14 finished in 36335 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||X(X(F((p1||X((!p0 U p2)))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 400 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 400/400 places, 2964/2964 transitions.
Applied a total of 0 rules in 10 ms. Remains 400 /400 variables (removed 0) and now considering 2964/2964 (removed 0) transitions.
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 06:47:38] [INFO ] Computed 1 place invariants in 10 ms
[2021-05-09 06:47:38] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 06:47:38] [INFO ] Computed 1 place invariants in 15 ms
[2021-05-09 06:47:38] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
// Phase 1: matrix 2964 rows 400 cols
[2021-05-09 06:47:38] [INFO ] Computed 1 place invariants in 10 ms
[2021-05-09 06:47:39] [INFO ] Dead Transitions using invariants and state equation in 1008 ms returned []
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 2964/2964 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Diffusion2D-PT-D20N050-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT s142 s399), p1:(LEQ 3 s304), p2:(AND (LEQ s142 s399) (LEQ 3 s304))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3 reset in 2059 ms.
Stack based approach found an accepted trace after 37 steps with 0 reset with depth 38 and stack size 38 in 0 ms.
FORMULA Diffusion2D-PT-D20N050-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D20N050-15 finished in 3787 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10566027987618206224
[2021-05-09 06:47:42] [INFO ] Too many transitions (2964) to apply POR reductions. Disabling POR matrices.
[2021-05-09 06:47:42] [INFO ] Applying decomposition
[2021-05-09 06:47:42] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10566027987618206224
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10566027987618206224]
[2021-05-09 06:47:42] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph18100498185128624716.txt, -o, /tmp/graph18100498185128624716.bin, -w, /tmp/graph18100498185128624716.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph18100498185128624716.bin, -l, -1, -v, -w, /tmp/graph18100498185128624716.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 06:47:42] [INFO ] Decomposing Gal with order
[2021-05-09 06:47:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 06:47:42] [INFO ] Removed a total of 2108 redundant transitions.
[2021-05-09 06:47:42] [INFO ] Flatten gal took : 248 ms
[2021-05-09 06:47:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 41 ms.
[2021-05-09 06:47:42] [INFO ] Time to serialize gal into /tmp/LTLCardinality11846484451955799992.gal : 9 ms
[2021-05-09 06:47:42] [INFO ] Time to serialize properties into /tmp/LTLCardinality14976407377496675679.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality11846484451955799992.gal, -t, CGAL, -LTL, /tmp/LTLCardinality14976407377496675679.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality11846484451955799992.gal -t CGAL -LTL /tmp/LTLCardinality14976407377496675679.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 2 LTL properties
Checking formula 0 : !((X(X((G("(gu7.cAMP__12_3_<=gu7.cAMP__11_14_)"))U("(gu33.cAMP__7_7_<=gu33.cAMP__18_6_)")))))
Formula 0 simplified : !XX(G"(gu7.cAMP__12_3_<=gu7.cAMP__11_14_)" U "(gu33.cAMP__7_7_<=gu33.cAMP__18_6_)")
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10566027987618206224] killed by timeout after 27 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10566027987618206224] killed by timeout after 27 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
17630 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,176.476,1774944,1,0,7,7.13259e+06,21,0,35620,5.04848e+06,12
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Diffusion2D-PT-D20N050-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X((G("(gi3.gu38.cAMP__1_5_<1)"))||(F(("(gu3.cAMP__20_15_<=gu3.cAMP__10_1_)")||(G("((gi4.gi0.gu44.cAMP__19_7_>=3)||(gi3.gu38.cAMP__1_5_>=1))")))))))
Formula 1 simplified : !X(G"(gi3.gu38.cAMP__1_5_<1)" | F("(gu3.cAMP__20_15_<=gu3.cAMP__10_1_)" | G"((gi4.gi0.gu44.cAMP__19_7_>=3)||(gi3.gu38.cAMP__1_5_>=1))"))
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,176.478,1775208,1,0,7,7.13259e+06,33,0,35628,5.04848e+06,17
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA Diffusion2D-PT-D20N050-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
BK_STOP 1620543046446
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Diffusion2D-PT-D20N050"
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-D20N050, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r083-tall-162048875000116"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D20N050.tgz
mv Diffusion2D-PT-D20N050 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 ;