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.r140-tall-162089128100548.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 PermAdmissibility-PT-50, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089128100548
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 22K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 153K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 426K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.1M May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.3K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 70K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Mar 27 06:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 27 06:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 26K Mar 25 08:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Mar 25 08:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 484K 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 PermAdmissibility-PT-50-00
FORMULA_NAME PermAdmissibility-PT-50-01
FORMULA_NAME PermAdmissibility-PT-50-02
FORMULA_NAME PermAdmissibility-PT-50-03
FORMULA_NAME PermAdmissibility-PT-50-04
FORMULA_NAME PermAdmissibility-PT-50-05
FORMULA_NAME PermAdmissibility-PT-50-06
FORMULA_NAME PermAdmissibility-PT-50-07
FORMULA_NAME PermAdmissibility-PT-50-08
FORMULA_NAME PermAdmissibility-PT-50-09
FORMULA_NAME PermAdmissibility-PT-50-10
FORMULA_NAME PermAdmissibility-PT-50-11
FORMULA_NAME PermAdmissibility-PT-50-12
FORMULA_NAME PermAdmissibility-PT-50-13
FORMULA_NAME PermAdmissibility-PT-50-14
FORMULA_NAME PermAdmissibility-PT-50-15

=== Now, execution of the tool begins

BK_START 1621004947636

