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-162048875100212.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-D50N050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875100212
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.8M
-rw-r--r-- 1 mcc users 21K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 133K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Mar 28 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Mar 23 10:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 10:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 22 17:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 17:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 7.3M 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-D50N050-00
FORMULA_NAME Diffusion2D-PT-D50N050-01
FORMULA_NAME Diffusion2D-PT-D50N050-02
FORMULA_NAME Diffusion2D-PT-D50N050-03
FORMULA_NAME Diffusion2D-PT-D50N050-04
FORMULA_NAME Diffusion2D-PT-D50N050-05
FORMULA_NAME Diffusion2D-PT-D50N050-06
FORMULA_NAME Diffusion2D-PT-D50N050-07
FORMULA_NAME Diffusion2D-PT-D50N050-08
FORMULA_NAME Diffusion2D-PT-D50N050-09
FORMULA_NAME Diffusion2D-PT-D50N050-10
FORMULA_NAME Diffusion2D-PT-D50N050-11
FORMULA_NAME Diffusion2D-PT-D50N050-12
FORMULA_NAME Diffusion2D-PT-D50N050-13
FORMULA_NAME Diffusion2D-PT-D50N050-14
FORMULA_NAME Diffusion2D-PT-D50N050-15

=== Now, execution of the tool begins

BK_START 1620564522507

