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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 9.2K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 110K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 10:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 10:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 67K 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 DoubleExponent-PT-004-00
FORMULA_NAME DoubleExponent-PT-004-01
FORMULA_NAME DoubleExponent-PT-004-02
FORMULA_NAME DoubleExponent-PT-004-03
FORMULA_NAME DoubleExponent-PT-004-04
FORMULA_NAME DoubleExponent-PT-004-05
FORMULA_NAME DoubleExponent-PT-004-06
FORMULA_NAME DoubleExponent-PT-004-07
FORMULA_NAME DoubleExponent-PT-004-08
FORMULA_NAME DoubleExponent-PT-004-09
FORMULA_NAME DoubleExponent-PT-004-10
FORMULA_NAME DoubleExponent-PT-004-11
FORMULA_NAME DoubleExponent-PT-004-12
FORMULA_NAME DoubleExponent-PT-004-13
FORMULA_NAME DoubleExponent-PT-004-14
FORMULA_NAME DoubleExponent-PT-004-15

=== Now, execution of the tool begins

BK_START 1620585251166

Running Version 0
[2021-05-09 18:34:12] [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-09 18:34:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 18:34:12] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2021-05-09 18:34:12] [INFO ] Transformed 216 places.
[2021-05-09 18:34:12] [INFO ] Transformed 198 transitions.
[2021-05-09 18:34:12] [INFO ] Parsed PT model containing 216 places and 198 transitions in 112 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 18:34:12] [INFO ] Initial state test concluded for 4 properties.
FORMULA DoubleExponent-PT-004-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 216 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 216/216 places, 198/198 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 212 transition count 198
Applied a total of 4 rules in 22 ms. Remains 212 /216 variables (removed 4) and now considering 198/198 (removed 0) transitions.
// Phase 1: matrix 198 rows 212 cols
[2021-05-09 18:34:13] [INFO ] Computed 21 place invariants in 32 ms
[2021-05-09 18:34:13] [INFO ] Implicit Places using invariants in 214 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 242 ms to find 1 implicit places.
// Phase 1: matrix 198 rows 211 cols
[2021-05-09 18:34:13] [INFO ] Computed 20 place invariants in 9 ms
[2021-05-09 18:34:13] [INFO ] Dead Transitions using invariants and state equation in 171 ms returned []
Starting structural reductions, iteration 1 : 211/216 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 210 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 197
Applied a total of 2 rules in 24 ms. Remains 210 /211 variables (removed 1) and now considering 197/198 (removed 1) transitions.
// Phase 1: matrix 197 rows 210 cols
[2021-05-09 18:34:13] [INFO ] Computed 20 place invariants in 7 ms
[2021-05-09 18:34:13] [INFO ] Implicit Places using invariants in 183 ms returned []
// Phase 1: matrix 197 rows 210 cols
[2021-05-09 18:34:13] [INFO ] Computed 20 place invariants in 5 ms
[2021-05-09 18:34:13] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 210/216 places, 197/198 transitions.
[2021-05-09 18:34:13] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-09 18:34:14] [INFO ] Flatten gal took : 43 ms
FORMULA DoubleExponent-PT-004-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 18:34:14] [INFO ] Flatten gal took : 21 ms
[2021-05-09 18:34:14] [INFO ] Input system was already deterministic with 197 transitions.
Incomplete random walk after 100000 steps, including 3278 resets, run finished after 331 ms. (steps per millisecond=302 ) properties (out of 30) seen :10
Running SMT prover for 20 properties.
// Phase 1: matrix 197 rows 210 cols
[2021-05-09 18:34:14] [INFO ] Computed 20 place invariants in 8 ms
[2021-05-09 18:34:14] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2021-05-09 18:34:14] [INFO ] [Real]Absence check using 2 positive and 18 generalized place invariants in 5 ms returned sat
[2021-05-09 18:34:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 18:34:14] [INFO ] [Real]Absence check using state equation in 234 ms returned unsat :1 sat :19 real:0
Attempting to minimize the solution found.
Minimization took 211 ms.
[2021-05-09 18:34:15] [INFO ] SMT Verify possible in real domain returnedunsat :1 sat :19 real:0
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2021-05-09 18:34:15] [INFO ] Initial state test concluded for 1 properties.
FORMULA DoubleExponent-PT-004-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(((p0 U p1)&&((p2 U (p3||G(p2))) U ((p4&&(p2 U (p3||G(p2))))||G(p5))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 210 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 210/210 places, 197/197 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 209 transition count 153
Reduce places removed 43 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 44 rules applied. Total rules applied 87 place count 166 transition count 152
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 165 transition count 152
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 88 place count 165 transition count 144
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 104 place count 157 transition count 144
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 178 place count 120 transition count 107
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 190 place count 114 transition count 107
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 191 place count 113 transition count 106
Applied a total of 191 rules in 52 ms. Remains 113 /210 variables (removed 97) and now considering 106/197 (removed 91) transitions.
// Phase 1: matrix 106 rows 113 cols
[2021-05-09 18:34:15] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-09 18:34:15] [INFO ] Implicit Places using invariants in 66 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
[2021-05-09 18:34:15] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 106 rows 112 cols
[2021-05-09 18:34:15] [INFO ] Computed 19 place invariants in 5 ms
[2021-05-09 18:34:15] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Starting structural reductions, iteration 1 : 112/210 places, 106/197 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 110 transition count 104
Applied a total of 4 rules in 13 ms. Remains 110 /112 variables (removed 2) and now considering 104/106 (removed 2) transitions.
// Phase 1: matrix 104 rows 110 cols
[2021-05-09 18:34:15] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-09 18:34:15] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 104 rows 110 cols
[2021-05-09 18:34:15] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-09 18:34:15] [INFO ] State equation strengthened by 5 read => feed constraints.
[2021-05-09 18:34:15] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 110/210 places, 104/197 transitions.
Stuttering acceptance computed with spot in 564 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p4) (NOT p5))), (NOT p1), (OR (AND (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p4) (NOT p5))), (AND (NOT p2) (NOT p3) (NOT p5)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p3) (NOT p5))), (OR (AND (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p1) (NOT p5)) (AND (NOT p4) (NOT p5))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p5))]
Running random walk in product with property : DoubleExponent-PT-004-00 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p5) (NOT p3) (NOT p2))), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND (NOT p1) p0 p5) (AND (NOT p1) p0 p3) (AND (NOT p1) p0 p2)), acceptance={0, 1} source=0 dest: 1}, { cond=(OR (AND p1 (NOT p5) (NOT p4) p3) (AND p1 (NOT p5) (NOT p4) p2) (AND p0 (NOT p5) (NOT p4) p3) (AND p0 (NOT p5) (NOT p4) p2)), acceptance={0, 1} source=0 dest: 2}, { cond=(OR (AND p1 p5 (NOT p4) p3) (AND p1 p5 (NOT p4) p2) (AND p0 p5 (NOT p4) p3) (AND p0 p5 (NOT p4) p2)), acceptance={1} source=0 dest: 2}, { cond=(OR (AND p1 p5 p4 (NOT p3) p2) (AND p0 p5 p4 (NOT p3) p2)), acceptance={} source=0 dest: 3}, { cond=(OR (AND p1 (NOT p5) (NOT p3) p2) (AND p0 (NOT p5) (NOT p3) p2)), acceptance={0} source=0 dest: 4}, { cond=(OR (AND p1 p5 (NOT p3) (NOT p2)) (AND p0 p5 (NOT p3) (NOT p2))), acceptance={1} source=0 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p5) (NOT p3) (NOT p2)), acceptance={0, 1} source=2 dest: 0}, { cond=(OR (AND (NOT p5) (NOT p4) p3) (AND (NOT p5) (NOT p4) p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(OR (AND p5 (NOT p4) p3) (AND p5 (NOT p4) p2)), acceptance={1} source=2 dest: 2}, { cond=(AND p5 p4 (NOT p3) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p5) (NOT p3) p2), acceptance={0} source=2 dest: 4}, { cond=(AND p5 (NOT p3) (NOT p2)), acceptance={1} source=2 dest: 5}], [{ cond=(AND (NOT p5) (NOT p3) (NOT p2)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p5 (NOT p3) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p5) (NOT p3) p2), acceptance={0} source=3 dest: 4}, { cond=(AND p5 (NOT p3) (NOT p2)), acceptance={1} source=3 dest: 5}], [{ cond=(OR (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p5) (NOT p3) (NOT p2))), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p1) p0 p5 (NOT p3) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(OR (AND p1 p5 (NOT p3) p2) (AND p0 p5 (NOT p3) p2)), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p0) (NOT p3) p2) (AND (NOT p5) (NOT p3) p2)), acceptance={0} source=4 dest: 4}, { cond=(OR (AND p1 p5 (NOT p3) (NOT p2)) (AND p0 p5 (NOT p3) (NOT p2))), acceptance={1} source=4 dest: 5}, { cond=(AND (NOT p1) p0 p5 (NOT p3) p2), acceptance={0} source=4 dest: 6}], [{ cond=(OR (AND (NOT p1) (NOT p0) (NOT p5)) (AND (NOT p5) (NOT p3) (NOT p2))), acceptance={0, 1} source=5 dest: 0}, { cond=(OR (AND (NOT p1) p0 (NOT p5) p3) (AND (NOT p1) p0 (NOT p5) p2)), acceptance={0, 1} source=5 dest: 1}, { cond=(OR (AND p1 (NOT p5) (NOT p4) p3) (AND p1 (NOT p5) (NOT p4) p2) (AND p0 (NOT p5) (NOT p4) p3) (AND p0 (NOT p5) (NOT p4) p2)), acceptance={0, 1} source=5 dest: 2}, { cond=(OR (AND p1 p5 (NOT p4) p3) (AND p1 p5 (NOT p4) p2) (AND p0 p5 (NOT p4) p3) (AND p0 p5 (NOT p4) p2)), acceptance={1} source=5 dest: 2}, { cond=(OR (AND p1 p5 p4 (NOT p3) p2) (AND p0 p5 p4 (NOT p3) p2)), acceptance={} source=5 dest: 3}, { cond=(OR (AND p1 (NOT p5) (NOT p3) p2) (AND p0 (NOT p5) (NOT p3) p2)), acceptance={0} source=5 dest: 4}, { cond=(OR (AND (NOT p1) (NOT p0) p5) (AND p5 (NOT p3) (NOT p2))), acceptance={1} source=5 dest: 5}, { cond=(OR (AND (NOT p1) p0 p5 p3) (AND (NOT p1) p0 p5 p2)), acceptance={1} source=5 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1} source=6 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p5)), acceptance={0, 1} source=7 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p5)), acceptance={0, 1} source=7 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p5), acceptance={1} source=7 dest: 5}, { cond=(AND (NOT p1) p0 p5), acceptance={1} source=7 dest: 7}]], initial=0, aps=[p1:(AND (GEQ s38 1) (GEQ s95 1)), p0:(GEQ s58 1), p5:(OR (AND (LT s70 1) (LT s58 1)) (AND (LT s35 1) (LT s70 1) (LT s58 1))), p3:(AND (LT s35 1) (LT s70 1) (LT s58 1)), p2:(AND (LT s70 1) (LT s58 1)), p4:(OR (LT s4 1) (LT s75 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-004-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-00 finished in 1003 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0))||(p1 U p2)))], workingDir=/home/mcc/execution]
Support contains 3 out of 210 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 210/210 places, 197/197 transitions.
Applied a total of 0 rules in 6 ms. Remains 210 /210 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 210 cols
[2021-05-09 18:34:16] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-09 18:34:16] [INFO ] Implicit Places using invariants in 76 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 79 ms to find 1 implicit places.
// Phase 1: matrix 197 rows 209 cols
[2021-05-09 18:34:16] [INFO ] Computed 19 place invariants in 3 ms
[2021-05-09 18:34:16] [INFO ] Dead Transitions using invariants and state equation in 95 ms returned []
Starting structural reductions, iteration 1 : 209/210 places, 197/197 transitions.
Applied a total of 0 rules in 5 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 209 cols
[2021-05-09 18:34:16] [INFO ] Computed 19 place invariants in 3 ms
[2021-05-09 18:34:16] [INFO ] Dead Transitions using invariants and state equation in 85 ms returned []
Finished structural reductions, in 2 iterations. Remains : 209/210 places, 197/197 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-004-01 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(GEQ s87 1), p1:(GEQ s138 1), p0:(GEQ s109 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-004-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-01 finished in 399 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 210 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 210/210 places, 197/197 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 209 transition count 152
Reduce places removed 44 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 46 rules applied. Total rules applied 90 place count 165 transition count 150
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 92 place count 163 transition count 150
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 92 place count 163 transition count 142
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 108 place count 155 transition count 142
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 184 place count 117 transition count 104
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 194 place count 112 transition count 104
Applied a total of 194 rules in 20 ms. Remains 112 /210 variables (removed 98) and now considering 104/197 (removed 93) transitions.
// Phase 1: matrix 104 rows 112 cols
[2021-05-09 18:34:16] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-09 18:34:16] [INFO ] Implicit Places using invariants in 62 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
[2021-05-09 18:34:16] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 104 rows 111 cols
[2021-05-09 18:34:16] [INFO ] Computed 19 place invariants in 3 ms
[2021-05-09 18:34:16] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Starting structural reductions, iteration 1 : 111/210 places, 104/197 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 109 transition count 102
Applied a total of 4 rules in 8 ms. Remains 109 /111 variables (removed 2) and now considering 102/104 (removed 2) transitions.
// Phase 1: matrix 102 rows 109 cols
[2021-05-09 18:34:16] [INFO ] Computed 19 place invariants in 3 ms
[2021-05-09 18:34:16] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 102 rows 109 cols
[2021-05-09 18:34:16] [INFO ] Computed 19 place invariants in 2 ms
[2021-05-09 18:34:16] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-09 18:34:16] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 109/210 places, 102/197 transitions.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-004-03 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 (GEQ s0 1) (GEQ s108 1)), p0:(LT s98 1)], 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 10267 reset in 317 ms.
Product exploration explored 100000 steps with 10255 reset in 173 ms.
Graph (complete) has 327 edges and 109 vertex of which 108 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 10246 reset in 131 ms.
Product exploration explored 100000 steps with 10230 reset in 219 ms.
[2021-05-09 18:34:18] [INFO ] Flatten gal took : 19 ms
[2021-05-09 18:34:18] [INFO ] Flatten gal took : 8 ms
[2021-05-09 18:34:18] [INFO ] Time to serialize gal into /tmp/LTL5852256014104017796.gal : 21 ms
[2021-05-09 18:34:18] [INFO ] Time to serialize properties into /tmp/LTL9500830966047794286.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/LTL5852256014104017796.gal, -t, CGAL, -LTL, /tmp/LTL9500830966047794286.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/LTL5852256014104017796.gal -t CGAL -LTL /tmp/LTL9500830966047794286.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F(("(p86<1)")||(G("((p10>=1)&&(p99>=1))"))))))
Formula 0 simplified : !GF("(p86<1)" | G"((p10>=1)&&(p99>=1))")
Detected timeout of ITS tools.
[2021-05-09 18:34:33] [INFO ] Flatten gal took : 8 ms
[2021-05-09 18:34:33] [INFO ] Applying decomposition
[2021-05-09 18:34:33] [INFO ] Flatten gal took : 7 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/graph12665959083057351358.txt, -o, /tmp/graph12665959083057351358.bin, -w, /tmp/graph12665959083057351358.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/graph12665959083057351358.bin, -l, -1, -v, -w, /tmp/graph12665959083057351358.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 18:34:33] [INFO ] Decomposing Gal with order
[2021-05-09 18:34:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 18:34:33] [INFO ] Removed a total of 57 redundant transitions.
[2021-05-09 18:34:33] [INFO ] Flatten gal took : 49 ms
[2021-05-09 18:34:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 6 ms.
[2021-05-09 18:34:33] [INFO ] Time to serialize gal into /tmp/LTL12404312700634234705.gal : 12 ms
[2021-05-09 18:34:33] [INFO ] Time to serialize properties into /tmp/LTL8284578585918938853.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/LTL12404312700634234705.gal, -t, CGAL, -LTL, /tmp/LTL8284578585918938853.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/LTL12404312700634234705.gal -t CGAL -LTL /tmp/LTL8284578585918938853.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F(("(i5.u31.p86<1)")||(G("((i4.i0.u19.p10>=1)&&(i4.i0.u34.p99>=1))"))))))
Formula 0 simplified : !GF("(i5.u31.p86<1)" | G"((i4.i0.u19.p10>=1)&&(i4.i0.u34.p99>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14011525244217042448
[2021-05-09 18:34:48] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14011525244217042448
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/ltsmin14011525244217042448]
Compilation finished in 501 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin14011525244217042448]
Link finished in 37 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, --when, --ltl, [](<>(((LTLAPp0==true)||[]((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin14011525244217042448]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-004-03 finished in 46873 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((X(X((F(G(p0))&&F(!p0)))) U G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 210 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 210/210 places, 197/197 transitions.
Applied a total of 0 rules in 2 ms. Remains 210 /210 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 210 cols
[2021-05-09 18:35:03] [INFO ] Computed 20 place invariants in 3 ms
[2021-05-09 18:35:03] [INFO ] Implicit Places using invariants in 63 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
// Phase 1: matrix 197 rows 209 cols
[2021-05-09 18:35:03] [INFO ] Computed 19 place invariants in 3 ms
[2021-05-09 18:35:03] [INFO ] Dead Transitions using invariants and state equation in 83 ms returned []
Starting structural reductions, iteration 1 : 209/210 places, 197/197 transitions.
Applied a total of 0 rules in 5 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 209 cols
[2021-05-09 18:35:03] [INFO ] Computed 19 place invariants in 4 ms
[2021-05-09 18:35:03] [INFO ] Dead Transitions using invariants and state equation in 84 ms returned []
Finished structural reductions, in 2 iterations. Remains : 209/210 places, 197/197 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), true, p0, (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-004-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}, { cond=p1, acceptance={} source=4 dest: 8}], [{ cond=p0, acceptance={} source=5 dest: 6}, { cond=true, acceptance={} source=5 dest: 7}], [{ cond=p0, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=7 dest: 7}, { cond=p0, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 6}, { cond=(NOT p1), acceptance={} source=8 dest: 7}]], initial=0, aps=[p1:(AND (GEQ s10 1) (GEQ s112 1)), p0:(GEQ s129 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-004-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-04 finished in 467 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 210 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 210/210 places, 197/197 transitions.
Applied a total of 0 rules in 2 ms. Remains 210 /210 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 210 cols
[2021-05-09 18:35:03] [INFO ] Computed 20 place invariants in 3 ms
[2021-05-09 18:35:03] [INFO ] Implicit Places using invariants in 64 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
// Phase 1: matrix 197 rows 209 cols
[2021-05-09 18:35:03] [INFO ] Computed 19 place invariants in 3 ms
[2021-05-09 18:35:04] [INFO ] Dead Transitions using invariants and state equation in 86 ms returned []
Starting structural reductions, iteration 1 : 209/210 places, 197/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 209 cols
[2021-05-09 18:35:04] [INFO ] Computed 19 place invariants in 3 ms
[2021-05-09 18:35:04] [INFO ] Dead Transitions using invariants and state equation in 87 ms returned []
Finished structural reductions, in 2 iterations. Remains : 209/210 places, 197/197 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s83 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 24 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-004-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-05 finished in 305 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||X(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 210 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 210/210 places, 197/197 transitions.
Applied a total of 0 rules in 4 ms. Remains 210 /210 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 210 cols
[2021-05-09 18:35:04] [INFO ] Computed 20 place invariants in 3 ms
[2021-05-09 18:35:04] [INFO ] Implicit Places using invariants in 62 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
// Phase 1: matrix 197 rows 209 cols
[2021-05-09 18:35:04] [INFO ] Computed 19 place invariants in 3 ms
[2021-05-09 18:35:04] [INFO ] Dead Transitions using invariants and state equation in 86 ms returned []
Starting structural reductions, iteration 1 : 209/210 places, 197/197 transitions.
Applied a total of 0 rules in 2 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 209 cols
[2021-05-09 18:35:04] [INFO ] Computed 19 place invariants in 3 ms
[2021-05-09 18:35:04] [INFO ] Dead Transitions using invariants and state equation in 85 ms returned []
Finished structural reductions, in 2 iterations. Remains : 209/210 places, 197/197 transitions.
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-004-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s178 1) (GEQ s197 1)), p1:(AND (GEQ s54 1) (GEQ s68 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 24 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-004-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-06 finished in 300 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&((!p0||X(G(p1))) U p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 210 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 210/210 places, 197/197 transitions.
Applied a total of 0 rules in 2 ms. Remains 210 /210 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 210 cols
[2021-05-09 18:35:04] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-09 18:35:04] [INFO ] Implicit Places using invariants in 71 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
// Phase 1: matrix 197 rows 209 cols
[2021-05-09 18:35:04] [INFO ] Computed 19 place invariants in 3 ms
[2021-05-09 18:35:04] [INFO ] Dead Transitions using invariants and state equation in 88 ms returned []
Starting structural reductions, iteration 1 : 209/210 places, 197/197 transitions.
Applied a total of 0 rules in 2 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 209 cols
[2021-05-09 18:35:04] [INFO ] Computed 19 place invariants in 2 ms
[2021-05-09 18:35:04] [INFO ] Dead Transitions using invariants and state equation in 84 ms returned []
Finished structural reductions, in 2 iterations. Remains : 209/210 places, 197/197 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2)), true]
Running random walk in product with property : DoubleExponent-PT-004-08 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND p2 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(OR (LT s64 1) (LT s192 1)), p0:(GEQ s31 1), p2:(GEQ s186 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-004-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-08 finished in 359 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p0&&G(p1)) U ((G(p1)&&p2)||G(p3)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 210 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 210/210 places, 197/197 transitions.
Applied a total of 0 rules in 2 ms. Remains 210 /210 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 210 cols
[2021-05-09 18:35:04] [INFO ] Computed 20 place invariants in 4 ms
[2021-05-09 18:35:04] [INFO ] Implicit Places using invariants in 60 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
// Phase 1: matrix 197 rows 209 cols
[2021-05-09 18:35:04] [INFO ] Computed 19 place invariants in 2 ms
[2021-05-09 18:35:05] [INFO ] Dead Transitions using invariants and state equation in 107 ms returned []
Starting structural reductions, iteration 1 : 209/210 places, 197/197 transitions.
Applied a total of 0 rules in 2 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 209 cols
[2021-05-09 18:35:05] [INFO ] Computed 19 place invariants in 2 ms
[2021-05-09 18:35:05] [INFO ] Dead Transitions using invariants and state equation in 84 ms returned []
Finished structural reductions, in 2 iterations. Remains : 209/210 places, 197/197 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), true, (NOT p1), (NOT p3), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : DoubleExponent-PT-004-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1 (NOT p3) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 p3 p0), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p3) (NOT p0)) (AND (NOT p1) (NOT p3))), acceptance={} source=1 dest: 2}, { cond=(OR (AND p2 p1 (NOT p3)) (AND p1 (NOT p3) p0)), acceptance={} source=1 dest: 3}, { cond=(OR (AND (NOT p2) p3 (NOT p0)) (AND (NOT p1) p3)), acceptance={} source=1 dest: 4}, { cond=(AND p2 p1 p3), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 2}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p3), acceptance={} source=5 dest: 4}, { cond=(AND p1 p3), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (LT s18 1) (OR (LT s23 1) (LT s155 1))), p1:(AND (GEQ s73 1) (GEQ s91 1)), p3:(AND (LT s18 1) (GEQ s73 1) (GEQ s91 1)), p0:(LT s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-004-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-11 finished in 465 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 210 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 210/210 places, 197/197 transitions.
Applied a total of 0 rules in 2 ms. Remains 210 /210 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 210 cols
[2021-05-09 18:35:05] [INFO ] Computed 20 place invariants in 3 ms
[2021-05-09 18:35:05] [INFO ] Implicit Places using invariants in 62 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
// Phase 1: matrix 197 rows 209 cols
[2021-05-09 18:35:05] [INFO ] Computed 19 place invariants in 3 ms
[2021-05-09 18:35:05] [INFO ] Dead Transitions using invariants and state equation in 95 ms returned []
Starting structural reductions, iteration 1 : 209/210 places, 197/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 209 cols
[2021-05-09 18:35:05] [INFO ] Computed 19 place invariants in 3 ms
[2021-05-09 18:35:05] [INFO ] Dead Transitions using invariants and state equation in 77 ms returned []
Finished structural reductions, in 2 iterations. Remains : 209/210 places, 197/197 transitions.
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-12 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:(GEQ s92 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 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-004-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-12 finished in 299 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(((p1||X(X(p1)))&&p0))&&X(G(p2)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 210 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 210/210 places, 197/197 transitions.
Applied a total of 0 rules in 2 ms. Remains 210 /210 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 210 cols
[2021-05-09 18:35:05] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-09 18:35:05] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 197 rows 210 cols
[2021-05-09 18:35:05] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-09 18:35:05] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
// Phase 1: matrix 197 rows 210 cols
[2021-05-09 18:35:05] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-09 18:35:06] [INFO ] Dead Transitions using invariants and state equation in 76 ms returned []
Finished structural reductions, in 1 iterations. Remains : 210/210 places, 197/197 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p2), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p2)), true]
Running random walk in product with property : DoubleExponent-PT-004-13 automaton TGBA [mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 7}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=(AND p1 p2), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=3 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=3 dest: 6}, { cond=(NOT p2), acceptance={0} source=3 dest: 7}], [{ cond=(AND p1 p2), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 7}], [{ cond=(AND p0 p1 p2), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=5 dest: 6}, { cond=(NOT p2), acceptance={0} source=5 dest: 7}], [{ cond=(AND p0 p1 p2), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=6 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=6 dest: 4}, { cond=(NOT p2), acceptance={0} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=2, aps=[p2:(AND (GEQ s84 1) (GEQ s91 1)), p0:(AND (GEQ s163 1) (GEQ s203 1)), p1:(AND (GEQ s125 1) (GEQ s134 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-004-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-13 finished in 622 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||(X(p1) U ((X(p1)&&G(!p0))||X(G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 210 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 210/210 places, 197/197 transitions.
Applied a total of 0 rules in 2 ms. Remains 210 /210 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 210 cols
[2021-05-09 18:35:06] [INFO ] Computed 20 place invariants in 3 ms
[2021-05-09 18:35:06] [INFO ] Implicit Places using invariants in 57 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 57 ms to find 1 implicit places.
// Phase 1: matrix 197 rows 209 cols
[2021-05-09 18:35:06] [INFO ] Computed 19 place invariants in 3 ms
[2021-05-09 18:35:06] [INFO ] Dead Transitions using invariants and state equation in 97 ms returned []
Starting structural reductions, iteration 1 : 209/210 places, 197/197 transitions.
Applied a total of 0 rules in 2 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 209 cols
[2021-05-09 18:35:06] [INFO ] Computed 19 place invariants in 3 ms
[2021-05-09 18:35:06] [INFO ] Dead Transitions using invariants and state equation in 86 ms returned []
Finished structural reductions, in 2 iterations. Remains : 209/210 places, 197/197 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Running random walk in product with property : DoubleExponent-PT-004-14 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 2} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1, 2} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={2} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1, 2} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1, 2} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={2} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s110 1) (GEQ s123 1)), p1:(LT s151 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 6280 reset in 169 ms.
Product exploration explored 100000 steps with 6167 reset in 200 ms.
Graph (complete) has 349 edges and 209 vertex of which 207 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Product exploration explored 100000 steps with 6234 reset in 161 ms.
Product exploration explored 100000 steps with 6294 reset in 280 ms.
[2021-05-09 18:35:07] [INFO ] Flatten gal took : 10 ms
[2021-05-09 18:35:07] [INFO ] Flatten gal took : 9 ms
[2021-05-09 18:35:07] [INFO ] Time to serialize gal into /tmp/LTL11550513705549565750.gal : 2 ms
[2021-05-09 18:35:07] [INFO ] Time to serialize properties into /tmp/LTL9034484174592654943.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/LTL11550513705549565750.gal, -t, CGAL, -LTL, /tmp/LTL9034484174592654943.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/LTL11550513705549565750.gal -t CGAL -LTL /tmp/LTL9034484174592654943.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G("((p201>=1)&&(p213>=1))"))||((X("(p47<1)"))U(((X("(p47<1)"))&&(G("((p201<1)||(p213<1))")))||(X(G("(p47<1)"))))))))
Formula 0 simplified : !F(G"((p201>=1)&&(p213>=1))" | (X"(p47<1)" U ((X"(p47<1)" & G"((p201<1)||(p213<1))") | XG"(p47<1)")))
Detected timeout of ITS tools.
[2021-05-09 18:35:22] [INFO ] Flatten gal took : 9 ms
[2021-05-09 18:35:22] [INFO ] Applying decomposition
[2021-05-09 18:35:22] [INFO ] Flatten gal took : 9 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/graph12984211227273880481.txt, -o, /tmp/graph12984211227273880481.bin, -w, /tmp/graph12984211227273880481.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/graph12984211227273880481.bin, -l, -1, -v, -w, /tmp/graph12984211227273880481.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 18:35:22] [INFO ] Decomposing Gal with order
[2021-05-09 18:35:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 18:35:22] [INFO ] Removed a total of 54 redundant transitions.
[2021-05-09 18:35:22] [INFO ] Flatten gal took : 34 ms
[2021-05-09 18:35:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2021-05-09 18:35:22] [INFO ] Time to serialize gal into /tmp/LTL9928823179989787774.gal : 5 ms
[2021-05-09 18:35:22] [INFO ] Time to serialize properties into /tmp/LTL14330049057708134212.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/LTL9928823179989787774.gal, -t, CGAL, -LTL, /tmp/LTL14330049057708134212.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/LTL9928823179989787774.gal -t CGAL -LTL /tmp/LTL14330049057708134212.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((G("((i3.i3.u44.p201>=1)&&(i3.i3.u44.p213>=1))"))||((X("(i6.i0.u60.p47<1)"))U(((X("(i6.i0.u60.p47<1)"))&&(G("((i3.i3.u44.p201<1)||(i3.i3.u44.p213<1))")))||(X(G("(i6.i0.u60.p47<1)"))))))))
Formula 0 simplified : !F(G"((i3.i3.u44.p201>=1)&&(i3.i3.u44.p213>=1))" | (X"(i6.i0.u60.p47<1)" U ((X"(i6.i0.u60.p47<1)" & G"((i3.i3.u44.p201<1)||(i3.i3.u44.p213<1))") | XG"(i6.i0.u60.p47<1)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16259041077142001537
[2021-05-09 18:35:37] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16259041077142001537
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/ltsmin16259041077142001537]
Compilation finished in 742 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin16259041077142001537]
Link finished in 32 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, --when, --ltl, <>(([]((LTLAPp0==true))||(X((LTLAPp1==true)) U ((X((LTLAPp1==true))&&[](!(LTLAPp0==true)))||X([]((LTLAPp1==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin16259041077142001537]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-004-14 finished in 46604 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 210 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 210/210 places, 197/197 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 210 transition count 157
Reduce places removed 40 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 44 rules applied. Total rules applied 84 place count 170 transition count 153
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 88 place count 166 transition count 153
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 88 place count 166 transition count 143
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 108 place count 156 transition count 143
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 182 place count 119 transition count 106
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 194 place count 113 transition count 106
Applied a total of 194 rules in 18 ms. Remains 113 /210 variables (removed 97) and now considering 106/197 (removed 91) transitions.
// Phase 1: matrix 106 rows 113 cols
[2021-05-09 18:35:52] [INFO ] Computed 20 place invariants in 1 ms
[2021-05-09 18:35:52] [INFO ] Implicit Places using invariants in 59 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
[2021-05-09 18:35:52] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 106 rows 112 cols
[2021-05-09 18:35:52] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-09 18:35:52] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Starting structural reductions, iteration 1 : 112/210 places, 106/197 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 110 transition count 104
Applied a total of 4 rules in 5 ms. Remains 110 /112 variables (removed 2) and now considering 104/106 (removed 2) transitions.
// Phase 1: matrix 104 rows 110 cols
[2021-05-09 18:35:52] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-09 18:35:53] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 104 rows 110 cols
[2021-05-09 18:35:53] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-09 18:35:53] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-09 18:35:53] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 110/210 places, 104/197 transitions.
Stuttering acceptance computed with spot in 67 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-004-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s7 1) (LT s15 1)), p1:(OR (LT s28 1) (LT s97 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 9744 reset in 103 ms.
Product exploration explored 100000 steps with 9781 reset in 110 ms.
Graph (complete) has 326 edges and 110 vertex of which 109 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 62 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 9764 reset in 101 ms.
Product exploration explored 100000 steps with 9707 reset in 111 ms.
[2021-05-09 18:35:53] [INFO ] Flatten gal took : 6 ms
[2021-05-09 18:35:53] [INFO ] Flatten gal took : 6 ms
[2021-05-09 18:35:53] [INFO ] Time to serialize gal into /tmp/LTL12157907022401612605.gal : 14 ms
[2021-05-09 18:35:53] [INFO ] Time to serialize properties into /tmp/LTL5969125823812931932.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/LTL12157907022401612605.gal, -t, CGAL, -LTL, /tmp/LTL5969125823812931932.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/LTL12157907022401612605.gal -t CGAL -LTL /tmp/LTL5969125823812931932.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((F("((p109<1)||(p116<1))"))&&(F(G("((p14<1)||(p8<1))"))))))
Formula 0 simplified : !G(F"((p109<1)||(p116<1))" & FG"((p14<1)||(p8<1))")
Detected timeout of ITS tools.
[2021-05-09 18:36:08] [INFO ] Flatten gal took : 5 ms
[2021-05-09 18:36:08] [INFO ] Applying decomposition
[2021-05-09 18:36:08] [INFO ] Flatten gal took : 5 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/graph2510158100177909902.txt, -o, /tmp/graph2510158100177909902.bin, -w, /tmp/graph2510158100177909902.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/graph2510158100177909902.bin, -l, -1, -v, -w, /tmp/graph2510158100177909902.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 18:36:08] [INFO ] Decomposing Gal with order
[2021-05-09 18:36:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 18:36:08] [INFO ] Removed a total of 66 redundant transitions.
[2021-05-09 18:36:08] [INFO ] Flatten gal took : 21 ms
[2021-05-09 18:36:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2021-05-09 18:36:08] [INFO ] Time to serialize gal into /tmp/LTL10902909496900561214.gal : 2 ms
[2021-05-09 18:36:08] [INFO ] Time to serialize properties into /tmp/LTL811819513418940507.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/LTL10902909496900561214.gal, -t, CGAL, -LTL, /tmp/LTL811819513418940507.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/LTL10902909496900561214.gal -t CGAL -LTL /tmp/LTL811819513418940507.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G((F("((i1.u6.p109<1)||(i1.u4.p116<1))"))&&(F(G("((i3.i1.u29.p14<1)||(i3.i1.u33.p8<1))"))))))
Formula 0 simplified : !G(F"((i1.u6.p109<1)||(i1.u4.p116<1))" & FG"((i3.i1.u29.p14<1)||(i3.i1.u33.p8<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17511829415834726914
[2021-05-09 18:36:23] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17511829415834726914
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/ltsmin17511829415834726914]
Compilation finished in 439 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin17511829415834726914]
Link finished in 39 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, --when, --ltl, []((<>((LTLAPp0==true))&&<>([]((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin17511829415834726914]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-004-15 finished in 46156 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6506869633847048934
[2021-05-09 18:36:38] [INFO ] Computing symmetric may disable matrix : 197 transitions.
[2021-05-09 18:36:38] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 18:36:38] [INFO ] Computing symmetric may enable matrix : 197 transitions.
[2021-05-09 18:36:38] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 18:36:38] [INFO ] Applying decomposition
[2021-05-09 18:36:39] [INFO ] Flatten gal took : 7 ms
[2021-05-09 18:36:39] [INFO ] Computing Do-Not-Accords matrix : 197 transitions.
[2021-05-09 18:36:39] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 18:36:39] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6506869633847048934
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/ltsmin6506869633847048934]
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/graph11156224117174750093.txt, -o, /tmp/graph11156224117174750093.bin, -w, /tmp/graph11156224117174750093.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/graph11156224117174750093.bin, -l, -1, -v, -w, /tmp/graph11156224117174750093.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 18:36:39] [INFO ] Decomposing Gal with order
[2021-05-09 18:36:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 18:36:39] [INFO ] Removed a total of 52 redundant transitions.
[2021-05-09 18:36:39] [INFO ] Flatten gal took : 15 ms
[2021-05-09 18:36:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-09 18:36:39] [INFO ] Time to serialize gal into /tmp/LTLFireability8389202049138468371.gal : 3 ms
[2021-05-09 18:36:39] [INFO ] Time to serialize properties into /tmp/LTLFireability14634568000476487094.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/LTLFireability8389202049138468371.gal, -t, CGAL, -LTL, /tmp/LTLFireability14634568000476487094.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/LTLFireability8389202049138468371.gal -t CGAL -LTL /tmp/LTLFireability14634568000476487094.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !((G(F(("(i7.i1.u83.p86<1)")||(G("((i1.i0.u56.p10>=1)&&(i1.i0.u3.p99>=1))"))))))
Formula 0 simplified : !GF("(i7.i1.u83.p86<1)" | G"((i1.i0.u56.p10>=1)&&(i1.i0.u3.p99>=1))")
Compilation finished in 832 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin6506869633847048934]
Link finished in 34 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))))), --buchi-type=spotba], workingDir=/tmp/ltsmin6506869633847048934]
WARNING : LTSmin timed out (>276 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))))), --buchi-type=spotba], workingDir=/tmp/ltsmin6506869633847048934]
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, <>(([]((LTLAPp2==true))||(X((LTLAPp3==true)) U ((X((LTLAPp3==true))&&[](!(LTLAPp2==true)))||X([]((LTLAPp3==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin6506869633847048934]
WARNING : LTSmin timed out (>276 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, --when, --ltl, <>(([]((LTLAPp2==true))||(X((LTLAPp3==true)) U ((X((LTLAPp3==true))&&[](!(LTLAPp2==true)))||X([]((LTLAPp3==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin6506869633847048934]
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, []((<>((LTLAPp4==true))&&<>([]((LTLAPp5==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin6506869633847048934]
WARNING : LTSmin timed out (>276 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, []((<>((LTLAPp4==true))&&<>([]((LTLAPp5==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin6506869633847048934]
Retrying LTSmin with larger timeout 2208 s
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))))), --buchi-type=spotba], workingDir=/tmp/ltsmin6506869633847048934]
Detected timeout of ITS tools.
[2021-05-09 18:57:27] [INFO ] Flatten gal took : 7 ms
[2021-05-09 18:57:27] [INFO ] Time to serialize gal into /tmp/LTLFireability14649480320346046539.gal : 1 ms
[2021-05-09 18:57:27] [INFO ] Time to serialize properties into /tmp/LTLFireability3860595429901778852.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/LTLFireability14649480320346046539.gal, -t, CGAL, -LTL, /tmp/LTLFireability3860595429901778852.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/LTLFireability14649480320346046539.gal -t CGAL -LTL /tmp/LTLFireability3860595429901778852.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 3 LTL properties
Checking formula 0 : !((G(F(("(p86<1)")||(G("((p10>=1)&&(p99>=1))"))))))
Formula 0 simplified : !GF("(p86<1)" | G"((p10>=1)&&(p99>=1))")
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.012: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.016: Initializing POR dependencies: labels 203, guards 197
pins2lts-mc-linux64( 6/ 8), 0.080: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.070: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.128: LTL layer: formula: [](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))
pins2lts-mc-linux64( 2/ 8), 0.128: "[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.128: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.353: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.384: There are 204 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.384: State length is 211, there are 203 groups
pins2lts-mc-linux64( 0/ 8), 0.384: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.384: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.384: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.384: Visible groups: 12 / 203, labels: 2 / 204
pins2lts-mc-linux64( 0/ 8), 0.384: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.384: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.442: [Blue] ~97 levels ~960 states ~1064 transitions
pins2lts-mc-linux64( 3/ 8), 0.474: [Blue] ~184 levels ~1920 states ~2136 transitions
pins2lts-mc-linux64( 3/ 8), 0.501: [Blue] ~279 levels ~3840 states ~4304 transitions
pins2lts-mc-linux64( 2/ 8), 0.517: [Blue] ~471 levels ~7680 states ~8584 transitions
pins2lts-mc-linux64( 2/ 8), 0.533: [Blue] ~710 levels ~15360 states ~17176 transitions
pins2lts-mc-linux64( 2/ 8), 0.556: [Blue] ~1405 levels ~30720 states ~34280 transitions
pins2lts-mc-linux64( 2/ 8), 0.601: [Blue] ~2565 levels ~61440 states ~68400 transitions
pins2lts-mc-linux64( 2/ 8), 0.693: [Blue] ~4615 levels ~122880 states ~136600 transitions
pins2lts-mc-linux64( 2/ 8), 1.033: [Blue] ~7322 levels ~245760 states ~272824 transitions
pins2lts-mc-linux64( 2/ 8), 1.802: [Blue] ~11084 levels ~491520 states ~545136 transitions
pins2lts-mc-linux64( 2/ 8), 3.304: [Blue] ~14829 levels ~983040 states ~1089352 transitions
pins2lts-mc-linux64( 2/ 8), 6.529: [Blue] ~18782 levels ~1966080 states ~2177328 transitions
pins2lts-mc-linux64( 2/ 8), 13.273: [Blue] ~19085 levels ~3932160 states ~4355184 transitions
pins2lts-mc-linux64( 5/ 8), 27.020: [Blue] ~22193 levels ~7864320 states ~8716544 transitions
pins2lts-mc-linux64( 5/ 8), 51.301: [Blue] ~22872 levels ~15728640 states ~17417488 transitions
pins2lts-mc-linux64( 5/ 8), 104.378: [Blue] ~23916 levels ~31457280 states ~34821280 transitions
pins2lts-mc-linux64( 5/ 8), 212.907: [Blue] ~25050 levels ~62914560 states ~69626928 transitions
pins2lts-mc-linux64( 5/ 8), 430.683: [Blue] ~26791 levels ~125829120 states ~139239808 transitions
pins2lts-mc-linux64( 4/ 8), 499.491: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 499.505:
pins2lts-mc-linux64( 0/ 8), 499.507: Explored 141831467 states 157135576 transitions, fanout: 1.108
pins2lts-mc-linux64( 0/ 8), 499.507: Total exploration time 499.120 sec (499.090 sec minimum, 499.100 sec on average)
pins2lts-mc-linux64( 0/ 8), 499.507: States per second: 284163, Transitions per second: 314825
pins2lts-mc-linux64( 0/ 8), 499.507:
pins2lts-mc-linux64( 0/ 8), 499.507: State space has 134216997 states, 287512 are accepting
pins2lts-mc-linux64( 0/ 8), 499.507: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 499.507: blue states: 141831467 (105.67%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 499.507: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 499.507: all-red states: 287512 (0.21%), bogus 1419 (0.00%)
pins2lts-mc-linux64( 0/ 8), 499.507:
pins2lts-mc-linux64( 0/ 8), 499.507: Total memory used for local state coloring: 11.9MB
pins2lts-mc-linux64( 0/ 8), 499.507:
pins2lts-mc-linux64( 0/ 8), 499.507: Queue width: 8B, total height: 778037, memory: 5.94MB
pins2lts-mc-linux64( 0/ 8), 499.507: Tree memory: 1081.6MB, 8.4 B/state, compr.: 1.0%
pins2lts-mc-linux64( 0/ 8), 499.507: Tree fill ratio (roots/leafs): 99.0%/22.0%
pins2lts-mc-linux64( 0/ 8), 499.507: Stored 265 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 499.507: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 499.507: Est. total memory use: 1087.5MB (~1029.9MB 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, -p, --pins-guards, --when, --ltl, [](<>(((LTLAPp0==true)||[]((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin6506869633847048934]
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, -p, --pins-guards, --when, --ltl, [](<>(((LTLAPp0==true)||[]((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin6506869633847048934]
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:102)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-09 19:18:15] [INFO ] Flatten gal took : 7 ms
[2021-05-09 19:18:15] [INFO ] Input system was already deterministic with 197 transitions.
[2021-05-09 19:18:15] [INFO ] Transformed 210 places.
[2021-05-09 19:18:15] [INFO ] Transformed 197 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-09 19:18:15] [INFO ] Time to serialize gal into /tmp/LTLFireability14360805888157134487.gal : 1 ms
[2021-05-09 19:18:15] [INFO ] Time to serialize properties into /tmp/LTLFireability4589579765963063439.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/LTLFireability14360805888157134487.gal, -t, CGAL, -LTL, /tmp/LTLFireability4589579765963063439.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/LTLFireability14360805888157134487.gal -t CGAL -LTL /tmp/LTLFireability4589579765963063439.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(F(("(p86<1)")||(G("((p10>=1)&&(p99>=1))"))))))
Formula 0 simplified : !GF("(p86<1)" | G"((p10>=1)&&(p99>=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="DoubleExponent-PT-004"
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 DoubleExponent-PT-004, 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-162048875400421"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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