Running Version 0
[2021-05-14 15:09:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-14 15:09:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 15:09:09] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2021-05-14 15:09:09] [INFO ] Transformed 168 places.
[2021-05-14 15:09:09] [INFO ] Transformed 592 transitions.
[2021-05-14 15:09:09] [INFO ] Parsed PT model containing 168 places and 592 transitions in 127 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-14 15:09:09] [INFO ] Initial state test concluded for 2 properties.
FORMULA PermAdmissibility-PT-50-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-50-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-50-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 83 out of 168 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 130 transition count 592
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 43 place count 125 transition count 512
Iterating global reduction 1 with 5 rules applied. Total rules applied 48 place count 125 transition count 512
Applied a total of 48 rules in 30 ms. Remains 125 /168 variables (removed 43) and now considering 512/592 (removed 80) transitions.
// Phase 1: matrix 512 rows 125 cols
[2021-05-14 15:09:09] [INFO ] Computed 19 place invariants in 29 ms
[2021-05-14 15:09:09] [INFO ] Implicit Places using invariants in 231 ms returned []
// Phase 1: matrix 512 rows 125 cols
[2021-05-14 15:09:09] [INFO ] Computed 19 place invariants in 9 ms
[2021-05-14 15:09:09] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
// Phase 1: matrix 512 rows 125 cols
[2021-05-14 15:09:09] [INFO ] Computed 19 place invariants in 5 ms
[2021-05-14 15:09:10] [INFO ] Dead Transitions using invariants and state equation in 229 ms returned []
Finished structural reductions, in 1 iterations. Remains : 125/168 places, 512/592 transitions.
[2021-05-14 15:09:10] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-14 15:09:10] [INFO ] Flatten gal took : 86 ms
FORMULA PermAdmissibility-PT-50-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 15:09:10] [INFO ] Flatten gal took : 53 ms
[2021-05-14 15:09:10] [INFO ] Input system was already deterministic with 512 transitions.
Finished random walk after 8073 steps, including 9 resets, run visited all 22 properties in 17 ms. (steps per millisecond=474 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 8 out of 125 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 125/125 places, 512/512 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 99 transition count 512
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 47 place count 78 transition count 344
Iterating global reduction 1 with 21 rules applied. Total rules applied 68 place count 78 transition count 344
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 87 place count 59 transition count 138
Iterating global reduction 1 with 19 rules applied. Total rules applied 106 place count 59 transition count 138
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 58 transition count 130
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 58 transition count 130
Applied a total of 108 rules in 15 ms. Remains 58 /125 variables (removed 67) and now considering 130/512 (removed 382) transitions.
// Phase 1: matrix 130 rows 58 cols
[2021-05-14 15:09:10] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-14 15:09:10] [INFO ] Implicit Places using invariants in 51 ms returned [0, 5, 18, 25]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 56 ms to find 4 implicit places.
// Phase 1: matrix 130 rows 54 cols
[2021-05-14 15:09:10] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 15:09:10] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Starting structural reductions, iteration 1 : 54/125 places, 130/512 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 130/130 (removed 0) transitions.
// Phase 1: matrix 130 rows 54 cols
[2021-05-14 15:09:10] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 15:09:10] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 2 iterations. Remains : 54/125 places, 130/512 transitions.
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-50-01 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:(LEQ 2 (ADD s30 s31 s32 s33 s39 s40 s41 s42))], 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 1 ms.
FORMULA PermAdmissibility-PT-50-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-50-01 finished in 399 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 125/125 places, 512/512 transitions.
Graph (complete) has 1105 edges and 125 vertex of which 99 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.7 ms
Discarding 26 places :
Also discarding 0 output transitions
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 22 place count 78 transition count 344
Iterating global reduction 0 with 21 rules applied. Total rules applied 43 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 67 place count 54 transition count 108
Iterating global reduction 0 with 24 rules applied. Total rules applied 91 place count 54 transition count 108
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 94 place count 51 transition count 84
Iterating global reduction 0 with 3 rules applied. Total rules applied 97 place count 51 transition count 84
Applied a total of 97 rules in 54 ms. Remains 51 /125 variables (removed 74) and now considering 84/512 (removed 428) transitions.
// Phase 1: matrix 84 rows 51 cols
[2021-05-14 15:09:11] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-14 15:09:11] [INFO ] Implicit Places using invariants in 66 ms returned [0, 5, 18, 25]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 70 ms to find 4 implicit places.
[2021-05-14 15:09:11] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 84 rows 47 cols
[2021-05-14 15:09:11] [INFO ] Computed 12 place invariants in 7 ms
[2021-05-14 15:09:11] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Starting structural reductions, iteration 1 : 47/125 places, 84/512 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 46 transition count 83
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 46 transition count 82
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 45 transition count 82
Applied a total of 4 rules in 8 ms. Remains 45 /47 variables (removed 2) and now considering 82/84 (removed 2) transitions.
// Phase 1: matrix 82 rows 45 cols
[2021-05-14 15:09:11] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 15:09:11] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 82 rows 45 cols
[2021-05-14 15:09:11] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 15:09:11] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 45/125 places, 82/512 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-50-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 s41)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 700 steps with 0 reset in 10 ms.
FORMULA PermAdmissibility-PT-50-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-50-02 finished in 310 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0||X(G(p0))))))], workingDir=/home/mcc/execution]
Support contains 8 out of 125 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 125/125 places, 512/512 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 107 transition count 512
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 32 place count 93 transition count 372
Iterating global reduction 1 with 14 rules applied. Total rules applied 46 place count 93 transition count 372
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 56 place count 83 transition count 262
Iterating global reduction 1 with 10 rules applied. Total rules applied 66 place count 83 transition count 262
Applied a total of 66 rules in 7 ms. Remains 83 /125 variables (removed 42) and now considering 262/512 (removed 250) transitions.
// Phase 1: matrix 262 rows 83 cols
[2021-05-14 15:09:11] [INFO ] Computed 17 place invariants in 2 ms
[2021-05-14 15:09:11] [INFO ] Implicit Places using invariants in 59 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
// Phase 1: matrix 262 rows 82 cols
[2021-05-14 15:09:11] [INFO ] Computed 16 place invariants in 3 ms
[2021-05-14 15:09:11] [INFO ] Dead Transitions using invariants and state equation in 93 ms returned []
Starting structural reductions, iteration 1 : 82/125 places, 262/512 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 82 cols
[2021-05-14 15:09:11] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-14 15:09:11] [INFO ] Dead Transitions using invariants and state equation in 89 ms returned []
Finished structural reductions, in 2 iterations. Remains : 82/125 places, 262/512 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-50-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(GT 2 (ADD s15 s17 s18 s19 s20 s21 s22 s23))], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 87 steps with 0 reset in 2 ms.
FORMULA PermAdmissibility-PT-50-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-50-03 finished in 349 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X((G(p0)||(p0&&F((p1&&X(p2)))))))))], workingDir=/home/mcc/execution]
Support contains 29 out of 125 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 125/125 places, 512/512 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 115 transition count 512
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 17 place count 108 transition count 400
Iterating global reduction 1 with 7 rules applied. Total rules applied 24 place count 108 transition count 400
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 98 transition count 290
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 98 transition count 290
Applied a total of 44 rules in 11 ms. Remains 98 /125 variables (removed 27) and now considering 290/512 (removed 222) transitions.
// Phase 1: matrix 290 rows 98 cols
[2021-05-14 15:09:11] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-14 15:09:11] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 290 rows 98 cols
[2021-05-14 15:09:11] [INFO ] Computed 18 place invariants in 6 ms
[2021-05-14 15:09:11] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
// Phase 1: matrix 290 rows 98 cols
[2021-05-14 15:09:11] [INFO ] Computed 18 place invariants in 3 ms
[2021-05-14 15:09:12] [INFO ] Dead Transitions using invariants and state equation in 103 ms returned []
Finished structural reductions, in 1 iterations. Remains : 98/125 places, 290/512 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (OR (NOT p2) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-50-04 automaton TGBA [mat=[[{ cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={0} source=5 dest: 0}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 1}], [{ cond=true, acceptance={} source=7 dest: 6}], [{ cond=true, acceptance={} source=8 dest: 7}]], initial=8, aps=[p1:(GT s85 (ADD s31 s33 s34 s35 s36 s37 s38 s39)), p2:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7) (ADD s40 s45 s47 s48)), p0:(GT 2 (ADD s11 s12 s13 s14 s15 s16 s17 s18))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 9307 reset in 490 ms.
Product exploration explored 100000 steps with 9295 reset in 428 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 98 transition count 290
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (NOT p1), p2, p0]
Stuttering acceptance computed with spot in 216 ms :[(NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (OR (NOT p2) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9283 reset in 348 ms.
Product exploration explored 100000 steps with 9259 reset in 391 ms.
[2021-05-14 15:09:15] [INFO ] Flatten gal took : 24 ms
[2021-05-14 15:09:15] [INFO ] Flatten gal took : 22 ms
[2021-05-14 15:09:15] [INFO ] Time to serialize gal into /tmp/LTL17559555201164389727.gal : 13 ms
[2021-05-14 15:09:15] [INFO ] Time to serialize properties into /tmp/LTL2909024715161853183.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/LTL17559555201164389727.gal, -t, CGAL, -LTL, /tmp/LTL2909024715161853183.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/LTL17559555201164389727.gal -t CGAL -LTL /tmp/LTL2909024715161853183.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X((G("((((((((out7_1+out7_0)+out7_3)+out7_2)+out7_5)+out7_4)+out7_7)+out7_6)<2)"))||(("((((((((out7_1+out7_0)+out7_3)+out7_2)+out7_5)+out7_4)+out7_7)+out7_6)<2)")&&(F(("(c9>(((((((out1_0+out1_6)+out1_5)+out1_7)+out1_2)+out1_1)+out1_4)+out1_3))")&&(X("((((((((aux16_0+aux16_1)+aux16_2)+aux16_3)+aux16_4)+aux16_5)+aux16_6)+aux16_7)<=(((aux6_0+aux6_5)+aux6_1)+aux6_4))"))))))))))
Formula 0 simplified : !XXX(G"((((((((out7_1+out7_0)+out7_3)+out7_2)+out7_5)+out7_4)+out7_7)+out7_6)<2)" | ("((((((((out7_1+out7_0)+out7_3)+out7_2)+out7_5)+out7_4)+out7_7)+out7_6)<2)" & F("(c9>(((((((out1_0+out1_6)+out1_5)+out1_7)+out1_2)+out1_1)+out1_4)+out1_3))" & X"((((((((aux16_0+aux16_1)+aux16_2)+aux16_3)+aux16_4)+aux16_5)+aux16_6)+aux16_7)<=(((aux6_0+aux6_5)+aux6_1)+aux6_4))")))
Detected timeout of ITS tools.
[2021-05-14 15:09:30] [INFO ] Flatten gal took : 22 ms
[2021-05-14 15:09:30] [INFO ] Applying decomposition
[2021-05-14 15:09:30] [INFO ] Flatten gal took : 20 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/graph17891128308578331828.txt, -o, /tmp/graph17891128308578331828.bin, -w, /tmp/graph17891128308578331828.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/graph17891128308578331828.bin, -l, -1, -v, -w, /tmp/graph17891128308578331828.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 15:09:30] [INFO ] Decomposing Gal with order
[2021-05-14 15:09:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 15:09:30] [INFO ] Removed a total of 250 redundant transitions.
[2021-05-14 15:09:30] [INFO ] Flatten gal took : 108 ms
[2021-05-14 15:09:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 314 labels/synchronizations in 18 ms.
[2021-05-14 15:09:30] [INFO ] Time to serialize gal into /tmp/LTL17653993477831210815.gal : 5 ms
[2021-05-14 15:09:30] [INFO ] Time to serialize properties into /tmp/LTL766409280881492657.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/LTL17653993477831210815.gal, -t, CGAL, -LTL, /tmp/LTL766409280881492657.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/LTL17653993477831210815.gal -t CGAL -LTL /tmp/LTL766409280881492657.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X((G("((((((((gu0.out7_1+gu0.out7_0)+gu0.out7_3)+gu0.out7_2)+gu0.out7_5)+gu0.out7_4)+gu0.out7_7)+gu0.out7_6)<2)"))||(("((((((((gu0.out7_1+gu0.out7_0)+gu0.out7_3)+gu0.out7_2)+gu0.out7_5)+gu0.out7_4)+gu0.out7_7)+gu0.out7_6)<2)")&&(F(("(gu3.c9>(((((((gu3.out1_0+gu3.out1_6)+gu3.out1_5)+gu3.out1_7)+gu3.out1_2)+gu3.out1_1)+gu3.out1_4)+gu3.out1_3))")&&(X("((((((((gu4.aux16_0+gu4.aux16_1)+gu4.aux16_2)+gu4.aux16_3)+gu4.aux16_4)+gu4.aux16_5)+gu4.aux16_6)+gu4.aux16_7)<=(((gu4.aux6_0+gu4.aux6_5)+gu4.aux6_1)+gu4.aux6_4))"))))))))))
Formula 0 simplified : !XXX(G"((((((((gu0.out7_1+gu0.out7_0)+gu0.out7_3)+gu0.out7_2)+gu0.out7_5)+gu0.out7_4)+gu0.out7_7)+gu0.out7_6)<2)" | ("((((((((gu0.out7_1+gu0.out7_0)+gu0.out7_3)+gu0.out7_2)+gu0.out7_5)+gu0.out7_4)+gu0.out7_7)+gu0.out7_6)<2)" & F("(gu3.c9>(((((((gu3.out1_0+gu3.out1_6)+gu3.out1_5)+gu3.out1_7)+gu3.out1_2)+gu3.out1_1)+gu3.out1_4)+gu3.out1_3))" & X"((((((((gu4.aux16_0+gu4.aux16_1)+gu4.aux16_2)+gu4.aux16_3)+gu4.aux16_4)+gu4.aux16_5)+gu4.aux16_6)+gu4.aux16_7)<=(((gu4.aux6_0+gu4.aux6_5)+gu4.aux6_1)+gu4.aux6_4))")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10450099476256601259
[2021-05-14 15:09:45] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10450099476256601259
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/ltsmin10450099476256601259]
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/ltsmin10450099476256601259] 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/ltsmin10450099476256601259] 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 PermAdmissibility-PT-50-04 finished in 35101 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 9 out of 125 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 125/125 places, 512/512 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 99 transition count 512
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 47 place count 78 transition count 344
Iterating global reduction 1 with 21 rules applied. Total rules applied 68 place count 78 transition count 344
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 87 place count 59 transition count 138
Iterating global reduction 1 with 19 rules applied. Total rules applied 106 place count 59 transition count 138
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 58 transition count 130
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 58 transition count 130
Applied a total of 108 rules in 22 ms. Remains 58 /125 variables (removed 67) and now considering 130/512 (removed 382) transitions.
// Phase 1: matrix 130 rows 58 cols
[2021-05-14 15:09:46] [INFO ] Computed 16 place invariants in 3 ms
[2021-05-14 15:09:47] [INFO ] Implicit Places using invariants in 171 ms returned [0, 5, 18, 25]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 172 ms to find 4 implicit places.
// Phase 1: matrix 130 rows 54 cols
[2021-05-14 15:09:47] [INFO ] Computed 12 place invariants in 7 ms
[2021-05-14 15:09:47] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
Starting structural reductions, iteration 1 : 54/125 places, 130/512 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 130/130 (removed 0) transitions.
// Phase 1: matrix 130 rows 54 cols
[2021-05-14 15:09:47] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 15:09:47] [INFO ] Dead Transitions using invariants and state equation in 70 ms returned []
Finished structural reductions, in 2 iterations. Remains : 54/125 places, 130/512 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-50-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s30 s31 s32 s33 s39 s40 s41 s42) s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 126 ms.
Product exploration explored 100000 steps with 50000 reset in 132 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 130
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (OR (G p0) (G (NOT p0)))), p0]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 122 ms.
Product exploration explored 100000 steps with 50000 reset in 131 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Support contains 9 out of 54 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 54/54 places, 130/130 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 54 transition count 130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 54 transition count 130
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 53 transition count 129
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 53 transition count 129
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 4 rules in 8 ms. Remains 53 /54 variables (removed 1) and now considering 129/130 (removed 1) transitions.
[2021-05-14 15:09:47] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 129 rows 53 cols
[2021-05-14 15:09:47] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 15:09:48] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 1 iterations. Remains : 53/54 places, 129/130 transitions.
Product exploration explored 100000 steps with 50000 reset in 391 ms.
Product exploration explored 100000 steps with 50000 reset in 339 ms.
[2021-05-14 15:09:48] [INFO ] Flatten gal took : 9 ms
[2021-05-14 15:09:48] [INFO ] Flatten gal took : 8 ms
[2021-05-14 15:09:48] [INFO ] Time to serialize gal into /tmp/LTL1126811804394341828.gal : 1 ms
[2021-05-14 15:09:48] [INFO ] Time to serialize properties into /tmp/LTL14005279980776463546.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/LTL1126811804394341828.gal, -t, CGAL, -LTL, /tmp/LTL14005279980776463546.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/LTL1126811804394341828.gal -t CGAL -LTL /tmp/LTL14005279980776463546.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((((((((aux9_4+aux9_5)+aux9_6)+aux9_7)+aux9_0)+aux9_1)+aux9_2)+aux9_3)<=c19)"))))
Formula 0 simplified : !XF"((((((((aux9_4+aux9_5)+aux9_6)+aux9_7)+aux9_0)+aux9_1)+aux9_2)+aux9_3)<=c19)"
Detected timeout of ITS tools.
[2021-05-14 15:10:03] [INFO ] Flatten gal took : 25 ms
[2021-05-14 15:10:03] [INFO ] Applying decomposition
[2021-05-14 15:10:03] [INFO ] Flatten gal took : 8 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/graph9634219285798853852.txt, -o, /tmp/graph9634219285798853852.bin, -w, /tmp/graph9634219285798853852.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/graph9634219285798853852.bin, -l, -1, -v, -w, /tmp/graph9634219285798853852.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 15:10:03] [INFO ] Decomposing Gal with order
[2021-05-14 15:10:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 15:10:03] [INFO ] Removed a total of 127 redundant transitions.
[2021-05-14 15:10:03] [INFO ] Flatten gal took : 18 ms
[2021-05-14 15:10:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 63 labels/synchronizations in 4 ms.
[2021-05-14 15:10:03] [INFO ] Time to serialize gal into /tmp/LTL1967849698751044789.gal : 2 ms
[2021-05-14 15:10:03] [INFO ] Time to serialize properties into /tmp/LTL13577107990383377401.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/LTL1967849698751044789.gal, -t, CGAL, -LTL, /tmp/LTL13577107990383377401.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/LTL1967849698751044789.gal -t CGAL -LTL /tmp/LTL13577107990383377401.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((((((((gu0.aux9_4+gu0.aux9_5)+gu0.aux9_6)+gu0.aux9_7)+gu0.aux9_0)+gu0.aux9_1)+gu0.aux9_2)+gu0.aux9_3)<=gu0.c19)"))))
Formula 0 simplified : !XF"((((((((gu0.aux9_4+gu0.aux9_5)+gu0.aux9_6)+gu0.aux9_7)+gu0.aux9_0)+gu0.aux9_1)+gu0.aux9_2)+gu0.aux9_3)<=gu0.c19)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18287163918054139414
[2021-05-14 15:10:18] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18287163918054139414
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/ltsmin18287163918054139414]
Compilation finished in 605 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin18287163918054139414]
Link finished in 40 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, X(<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin18287163918054139414]
LTSmin run took 150 ms.
FORMULA PermAdmissibility-PT-50-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-PT-50-05 finished in 32965 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)&&X((!p0 U p1)))))], workingDir=/home/mcc/execution]
Support contains 18 out of 125 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 125/125 places, 512/512 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 107 transition count 512
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 32 place count 93 transition count 372
Iterating global reduction 1 with 14 rules applied. Total rules applied 46 place count 93 transition count 372
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 88 transition count 292
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 88 transition count 292
Applied a total of 56 rules in 7 ms. Remains 88 /125 variables (removed 37) and now considering 292/512 (removed 220) transitions.
// Phase 1: matrix 292 rows 88 cols
[2021-05-14 15:10:19] [INFO ] Computed 17 place invariants in 2 ms
[2021-05-14 15:10:19] [INFO ] Implicit Places using invariants in 59 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
// Phase 1: matrix 292 rows 87 cols
[2021-05-14 15:10:19] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-14 15:10:19] [INFO ] Dead Transitions using invariants and state equation in 103 ms returned []
Starting structural reductions, iteration 1 : 87/125 places, 292/512 transitions.
Applied a total of 0 rules in 2 ms. Remains 87 /87 variables (removed 0) and now considering 292/292 (removed 0) transitions.
// Phase 1: matrix 292 rows 87 cols
[2021-05-14 15:10:19] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-14 15:10:20] [INFO ] Dead Transitions using invariants and state equation in 115 ms returned []
Finished structural reductions, in 2 iterations. Remains : 87/125 places, 292/512 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), true]
Running random walk in product with property : PermAdmissibility-PT-50-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 3}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ (ADD s41 s42 s43 s44 s45 s46 s57 s58) s26), p1:(LEQ (ADD s11 s12 s13 s14 s15 s16 s17 s18) s76)], 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 27 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-50-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-50-06 finished in 411 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(G(p1))||G(F(p2))||p0)))], workingDir=/home/mcc/execution]
Support contains 31 out of 125 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 125/125 places, 512/512 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 107 transition count 512
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 99 transition count 384
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 99 transition count 384
Applied a total of 34 rules in 6 ms. Remains 99 /125 variables (removed 26) and now considering 384/512 (removed 128) transitions.
// Phase 1: matrix 384 rows 99 cols
[2021-05-14 15:10:20] [INFO ] Computed 17 place invariants in 3 ms
[2021-05-14 15:10:20] [INFO ] Implicit Places using invariants in 63 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
// Phase 1: matrix 384 rows 98 cols
[2021-05-14 15:10:20] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-14 15:10:20] [INFO ] Dead Transitions using invariants and state equation in 127 ms returned []
Starting structural reductions, iteration 1 : 98/125 places, 384/512 transitions.
Applied a total of 0 rules in 8 ms. Remains 98 /98 variables (removed 0) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 98 cols
[2021-05-14 15:10:20] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-14 15:10:20] [INFO ] Dead Transitions using invariants and state equation in 130 ms returned []
Finished structural reductions, in 2 iterations. Remains : 98/125 places, 384/512 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : PermAdmissibility-PT-50-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(OR (LEQ 1 s32) (LEQ (ADD s39 s40 s41 s42 s43 s44 s45 s54) (ADD s22 s23 s25 s26 s27 s28 s29 s30))), p1:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7) s46), p2:(GT s87 (ADD s65 s66 s67 s68))], 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 50000 reset in 181 ms.
Product exploration explored 100000 steps with 50000 reset in 205 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 98 transition count 384
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), p0, p1, (NOT p2)]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 50000 reset in 174 ms.
Product exploration explored 100000 steps with 50000 reset in 188 ms.
Applying partial POR strategy [true, true, true, false]
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 31 out of 98 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 98/98 places, 384/384 transitions.
Applied a total of 0 rules in 9 ms. Remains 98 /98 variables (removed 0) and now considering 384/384 (removed 0) transitions.
[2021-05-14 15:10:21] [INFO ] Redundant transitions in 22 ms returned []
// Phase 1: matrix 384 rows 98 cols
[2021-05-14 15:10:21] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-14 15:10:22] [INFO ] Dead Transitions using invariants and state equation in 139 ms returned []
Finished structural reductions, in 1 iterations. Remains : 98/98 places, 384/384 transitions.
Product exploration explored 100000 steps with 50000 reset in 612 ms.
Product exploration explored 100000 steps with 50000 reset in 599 ms.
[2021-05-14 15:10:23] [INFO ] Flatten gal took : 19 ms
[2021-05-14 15:10:23] [INFO ] Flatten gal took : 19 ms
[2021-05-14 15:10:23] [INFO ] Time to serialize gal into /tmp/LTL9428975294988405168.gal : 4 ms
[2021-05-14 15:10:23] [INFO ] Time to serialize properties into /tmp/LTL16354144864384571847.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/LTL9428975294988405168.gal, -t, CGAL, -LTL, /tmp/LTL16354144864384571847.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/LTL9428975294988405168.gal -t CGAL -LTL /tmp/LTL16354144864384571847.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((("((c12>=1)||((((((((aux12_6+aux12_5)+aux12_4)+aux12_3)+aux12_2)+aux12_1)+aux12_0)+aux12_7)<=(((((((out2_0+out2_7)+out2_5)+out2_6)+out2_3)+out2_4)+out2_1)+out2_2)))")||(F(G("((((((((aux16_0+aux16_1)+aux16_2)+aux16_3)+aux16_4)+aux16_5)+aux16_6)+aux16_7)<=c13)"))))||(G(F("(c16>(((aux5_1+aux5_0)+aux5_5)+aux5_4))"))))))
Formula 0 simplified : !X("((c12>=1)||((((((((aux12_6+aux12_5)+aux12_4)+aux12_3)+aux12_2)+aux12_1)+aux12_0)+aux12_7)<=(((((((out2_0+out2_7)+out2_5)+out2_6)+out2_3)+out2_4)+out2_1)+out2_2)))" | FG"((((((((aux16_0+aux16_1)+aux16_2)+aux16_3)+aux16_4)+aux16_5)+aux16_6)+aux16_7)<=c13)" | GF"(c16>(((aux5_1+aux5_0)+aux5_5)+aux5_4))")
Detected timeout of ITS tools.
[2021-05-14 15:10:38] [INFO ] Flatten gal took : 19 ms
[2021-05-14 15:10:38] [INFO ] Applying decomposition
[2021-05-14 15:10:38] [INFO ] Flatten gal took : 18 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/graph4074519796038206123.txt, -o, /tmp/graph4074519796038206123.bin, -w, /tmp/graph4074519796038206123.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/graph4074519796038206123.bin, -l, -1, -v, -w, /tmp/graph4074519796038206123.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 15:10:38] [INFO ] Decomposing Gal with order
[2021-05-14 15:10:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 15:10:38] [INFO ] Removed a total of 541 redundant transitions.
[2021-05-14 15:10:38] [INFO ] Flatten gal took : 72 ms
[2021-05-14 15:10:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 196 labels/synchronizations in 6 ms.
[2021-05-14 15:10:38] [INFO ] Time to serialize gal into /tmp/LTL14407771128575701090.gal : 3 ms
[2021-05-14 15:10:38] [INFO ] Time to serialize properties into /tmp/LTL9650759786345628139.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/LTL14407771128575701090.gal, -t, CGAL, -LTL, /tmp/LTL9650759786345628139.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/LTL14407771128575701090.gal -t CGAL -LTL /tmp/LTL9650759786345628139.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((("((gi2.gu4.c12>=1)||((((((((gu2.aux12_6+gu2.aux12_5)+gu2.aux12_4)+gu2.aux12_3)+gu2.aux12_2)+gu2.aux12_1)+gu2.aux12_0)+gu2.aux12_7)<=(((((((gu2.out2_0+gu2.out2_7)+gu2.out2_5)+gu2.out2_6)+gu2.out2_3)+gu2.out2_4)+gu2.out2_1)+gu2.out2_2)))")||(F(G("((((((((gu0.aux16_0+gu0.aux16_1)+gu0.aux16_2)+gu0.aux16_3)+gu0.aux16_4)+gu0.aux16_5)+gu0.aux16_6)+gu0.aux16_7)<=gu0.c13)"))))||(G(F("(gi2.gu3.c16>(((gi2.gu3.aux5_1+gi2.gu3.aux5_0)+gi2.gu3.aux5_5)+gi2.gu3.aux5_4))"))))))
Formula 0 simplified : !X("((gi2.gu4.c12>=1)||((((((((gu2.aux12_6+gu2.aux12_5)+gu2.aux12_4)+gu2.aux12_3)+gu2.aux12_2)+gu2.aux12_1)+gu2.aux12_0)+gu2.aux12_7)<=(((((((gu2.out2_0+gu2.out2_7)+gu2.out2_5)+gu2.out2_6)+gu2.out2_3)+gu2.out2_4)+gu2.out2_1)+gu2.out2_2)))" | FG"((((((((gu0.aux16_0+gu0.aux16_1)+gu0.aux16_2)+gu0.aux16_3)+gu0.aux16_4)+gu0.aux16_5)+gu0.aux16_6)+gu0.aux16_7)<=gu0.c13)" | GF"(gi2.gu3.c16>(((gi2.gu3.aux5_1+gi2.gu3.aux5_0)+gi2.gu3.aux5_5)+gi2.gu3.aux5_4))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4102980715414404490
[2021-05-14 15:10:53] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4102980715414404490
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/ltsmin4102980715414404490]
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/ltsmin4102980715414404490] 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/ltsmin4102980715414404490] 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 PermAdmissibility-PT-50-07 finished in 34493 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((F(p0)&&(F(p2)||p1)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 125 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 125/125 places, 512/512 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 100 transition count 512
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 45 place count 80 transition count 348
Iterating global reduction 1 with 20 rules applied. Total rules applied 65 place count 80 transition count 348
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 87 place count 58 transition count 118
Iterating global reduction 1 with 22 rules applied. Total rules applied 109 place count 58 transition count 118
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 111 place count 56 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 113 place count 56 transition count 102
Applied a total of 113 rules in 5 ms. Remains 56 /125 variables (removed 69) and now considering 102/512 (removed 410) transitions.
// Phase 1: matrix 102 rows 56 cols
[2021-05-14 15:10:54] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-14 15:10:54] [INFO ] Implicit Places using invariants in 69 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
// Phase 1: matrix 102 rows 55 cols
[2021-05-14 15:10:54] [INFO ] Computed 15 place invariants in 9 ms
[2021-05-14 15:10:54] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Starting structural reductions, iteration 1 : 55/125 places, 102/512 transitions.
Applied a total of 0 rules in 0 ms. Remains 55 /55 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 55 cols
[2021-05-14 15:10:54] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-14 15:10:54] [INFO ] Dead Transitions using invariants and state equation in 75 ms returned []
Finished structural reductions, in 2 iterations. Remains : 55/125 places, 102/512 transitions.
Stuttering acceptance computed with spot in 2535 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : PermAdmissibility-PT-50-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GT s44 s42), p2:(LEQ 2 s51), p1:(OR (LEQ s44 s42) (LEQ s26 s5))], 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]]
Product exploration explored 100000 steps with 1841 reset in 501 ms.
Product exploration explored 100000 steps with 1839 reset in 598 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 55 transition count 102
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (NOT p0), p2, p1]
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 1807 reset in 500 ms.
Product exploration explored 100000 steps with 1818 reset in 555 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 5 out of 55 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 55/55 places, 102/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 55 /55 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2021-05-14 15:11:00] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 102 rows 55 cols
[2021-05-14 15:11:00] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-14 15:11:00] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 1 iterations. Remains : 55/55 places, 102/102 transitions.
Product exploration explored 100000 steps with 1814 reset in 776 ms.
Product exploration explored 100000 steps with 1833 reset in 540 ms.
[2021-05-14 15:11:01] [INFO ] Flatten gal took : 5 ms
[2021-05-14 15:11:01] [INFO ] Flatten gal took : 5 ms
[2021-05-14 15:11:01] [INFO ] Time to serialize gal into /tmp/LTL16775250908617423548.gal : 1 ms
[2021-05-14 15:11:01] [INFO ] Time to serialize properties into /tmp/LTL7908599630588436466.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/LTL16775250908617423548.gal, -t, CGAL, -LTL, /tmp/LTL7908599630588436466.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/LTL16775250908617423548.gal -t CGAL -LTL /tmp/LTL7908599630588436466.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((F("(c16>c9)"))&&(("((c16<=c9)||(aux7_6<=out7_5))")||(F("(c5>=2)")))))))
Formula 0 simplified : !XF(F"(c16>c9)" & ("((c16<=c9)||(aux7_6<=out7_5))" | F"(c5>=2)"))
Detected timeout of ITS tools.
[2021-05-14 15:11:16] [INFO ] Flatten gal took : 5 ms
[2021-05-14 15:11:16] [INFO ] Applying decomposition
[2021-05-14 15:11:16] [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/graph11640842883582272107.txt, -o, /tmp/graph11640842883582272107.bin, -w, /tmp/graph11640842883582272107.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/graph11640842883582272107.bin, -l, -1, -v, -w, /tmp/graph11640842883582272107.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 15:11:16] [INFO ] Decomposing Gal with order
[2021-05-14 15:11:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 15:11:16] [INFO ] Removed a total of 102 redundant transitions.
[2021-05-14 15:11:16] [INFO ] Flatten gal took : 11 ms
[2021-05-14 15:11:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 69 labels/synchronizations in 2 ms.
[2021-05-14 15:11:16] [INFO ] Time to serialize gal into /tmp/LTL13169810023820519642.gal : 1 ms
[2021-05-14 15:11:16] [INFO ] Time to serialize properties into /tmp/LTL5431512958315117621.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/LTL13169810023820519642.gal, -t, CGAL, -LTL, /tmp/LTL5431512958315117621.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/LTL13169810023820519642.gal -t CGAL -LTL /tmp/LTL5431512958315117621.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((F("(gu5.c16>gu5.c9)"))&&(("((gu5.c16<=gu5.c9)||(gu1.aux7_6<=gu1.out7_5))")||(F("(gi2.gu4.c5>=2)")))))))
Formula 0 simplified : !XF(F"(gu5.c16>gu5.c9)" & ("((gu5.c16<=gu5.c9)||(gu1.aux7_6<=gu1.out7_5))" | F"(gi2.gu4.c5>=2)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4397361446248734331
[2021-05-14 15:11:31] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4397361446248734331
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/ltsmin4397361446248734331]
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/ltsmin4397361446248734331] 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/ltsmin4397361446248734331] 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 PermAdmissibility-PT-50-09 finished in 38135 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 125 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 125/125 places, 512/512 transitions.
Graph (complete) has 1105 edges and 125 vertex of which 99 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.3 ms
Discarding 26 places :
Also discarding 0 output transitions
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 79 transition count 346
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 79 transition count 346
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 62 place count 58 transition count 132
Iterating global reduction 0 with 21 rules applied. Total rules applied 83 place count 58 transition count 132
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 85 place count 56 transition count 116
Iterating global reduction 0 with 2 rules applied. Total rules applied 87 place count 56 transition count 116
Applied a total of 87 rules in 15 ms. Remains 56 /125 variables (removed 69) and now considering 116/512 (removed 396) transitions.
// Phase 1: matrix 116 rows 56 cols
[2021-05-14 15:11:32] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-14 15:11:32] [INFO ] Implicit Places using invariants in 40 ms returned [0, 6, 20, 28]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 41 ms to find 4 implicit places.
[2021-05-14 15:11:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 116 rows 52 cols
[2021-05-14 15:11:32] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 15:11:32] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Starting structural reductions, iteration 1 : 52/125 places, 116/512 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 52 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 51 transition count 115
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 51 transition count 114
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 50 transition count 114
Applied a total of 4 rules in 6 ms. Remains 50 /52 variables (removed 2) and now considering 114/116 (removed 2) transitions.
// Phase 1: matrix 114 rows 50 cols
[2021-05-14 15:11:32] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 15:11:32] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 114 rows 50 cols
[2021-05-14 15:11:32] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 15:11:33] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 50/125 places, 114/512 transitions.
Stuttering acceptance computed with spot in 6182 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-50-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LEQ s38 s14) (GT s1 s4))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 700 steps with 0 reset in 4 ms.
FORMULA PermAdmissibility-PT-50-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-50-11 finished in 6416 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 125 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 125/125 places, 512/512 transitions.
Graph (complete) has 1105 edges and 125 vertex of which 100 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.2 ms
Discarding 25 places :
Also discarding 0 output transitions
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 81 transition count 352
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 81 transition count 352
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 61 place count 59 transition count 122
Iterating global reduction 0 with 22 rules applied. Total rules applied 83 place count 59 transition count 122
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 86 place count 56 transition count 98
Iterating global reduction 0 with 3 rules applied. Total rules applied 89 place count 56 transition count 98
Applied a total of 89 rules in 12 ms. Remains 56 /125 variables (removed 69) and now considering 98/512 (removed 414) transitions.
// Phase 1: matrix 98 rows 56 cols
[2021-05-14 15:11:39] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-14 15:11:39] [INFO ] Implicit Places using invariants in 55 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
[2021-05-14 15:11:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 98 rows 55 cols
[2021-05-14 15:11:39] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-14 15:11:39] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Starting structural reductions, iteration 1 : 55/125 places, 98/512 transitions.
Applied a total of 0 rules in 4 ms. Remains 55 /55 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2021-05-14 15:11:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 98 rows 55 cols
[2021-05-14 15:11:39] [INFO ] Computed 15 place invariants in 0 ms
[2021-05-14 15:11:39] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Finished structural reductions, in 2 iterations. Remains : 55/125 places, 98/512 transitions.
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-50-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s6 s10), p1:(LEQ 3 s47)], 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 124 reset in 502 ms.
Product exploration explored 100000 steps with 124 reset in 501 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 55 transition count 98
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), p0, p1]
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 124 reset in 477 ms.
Product exploration explored 100000 steps with 124 reset in 491 ms.
[2021-05-14 15:11:41] [INFO ] Flatten gal took : 4 ms
[2021-05-14 15:11:41] [INFO ] Flatten gal took : 5 ms
[2021-05-14 15:11:41] [INFO ] Time to serialize gal into /tmp/LTL6304394861584031189.gal : 1 ms
[2021-05-14 15:11:41] [INFO ] Time to serialize properties into /tmp/LTL7826446179965412398.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/LTL6304394861584031189.gal, -t, CGAL, -LTL, /tmp/LTL7826446179965412398.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/LTL6304394861584031189.gal -t CGAL -LTL /tmp/LTL7826446179965412398.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G("(aux15_7<=out4_7)"))||(G(F("(in3_5>=3)"))))))
Formula 0 simplified : !F(G"(aux15_7<=out4_7)" | GF"(in3_5>=3)")
Detected timeout of ITS tools.
[2021-05-14 15:11:56] [INFO ] Flatten gal took : 5 ms
[2021-05-14 15:11:56] [INFO ] Applying decomposition
[2021-05-14 15:11:56] [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/graph5704335232672069599.txt, -o, /tmp/graph5704335232672069599.bin, -w, /tmp/graph5704335232672069599.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/graph5704335232672069599.bin, -l, -1, -v, -w, /tmp/graph5704335232672069599.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 15:11:56] [INFO ] Decomposing Gal with order
[2021-05-14 15:11:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 15:11:56] [INFO ] Removed a total of 37 redundant transitions.
[2021-05-14 15:11:56] [INFO ] Flatten gal took : 7 ms
[2021-05-14 15:11:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 1 ms.
[2021-05-14 15:11:56] [INFO ] Time to serialize gal into /tmp/LTL16159954312950451102.gal : 1 ms
[2021-05-14 15:11:56] [INFO ] Time to serialize properties into /tmp/LTL780626193816450202.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/LTL16159954312950451102.gal, -t, CGAL, -LTL, /tmp/LTL780626193816450202.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/LTL16159954312950451102.gal -t CGAL -LTL /tmp/LTL780626193816450202.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G("(gu0.aux15_7<=gu0.out4_7)"))||(G(F("(gi1.gu3.in3_5>=3)"))))))
Formula 0 simplified : !F(G"(gu0.aux15_7<=gu0.out4_7)" | GF"(gi1.gu3.in3_5>=3)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12347093816651326682
[2021-05-14 15:12:11] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12347093816651326682
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/ltsmin12347093816651326682]
Compilation finished in 904 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin12347093816651326682]
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))||[](<>((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12347093816651326682]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PermAdmissibility-PT-50-13 finished in 47695 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F((p0&&X(F(!p0))))||X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 125/125 places, 512/512 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 100 transition count 512
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 45 place count 80 transition count 348
Iterating global reduction 1 with 20 rules applied. Total rules applied 65 place count 80 transition count 348
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 87 place count 58 transition count 118
Iterating global reduction 1 with 22 rules applied. Total rules applied 109 place count 58 transition count 118
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 112 place count 55 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 115 place count 55 transition count 94
Applied a total of 115 rules in 4 ms. Remains 55 /125 variables (removed 70) and now considering 94/512 (removed 418) transitions.
// Phase 1: matrix 94 rows 55 cols
[2021-05-14 15:12:29] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-14 15:12:29] [INFO ] Implicit Places using invariants in 38 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
// Phase 1: matrix 94 rows 54 cols
[2021-05-14 15:12:29] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-14 15:12:29] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Starting structural reductions, iteration 1 : 54/125 places, 94/512 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
// Phase 1: matrix 94 rows 54 cols
[2021-05-14 15:12:29] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-14 15:12:29] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 2 iterations. Remains : 54/125 places, 94/512 transitions.
Stuttering acceptance computed with spot in 378 ms :[(NOT p1), (AND p0 (NOT p1)), (NOT p1), p0, true]
Running random walk in product with property : PermAdmissibility-PT-50-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={0} source=4 dest: 3}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 1 s38), p1:(GT 2 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33332 reset in 142 ms.
Product exploration explored 100000 steps with 33277 reset in 155 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 94
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), p0, p1]
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (AND p0 (NOT p1)), (NOT p1), p0, true]
Product exploration explored 100000 steps with 33419 reset in 139 ms.
Product exploration explored 100000 steps with 33402 reset in 150 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (AND p0 (NOT p1)), (NOT p1), p0, true]
Support contains 2 out of 54 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 54/54 places, 94/94 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2021-05-14 15:12:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 94 rows 54 cols
[2021-05-14 15:12:31] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-14 15:12:31] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 94/94 transitions.
Product exploration explored 100000 steps with 33260 reset in 279 ms.
Product exploration explored 100000 steps with 33169 reset in 293 ms.
[2021-05-14 15:12:31] [INFO ] Flatten gal took : 4 ms
[2021-05-14 15:12:31] [INFO ] Flatten gal took : 4 ms
[2021-05-14 15:12:31] [INFO ] Time to serialize gal into /tmp/LTL5787812255160906290.gal : 0 ms
[2021-05-14 15:12:31] [INFO ] Time to serialize properties into /tmp/LTL17292340683817171048.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/LTL5787812255160906290.gal, -t, CGAL, -LTL, /tmp/LTL17292340683817171048.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/LTL5787812255160906290.gal -t CGAL -LTL /tmp/LTL17292340683817171048.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((F(("(in4_7>=1)")&&(X(F("(in4_7<1)")))))||(X(G("(out1_2<2)"))))))
Formula 0 simplified : !G(F("(in4_7>=1)" & XF"(in4_7<1)") | XG"(out1_2<2)")
Detected timeout of ITS tools.
[2021-05-14 15:12:46] [INFO ] Flatten gal took : 4 ms
[2021-05-14 15:12:46] [INFO ] Applying decomposition
[2021-05-14 15:12:46] [INFO ] Flatten gal took : 4 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/graph11522065655858315770.txt, -o, /tmp/graph11522065655858315770.bin, -w, /tmp/graph11522065655858315770.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/graph11522065655858315770.bin, -l, -1, -v, -w, /tmp/graph11522065655858315770.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 15:12:48] [INFO ] Decomposing Gal with order
[2021-05-14 15:12:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 15:12:48] [INFO ] Removed a total of 69 redundant transitions.
[2021-05-14 15:12:48] [INFO ] Flatten gal took : 9 ms
[2021-05-14 15:12:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 61 labels/synchronizations in 2 ms.
[2021-05-14 15:12:48] [INFO ] Time to serialize gal into /tmp/LTL14476005374553371308.gal : 2 ms
[2021-05-14 15:12:48] [INFO ] Time to serialize properties into /tmp/LTL11872688135650762800.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/LTL14476005374553371308.gal, -t, CGAL, -LTL, /tmp/LTL11872688135650762800.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/LTL14476005374553371308.gal -t CGAL -LTL /tmp/LTL11872688135650762800.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G((F(("(i2.u3.in4_7>=1)")&&(X(F("(i2.u3.in4_7<1)")))))||(X(G("(i0.u0.out1_2<2)"))))))
Formula 0 simplified : !G(F("(i2.u3.in4_7>=1)" & XF"(i2.u3.in4_7<1)") | XG"(i0.u0.out1_2<2)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5478518445534208826
[2021-05-14 15:13:07] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5478518445534208826
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/ltsmin5478518445534208826]
Compilation finished in 470 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5478518445534208826]
Link finished in 33 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(<>(!(LTLAPp0==true)))))||X([]((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5478518445534208826]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PermAdmissibility-PT-50-14 finished in 55248 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&F(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 125 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 125/125 places, 512/512 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 99 transition count 512
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 47 place count 78 transition count 344
Iterating global reduction 1 with 21 rules applied. Total rules applied 68 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 92 place count 54 transition count 108
Iterating global reduction 1 with 24 rules applied. Total rules applied 116 place count 54 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 119 place count 51 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 122 place count 51 transition count 84
Applied a total of 122 rules in 4 ms. Remains 51 /125 variables (removed 74) and now considering 84/512 (removed 428) transitions.
// Phase 1: matrix 84 rows 51 cols
[2021-05-14 15:13:22] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-14 15:13:22] [INFO ] Implicit Places using invariants in 34 ms returned [0, 5, 18, 25]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 34 ms to find 4 implicit places.
// Phase 1: matrix 84 rows 47 cols
[2021-05-14 15:13:22] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 15:13:22] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Starting structural reductions, iteration 1 : 47/125 places, 84/512 transitions.
Applied a total of 0 rules in 0 ms. Remains 47 /47 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 47 cols
[2021-05-14 15:13:22] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 15:13:22] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 2 iterations. Remains : 47/125 places, 84/512 transitions.
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-50-15 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}]], initial=0, aps=[p0:(LEQ 1 s5), p1:(LEQ s41 s22)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-50-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-50-15 finished in 209 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5282707488136604046
[2021-05-14 15:13:22] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2021-05-14 15:13:22] [INFO ] Applying decomposition
[2021-05-14 15:13:22] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 15:13:22] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2021-05-14 15:13:22] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 15:13:22] [INFO ] Flatten gal took : 28 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/graph5778035670834770215.txt, -o, /tmp/graph5778035670834770215.bin, -w, /tmp/graph5778035670834770215.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/graph5778035670834770215.bin, -l, -1, -v, -w, /tmp/graph5778035670834770215.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 15:13:22] [INFO ] Decomposing Gal with order
[2021-05-14 15:13:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 15:13:22] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2021-05-14 15:13:22] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 15:13:22] [INFO ] Built C files in 121ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5282707488136604046
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/ltsmin5282707488136604046]
[2021-05-14 15:13:22] [INFO ] Removed a total of 885 redundant transitions.
[2021-05-14 15:13:22] [INFO ] Flatten gal took : 98 ms
[2021-05-14 15:13:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 334 labels/synchronizations in 20 ms.
[2021-05-14 15:13:22] [INFO ] Time to serialize gal into /tmp/LTLCardinality16793652814372984250.gal : 3 ms
[2021-05-14 15:13:22] [INFO ] Time to serialize properties into /tmp/LTLCardinality324916862044144297.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/LTLCardinality16793652814372984250.gal, -t, CGAL, -LTL, /tmp/LTLCardinality324916862044144297.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/LTLCardinality16793652814372984250.gal -t CGAL -LTL /tmp/LTLCardinality324916862044144297.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 5 LTL properties
Checking formula 0 : !((X(X(X(("((((((((gu0.out7_1+gu0.out7_0)+gu0.out7_3)+gu0.out7_2)+gu0.out7_5)+gu0.out7_4)+gu0.out7_7)+gu0.out7_6)<2)")U((("((((((((gu0.out7_1+gu0.out7_0)+gu0.out7_3)+gu0.out7_2)+gu0.out7_5)+gu0.out7_4)+gu0.out7_7)+gu0.out7_6)<2)")&&(F(("(gu3.c9>(((((((gu3.out1_0+gu3.out1_6)+gu3.out1_5)+gu3.out1_7)+gu3.out1_2)+gu3.out1_1)+gu3.out1_4)+gu3.out1_3))")&&(X("((((((((gu5.aux16_0+gu5.aux16_1)+gu5.aux16_2)+gu5.aux16_3)+gu5.aux16_4)+gu5.aux16_5)+gu5.aux16_6)+gu5.aux16_7)<=(((gu5.aux6_0+gu5.aux6_5)+gu5.aux6_1)+gu5.aux6_4))")))))||(G("((((((((gu0.out7_1+gu0.out7_0)+gu0.out7_3)+gu0.out7_2)+gu0.out7_5)+gu0.out7_4)+gu0.out7_7)+gu0.out7_6)<2)"))))))))
Formula 0 simplified : !XXX("((((((((gu0.out7_1+gu0.out7_0)+gu0.out7_3)+gu0.out7_2)+gu0.out7_5)+gu0.out7_4)+gu0.out7_7)+gu0.out7_6)<2)" U (("((((((((gu0.out7_1+gu0.out7_0)+gu0.out7_3)+gu0.out7_2)+gu0.out7_5)+gu0.out7_4)+gu0.out7_7)+gu0.out7_6)<2)" & F("(gu3.c9>(((((((gu3.out1_0+gu3.out1_6)+gu3.out1_5)+gu3.out1_7)+gu3.out1_2)+gu3.out1_1)+gu3.out1_4)+gu3.out1_3))" & X"((((((((gu5.aux16_0+gu5.aux16_1)+gu5.aux16_2)+gu5.aux16_3)+gu5.aux16_4)+gu5.aux16_5)+gu5.aux16_6)+gu5.aux16_7)<=(((gu5.aux6_0+gu5.aux6_5)+gu5.aux6_1)+gu5.aux6_4))")) | G"((((((((gu0.out7_1+gu0.out7_0)+gu0.out7_3)+gu0.out7_2)+gu0.out7_5)+gu0.out7_4)+gu0.out7_7)+gu0.out7_6)<2)"))
Compilation finished in 3684 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5282707488136604046]
Link finished in 43 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, X(X(X(([]((LTLAPp0==true))||((LTLAPp0==true)&&<>(((LTLAPp1==true)&&X((LTLAPp2==true))))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5282707488136604046]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: 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( 0/ 8), 0.031: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.030: LTL layer: formula: X(X(X(([]((LTLAPp0==true))||((LTLAPp0==true)&&<>(((LTLAPp1==true)&&X((LTLAPp2==true)))))))))
pins2lts-mc-linux64( 4/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.031: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.032: "X(X(X(([]((LTLAPp0==true))||((LTLAPp0==true)&&<>(((LTLAPp1==true)&&X((LTLAPp2==true)))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.032: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.039: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.043: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.279: DFS-FIFO for weak LTL, using special progress label 526
pins2lts-mc-linux64( 0/ 8), 0.279: There are 527 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.279: State length is 126, there are 531 groups
pins2lts-mc-linux64( 0/ 8), 0.279: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.279: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.279: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.279: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.428: ~1 levels ~960 states ~8480 transitions
pins2lts-mc-linux64( 2/ 8), 0.435: ~1 levels ~1920 states ~17088 transitions
pins2lts-mc-linux64( 2/ 8), 0.458: ~1 levels ~3840 states ~29344 transitions
pins2lts-mc-linux64( 2/ 8), 0.500: ~1 levels ~7680 states ~49504 transitions
pins2lts-mc-linux64( 1/ 8), 0.580: ~1 levels ~15360 states ~53552 transitions
pins2lts-mc-linux64( 1/ 8), 0.741: ~1 levels ~30720 states ~124896 transitions
pins2lts-mc-linux64( 1/ 8), 1.089: ~1 levels ~61440 states ~266752 transitions
pins2lts-mc-linux64( 5/ 8), 1.881: ~1 levels ~122880 states ~409248 transitions
pins2lts-mc-linux64( 5/ 8), 3.171: ~1 levels ~245760 states ~779328 transitions
pins2lts-mc-linux64( 2/ 8), 5.908: ~1 levels ~491520 states ~2135200 transitions
pins2lts-mc-linux64( 2/ 8), 11.324: ~1 levels ~983040 states ~4227648 transitions
pins2lts-mc-linux64( 2/ 8), 21.503: ~1 levels ~1966080 states ~7878272 transitions
pins2lts-mc-linux64( 2/ 8), 42.577: ~1 levels ~3932160 states ~14924384 transitions
pins2lts-mc-linux64( 0/ 8), 85.091: ~1 levels ~7864320 states ~23739968 transitions
pins2lts-mc-linux64( 2/ 8), 168.022: ~1 levels ~15728640 states ~52024928 transitions
pins2lts-mc-linux64( 2/ 8), 184.501: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 184.717:
pins2lts-mc-linux64( 0/ 8), 184.717: mean standard work distribution: 8.0% (states) 12.7% (transitions)
pins2lts-mc-linux64( 0/ 8), 184.717:
pins2lts-mc-linux64( 0/ 8), 184.717: Explored 15716884 states 55952281 transitions, fanout: 3.560
pins2lts-mc-linux64( 0/ 8), 184.717: Total exploration time 184.430 sec (184.210 sec minimum, 184.333 sec on average)
pins2lts-mc-linux64( 0/ 8), 184.717: States per second: 85219, Transitions per second: 303380
pins2lts-mc-linux64( 0/ 8), 184.717:
pins2lts-mc-linux64( 0/ 8), 184.717: Progress states detected: 29933407
pins2lts-mc-linux64( 0/ 8), 184.717: Redundant explorations: -47.4939
pins2lts-mc-linux64( 0/ 8), 184.717:
pins2lts-mc-linux64( 0/ 8), 184.717: Queue width: 8B, total height: 25023369, memory: 190.91MB
pins2lts-mc-linux64( 0/ 8), 184.717: Tree memory: 484.4MB, 17.0 B/state, compr.: 3.4%
pins2lts-mc-linux64( 0/ 8), 184.717: Tree fill ratio (roots/leafs): 22.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 184.717: Stored 528 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 184.717: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 184.717: Est. total memory use: 675.3MB (~1214.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, --when, --ltl, X(X(X(([]((LTLAPp0==true))||((LTLAPp0==true)&&<>(((LTLAPp1==true)&&X((LTLAPp2==true))))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5282707488136604046]
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(X(X(([]((LTLAPp0==true))||((LTLAPp0==true)&&<>(((LTLAPp1==true)&&X((LTLAPp2==true))))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin5282707488136604046]
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-14 15:34:47] [INFO ] Flatten gal took : 128 ms
[2021-05-14 15:34:48] [INFO ] Time to serialize gal into /tmp/LTLCardinality17976661249084978219.gal : 52 ms
[2021-05-14 15:34:48] [INFO ] Time to serialize properties into /tmp/LTLCardinality2547720548439584247.ltl : 9 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/LTLCardinality17976661249084978219.gal, -t, CGAL, -LTL, /tmp/LTLCardinality2547720548439584247.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/LTLCardinality17976661249084978219.gal -t CGAL -LTL /tmp/LTLCardinality2547720548439584247.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 5 LTL properties
Checking formula 0 : !((X(X(X(("((((((((out7_1+out7_0)+out7_3)+out7_2)+out7_5)+out7_4)+out7_7)+out7_6)<2)")U((("((((((((out7_1+out7_0)+out7_3)+out7_2)+out7_5)+out7_4)+out7_7)+out7_6)<2)")&&(F(("(c9>(((((((out1_0+out1_6)+out1_5)+out1_7)+out1_2)+out1_1)+out1_4)+out1_3))")&&(X("((((((((aux16_0+aux16_1)+aux16_2)+aux16_3)+aux16_4)+aux16_5)+aux16_6)+aux16_7)<=(((aux6_0+aux6_5)+aux6_1)+aux6_4))")))))||(G("((((((((out7_1+out7_0)+out7_3)+out7_2)+out7_5)+out7_4)+out7_7)+out7_6)<2)"))))))))
Formula 0 simplified : !XXX("((((((((out7_1+out7_0)+out7_3)+out7_2)+out7_5)+out7_4)+out7_7)+out7_6)<2)" U (("((((((((out7_1+out7_0)+out7_3)+out7_2)+out7_5)+out7_4)+out7_7)+out7_6)<2)" & F("(c9>(((((((out1_0+out1_6)+out1_5)+out1_7)+out1_2)+out1_1)+out1_4)+out1_3))" & X"((((((((aux16_0+aux16_1)+aux16_2)+aux16_3)+aux16_4)+aux16_5)+aux16_6)+aux16_7)<=(((aux6_0+aux6_5)+aux6_1)+aux6_4))")) | G"((((((((out7_1+out7_0)+out7_3)+out7_2)+out7_5)+out7_4)+out7_7)+out7_6)<2)"))
Detected timeout of ITS tools.
[2021-05-14 15:56:13] [INFO ] Flatten gal took : 173 ms
[2021-05-14 15:56:14] [INFO ] Input system was already deterministic with 512 transitions.
[2021-05-14 15:56:14] [INFO ] Transformed 125 places.
[2021-05-14 15:56:14] [INFO ] Transformed 512 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-14 15:56:26] [INFO ] Time to serialize gal into /tmp/LTLCardinality14458264770683360371.gal : 2 ms
[2021-05-14 15:56:26] [INFO ] Time to serialize properties into /tmp/LTLCardinality8752196918377468187.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/LTLCardinality14458264770683360371.gal, -t, CGAL, -LTL, /tmp/LTLCardinality8752196918377468187.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/LTLCardinality14458264770683360371.gal -t CGAL -LTL /tmp/LTLCardinality8752196918377468187.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 5 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(X(("((((((((out7_1+out7_0)+out7_3)+out7_2)+out7_5)+out7_4)+out7_7)+out7_6)<2)")U((("((((((((out7_1+out7_0)+out7_3)+out7_2)+out7_5)+out7_4)+out7_7)+out7_6)<2)")&&(F(("(c9>(((((((out1_0+out1_6)+out1_5)+out1_7)+out1_2)+out1_1)+out1_4)+out1_3))")&&(X("((((((((aux16_0+aux16_1)+aux16_2)+aux16_3)+aux16_4)+aux16_5)+aux16_6)+aux16_7)<=(((aux6_0+aux6_5)+aux6_1)+aux6_4))")))))||(G("((((((((out7_1+out7_0)+out7_3)+out7_2)+out7_5)+out7_4)+out7_7)+out7_6)<2)"))))))))
Formula 0 simplified : !XXX("((((((((out7_1+out7_0)+out7_3)+out7_2)+out7_5)+out7_4)+out7_7)+out7_6)<2)" U (("((((((((out7_1+out7_0)+out7_3)+out7_2)+out7_5)+out7_4)+out7_7)+out7_6)<2)" & F("(c9>(((((((out1_0+out1_6)+out1_5)+out1_7)+out1_2)+out1_1)+out1_4)+out1_3))" & X"((((((((aux16_0+aux16_1)+aux16_2)+aux16_3)+aux16_4)+aux16_5)+aux16_6)+aux16_7)<=(((aux6_0+aux6_5)+aux6_1)+aux6_4))")) | G"((((((((out7_1+out7_0)+out7_3)+out7_2)+out7_5)+out7_4)+out7_7)+out7_6)<2)"))

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PermAdmissibility-PT-50"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is PermAdmissibility-PT-50, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r140-tall-162089128100548"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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