Running Version 0
[2021-05-09 12:48:44] [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 12:48:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 12:48:44] [INFO ] Load time of PNML (sax parser for PT used): 464 ms
[2021-05-09 12:48:44] [INFO ] Transformed 2500 places.
[2021-05-09 12:48:44] [INFO ] Transformed 19404 transitions.
[2021-05-09 12:48:44] [INFO ] Parsed PT model containing 2500 places and 19404 transitions in 638 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 12:48:44] [INFO ] Initial state test concluded for 6 properties.
FORMULA Diffusion2D-PT-D50N050-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D50N050-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D50N050-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D50N050-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 2500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 957 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 12:48:46] [INFO ] Computed 1 place invariants in 159 ms
[2021-05-09 12:48:46] [INFO ] Implicit Places using invariants in 534 ms returned []
Implicit Place search using SMT only with invariants took 563 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 12:48:46] [INFO ] Computed 1 place invariants in 111 ms
[2021-05-09 12:48:54] [INFO ] Dead Transitions using invariants and state equation in 8001 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
[2021-05-09 12:48:55] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-09 12:48:55] [INFO ] Flatten gal took : 581 ms
FORMULA Diffusion2D-PT-D50N050-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D50N050-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D50N050-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 12:48:55] [INFO ] Flatten gal took : 396 ms
[2021-05-09 12:48:56] [INFO ] Input system was already deterministic with 19404 transitions.
Incomplete random walk after 100012 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=546 ) properties (out of 14) seen :10
Running SMT prover for 4 properties.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 12:48:57] [INFO ] Computed 1 place invariants in 97 ms
[2021-05-09 12:48:57] [INFO ] [Real]Absence check using 1 positive place invariants in 17 ms returned sat
[2021-05-09 12:48:57] [INFO ] SMT Verify possible in real domain returnedunsat :0 sat :0 real:4
[2021-05-09 12:48:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 19 ms returned sat
[2021-05-09 12:48:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 12:49:04] [INFO ] [Nat]Absence check using state equation in 5907 ms returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1442 ms.
[2021-05-09 12:49:05] [INFO ] SMT Verify possible in nat domain returned unsat :0 sat :4
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19372 edges and 2500 vertex of which 2498 / 2500 are part of one of the 1 SCC in 32 ms
Free SCC test removed 2497 places
Ensure Unique test removed 19399 transitions
Reduce isomorphic transitions removed 19399 transitions.
Applied a total of 1 rules in 74 ms. Remains 3 /2500 variables (removed 2497) and now considering 5/19404 (removed 19399) transitions.
// Phase 1: matrix 5 rows 3 cols
[2021-05-09 12:49:05] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 12:49:05] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-09 12:49:05] [INFO ] Computed 1 place invariants in 5 ms
[2021-05-09 12:49:05] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 25 ms to find 0 implicit places.
[2021-05-09 12:49:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-09 12:49:05] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 12:49:05] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/2500 places, 5/19404 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Diffusion2D-PT-D50N050-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GT 1 s1), p1:(LEQ 2 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 1 ms.
FORMULA Diffusion2D-PT-D50N050-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N050-01 finished in 370 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(F((p1&&X(!p0)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 575 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 12:49:06] [INFO ] Computed 1 place invariants in 90 ms
[2021-05-09 12:49:06] [INFO ] Implicit Places using invariants in 314 ms returned []
Implicit Place search using SMT only with invariants took 315 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 12:49:06] [INFO ] Computed 1 place invariants in 83 ms
[2021-05-09 12:49:14] [INFO ] Dead Transitions using invariants and state equation in 7664 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false]
Running random walk in product with property : Diffusion2D-PT-D50N050-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GT s2327 s1729), p0:(LEQ s423 s209)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1 reset in 3249 ms.
Stack based approach found an accepted trace after 4122 steps with 0 reset with depth 4123 and stack size 4107 in 86 ms.
FORMULA Diffusion2D-PT-D50N050-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N050-05 finished in 12090 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G(p0)||(p0&&F(((!p0&&X(F(p1)))||G(F(p1)))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 350 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 12:49:18] [INFO ] Computed 1 place invariants in 80 ms
[2021-05-09 12:49:18] [INFO ] Implicit Places using invariants in 327 ms returned []
Implicit Place search using SMT only with invariants took 329 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 12:49:18] [INFO ] Computed 1 place invariants in 81 ms
[2021-05-09 12:49:26] [INFO ] Dead Transitions using invariants and state equation in 7418 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N050-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(LEQ s2366 s534), p1:(OR (LEQ s238 s1594) (LEQ 2 s2006))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 7 reset in 2473 ms.
Product exploration explored 100000 steps with 12 reset in 2405 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 11 reset in 2302 ms.
Product exploration explored 100000 steps with 8 reset in 2395 ms.
Applying partial POR strategy [false, false, true, false]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 5 out of 2500 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19336 edges and 2500 vertex of which 2495 / 2500 are part of one of the 1 SCC in 15 ms
Free SCC test removed 2494 places
Ensure Unique test removed 19393 transitions
Reduce isomorphic transitions removed 19393 transitions.
Applied a total of 1 rules in 36 ms. Remains 6 /2500 variables (removed 2494) and now considering 11/19404 (removed 19393) transitions.
[2021-05-09 12:49:36] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 11 rows 6 cols
[2021-05-09 12:49:36] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 12:49:36] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/2500 places, 11/19404 transitions.
Product exploration explored 100000 steps with 11 reset in 2118 ms.
Product exploration explored 100000 steps with 11 reset in 2169 ms.
[2021-05-09 12:49:41] [INFO ] Flatten gal took : 336 ms
[2021-05-09 12:49:41] [INFO ] Flatten gal took : 335 ms
[2021-05-09 12:49:41] [INFO ] Time to serialize gal into /tmp/LTL6422477893442719516.gal : 122 ms
[2021-05-09 12:49:41] [INFO ] Time to serialize properties into /tmp/LTL3855669359681133246.ltl : 3 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/LTL6422477893442719516.gal, -t, CGAL, -LTL, /tmp/LTL3855669359681133246.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/LTL6422477893442719516.gal -t CGAL -LTL /tmp/LTL3855669359681133246.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(cAMP__7_25_<=cAMP__1_41_)"))||(("(cAMP__7_25_<=cAMP__1_41_)")&&(F((("(cAMP__7_25_>cAMP__1_41_)")&&(X(F("((cAMP__14_45_<=cAMP__39_50_)||(cAMP__47_16_>=2))"))))||(G(F("((cAMP__14_45_<=cAMP__39_50_)||(cAMP__47_16_>=2))"))))))))))
Formula 0 simplified : !XF(G"(cAMP__7_25_<=cAMP__1_41_)" | ("(cAMP__7_25_<=cAMP__1_41_)" & F(("(cAMP__7_25_>cAMP__1_41_)" & XF"((cAMP__14_45_<=cAMP__39_50_)||(cAMP__47_16_>=2))") | GF"((cAMP__14_45_<=cAMP__39_50_)||(cAMP__47_16_>=2))")))
Detected timeout of ITS tools.
[2021-05-09 12:49:57] [INFO ] Flatten gal took : 395 ms
[2021-05-09 12:49:57] [INFO ] Applying decomposition
[2021-05-09 12:49:57] [INFO ] Flatten gal took : 324 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/graph13522098290930695582.txt, -o, /tmp/graph13522098290930695582.bin, -w, /tmp/graph13522098290930695582.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/graph13522098290930695582.bin, -l, -1, -v, -w, /tmp/graph13522098290930695582.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 12:49:58] [INFO ] Decomposing Gal with order
[2021-05-09 12:49:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 12:49:59] [INFO ] Removed a total of 13888 redundant transitions.
[2021-05-09 12:50:00] [INFO ] Flatten gal took : 1045 ms
[2021-05-09 12:50:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 170 labels/synchronizations in 221 ms.
[2021-05-09 12:50:01] [INFO ] Time to serialize gal into /tmp/LTL11566262502960847091.gal : 56 ms
[2021-05-09 12:50:01] [INFO ] Time to serialize properties into /tmp/LTL15642295710970948028.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL11566262502960847091.gal, -t, CGAL, -LTL, /tmp/LTL15642295710970948028.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/LTL11566262502960847091.gal -t CGAL -LTL /tmp/LTL15642295710970948028.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(gu362.cAMP__7_25_<=gu362.cAMP__1_41_)"))||(("(gu362.cAMP__7_25_<=gu362.cAMP__1_41_)")&&(F((("(gu362.cAMP__7_25_>gu362.cAMP__1_41_)")&&(X(F("((gu248.cAMP__14_45_<=gu248.cAMP__39_50_)||(gi1.gu305.cAMP__47_16_>=2))"))))||(G(F("((gu248.cAMP__14_45_<=gu248.cAMP__39_50_)||(gi1.gu305.cAMP__47_16_>=2))"))))))))))
Formula 0 simplified : !XF(G"(gu362.cAMP__7_25_<=gu362.cAMP__1_41_)" | ("(gu362.cAMP__7_25_<=gu362.cAMP__1_41_)" & F(("(gu362.cAMP__7_25_>gu362.cAMP__1_41_)" & XF"((gu248.cAMP__14_45_<=gu248.cAMP__39_50_)||(gi1.gu305.cAMP__47_16_>=2))") | GF"((gu248.cAMP__14_45_<=gu248.cAMP__39_50_)||(gi1.gu305.cAMP__47_16_>=2))")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13360484984838487882
[2021-05-09 12:50:16] [INFO ] Built C files in 178ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13360484984838487882
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/ltsmin13360484984838487882]
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/ltsmin13360484984838487882] 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/ltsmin13360484984838487882] 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-D50N050-07 finished in 59815 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19362 edges and 2500 vertex of which 2497 / 2500 are part of one of the 1 SCC in 8 ms
Free SCC test removed 2496 places
Ensure Unique test removed 19397 transitions
Reduce isomorphic transitions removed 19397 transitions.
Applied a total of 1 rules in 23 ms. Remains 4 /2500 variables (removed 2496) and now considering 7/19404 (removed 19397) transitions.
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 12:50:17] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 12:50:17] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 12:50:17] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 12:50:17] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2021-05-09 12:50:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 12:50:17] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 12:50:17] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/2500 places, 7/19404 transitions.
Stuttering acceptance computed with spot in 30 ms :[true, (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N050-08 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:(OR (GT s2 s0) (GT 2 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 123 steps with 0 reset in 1 ms.
FORMULA Diffusion2D-PT-D50N050-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N050-08 finished in 146 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((F(p0) U p1) U (p1 U (G(p1)||(p1&&G(!p0))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19362 edges and 2500 vertex of which 2497 / 2500 are part of one of the 1 SCC in 6 ms
Free SCC test removed 2496 places
Ensure Unique test removed 19397 transitions
Reduce isomorphic transitions removed 19397 transitions.
Applied a total of 1 rules in 21 ms. Remains 4 /2500 variables (removed 2496) and now considering 7/19404 (removed 19397) transitions.
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 12:50:18] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 12:50:18] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 12:50:18] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 12:50:18] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2021-05-09 12:50:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2021-05-09 12:50:18] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-09 12:50:18] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/2500 places, 7/19404 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p0), (AND p0 (NOT p1))]
Running random walk in product with property : Diffusion2D-PT-D50N050-10 automaton TGBA [mat=[[{ cond=(AND p0 p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s0 s2), p1:(GT s2 s1)], nbAcceptance=2, 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-D50N050-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N050-10 finished in 188 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 501 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 12:50:18] [INFO ] Computed 1 place invariants in 80 ms
[2021-05-09 12:50:19] [INFO ] Implicit Places using invariants in 331 ms returned []
Implicit Place search using SMT only with invariants took 331 ms to find 0 implicit places.
// Phase 1: matrix 19404 rows 2500 cols
[2021-05-09 12:50:19] [INFO ] Computed 1 place invariants in 81 ms
[2021-05-09 12:50:27] [INFO ] Dead Transitions using invariants and state equation in 8527 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N050-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s6 s1015)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 8 reset in 2387 ms.
Stack based approach found an accepted trace after 29 steps with 0 reset with depth 30 and stack size 30 in 2 ms.
FORMULA Diffusion2D-PT-D50N050-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N050-11 finished in 11830 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&(F(!p0) U G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19346 edges and 2500 vertex of which 2496 / 2500 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2495 places
Ensure Unique test removed 19395 transitions
Reduce isomorphic transitions removed 19395 transitions.
Applied a total of 1 rules in 17 ms. Remains 5 /2500 variables (removed 2495) and now considering 9/19404 (removed 19395) transitions.
// Phase 1: matrix 9 rows 5 cols
[2021-05-09 12:50:30] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 12:50:30] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 9 rows 5 cols
[2021-05-09 12:50:30] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 12:50:30] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
[2021-05-09 12:50:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 5 cols
[2021-05-09 12:50:30] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 12:50:30] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/2500 places, 9/19404 transitions.
Stuttering acceptance computed with spot in 36 ms :[true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Diffusion2D-PT-D50N050-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ s3 s0), p1:(LEQ s2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, 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-D50N050-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N050-13 finished in 120 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 2500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19388 edges and 2500 vertex of which 2499 / 2500 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2498 places
Ensure Unique test removed 19401 transitions
Reduce isomorphic transitions removed 19401 transitions.
Applied a total of 1 rules in 18 ms. Remains 2 /2500 variables (removed 2498) and now considering 3/19404 (removed 19401) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 12:50:30] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 12:50:30] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 12:50:30] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 12:50:30] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2021-05-09 12:50:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 12:50:30] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-09 12:50:30] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/2500 places, 3/19404 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N050-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 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-D50N050-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N050-14 finished in 136 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 2500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19372 edges and 2500 vertex of which 2498 / 2500 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2497 places
Ensure Unique test removed 19399 transitions
Reduce isomorphic transitions removed 19399 transitions.
Applied a total of 1 rules in 15 ms. Remains 3 /2500 variables (removed 2497) and now considering 5/19404 (removed 19399) transitions.
// Phase 1: matrix 5 rows 3 cols
[2021-05-09 12:50:30] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 12:50:30] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-09 12:50:30] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 12:50:30] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2021-05-09 12:50:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-09 12:50:30] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 12:50:30] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/2500 places, 5/19404 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N050-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA Diffusion2D-PT-D50N050-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N050-15 finished in 147 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin716228923572479994
[2021-05-09 12:50:30] [INFO ] Too many transitions (19404) to apply POR reductions. Disabling POR matrices.
[2021-05-09 12:50:30] [INFO ] Built C files in 153ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin716228923572479994
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/ltsmin716228923572479994]
[2021-05-09 12:50:30] [INFO ] Applying decomposition
[2021-05-09 12:50:31] [INFO ] Flatten gal took : 461 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/graph1719218787293965246.txt, -o, /tmp/graph1719218787293965246.bin, -w, /tmp/graph1719218787293965246.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/graph1719218787293965246.bin, -l, -1, -v, -w, /tmp/graph1719218787293965246.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 12:50:32] [INFO ] Decomposing Gal with order
[2021-05-09 12:50:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 12:50:33] [INFO ] Removed a total of 14030 redundant transitions.
[2021-05-09 12:50:33] [INFO ] Flatten gal took : 974 ms
[2021-05-09 12:50:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 124 labels/synchronizations in 304 ms.
[2021-05-09 12:50:35] [INFO ] Time to serialize gal into /tmp/LTLCardinality4175488532180349996.gal : 48 ms
[2021-05-09 12:50:35] [INFO ] Time to serialize properties into /tmp/LTLCardinality7055116632149833128.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality4175488532180349996.gal, -t, CGAL, -LTL, /tmp/LTLCardinality7055116632149833128.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/LTLCardinality4175488532180349996.gal -t CGAL -LTL /tmp/LTLCardinality7055116632149833128.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("(gu95.cAMP__7_25_<=gu95.cAMP__1_41_)")U((("(gu95.cAMP__7_25_<=gu95.cAMP__1_41_)")&&((X(F(!("((gu249.cAMP__14_45_>gu249.cAMP__39_50_)&&(gi3.gi1.gi0.gi3.gu313.cAMP__47_16_<2))"))))U((("(gu95.cAMP__7_25_>gu95.cAMP__1_41_)")&&(X(F(!("((gu249.cAMP__14_45_>gu249.cAMP__39_50_)&&(gi3.gi1.gi0.gi3.gu313.cAMP__47_16_<2))")))))||(G(X(F(!("((gu249.cAMP__14_45_>gu249.cAMP__39_50_)&&(gi3.gi1.gi0.gi3.gu313.cAMP__47_16_<2))"))))))))||(G("(gu95.cAMP__7_25_<=gu95.cAMP__1_41_)")))))))
Formula 0 simplified : !XF("(gu95.cAMP__7_25_<=gu95.cAMP__1_41_)" U (("(gu95.cAMP__7_25_<=gu95.cAMP__1_41_)" & (XF!"((gu249.cAMP__14_45_>gu249.cAMP__39_50_)&&(gi3.gi1.gi0.gi3.gu313.cAMP__47_16_<2))" U (("(gu95.cAMP__7_25_>gu95.cAMP__1_41_)" & XF!"((gu249.cAMP__14_45_>gu249.cAMP__39_50_)&&(gi3.gi1.gi0.gi3.gu313.cAMP__47_16_<2))") | GXF!"((gu249.cAMP__14_45_>gu249.cAMP__39_50_)&&(gi3.gi1.gi0.gi3.gu313.cAMP__47_16_<2))"))) | G"(gu95.cAMP__7_25_<=gu95.cAMP__1_41_)"))
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/ltsmin716228923572479994] killed by timeout after 40 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/ltsmin716228923572479994] killed by timeout after 40 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-09 13:11:10] [INFO ] Flatten gal took : 376 ms
[2021-05-09 13:11:11] [INFO ] Time to serialize gal into /tmp/LTLCardinality1002073548618325017.gal : 59 ms
[2021-05-09 13:11:11] [INFO ] Time to serialize properties into /tmp/LTLCardinality16473440441682964963.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality1002073548618325017.gal, -t, CGAL, -LTL, /tmp/LTLCardinality16473440441682964963.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/LTLCardinality1002073548618325017.gal -t CGAL -LTL /tmp/LTLCardinality16473440441682964963.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("(cAMP__7_25_<=cAMP__1_41_)")U((("(cAMP__7_25_<=cAMP__1_41_)")&&((X(F(!("((cAMP__14_45_>cAMP__39_50_)&&(cAMP__47_16_<2))"))))U((("(cAMP__7_25_>cAMP__1_41_)")&&(X(F(!("((cAMP__14_45_>cAMP__39_50_)&&(cAMP__47_16_<2))")))))||(G(X(F(!("((cAMP__14_45_>cAMP__39_50_)&&(cAMP__47_16_<2))"))))))))||(G("(cAMP__7_25_<=cAMP__1_41_)")))))))
Formula 0 simplified : !XF("(cAMP__7_25_<=cAMP__1_41_)" U (("(cAMP__7_25_<=cAMP__1_41_)" & (XF!"((cAMP__14_45_>cAMP__39_50_)&&(cAMP__47_16_<2))" U (("(cAMP__7_25_>cAMP__1_41_)" & XF!"((cAMP__14_45_>cAMP__39_50_)&&(cAMP__47_16_<2))") | GXF!"((cAMP__14_45_>cAMP__39_50_)&&(cAMP__47_16_<2))"))) | G"(cAMP__7_25_<=cAMP__1_41_)"))
Detected timeout of ITS tools.
[2021-05-09 13:31:46] [INFO ] Flatten gal took : 341 ms
[2021-05-09 13:31:47] [INFO ] Input system was already deterministic with 19404 transitions.
[2021-05-09 13:31:47] [INFO ] Transformed 2500 places.
[2021-05-09 13:31:47] [INFO ] Transformed 19404 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-09 13:31:50] [INFO ] Time to serialize gal into /tmp/LTLCardinality4158903281960233807.gal : 31 ms
[2021-05-09 13:31:50] [INFO ] Time to serialize properties into /tmp/LTLCardinality6818931476820026695.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/LTLCardinality4158903281960233807.gal, -t, CGAL, -LTL, /tmp/LTLCardinality6818931476820026695.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --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/LTLCardinality4158903281960233807.gal -t CGAL -LTL /tmp/LTLCardinality6818931476820026695.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F(("(cAMP__7_25_<=cAMP__1_41_)")U((("(cAMP__7_25_<=cAMP__1_41_)")&&((X(F(!("((cAMP__14_45_>cAMP__39_50_)&&(cAMP__47_16_<2))"))))U((("(cAMP__7_25_>cAMP__1_41_)")&&(X(F(!("((cAMP__14_45_>cAMP__39_50_)&&(cAMP__47_16_<2))")))))||(G(X(F(!("((cAMP__14_45_>cAMP__39_50_)&&(cAMP__47_16_<2))"))))))))||(G("(cAMP__7_25_<=cAMP__1_41_)")))))))
Formula 0 simplified : !XF("(cAMP__7_25_<=cAMP__1_41_)" U (("(cAMP__7_25_<=cAMP__1_41_)" & (XF!"((cAMP__14_45_>cAMP__39_50_)&&(cAMP__47_16_<2))" U (("(cAMP__7_25_>cAMP__1_41_)" & XF!"((cAMP__14_45_>cAMP__39_50_)&&(cAMP__47_16_<2))") | GXF!"((cAMP__14_45_>cAMP__39_50_)&&(cAMP__47_16_<2))"))) | G"(cAMP__7_25_<=cAMP__1_41_)"))

BK_TIME_CONFINEMENT_REACHED

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

tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D50N050.tgz
mv Diffusion2D-PT-D50N050 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;