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-162048875600637.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 Echo-PT-d03r03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875600637
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 139K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 10K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 98K 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 5.9K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 10:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 10:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 22 18:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 18:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 114K 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 Echo-PT-d03r03-00
FORMULA_NAME Echo-PT-d03r03-01
FORMULA_NAME Echo-PT-d03r03-02
FORMULA_NAME Echo-PT-d03r03-03
FORMULA_NAME Echo-PT-d03r03-04
FORMULA_NAME Echo-PT-d03r03-05
FORMULA_NAME Echo-PT-d03r03-06
FORMULA_NAME Echo-PT-d03r03-07
FORMULA_NAME Echo-PT-d03r03-08
FORMULA_NAME Echo-PT-d03r03-09
FORMULA_NAME Echo-PT-d03r03-10
FORMULA_NAME Echo-PT-d03r03-11
FORMULA_NAME Echo-PT-d03r03-12
FORMULA_NAME Echo-PT-d03r03-13
FORMULA_NAME Echo-PT-d03r03-14
FORMULA_NAME Echo-PT-d03r03-15

=== Now, execution of the tool begins

BK_START 1620644439495

Running Version 0
[2021-05-10 11:00:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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-10 11:00:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-10 11:00:41] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2021-05-10 11:00:41] [INFO ] Transformed 265 places.
[2021-05-10 11:00:41] [INFO ] Transformed 206 transitions.
[2021-05-10 11:00:41] [INFO ] Found NUPN structural information;
[2021-05-10 11:00:41] [INFO ] Parsed PT model containing 265 places and 206 transitions in 105 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-10 11:00:41] [INFO ] Initial state test concluded for 2 properties.
Support contains 88 out of 265 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 265/265 places, 206/206 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 238 transition count 206
Applied a total of 27 rules in 20 ms. Remains 238 /265 variables (removed 27) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:00:41] [INFO ] Computed 108 place invariants in 58 ms
[2021-05-10 11:00:41] [INFO ] Implicit Places using invariants in 474 ms returned []
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:00:41] [INFO ] Computed 108 place invariants in 21 ms
[2021-05-10 11:00:42] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 977 ms to find 0 implicit places.
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:00:42] [INFO ] Computed 108 place invariants in 24 ms
[2021-05-10 11:00:42] [INFO ] Dead Transitions using invariants and state equation in 288 ms returned []
Finished structural reductions, in 1 iterations. Remains : 238/265 places, 206/206 transitions.
[2021-05-10 11:00:42] [INFO ] Flatten gal took : 55 ms
[2021-05-10 11:00:42] [INFO ] Flatten gal took : 27 ms
[2021-05-10 11:00:42] [INFO ] Input system was already deterministic with 206 transitions.
Finished random walk after 7724 steps, including 140 resets, run visited all 34 properties in 64 ms. (steps per millisecond=120 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||G(p1)||F(G(!p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 238 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 238/238 places, 206/206 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 29 ms. Remains 237 /238 variables (removed 1) and now considering 205/206 (removed 1) transitions.
// Phase 1: matrix 205 rows 237 cols
[2021-05-10 11:00:43] [INFO ] Computed 108 place invariants in 27 ms
[2021-05-10 11:00:43] [INFO ] Implicit Places using invariants in 394 ms returned [16, 163, 182, 204, 212, 223, 231]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 398 ms to find 7 implicit places.
[2021-05-10 11:00:43] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 205 rows 230 cols
[2021-05-10 11:00:43] [INFO ] Computed 101 place invariants in 19 ms
[2021-05-10 11:00:43] [INFO ] Dead Transitions using invariants and state equation in 293 ms returned []
Starting structural reductions, iteration 1 : 230/238 places, 205/206 transitions.
Applied a total of 0 rules in 23 ms. Remains 230 /230 variables (removed 0) and now considering 205/205 (removed 0) transitions.
[2021-05-10 11:00:43] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 205 rows 230 cols
[2021-05-10 11:00:43] [INFO ] Computed 101 place invariants in 19 ms
[2021-05-10 11:00:44] [INFO ] Dead Transitions using invariants and state equation in 285 ms returned []
Finished structural reductions, in 2 iterations. Remains : 230/238 places, 205/206 transitions.
Stuttering acceptance computed with spot in 226 ms :[false, p0, (AND p0 (NOT p1)), false]
Running random walk in product with property : Echo-PT-d03r03-00 automaton TGBA [mat=[[{ cond=(AND p0 p1), acceptance={} 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=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s58 1) (EQ s184 1) (EQ s186 1)), p1:(OR (EQ s58 0) (EQ s184 0) (EQ s186 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 1851 reset in 585 ms.
Product exploration explored 100000 steps with 1851 reset in 481 ms.
Graph (complete) has 690 edges and 230 vertex of which 218 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.3 ms
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 97 ms :[false, p0, (AND p0 (NOT p1)), false]
Product exploration explored 100000 steps with 1851 reset in 374 ms.
Product exploration explored 100000 steps with 1851 reset in 407 ms.
[2021-05-10 11:00:46] [INFO ] Flatten gal took : 22 ms
[2021-05-10 11:00:46] [INFO ] Flatten gal took : 19 ms
[2021-05-10 11:00:46] [INFO ] Time to serialize gal into /tmp/LTL9685102932782011258.gal : 12 ms
[2021-05-10 11:00:46] [INFO ] Time to serialize properties into /tmp/LTL2254272723663967490.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/LTL9685102932782011258.gal, -t, CGAL, -LTL, /tmp/LTL2254272723663967490.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/LTL9685102932782011258.gal -t CGAL -LTL /tmp/LTL2254272723663967490.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((((G("(((p159==1)&&(p50==1))&&(p52==1))"))||(G("(((p159==0)||(p50==0))||(p52==0))")))||(F(G("(((p159==0)||(p50==0))||(p52==0))")))))
Formula 0 simplified : !(G"(((p159==1)&&(p50==1))&&(p52==1))" | G"(((p159==0)||(p50==0))||(p52==0))" | FG"(((p159==0)||(p50==0))||(p52==0))")
Detected timeout of ITS tools.
[2021-05-10 11:01:01] [INFO ] Flatten gal took : 19 ms
[2021-05-10 11:01:01] [INFO ] Applying decomposition
[2021-05-10 11:01:01] [INFO ] Flatten gal took : 19 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/graph11240180635289593368.txt, -o, /tmp/graph11240180635289593368.bin, -w, /tmp/graph11240180635289593368.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/graph11240180635289593368.bin, -l, -1, -v, -w, /tmp/graph11240180635289593368.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 11:01:03] [INFO ] Decomposing Gal with order
[2021-05-10 11:01:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 11:01:03] [INFO ] Removed a total of 227 redundant transitions.
[2021-05-10 11:01:03] [INFO ] Flatten gal took : 63 ms
[2021-05-10 11:01:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 10 ms.
[2021-05-10 11:01:03] [INFO ] Time to serialize gal into /tmp/LTL9973820433034298959.gal : 7 ms
[2021-05-10 11:01:03] [INFO ] Time to serialize properties into /tmp/LTL10778391866148085899.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/LTL9973820433034298959.gal, -t, CGAL, -LTL, /tmp/LTL10778391866148085899.ltl, -c, -stutter-deadlock], 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/LTL9973820433034298959.gal -t CGAL -LTL /tmp/LTL10778391866148085899.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((((G("(((i6.u24.p159==1)&&(i6.u31.p50==1))&&(i6.u24.p52==1))"))||(G("(((i6.u24.p159==0)||(i6.u31.p50==0))||(i6.u24.p52==0))")))||(F(G("(((i6.u24.p159==0)||(i6.u31.p50==0))||(i6.u24.p52==0))")))))
Formula 0 simplified : !(G"(((i6.u24.p159==1)&&(i6.u31.p50==1))&&(i6.u24.p52==1))" | G"(((i6.u24.p159==0)||(i6.u31.p50==0))||(i6.u24.p52==0))" | FG"(((i6.u24.p159==0)||(i6.u31.p50==0))||(i6.u24.p52==0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15018646051046782426
[2021-05-10 11:01:18] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15018646051046782426
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/ltsmin15018646051046782426]
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/ltsmin15018646051046782426] 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/ltsmin15018646051046782426] 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 Echo-PT-d03r03-00 finished in 36713 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((G(p1)||p0))))], workingDir=/home/mcc/execution]
Support contains 6 out of 238 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 238/238 places, 206/206 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 11 ms. Remains 237 /238 variables (removed 1) and now considering 205/206 (removed 1) transitions.
// Phase 1: matrix 205 rows 237 cols
[2021-05-10 11:01:19] [INFO ] Computed 108 place invariants in 15 ms
[2021-05-10 11:01:20] [INFO ] Implicit Places using invariants in 425 ms returned [16, 163, 182, 204, 212, 223, 231]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 430 ms to find 7 implicit places.
[2021-05-10 11:01:20] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 205 rows 230 cols
[2021-05-10 11:01:20] [INFO ] Computed 101 place invariants in 12 ms
[2021-05-10 11:01:20] [INFO ] Dead Transitions using invariants and state equation in 345 ms returned []
Starting structural reductions, iteration 1 : 230/238 places, 205/206 transitions.
Applied a total of 0 rules in 22 ms. Remains 230 /230 variables (removed 0) and now considering 205/205 (removed 0) transitions.
[2021-05-10 11:01:20] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 205 rows 230 cols
[2021-05-10 11:01:20] [INFO ] Computed 101 place invariants in 12 ms
[2021-05-10 11:01:20] [INFO ] Dead Transitions using invariants and state equation in 286 ms returned []
Finished structural reductions, in 2 iterations. Remains : 230/238 places, 205/206 transitions.
Stuttering acceptance computed with spot in 1118 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Echo-PT-d03r03-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s144 1) (EQ s193 1)), p0:(OR (EQ s70 0) (EQ s194 0) (EQ s195 0) (EQ s196 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1907 reset in 427 ms.
Product exploration explored 100000 steps with 1908 reset in 442 ms.
Graph (complete) has 690 edges and 230 vertex of which 218 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1908 reset in 399 ms.
Product exploration explored 100000 steps with 1903 reset in 426 ms.
[2021-05-10 11:01:23] [INFO ] Flatten gal took : 16 ms
[2021-05-10 11:01:23] [INFO ] Flatten gal took : 16 ms
[2021-05-10 11:01:23] [INFO ] Time to serialize gal into /tmp/LTL8653122731313798699.gal : 2 ms
[2021-05-10 11:01:23] [INFO ] Time to serialize properties into /tmp/LTL10144273003698052818.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/LTL8653122731313798699.gal, -t, CGAL, -LTL, /tmp/LTL10144273003698052818.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/LTL8653122731313798699.gal -t CGAL -LTL /tmp/LTL10144273003698052818.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F(("((((p171==0)||(p60==0))||(p61==0))||(p62==0))")||(G("((p247==1)&&(p59==1))"))))))
Formula 0 simplified : !GF("((((p171==0)||(p60==0))||(p61==0))||(p62==0))" | G"((p247==1)&&(p59==1))")
Detected timeout of ITS tools.
[2021-05-10 11:01:38] [INFO ] Flatten gal took : 16 ms
[2021-05-10 11:01:38] [INFO ] Applying decomposition
[2021-05-10 11:01:38] [INFO ] Flatten gal took : 16 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/graph9767484092192786821.txt, -o, /tmp/graph9767484092192786821.bin, -w, /tmp/graph9767484092192786821.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/graph9767484092192786821.bin, -l, -1, -v, -w, /tmp/graph9767484092192786821.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 11:01:38] [INFO ] Decomposing Gal with order
[2021-05-10 11:01:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 11:01:38] [INFO ] Removed a total of 220 redundant transitions.
[2021-05-10 11:01:38] [INFO ] Flatten gal took : 34 ms
[2021-05-10 11:01:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-10 11:01:39] [INFO ] Time to serialize gal into /tmp/LTL3288192649059507759.gal : 3 ms
[2021-05-10 11:01:39] [INFO ] Time to serialize properties into /tmp/LTL553079671000546288.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/LTL3288192649059507759.gal, -t, CGAL, -LTL, /tmp/LTL553079671000546288.ltl, -c, -stutter-deadlock], 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/LTL3288192649059507759.gal -t CGAL -LTL /tmp/LTL553079671000546288.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F(("((((i3.u7.p171==0)||(i6.u17.p60==0))||(i3.u13.p61==0))||(u29.p62==0))")||(G("((i9.u30.p247==1)&&(i9.u27.p59==1))"))))))
Formula 0 simplified : !GF("((((i3.u7.p171==0)||(i6.u17.p60==0))||(i3.u13.p61==0))||(u29.p62==0))" | G"((i9.u30.p247==1)&&(i9.u27.p59==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10891854879646962267
[2021-05-10 11:01:54] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10891854879646962267
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/ltsmin10891854879646962267]
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/ltsmin10891854879646962267] 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/ltsmin10891854879646962267] 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 Echo-PT-d03r03-01 finished in 35416 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&F(p1)&&X(G(p2)))))], workingDir=/home/mcc/execution]
Support contains 14 out of 238 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 238/238 places, 206/206 transitions.
Applied a total of 0 rules in 4 ms. Remains 238 /238 variables (removed 0) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:02:01] [INFO ] Computed 108 place invariants in 14 ms
[2021-05-10 11:02:02] [INFO ] Implicit Places using invariants in 570 ms returned []
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:02:02] [INFO ] Computed 108 place invariants in 14 ms
[2021-05-10 11:02:02] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 1093 ms to find 0 implicit places.
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:02:02] [INFO ] Computed 108 place invariants in 14 ms
[2021-05-10 11:02:02] [INFO ] Dead Transitions using invariants and state equation in 270 ms returned []
Finished structural reductions, in 1 iterations. Remains : 238/238 places, 206/206 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), true]
Running random walk in product with property : Echo-PT-d03r03-02 automaton TGBA [mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND p1 p2), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(OR (AND (EQ s40 1) (EQ s168 1) (EQ s169 1) (EQ s171 1)) (AND (EQ s43 1) (EQ s172 1) (EQ s174 1))), p0:(OR (EQ s97 0) (EQ s231 0) (EQ s232 0) (EQ s234 0) (EQ s235 0)), p1:(OR (NEQ s16 1) (NEQ s159 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Echo-PT-d03r03-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r03-02 finished in 7882 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X(G((p1||(G(p2) U X(p3)))))))], workingDir=/home/mcc/execution]
Support contains 9 out of 238 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 238/238 places, 206/206 transitions.
Applied a total of 0 rules in 4 ms. Remains 238 /238 variables (removed 0) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:02:03] [INFO ] Computed 108 place invariants in 14 ms
[2021-05-10 11:02:03] [INFO ] Implicit Places using invariants in 479 ms returned []
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:02:03] [INFO ] Computed 108 place invariants in 17 ms
[2021-05-10 11:02:04] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 971 ms to find 0 implicit places.
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:02:04] [INFO ] Computed 108 place invariants in 23 ms
[2021-05-10 11:02:04] [INFO ] Dead Transitions using invariants and state equation in 292 ms returned []
Finished structural reductions, in 1 iterations. Remains : 238/238 places, 206/206 transitions.
Stuttering acceptance computed with spot in 418 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), true, (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : Echo-PT-d03r03-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=1 dest: 6}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 1} source=1 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 9}], [{ cond=(NOT p3), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 5}, { cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 11}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND p2 (NOT p3)), acceptance={0, 1} source=4 dest: 4}], [{ cond=true, acceptance={0, 1} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=6 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={0} source=6 dest: 1}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={1} source=6 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=6 dest: 9}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=6 dest: 12}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=6 dest: 13}], [{ cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={1} source=7 dest: 6}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={0, 1} source=7 dest: 7}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=7 dest: 8}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=7 dest: 9}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={0} source=7 dest: 9}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=8 dest: 4}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=8 dest: 8}, { cond=(AND p2 (NOT p3)), acceptance={} source=8 dest: 13}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=9 dest: 0}, { cond=(AND p0 (NOT p3)), acceptance={0} source=9 dest: 1}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={1} source=9 dest: 6}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={0, 1} source=9 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=9 dest: 9}], [{ cond=(NOT p3), acceptance={} source=10 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=10 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=10 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=10 dest: 4}], [{ cond=(NOT p2), acceptance={} source=11 dest: 5}, { cond=p2, acceptance={} source=11 dest: 11}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=12 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=12 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=12 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=12 dest: 9}, { cond=(AND p0 p2), acceptance={} source=12 dest: 12}, { cond=(AND (NOT p0) p2), acceptance={} source=12 dest: 13}], [{ cond=(NOT p2), acceptance={} source=13 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=13 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=13 dest: 3}, { cond=p2, acceptance={} source=13 dest: 13}]], initial=1, aps=[p1:(AND (EQ s153 1) (EQ s233 1)), p2:(AND (EQ s141 1) (EQ s175 1)), p0:(OR (EQ s141 0) (EQ s175 0) (AND (EQ s85 1) (EQ s211 1) (EQ s212 1) (EQ s213 1) (EQ s214 1))), p3:(AND (EQ s85 1) (EQ s211 1) (EQ s212 1) (EQ s213 1) (EQ s214 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 54 steps with 0 reset in 1 ms.
FORMULA Echo-PT-d03r03-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r03-03 finished in 1707 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(((X(F(p0))&&(X(G(p2))||p1))||G(F(p0)))))], workingDir=/home/mcc/execution]
Support contains 9 out of 238 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 238/238 places, 206/206 transitions.
Applied a total of 0 rules in 2 ms. Remains 238 /238 variables (removed 0) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:02:04] [INFO ] Computed 108 place invariants in 13 ms
[2021-05-10 11:02:05] [INFO ] Implicit Places using invariants in 518 ms returned []
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:02:05] [INFO ] Computed 108 place invariants in 14 ms
[2021-05-10 11:02:05] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 1028 ms to find 0 implicit places.
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:02:05] [INFO ] Computed 108 place invariants in 13 ms
[2021-05-10 11:02:06] [INFO ] Dead Transitions using invariants and state equation in 286 ms returned []
Finished structural reductions, in 1 iterations. Remains : 238/238 places, 206/206 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Echo-PT-d03r03-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (NEQ s86 0) (NEQ s223 0) (NEQ s224 0) (NEQ s225 0) (NEQ s226 0)) (AND (NEQ s152 0) (NEQ s229 0))), p0:(OR (NEQ s152 1) (NEQ s229 1)), p2:(OR (NEQ s27 1) (NEQ s161 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 8627 reset in 466 ms.
Product exploration explored 100000 steps with 8583 reset in 490 ms.
Graph (complete) has 727 edges and 238 vertex of which 225 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Knowledge obtained : [(NOT p1), p0, p2]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 8460 reset in 459 ms.
Product exploration explored 100000 steps with 8415 reset in 486 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 9 out of 238 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 238/238 places, 206/206 transitions.
Applied a total of 0 rules in 22 ms. Remains 238 /238 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2021-05-10 11:02:16] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:02:17] [INFO ] Computed 108 place invariants in 14 ms
[2021-05-10 11:02:17] [INFO ] Dead Transitions using invariants and state equation in 334 ms returned []
Finished structural reductions, in 1 iterations. Remains : 238/238 places, 206/206 transitions.
Product exploration explored 100000 steps with 8686 reset in 737 ms.
Product exploration explored 100000 steps with 8716 reset in 681 ms.
[2021-05-10 11:02:18] [INFO ] Flatten gal took : 14 ms
[2021-05-10 11:02:18] [INFO ] Flatten gal took : 12 ms
[2021-05-10 11:02:18] [INFO ] Time to serialize gal into /tmp/LTL15451319446715649789.gal : 2 ms
[2021-05-10 11:02:18] [INFO ] Time to serialize properties into /tmp/LTL11724938662596311702.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/LTL15451319446715649789.gal, -t, CGAL, -LTL, /tmp/LTL11724938662596311702.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/LTL15451319446715649789.gal -t CGAL -LTL /tmp/LTL11724938662596311702.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((p253==0)||(p91==0))")))||((X(F("((p253==0)||(p91==0))")))&&(((X(G("((p127==0)||(p262==0))")))||("(((((p186==1)&&(p85==1))&&(p86==1))&&(p87==1))&&(p88==1))"))||("((p253==1)&&(p91==1))"))))))
Formula 0 simplified : !F(GF"((p253==0)||(p91==0))" | (XF"((p253==0)||(p91==0))" & ("(((((p186==1)&&(p85==1))&&(p86==1))&&(p87==1))&&(p88==1))" | "((p253==1)&&(p91==1))" | XG"((p127==0)||(p262==0))")))
Detected timeout of ITS tools.
[2021-05-10 11:02:33] [INFO ] Flatten gal took : 28 ms
[2021-05-10 11:02:33] [INFO ] Applying decomposition
[2021-05-10 11:02:33] [INFO ] Flatten gal took : 13 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/graph6399177371109025978.txt, -o, /tmp/graph6399177371109025978.bin, -w, /tmp/graph6399177371109025978.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/graph6399177371109025978.bin, -l, -1, -v, -w, /tmp/graph6399177371109025978.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 11:02:33] [INFO ] Decomposing Gal with order
[2021-05-10 11:02:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 11:02:33] [INFO ] Removed a total of 221 redundant transitions.
[2021-05-10 11:02:33] [INFO ] Flatten gal took : 31 ms
[2021-05-10 11:02:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-10 11:02:33] [INFO ] Time to serialize gal into /tmp/LTL7273836395085508251.gal : 2 ms
[2021-05-10 11:02:33] [INFO ] Time to serialize properties into /tmp/LTL6005580617354535415.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/LTL7273836395085508251.gal, -t, CGAL, -LTL, /tmp/LTL6005580617354535415.ltl, -c, -stutter-deadlock], 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/LTL7273836395085508251.gal -t CGAL -LTL /tmp/LTL6005580617354535415.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((i9.u27.p253==0)||(i9.u15.p91==0))")))||((X(F("((i9.u27.p253==0)||(i9.u15.p91==0))")))&&(((X(G("((i1.u7.p127==0)||(i1.u4.p262==0))")))||("(((((i8.u14.p186==1)&&(i8.u14.p85==1))&&(i8.u14.p86==1))&&(i8.u14.p87==1))&&(i8.u14.p88==1))"))||("((i9.u27.p253==1)&&(i9.u15.p91==1))"))))))
Formula 0 simplified : !F(GF"((i9.u27.p253==0)||(i9.u15.p91==0))" | (XF"((i9.u27.p253==0)||(i9.u15.p91==0))" & ("(((((i8.u14.p186==1)&&(i8.u14.p85==1))&&(i8.u14.p86==1))&&(i8.u14.p87==1))&&(i8.u14.p88==1))" | "((i9.u27.p253==1)&&(i9.u15.p91==1))" | XG"((i1.u7.p127==0)||(i1.u4.p262==0))")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2940052623038338301
[2021-05-10 11:02:48] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2940052623038338301
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/ltsmin2940052623038338301]
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/ltsmin2940052623038338301] 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/ltsmin2940052623038338301] 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 Echo-PT-d03r03-04 finished in 45271 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 9 out of 238 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 238/238 places, 206/206 transitions.
Applied a total of 0 rules in 5 ms. Remains 238 /238 variables (removed 0) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:02:50] [INFO ] Computed 108 place invariants in 14 ms
[2021-05-10 11:02:50] [INFO ] Implicit Places using invariants in 476 ms returned []
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:02:50] [INFO ] Computed 108 place invariants in 14 ms
[2021-05-10 11:02:51] [INFO ] Implicit Places using invariants and state equation in 519 ms returned []
Implicit Place search using SMT with State Equation took 997 ms to find 0 implicit places.
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:02:51] [INFO ] Computed 108 place invariants in 13 ms
[2021-05-10 11:02:51] [INFO ] Dead Transitions using invariants and state equation in 280 ms returned []
Finished structural reductions, in 1 iterations. Remains : 238/238 places, 206/206 transitions.
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d03r03-05 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:(AND (OR (NEQ s63 1) (NEQ s191 1) (NEQ s192 1) (NEQ s194 1)) (OR (NEQ s89 1) (NEQ s222 1) (NEQ s223 1) (NEQ s224 1) (NEQ s226 1)))], 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 134 steps with 2 reset in 0 ms.
FORMULA Echo-PT-d03r03-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r03-05 finished in 1356 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U p1)))], workingDir=/home/mcc/execution]
Support contains 8 out of 238 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 238/238 places, 206/206 transitions.
Applied a total of 0 rules in 2 ms. Remains 238 /238 variables (removed 0) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:02:51] [INFO ] Computed 108 place invariants in 12 ms
[2021-05-10 11:02:51] [INFO ] Implicit Places using invariants in 537 ms returned []
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:02:51] [INFO ] Computed 108 place invariants in 15 ms
[2021-05-10 11:02:52] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 1064 ms to find 0 implicit places.
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:02:52] [INFO ] Computed 108 place invariants in 13 ms
[2021-05-10 11:02:52] [INFO ] Dead Transitions using invariants and state equation in 281 ms returned []
Finished structural reductions, in 1 iterations. Remains : 238/238 places, 206/206 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : Echo-PT-d03r03-06 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s150 1) (EQ s211 1)), p0:(OR (EQ s147 0) (EQ s198 0) (AND (EQ s63 1) (EQ s191 1) (EQ s192 1) (EQ s194 1)))], 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]]
Stuttering criterion allowed to conclude after 54 steps with 0 reset in 0 ms.
FORMULA Echo-PT-d03r03-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r03-06 finished in 1476 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 238 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 238/238 places, 206/206 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 9 ms. Remains 237 /238 variables (removed 1) and now considering 205/206 (removed 1) transitions.
// Phase 1: matrix 205 rows 237 cols
[2021-05-10 11:02:52] [INFO ] Computed 108 place invariants in 15 ms
[2021-05-10 11:02:53] [INFO ] Implicit Places using invariants in 388 ms returned [16, 163, 182, 204, 212, 223, 231]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 389 ms to find 7 implicit places.
[2021-05-10 11:02:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 205 rows 230 cols
[2021-05-10 11:02:53] [INFO ] Computed 101 place invariants in 21 ms
[2021-05-10 11:02:53] [INFO ] Dead Transitions using invariants and state equation in 277 ms returned []
Starting structural reductions, iteration 1 : 230/238 places, 205/206 transitions.
Applied a total of 0 rules in 8 ms. Remains 230 /230 variables (removed 0) and now considering 205/205 (removed 0) transitions.
[2021-05-10 11:02:53] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 205 rows 230 cols
[2021-05-10 11:02:53] [INFO ] Computed 101 place invariants in 12 ms
[2021-05-10 11:02:53] [INFO ] Dead Transitions using invariants and state equation in 281 ms returned []
Finished structural reductions, in 2 iterations. Remains : 230/238 places, 205/206 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d03r03-07 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:(AND (EQ s9 1) (EQ s11 1) (EQ s111 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 53 steps with 0 reset in 0 ms.
FORMULA Echo-PT-d03r03-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r03-07 finished in 1033 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0) U ((X(G(p2))||p1) U p3))))], workingDir=/home/mcc/execution]
Support contains 10 out of 238 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 238/238 places, 206/206 transitions.
Applied a total of 0 rules in 2 ms. Remains 238 /238 variables (removed 0) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:02:53] [INFO ] Computed 108 place invariants in 14 ms
[2021-05-10 11:02:54] [INFO ] Implicit Places using invariants in 488 ms returned []
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:02:54] [INFO ] Computed 108 place invariants in 15 ms
[2021-05-10 11:02:54] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 959 ms to find 0 implicit places.
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:02:54] [INFO ] Computed 108 place invariants in 14 ms
[2021-05-10 11:02:55] [INFO ] Dead Transitions using invariants and state equation in 286 ms returned []
Finished structural reductions, in 1 iterations. Remains : 238/238 places, 206/206 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p3), (NOT p3), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : Echo-PT-d03r03-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(AND (EQ s153 1) (EQ s235 1)), p1:(OR (EQ s61 0) (EQ s192 0) (EQ s193 0) (EQ s194 0)), p0:(AND (EQ s47 1) (EQ s175 1) (EQ s176 1) (EQ s178 1)), p2:(AND (EQ s61 1) (EQ s192 1) (EQ s193 1) (EQ s194 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 54 steps with 0 reset in 0 ms.
FORMULA Echo-PT-d03r03-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r03-08 finished in 1390 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 238 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 238/238 places, 206/206 transitions.
Applied a total of 0 rules in 2 ms. Remains 238 /238 variables (removed 0) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:02:55] [INFO ] Computed 108 place invariants in 14 ms
[2021-05-10 11:02:55] [INFO ] Implicit Places using invariants in 510 ms returned []
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:02:55] [INFO ] Computed 108 place invariants in 15 ms
[2021-05-10 11:02:56] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 1010 ms to find 0 implicit places.
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:02:56] [INFO ] Computed 108 place invariants in 21 ms
[2021-05-10 11:02:56] [INFO ] Dead Transitions using invariants and state equation in 262 ms returned []
Finished structural reductions, in 1 iterations. Remains : 238/238 places, 206/206 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d03r03-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s138 1) (EQ s165 1))], 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]]
Stuttering criterion allowed to conclude after 67 steps with 1 reset in 1 ms.
FORMULA Echo-PT-d03r03-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r03-09 finished in 1328 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0) U X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 9 out of 238 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 238/238 places, 206/206 transitions.
Applied a total of 0 rules in 2 ms. Remains 238 /238 variables (removed 0) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:02:56] [INFO ] Computed 108 place invariants in 21 ms
[2021-05-10 11:02:57] [INFO ] Implicit Places using invariants in 445 ms returned []
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:02:57] [INFO ] Computed 108 place invariants in 13 ms
[2021-05-10 11:02:57] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 932 ms to find 0 implicit places.
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:02:57] [INFO ] Computed 108 place invariants in 14 ms
[2021-05-10 11:02:57] [INFO ] Dead Transitions using invariants and state equation in 277 ms returned []
Finished structural reductions, in 1 iterations. Remains : 238/238 places, 206/206 transitions.
Stuttering acceptance computed with spot in 6738 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), true, (AND p1 (NOT p0))]
Running random walk in product with property : Echo-PT-d03r03-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s22 0) (EQ s23 0) (EQ s24 0) (EQ s123 0)), p0:(AND (EQ s16 1) (EQ s17 1) (EQ s18 1) (EQ s20 1) (EQ s121 1))], 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 138 steps with 2 reset in 1 ms.
FORMULA Echo-PT-d03r03-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r03-10 finished in 7961 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((F(G(p1))&&p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 238 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 238/238 places, 206/206 transitions.
Applied a total of 0 rules in 1 ms. Remains 238 /238 variables (removed 0) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:03:04] [INFO ] Computed 108 place invariants in 13 ms
[2021-05-10 11:03:05] [INFO ] Implicit Places using invariants in 492 ms returned []
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:03:05] [INFO ] Computed 108 place invariants in 14 ms
[2021-05-10 11:03:05] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 996 ms to find 0 implicit places.
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:03:05] [INFO ] Computed 108 place invariants in 20 ms
[2021-05-10 11:03:05] [INFO ] Dead Transitions using invariants and state equation in 283 ms returned []
Finished structural reductions, in 1 iterations. Remains : 238/238 places, 206/206 transitions.
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Echo-PT-d03r03-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s152 1) (EQ s228 1)), p1:(AND (EQ s152 1) (EQ s228 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Echo-PT-d03r03-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r03-11 finished in 1381 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X(F(p1))&&p0)))], workingDir=/home/mcc/execution]
Support contains 6 out of 238 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 238/238 places, 206/206 transitions.
Applied a total of 0 rules in 1 ms. Remains 238 /238 variables (removed 0) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:03:05] [INFO ] Computed 108 place invariants in 13 ms
[2021-05-10 11:03:06] [INFO ] Implicit Places using invariants in 415 ms returned []
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:03:06] [INFO ] Computed 108 place invariants in 14 ms
[2021-05-10 11:03:06] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 893 ms to find 0 implicit places.
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:03:06] [INFO ] Computed 108 place invariants in 14 ms
[2021-05-10 11:03:07] [INFO ] Dead Transitions using invariants and state equation in 280 ms returned []
Finished structural reductions, in 1 iterations. Remains : 238/238 places, 206/206 transitions.
Stuttering acceptance computed with spot in 4454 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Echo-PT-d03r03-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s152 1) (EQ s227 1)), p1:(AND (EQ s28 1) (EQ s29 1) (EQ s31 1) (EQ s132 1) (EQ s152 1) (EQ s227 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 54 steps with 0 reset in 1 ms.
FORMULA Echo-PT-d03r03-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r03-12 finished in 5640 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&X((X(X(p2))&&p1)))))], workingDir=/home/mcc/execution]
Support contains 9 out of 238 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 238/238 places, 206/206 transitions.
Applied a total of 0 rules in 2 ms. Remains 238 /238 variables (removed 0) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:03:11] [INFO ] Computed 108 place invariants in 13 ms
[2021-05-10 11:03:12] [INFO ] Implicit Places using invariants in 505 ms returned []
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:03:12] [INFO ] Computed 108 place invariants in 13 ms
[2021-05-10 11:03:12] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 1001 ms to find 0 implicit places.
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:03:12] [INFO ] Computed 108 place invariants in 14 ms
[2021-05-10 11:03:12] [INFO ] Dead Transitions using invariants and state equation in 277 ms returned []
Finished structural reductions, in 1 iterations. Remains : 238/238 places, 206/206 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true]
Running random walk in product with property : Echo-PT-d03r03-13 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 3}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1 p2), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 2}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s24 0) (EQ s160 0)), p1:(AND (OR (NEQ s21 1) (NEQ s22 1) (NEQ s24 1) (NEQ s125 1)) (OR (NEQ s24 1) (NEQ s160 1))), p2:(OR (NEQ s80 1) (NEQ s207 1) (NEQ s208 1) (NEQ s209 1))], 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 139 steps with 2 reset in 1 ms.
FORMULA Echo-PT-d03r03-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r03-13 finished in 1456 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(G(p0))||G(!p0))))], workingDir=/home/mcc/execution]
Support contains 5 out of 238 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 238/238 places, 206/206 transitions.
Applied a total of 0 rules in 2 ms. Remains 238 /238 variables (removed 0) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:03:13] [INFO ] Computed 108 place invariants in 13 ms
[2021-05-10 11:03:13] [INFO ] Implicit Places using invariants in 472 ms returned []
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:03:13] [INFO ] Computed 108 place invariants in 35 ms
[2021-05-10 11:03:13] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 959 ms to find 0 implicit places.
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:03:14] [INFO ] Computed 108 place invariants in 14 ms
[2021-05-10 11:03:14] [INFO ] Dead Transitions using invariants and state equation in 287 ms returned []
Finished structural reductions, in 1 iterations. Remains : 238/238 places, 206/206 transitions.
Stuttering acceptance computed with spot in 75 ms :[false, (NOT p0), false]
Running random walk in product with property : Echo-PT-d03r03-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (EQ s72 1) (EQ s203 1) (EQ s204 1) (EQ s205 1) (EQ s206 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 439 steps with 7 reset in 2 ms.
FORMULA Echo-PT-d03r03-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r03-14 finished in 1336 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 9 out of 238 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 238/238 places, 206/206 transitions.
Applied a total of 0 rules in 7 ms. Remains 238 /238 variables (removed 0) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:03:14] [INFO ] Computed 108 place invariants in 13 ms
[2021-05-10 11:03:14] [INFO ] Implicit Places using invariants in 513 ms returned []
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:03:14] [INFO ] Computed 108 place invariants in 14 ms
[2021-05-10 11:03:15] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 979 ms to find 0 implicit places.
[2021-05-10 11:03:15] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 206 rows 238 cols
[2021-05-10 11:03:15] [INFO ] Computed 108 place invariants in 13 ms
[2021-05-10 11:03:15] [INFO ] Dead Transitions using invariants and state equation in 262 ms returned []
Finished structural reductions, in 1 iterations. Remains : 238/238 places, 206/206 transitions.
Stuttering acceptance computed with spot in 5976 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d03r03-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:(OR (AND (EQ s85 1) (EQ s211 1) (EQ s212 1) (EQ s213 1) (EQ s214 1)) (AND (EQ s151 1) (EQ s223 1)) (AND (EQ s4 1) (EQ s155 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 127 steps with 6 reset in 1 ms.
FORMULA Echo-PT-d03r03-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r03-15 finished in 7240 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12777956958912702371
[2021-05-10 11:03:21] [INFO ] Applying decomposition
[2021-05-10 11:03:21] [INFO ] Computing symmetric may disable matrix : 206 transitions.
[2021-05-10 11:03:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-10 11:03:21] [INFO ] Computing symmetric may enable matrix : 206 transitions.
[2021-05-10 11:03:21] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-10 11:03:21] [INFO ] Flatten gal took : 20 ms
[2021-05-10 11:03:21] [INFO ] Computing Do-Not-Accords matrix : 206 transitions.
[2021-05-10 11:03:21] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-10 11:03:21] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12777956958912702371
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/ltsmin12777956958912702371]
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/graph12384982463841794123.txt, -o, /tmp/graph12384982463841794123.bin, -w, /tmp/graph12384982463841794123.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/graph12384982463841794123.bin, -l, -1, -v, -w, /tmp/graph12384982463841794123.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 11:03:21] [INFO ] Decomposing Gal with order
[2021-05-10 11:03:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 11:03:21] [INFO ] Removed a total of 223 redundant transitions.
[2021-05-10 11:03:21] [INFO ] Flatten gal took : 33 ms
[2021-05-10 11:03:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-10 11:03:21] [INFO ] Time to serialize gal into /tmp/LTLFireability15354863397329992810.gal : 11 ms
[2021-05-10 11:03:21] [INFO ] Time to serialize properties into /tmp/LTLFireability14571493453143178260.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/LTLFireability15354863397329992810.gal, -t, CGAL, -LTL, /tmp/LTLFireability14571493453143178260.ltl, -c, -stutter-deadlock], 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/LTLFireability15354863397329992810.gal -t CGAL -LTL /tmp/LTLFireability14571493453143178260.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !((((G("(((i7.u23.p159==1)&&(i7.u23.p50==1))&&(i7.u22.p52==1))"))||(G("(((i7.u23.p159==0)||(i7.u23.p50==0))||(i7.u22.p52==0))")))||(F(G(!("(((i7.u23.p159==1)&&(i7.u23.p50==1))&&(i7.u22.p52==1))"))))))
Formula 0 simplified : !(G"(((i7.u23.p159==1)&&(i7.u23.p50==1))&&(i7.u22.p52==1))" | G"(((i7.u23.p159==0)||(i7.u23.p50==0))||(i7.u22.p52==0))" | FG!"(((i7.u23.p159==1)&&(i7.u23.p50==1))&&(i7.u22.p52==1))")
Compilation finished in 1234 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin12777956958912702371]
Link finished in 49 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, ([]((LTLAPp0==true))||[]((LTLAPp1==true))||<>([](!(LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin12777956958912702371]
WARNING : LTSmin timed out (>225 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, ([]((LTLAPp0==true))||[]((LTLAPp1==true))||<>([](!(LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin12777956958912702371]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>(([]((LTLAPp3==true))||(LTLAPp2==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin12777956958912702371]
WARNING : LTSmin timed out (>225 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>(([]((LTLAPp3==true))||(LTLAPp2==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin12777956958912702371]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>(((X(<>((LTLAPp4==true)))&&(X([]((LTLAPp6==true)))||(LTLAPp5==true)))||[](<>((LTLAPp4==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12777956958912702371]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.010: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.032: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.032: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.037: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.028: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.037: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.028: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.151: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.151: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.152: LTL layer: formula: <>(((X(<>((LTLAPp4==true)))&&(X([]((LTLAPp6==true)))||(LTLAPp5==true)))||[](<>((LTLAPp4==true)))))
pins2lts-mc-linux64( 0/ 8), 0.153: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.154: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.155: "<>(((X(<>((LTLAPp4==true)))&&(X([]((LTLAPp6==true)))||(LTLAPp5==true)))||[](<>((LTLAPp4==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.155: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.155: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.155: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.146: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.155: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.174: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.421: DFS-FIFO for weak LTL, using special progress label 214
pins2lts-mc-linux64( 0/ 8), 0.422: There are 215 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.422: State length is 239, there are 214 groups
pins2lts-mc-linux64( 0/ 8), 0.422: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.422: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.422: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.422: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.686: ~42 levels ~960 states ~7600 transitions
pins2lts-mc-linux64( 1/ 8), 0.687: ~42 levels ~1920 states ~8672 transitions
pins2lts-mc-linux64( 1/ 8), 0.691: ~42 levels ~3840 states ~11280 transitions
pins2lts-mc-linux64( 1/ 8), 0.711: ~42 levels ~7680 states ~16976 transitions
pins2lts-mc-linux64( 1/ 8), 0.738: ~42 levels ~15360 states ~28544 transitions
pins2lts-mc-linux64( 1/ 8), 0.807: ~42 levels ~30720 states ~54512 transitions
pins2lts-mc-linux64( 1/ 8), 0.965: ~42 levels ~61440 states ~107208 transitions
pins2lts-mc-linux64( 1/ 8), 1.234: ~42 levels ~122880 states ~214328 transitions
pins2lts-mc-linux64( 1/ 8), 1.800: ~43 levels ~245760 states ~437104 transitions
pins2lts-mc-linux64( 1/ 8), 2.914: ~43 levels ~491520 states ~874280 transitions
pins2lts-mc-linux64( 1/ 8), 5.796: ~43 levels ~983040 states ~1782632 transitions
pins2lts-mc-linux64( 3/ 8), 11.525: ~41 levels ~1966080 states ~3998384 transitions
pins2lts-mc-linux64( 1/ 8), 22.737: ~43 levels ~3932160 states ~7375688 transitions
pins2lts-mc-linux64( 4/ 8), 44.006: ~41 levels ~7864320 states ~15432328 transitions
pins2lts-mc-linux64( 4/ 8), 92.001: ~41 levels ~15728640 states ~32053992 transitions
pins2lts-mc-linux64( 3/ 8), 139.732: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 139.852:
pins2lts-mc-linux64( 0/ 8), 139.852: mean standard work distribution: 2.2% (states) 3.0% (transitions)
pins2lts-mc-linux64( 0/ 8), 139.852:
pins2lts-mc-linux64( 0/ 8), 139.852: Explored 22190680 states 48517460 transitions, fanout: 2.186
pins2lts-mc-linux64( 0/ 8), 139.852: Total exploration time 139.420 sec (139.310 sec minimum, 139.343 sec on average)
pins2lts-mc-linux64( 0/ 8), 139.852: States per second: 159164, Transitions per second: 347995
pins2lts-mc-linux64( 0/ 8), 139.852:
pins2lts-mc-linux64( 0/ 8), 139.852: Progress states detected: 978
pins2lts-mc-linux64( 0/ 8), 139.852: Redundant explorations: -0.0167
pins2lts-mc-linux64( 0/ 8), 139.852:
pins2lts-mc-linux64( 0/ 8), 139.852: Queue width: 8B, total height: 1384, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 139.852: Tree memory: 425.3MB, 20.1 B/state, compr.: 2.1%
pins2lts-mc-linux64( 0/ 8), 139.852: Tree fill ratio (roots/leafs): 16.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 139.852: Stored 216 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 139.852: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 139.852: Est. total memory use: 425.3MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>(((X(<>((LTLAPp4==true)))&&(X([]((LTLAPp6==true)))||(LTLAPp5==true)))||[](<>((LTLAPp4==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12777956958912702371]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>(((X(<>((LTLAPp4==true)))&&(X([]((LTLAPp6==true)))||(LTLAPp5==true)))||[](<>((LTLAPp4==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12777956958912702371]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-10 11:24:15] [INFO ] Applying decomposition
[2021-05-10 11:24:15] [INFO ] Flatten gal took : 20 ms
[2021-05-10 11:24:15] [INFO ] Decomposing Gal with order
[2021-05-10 11:24:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 11:24:15] [INFO ] Removed a total of 624 redundant transitions.
[2021-05-10 11:24:15] [INFO ] Flatten gal took : 26 ms
[2021-05-10 11:24:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-10 11:24:15] [INFO ] Time to serialize gal into /tmp/LTLFireability1332702460048518021.gal : 2 ms
[2021-05-10 11:24:15] [INFO ] Time to serialize properties into /tmp/LTLFireability13695301320230839570.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/LTLFireability1332702460048518021.gal, -t, CGAL, -LTL, /tmp/LTLFireability13695301320230839570.ltl, -c, -stutter-deadlock], 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/LTLFireability1332702460048518021.gal -t CGAL -LTL /tmp/LTLFireability13695301320230839570.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !((((G("(((u21.p159==1)&&(u87.p50==1))&&(u89.p52==1))"))||(G("(((u21.p159==0)||(u87.p50==0))||(u89.p52==0))")))||(F(G(!("(((u21.p159==1)&&(u87.p50==1))&&(u89.p52==1))"))))))
Formula 0 simplified : !(G"(((u21.p159==1)&&(u87.p50==1))&&(u89.p52==1))" | G"(((u21.p159==0)||(u87.p50==0))||(u89.p52==0))" | FG!"(((u21.p159==1)&&(u87.p50==1))&&(u89.p52==1))")
Detected timeout of ITS tools.
[2021-05-10 11:45:10] [INFO ] Flatten gal took : 127 ms
[2021-05-10 11:45:10] [INFO ] Input system was already deterministic with 206 transitions.
[2021-05-10 11:45:10] [INFO ] Transformed 238 places.
[2021-05-10 11:45:10] [INFO ] Transformed 206 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-10 11:45:10] [INFO ] Time to serialize gal into /tmp/LTLFireability4968166617079639078.gal : 8 ms
[2021-05-10 11:45:10] [INFO ] Time to serialize properties into /tmp/LTLFireability6961070449033115859.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/LTLFireability4968166617079639078.gal, -t, CGAL, -LTL, /tmp/LTLFireability6961070449033115859.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/LTLFireability4968166617079639078.gal -t CGAL -LTL /tmp/LTLFireability6961070449033115859.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((((G("(((p159==1)&&(p50==1))&&(p52==1))"))||(G("(((p159==0)||(p50==0))||(p52==0))")))||(F(G(!("(((p159==1)&&(p50==1))&&(p52==1))"))))))
Formula 0 simplified : !(G"(((p159==1)&&(p50==1))&&(p52==1))" | G"(((p159==0)||(p50==0))||(p52==0))" | FG!"(((p159==1)&&(p50==1))&&(p52==1))")

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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="Echo-PT-d03r03"
export BK_EXAMINATION="LTLFireability"
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 Echo-PT-d03r03, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r083-tall-162048875600637"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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