About the Execution of ITS-Tools for PermAdmissibility-COL-50
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16247.079 | 3600000.00 | 3425200.00 | 293479.50 | TFFF?TF?F?FF??FT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r140-tall-162089128000500.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-COL-50, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089128000500
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 9.7K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 111K 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 3.6K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K 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 2.9K Mar 25 08:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 08:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 54K 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-COL-50-00
FORMULA_NAME PermAdmissibility-COL-50-01
FORMULA_NAME PermAdmissibility-COL-50-02
FORMULA_NAME PermAdmissibility-COL-50-03
FORMULA_NAME PermAdmissibility-COL-50-04
FORMULA_NAME PermAdmissibility-COL-50-05
FORMULA_NAME PermAdmissibility-COL-50-06
FORMULA_NAME PermAdmissibility-COL-50-07
FORMULA_NAME PermAdmissibility-COL-50-08
FORMULA_NAME PermAdmissibility-COL-50-09
FORMULA_NAME PermAdmissibility-COL-50-10
FORMULA_NAME PermAdmissibility-COL-50-11
FORMULA_NAME PermAdmissibility-COL-50-12
FORMULA_NAME PermAdmissibility-COL-50-13
FORMULA_NAME PermAdmissibility-COL-50-14
FORMULA_NAME PermAdmissibility-COL-50-15
=== Now, execution of the tool begins
BK_START 1620994971149
Running Version 0
[2021-05-14 12:22:52] [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 12:22:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 12:22:52] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-05-14 12:22:53] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-14 12:22:53] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 575 ms
[2021-05-14 12:22:53] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 15 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 12:22:53] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions in 4 ms.
[2021-05-14 12:22:53] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_3152733593875855953.dot
[2021-05-14 12:22:53] [INFO ] Initial state test concluded for 4 properties.
FORMULA PermAdmissibility-COL-50-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-50-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-50-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 100031 steps, including 122 resets, run finished after 58 ms. (steps per millisecond=1724 ) properties (out of 26) seen :25
Running SMT prover for 1 properties.
// Phase 1: matrix 16 rows 40 cols
[2021-05-14 12:22:53] [INFO ] Computed 24 place invariants in 10 ms
[2021-05-14 12:22:53] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA PermAdmissibility-COL-50-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 12:22:53] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-14 12:22:53] [INFO ] Flatten gal took : 23 ms
FORMULA PermAdmissibility-COL-50-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 12:22:53] [INFO ] Flatten gal took : 5 ms
[2021-05-14 12:22:53] [INFO ] Unfolded HLPN to a Petri net with 208 places and 1024 transitions in 11 ms.
[2021-05-14 12:22:53] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_15646744057895966815.dot
[2021-05-14 12:22:53] [INFO ] Initial state test concluded for 1 properties.
Deduced a syphon composed of 40 places in 6 ms
Reduce places removed 40 places and 432 transitions.
Support contains 106 out of 168 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 128 transition count 592
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 47 place count 121 transition count 480
Iterating global reduction 1 with 7 rules applied. Total rules applied 54 place count 121 transition count 480
Applied a total of 54 rules in 24 ms. Remains 121 /168 variables (removed 47) and now considering 480/592 (removed 112) transitions.
// Phase 1: matrix 480 rows 121 cols
[2021-05-14 12:22:53] [INFO ] Computed 19 place invariants in 13 ms
[2021-05-14 12:22:53] [INFO ] Implicit Places using invariants in 84 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 88 ms to find 1 implicit places.
// Phase 1: matrix 480 rows 120 cols
[2021-05-14 12:22:53] [INFO ] Computed 18 place invariants in 10 ms
[2021-05-14 12:22:54] [INFO ] Dead Transitions using invariants and state equation in 247 ms returned []
Starting structural reductions, iteration 1 : 120/168 places, 480/592 transitions.
Applied a total of 0 rules in 21 ms. Remains 120 /120 variables (removed 0) and now considering 480/480 (removed 0) transitions.
// Phase 1: matrix 480 rows 120 cols
[2021-05-14 12:22:54] [INFO ] Computed 18 place invariants in 5 ms
[2021-05-14 12:22:54] [INFO ] Dead Transitions using invariants and state equation in 198 ms returned []
Finished structural reductions, in 2 iterations. Remains : 120/168 places, 480/592 transitions.
[2021-05-14 12:22:54] [INFO ] Flatten gal took : 60 ms
[2021-05-14 12:22:54] [INFO ] Flatten gal took : 51 ms
[2021-05-14 12:22:54] [INFO ] Input system was already deterministic with 480 transitions.
Finished random walk after 817 steps, including 1 resets, run visited all 22 properties in 2 ms. (steps per millisecond=408 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 8 out of 120 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 120/120 places, 480/480 transitions.
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 96 transition count 480
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 45 place count 75 transition count 340
Iterating global reduction 1 with 21 rules applied. Total rules applied 66 place count 75 transition count 340
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 87 place count 54 transition count 102
Iterating global reduction 1 with 21 rules applied. Total rules applied 108 place count 54 transition count 102
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 114 place count 48 transition count 72
Iterating global reduction 1 with 6 rules applied. Total rules applied 120 place count 48 transition count 72
Applied a total of 120 rules in 15 ms. Remains 48 /120 variables (removed 72) and now considering 72/480 (removed 408) transitions.
// Phase 1: matrix 72 rows 48 cols
[2021-05-14 12:22:54] [INFO ] Computed 15 place invariants in 2 ms
[2021-05-14 12:22:54] [INFO ] Implicit Places using invariants in 54 ms returned [12, 13, 14, 27, 32, 41, 42, 43]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 55 ms to find 8 implicit places.
// Phase 1: matrix 72 rows 40 cols
[2021-05-14 12:22:54] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-14 12:22:54] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
Starting structural reductions, iteration 1 : 40/120 places, 72/480 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 40 cols
[2021-05-14 12:22:54] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-14 12:22:54] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 2 iterations. Remains : 40/120 places, 72/480 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-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 s4 s5 s6 s7 s8 s9 s10 s11))], 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-COL-50-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-50-01 finished in 369 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 120 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 120/120 places, 480/480 transitions.
Graph (complete) has 1007 edges and 120 vertex of which 96 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.4 ms
Discarding 24 places :
Also discarding 0 output transitions
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 22 place count 75 transition count 340
Iterating global reduction 0 with 21 rules applied. Total rules applied 43 place count 75 transition count 340
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 71 place count 47 transition count 88
Iterating global reduction 0 with 28 rules applied. Total rules applied 99 place count 47 transition count 88
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 111 place count 35 transition count 28
Iterating global reduction 0 with 12 rules applied. Total rules applied 123 place count 35 transition count 28
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 127 place count 31 transition count 16
Ensure Unique test removed 2 places
Iterating global reduction 0 with 6 rules applied. Total rules applied 133 place count 29 transition count 16
Applied a total of 133 rules in 25 ms. Remains 29 /120 variables (removed 91) and now considering 16/480 (removed 464) transitions.
// Phase 1: matrix 16 rows 29 cols
[2021-05-14 12:22:54] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-14 12:22:55] [INFO ] Implicit Places using invariants in 42 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 16, 17, 22, 23, 24]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 42 ms to find 13 implicit places.
[2021-05-14 12:22:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2021-05-14 12:22:55] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-14 12:22:55] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Starting structural reductions, iteration 1 : 16/120 places, 16/480 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 16 transition count 2
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 2 transition count 1
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 1 transition count 1
Applied a total of 30 rules in 2 ms. Remains 1 /16 variables (removed 15) and now considering 1/16 (removed 15) transitions.
// Phase 1: matrix 1 rows 1 cols
[2021-05-14 12:22:55] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-14 12:22:55] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-14 12:22:55] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-14 12:22:55] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1/120 places, 1/480 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-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 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-50-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-50-02 finished in 141 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 120 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 120/120 places, 480/480 transitions.
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 104 transition count 480
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 30 place count 90 transition count 354
Iterating global reduction 1 with 14 rules applied. Total rules applied 44 place count 90 transition count 354
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 58 place count 76 transition count 228
Iterating global reduction 1 with 14 rules applied. Total rules applied 72 place count 76 transition count 228
Applied a total of 72 rules in 11 ms. Remains 76 /120 variables (removed 44) and now considering 228/480 (removed 252) transitions.
// Phase 1: matrix 228 rows 76 cols
[2021-05-14 12:22:55] [INFO ] Computed 16 place invariants in 7 ms
[2021-05-14 12:22:55] [INFO ] Implicit Places using invariants in 81 ms returned [4, 13, 54, 63]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 82 ms to find 4 implicit places.
// Phase 1: matrix 228 rows 72 cols
[2021-05-14 12:22:55] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 12:22:55] [INFO ] Dead Transitions using invariants and state equation in 91 ms returned []
Starting structural reductions, iteration 1 : 72/120 places, 228/480 transitions.
Applied a total of 0 rules in 3 ms. Remains 72 /72 variables (removed 0) and now considering 228/228 (removed 0) transitions.
// Phase 1: matrix 228 rows 72 cols
[2021-05-14 12:22:55] [INFO ] Computed 12 place invariants in 4 ms
[2021-05-14 12:22:55] [INFO ] Dead Transitions using invariants and state equation in 117 ms returned []
Finished structural reductions, in 2 iterations. Remains : 72/120 places, 228/480 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-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 s64 s65 s66 s67 s68 s69 s70 s71))], 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 77 steps with 0 reset in 6 ms.
FORMULA PermAdmissibility-COL-50-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-50-03 finished in 424 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 120 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 120/120 places, 480/480 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 112 transition count 480
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 15 place count 105 transition count 368
Iterating global reduction 1 with 7 rules applied. Total rules applied 22 place count 105 transition count 368
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 36 place count 91 transition count 242
Iterating global reduction 1 with 14 rules applied. Total rules applied 50 place count 91 transition count 242
Applied a total of 50 rules in 6 ms. Remains 91 /120 variables (removed 29) and now considering 242/480 (removed 238) transitions.
// Phase 1: matrix 242 rows 91 cols
[2021-05-14 12:22:55] [INFO ] Computed 17 place invariants in 6 ms
[2021-05-14 12:22:55] [INFO ] Implicit Places using invariants in 71 ms returned [4, 13, 70]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 85 ms to find 3 implicit places.
// Phase 1: matrix 242 rows 88 cols
[2021-05-14 12:22:55] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-14 12:22:55] [INFO ] Dead Transitions using invariants and state equation in 113 ms returned []
Starting structural reductions, iteration 1 : 88/120 places, 242/480 transitions.
Applied a total of 0 rules in 2 ms. Remains 88 /88 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 88 cols
[2021-05-14 12:22:55] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-14 12:22:55] [INFO ] Dead Transitions using invariants and state equation in 91 ms returned []
Finished structural reductions, in 2 iterations. Remains : 88/120 places, 242/480 transitions.
Stuttering acceptance computed with spot in 253 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-COL-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 s48 (ADD s72 s73 s74 s75 s76 s77 s78 s79)), p2:(LEQ (ADD s52 s53 s54 s55 s56 s57 s58 s59) (ADD s40 s41 s42 s43)), p0:(GT 2 (ADD s80 s81 s82 s83 s84 s85 s86 s87))], 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 9312 reset in 490 ms.
Product exploration explored 100000 steps with 9216 reset in 407 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 88 transition count 242
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 215 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 9325 reset in 359 ms.
Product exploration explored 100000 steps with 9246 reset in 387 ms.
[2021-05-14 12:22:58] [INFO ] Flatten gal took : 22 ms
[2021-05-14 12:22:58] [INFO ] Flatten gal took : 20 ms
[2021-05-14 12:22:58] [INFO ] Time to serialize gal into /tmp/LTL4743634168234372751.gal : 5 ms
[2021-05-14 12:22:58] [INFO ] Time to serialize properties into /tmp/LTL16719321388292105022.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/LTL4743634168234372751.gal, -t, CGAL, -LTL, /tmp/LTL16719321388292105022.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/LTL4743634168234372751.gal -t CGAL -LTL /tmp/LTL16719321388292105022.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X((G("((((((((out7_0+out7_1)+out7_2)+out7_3)+out7_4)+out7_5)+out7_6)+out7_7)<2)"))||(("((((((((out7_0+out7_1)+out7_2)+out7_3)+out7_4)+out7_5)+out7_6)+out7_7)<2)")&&(F(("(c9_0>(((((((out1_0+out1_1)+out1_2)+out1_3)+out1_4)+out1_5)+out1_6)+out1_7))")&&(X("((((((((aux16_0+aux16_1)+aux16_2)+aux16_3)+aux16_4)+aux16_5)+aux16_6)+aux16_7)<=(((aux6_0+aux6_1)+aux6_4)+aux6_5))"))))))))))
Formula 0 simplified : !XXX(G"((((((((out7_0+out7_1)+out7_2)+out7_3)+out7_4)+out7_5)+out7_6)+out7_7)<2)" | ("((((((((out7_0+out7_1)+out7_2)+out7_3)+out7_4)+out7_5)+out7_6)+out7_7)<2)" & F("(c9_0>(((((((out1_0+out1_1)+out1_2)+out1_3)+out1_4)+out1_5)+out1_6)+out1_7))" & X"((((((((aux16_0+aux16_1)+aux16_2)+aux16_3)+aux16_4)+aux16_5)+aux16_6)+aux16_7)<=(((aux6_0+aux6_1)+aux6_4)+aux6_5))")))
Detected timeout of ITS tools.
[2021-05-14 12:23:13] [INFO ] Flatten gal took : 21 ms
[2021-05-14 12:23:13] [INFO ] Applying decomposition
[2021-05-14 12:23:13] [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/graph8559391308991173881.txt, -o, /tmp/graph8559391308991173881.bin, -w, /tmp/graph8559391308991173881.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/graph8559391308991173881.bin, -l, -1, -v, -w, /tmp/graph8559391308991173881.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 12:23:13] [INFO ] Decomposing Gal with order
[2021-05-14 12:23:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 12:23:13] [INFO ] Removed a total of 153 redundant transitions.
[2021-05-14 12:23:13] [INFO ] Flatten gal took : 79 ms
[2021-05-14 12:23:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 248 labels/synchronizations in 15 ms.
[2021-05-14 12:23:13] [INFO ] Time to serialize gal into /tmp/LTL4455479320665424092.gal : 4 ms
[2021-05-14 12:23:13] [INFO ] Time to serialize properties into /tmp/LTL8345107478908335164.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/LTL4455479320665424092.gal, -t, CGAL, -LTL, /tmp/LTL8345107478908335164.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/LTL4455479320665424092.gal -t CGAL -LTL /tmp/LTL8345107478908335164.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X((G("((((((((gu8.out7_0+gu8.out7_1)+gu8.out7_2)+gu8.out7_3)+gu8.out7_4)+gu8.out7_5)+gu8.out7_6)+gu8.out7_7)<2)"))||(("((((((((gu8.out7_0+gu8.out7_1)+gu8.out7_2)+gu8.out7_3)+gu8.out7_4)+gu8.out7_5)+gu8.out7_6)+gu8.out7_7)<2)")&&(F(("(gu7.c9_0>(((((((gu7.out1_0+gu7.out1_1)+gu7.out1_2)+gu7.out1_3)+gu7.out1_4)+gu7.out1_5)+gu7.out1_6)+gu7.out1_7))")&&(X("((((((((gu2.aux16_0+gu2.aux16_1)+gu2.aux16_2)+gu2.aux16_3)+gu2.aux16_4)+gu2.aux16_5)+gu2.aux16_6)+gu2.aux16_7)<=(((gu2.aux6_0+gu2.aux6_1)+gu2.aux6_4)+gu2.aux6_5))"))))))))))
Formula 0 simplified : !XXX(G"((((((((gu8.out7_0+gu8.out7_1)+gu8.out7_2)+gu8.out7_3)+gu8.out7_4)+gu8.out7_5)+gu8.out7_6)+gu8.out7_7)<2)" | ("((((((((gu8.out7_0+gu8.out7_1)+gu8.out7_2)+gu8.out7_3)+gu8.out7_4)+gu8.out7_5)+gu8.out7_6)+gu8.out7_7)<2)" & F("(gu7.c9_0>(((((((gu7.out1_0+gu7.out1_1)+gu7.out1_2)+gu7.out1_3)+gu7.out1_4)+gu7.out1_5)+gu7.out1_6)+gu7.out1_7))" & X"((((((((gu2.aux16_0+gu2.aux16_1)+gu2.aux16_2)+gu2.aux16_3)+gu2.aux16_4)+gu2.aux16_5)+gu2.aux16_6)+gu2.aux16_7)<=(((gu2.aux6_0+gu2.aux6_1)+gu2.aux6_4)+gu2.aux6_5))")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3435706677305654457
[2021-05-14 12:23:28] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3435706677305654457
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/ltsmin3435706677305654457]
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/ltsmin3435706677305654457] 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/ltsmin3435706677305654457] 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-COL-50-04 finished in 34349 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 120 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 120/120 places, 480/480 transitions.
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 96 transition count 480
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 45 place count 75 transition count 340
Iterating global reduction 1 with 21 rules applied. Total rules applied 66 place count 75 transition count 340
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 87 place count 54 transition count 102
Iterating global reduction 1 with 21 rules applied. Total rules applied 108 place count 54 transition count 102
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 114 place count 48 transition count 72
Iterating global reduction 1 with 6 rules applied. Total rules applied 120 place count 48 transition count 72
Applied a total of 120 rules in 7 ms. Remains 48 /120 variables (removed 72) and now considering 72/480 (removed 408) transitions.
// Phase 1: matrix 72 rows 48 cols
[2021-05-14 12:23:29] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-14 12:23:30] [INFO ] Implicit Places using invariants in 109 ms returned [12, 13, 14, 27, 32, 41, 42, 43]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 110 ms to find 8 implicit places.
// Phase 1: matrix 72 rows 40 cols
[2021-05-14 12:23:30] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-14 12:23:30] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
Starting structural reductions, iteration 1 : 40/120 places, 72/480 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 40 cols
[2021-05-14 12:23:30] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-14 12:23:30] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 2 iterations. Remains : 40/120 places, 72/480 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-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 s4 s5 s6 s7 s8 s9 s10 s11) s38)], 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 136 ms.
Product exploration explored 100000 steps with 50000 reset in 134 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 72
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 45 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 123 ms.
Product exploration explored 100000 steps with 50000 reset in 132 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Support contains 9 out of 40 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 40/40 places, 72/72 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 40 transition count 72
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 3 place count 40 transition count 72
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 40 transition count 72
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 38 transition count 70
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 38 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 38 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 37 transition count 69
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 37 transition count 69
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 12 rules in 7 ms. Remains 37 /40 variables (removed 3) and now considering 69/72 (removed 3) transitions.
[2021-05-14 12:23:30] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 69 rows 37 cols
[2021-05-14 12:23:30] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-14 12:23:30] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 37/40 places, 69/72 transitions.
Product exploration explored 100000 steps with 50000 reset in 307 ms.
Product exploration explored 100000 steps with 50000 reset in 272 ms.
[2021-05-14 12:23:31] [INFO ] Flatten gal took : 10 ms
[2021-05-14 12:23:31] [INFO ] Flatten gal took : 4 ms
[2021-05-14 12:23:31] [INFO ] Time to serialize gal into /tmp/LTL9812354930492243250.gal : 1 ms
[2021-05-14 12:23:31] [INFO ] Time to serialize properties into /tmp/LTL16885390875289118461.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/LTL9812354930492243250.gal, -t, CGAL, -LTL, /tmp/LTL16885390875289118461.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/LTL9812354930492243250.gal -t CGAL -LTL /tmp/LTL16885390875289118461.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((((((((aux9_0+aux9_1)+aux9_2)+aux9_3)+aux9_4)+aux9_5)+aux9_6)+aux9_7)<=c19_0)"))))
Formula 0 simplified : !XF"((((((((aux9_0+aux9_1)+aux9_2)+aux9_3)+aux9_4)+aux9_5)+aux9_6)+aux9_7)<=c19_0)"
Detected timeout of ITS tools.
[2021-05-14 12:23:46] [INFO ] Flatten gal took : 14 ms
[2021-05-14 12:23:46] [INFO ] Applying decomposition
[2021-05-14 12:23: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/graph7636852478863202219.txt, -o, /tmp/graph7636852478863202219.bin, -w, /tmp/graph7636852478863202219.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/graph7636852478863202219.bin, -l, -1, -v, -w, /tmp/graph7636852478863202219.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 12:23:46] [INFO ] Decomposing Gal with order
[2021-05-14 12:23:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 12:23:46] [INFO ] Removed a total of 40 redundant transitions.
[2021-05-14 12:23:46] [INFO ] Flatten gal took : 9 ms
[2021-05-14 12:23:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 2 ms.
[2021-05-14 12:23:46] [INFO ] Time to serialize gal into /tmp/LTL1843536469525301451.gal : 1 ms
[2021-05-14 12:23:46] [INFO ] Time to serialize properties into /tmp/LTL33816212811132369.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/LTL1843536469525301451.gal, -t, CGAL, -LTL, /tmp/LTL33816212811132369.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/LTL1843536469525301451.gal -t CGAL -LTL /tmp/LTL33816212811132369.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((((((((gu5.aux9_0+gu5.aux9_1)+gu5.aux9_2)+gu5.aux9_3)+gu5.aux9_4)+gu5.aux9_5)+gu5.aux9_6)+gu5.aux9_7)<=gu5.c19_0)"))))
Formula 0 simplified : !XF"((((((((gu5.aux9_0+gu5.aux9_1)+gu5.aux9_2)+gu5.aux9_3)+gu5.aux9_4)+gu5.aux9_5)+gu5.aux9_6)+gu5.aux9_7)<=gu5.c19_0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1978650030467283604
[2021-05-14 12:24:01] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1978650030467283604
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/ltsmin1978650030467283604]
Compilation finished in 350 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin1978650030467283604]
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/ltsmin1978650030467283604]
LTSmin run took 358 ms.
FORMULA PermAdmissibility-COL-50-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-50-05 finished in 32604 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 120 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 120/120 places, 480/480 transitions.
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 104 transition count 480
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 30 place count 90 transition count 354
Iterating global reduction 1 with 14 rules applied. Total rules applied 44 place count 90 transition count 354
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 51 place count 83 transition count 242
Iterating global reduction 1 with 7 rules applied. Total rules applied 58 place count 83 transition count 242
Applied a total of 58 rules in 6 ms. Remains 83 /120 variables (removed 37) and now considering 242/480 (removed 238) transitions.
// Phase 1: matrix 242 rows 83 cols
[2021-05-14 12:24:02] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-14 12:24:02] [INFO ] Implicit Places using invariants in 62 ms returned [4, 69, 70]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 65 ms to find 3 implicit places.
// Phase 1: matrix 242 rows 80 cols
[2021-05-14 12:24:02] [INFO ] Computed 13 place invariants in 2 ms
[2021-05-14 12:24:02] [INFO ] Dead Transitions using invariants and state equation in 98 ms returned []
Starting structural reductions, iteration 1 : 80/120 places, 242/480 transitions.
Applied a total of 0 rules in 6 ms. Remains 80 /80 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 80 cols
[2021-05-14 12:24:02] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-14 12:24:02] [INFO ] Dead Transitions using invariants and state equation in 95 ms returned []
Finished structural reductions, in 2 iterations. Remains : 80/120 places, 242/480 transitions.
Stuttering acceptance computed with spot in 110 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-COL-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 s12 s13 s14 s15 s16 s17 s18 s19) s59), p1:(LEQ (ADD s72 s73 s74 s75 s76 s77 s78 s79) s0)], 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 16 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-COL-50-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-50-06 finished in 399 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 120 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 120/120 places, 480/480 transitions.
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 104 transition count 480
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 23 place count 97 transition count 368
Iterating global reduction 1 with 7 rules applied. Total rules applied 30 place count 97 transition count 368
Applied a total of 30 rules in 4 ms. Remains 97 /120 variables (removed 23) and now considering 368/480 (removed 112) transitions.
// Phase 1: matrix 368 rows 97 cols
[2021-05-14 12:24:02] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-14 12:24:02] [INFO ] Implicit Places using invariants in 62 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
// Phase 1: matrix 368 rows 96 cols
[2021-05-14 12:24:02] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-14 12:24:03] [INFO ] Dead Transitions using invariants and state equation in 142 ms returned []
Starting structural reductions, iteration 1 : 96/120 places, 368/480 transitions.
Applied a total of 0 rules in 6 ms. Remains 96 /96 variables (removed 0) and now considering 368/368 (removed 0) transitions.
// Phase 1: matrix 368 rows 96 cols
[2021-05-14 12:24:03] [INFO ] Computed 15 place invariants in 2 ms
[2021-05-14 12:24:03] [INFO ] Dead Transitions using invariants and state equation in 137 ms returned []
Finished structural reductions, in 2 iterations. Remains : 96/120 places, 368/480 transitions.
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))]
Running random walk in product with property : PermAdmissibility-COL-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 s67) (LEQ (ADD s28 s29 s30 s31 s32 s33 s34 s35) (ADD s88 s89 s90 s91 s92 s93 s94 s95))), p1:(LEQ (ADD s68 s69 s70 s71 s72 s73 s74 s75) s3), p2:(GT s0 (ADD s60 s61 s62 s63))], 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 188 ms.
Product exploration explored 100000 steps with 50000 reset in 200 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 96 transition count 368
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 108 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 185 ms.
Product exploration explored 100000 steps with 50000 reset in 203 ms.
Applying partial POR strategy [true, true, true, false]
Stuttering acceptance computed with spot in 103 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 96 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 96/96 places, 368/368 transitions.
Applied a total of 0 rules in 8 ms. Remains 96 /96 variables (removed 0) and now considering 368/368 (removed 0) transitions.
[2021-05-14 12:24:04] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 368 rows 96 cols
[2021-05-14 12:24:04] [INFO ] Computed 15 place invariants in 2 ms
[2021-05-14 12:24:04] [INFO ] Dead Transitions using invariants and state equation in 150 ms returned []
Finished structural reductions, in 1 iterations. Remains : 96/96 places, 368/368 transitions.
Product exploration explored 100000 steps with 50000 reset in 641 ms.
Product exploration explored 100000 steps with 50000 reset in 619 ms.
[2021-05-14 12:24:06] [INFO ] Flatten gal took : 24 ms
[2021-05-14 12:24:06] [INFO ] Flatten gal took : 23 ms
[2021-05-14 12:24:06] [INFO ] Time to serialize gal into /tmp/LTL9201729987393920854.gal : 3 ms
[2021-05-14 12:24:06] [INFO ] Time to serialize properties into /tmp/LTL2686204259384496357.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/LTL9201729987393920854.gal, -t, CGAL, -LTL, /tmp/LTL2686204259384496357.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/LTL9201729987393920854.gal -t CGAL -LTL /tmp/LTL2686204259384496357.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((("((c12_0>=1)||((((((((aux12_0+aux12_1)+aux12_2)+aux12_3)+aux12_4)+aux12_5)+aux12_6)+aux12_7)<=(((((((out2_0+out2_1)+out2_2)+out2_3)+out2_4)+out2_5)+out2_6)+out2_7)))")||(F(G("((((((((aux16_0+aux16_1)+aux16_2)+aux16_3)+aux16_4)+aux16_5)+aux16_6)+aux16_7)<=c13_0)"))))||(G(F("(c16_0>(((aux5_0+aux5_1)+aux5_4)+aux5_5))"))))))
Formula 0 simplified : !X("((c12_0>=1)||((((((((aux12_0+aux12_1)+aux12_2)+aux12_3)+aux12_4)+aux12_5)+aux12_6)+aux12_7)<=(((((((out2_0+out2_1)+out2_2)+out2_3)+out2_4)+out2_5)+out2_6)+out2_7)))" | FG"((((((((aux16_0+aux16_1)+aux16_2)+aux16_3)+aux16_4)+aux16_5)+aux16_6)+aux16_7)<=c13_0)" | GF"(c16_0>(((aux5_0+aux5_1)+aux5_4)+aux5_5))")
Detected timeout of ITS tools.
[2021-05-14 12:24:21] [INFO ] Flatten gal took : 40 ms
[2021-05-14 12:24:21] [INFO ] Applying decomposition
[2021-05-14 12:24:21] [INFO ] Flatten gal took : 21 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/graph6944953047133484194.txt, -o, /tmp/graph6944953047133484194.bin, -w, /tmp/graph6944953047133484194.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/graph6944953047133484194.bin, -l, -1, -v, -w, /tmp/graph6944953047133484194.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 12:24:21] [INFO ] Decomposing Gal with order
[2021-05-14 12:24:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 12:24:21] [INFO ] Removed a total of 479 redundant transitions.
[2021-05-14 12:24:21] [INFO ] Flatten gal took : 66 ms
[2021-05-14 12:24:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 192 labels/synchronizations in 7 ms.
[2021-05-14 12:24:21] [INFO ] Time to serialize gal into /tmp/LTL5524228712125876116.gal : 3 ms
[2021-05-14 12:24:21] [INFO ] Time to serialize properties into /tmp/LTL10382079250704933764.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/LTL5524228712125876116.gal, -t, CGAL, -LTL, /tmp/LTL10382079250704933764.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/LTL5524228712125876116.gal -t CGAL -LTL /tmp/LTL10382079250704933764.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((("((gi0.gu0.c12_0>=1)||((((((((gu5.aux12_0+gu5.aux12_1)+gu5.aux12_2)+gu5.aux12_3)+gu5.aux12_4)+gu5.aux12_5)+gu5.aux12_6)+gu5.aux12_7)<=(((((((gu5.out2_0+gu5.out2_1)+gu5.out2_2)+gu5.out2_3)+gu5.out2_4)+gu5.out2_5)+gu5.out2_6)+gu5.out2_7)))")||(F(G("((((((((gu3.aux16_0+gu3.aux16_1)+gu3.aux16_2)+gu3.aux16_3)+gu3.aux16_4)+gu3.aux16_5)+gu3.aux16_6)+gu3.aux16_7)<=gu3.c13_0)"))))||(G(F("(gi0.gu2.c16_0>(((gi0.gu2.aux5_0+gi0.gu2.aux5_1)+gi0.gu2.aux5_4)+gi0.gu2.aux5_5))"))))))
Formula 0 simplified : !X("((gi0.gu0.c12_0>=1)||((((((((gu5.aux12_0+gu5.aux12_1)+gu5.aux12_2)+gu5.aux12_3)+gu5.aux12_4)+gu5.aux12_5)+gu5.aux12_6)+gu5.aux12_7)<=(((((((gu5.out2_0+gu5.out2_1)+gu5.out2_2)+gu5.out2_3)+gu5.out2_4)+gu5.out2_5)+gu5.out2_6)+gu5.out2_7)))" | FG"((((((((gu3.aux16_0+gu3.aux16_1)+gu3.aux16_2)+gu3.aux16_3)+gu3.aux16_4)+gu3.aux16_5)+gu3.aux16_6)+gu3.aux16_7)<=gu3.c13_0)" | GF"(gi0.gu2.c16_0>(((gi0.gu2.aux5_0+gi0.gu2.aux5_1)+gi0.gu2.aux5_4)+gi0.gu2.aux5_5))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8725201982996833149
[2021-05-14 12:24:36] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8725201982996833149
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/ltsmin8725201982996833149]
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/ltsmin8725201982996833149] 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/ltsmin8725201982996833149] 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-COL-50-07 finished in 34624 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((X(p0)&&(X(p2)||p1))) U p3))], workingDir=/home/mcc/execution]
Support contains 15 out of 120 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 120/120 places, 480/480 transitions.
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 104 transition count 480
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 30 place count 90 transition count 354
Iterating global reduction 1 with 14 rules applied. Total rules applied 44 place count 90 transition count 354
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 58 place count 76 transition count 228
Iterating global reduction 1 with 14 rules applied. Total rules applied 72 place count 76 transition count 228
Applied a total of 72 rules in 12 ms. Remains 76 /120 variables (removed 44) and now considering 228/480 (removed 252) transitions.
// Phase 1: matrix 228 rows 76 cols
[2021-05-14 12:24:37] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-14 12:24:37] [INFO ] Implicit Places using invariants in 62 ms returned [12, 21, 54, 55]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 63 ms to find 4 implicit places.
// Phase 1: matrix 228 rows 72 cols
[2021-05-14 12:24:37] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 12:24:37] [INFO ] Dead Transitions using invariants and state equation in 94 ms returned []
Starting structural reductions, iteration 1 : 72/120 places, 228/480 transitions.
Applied a total of 0 rules in 2 ms. Remains 72 /72 variables (removed 0) and now considering 228/228 (removed 0) transitions.
// Phase 1: matrix 228 rows 72 cols
[2021-05-14 12:24:37] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 12:24:37] [INFO ] Dead Transitions using invariants and state equation in 79 ms returned []
Finished structural reductions, in 2 iterations. Remains : 72/120 places, 228/480 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND p0 (NOT p2)), true]
Running random walk in product with property : PermAdmissibility-COL-50-08 automaton TGBA [mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(NOT p3), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(LEQ 1 (ADD s40 s41 s42 s43)), p1:(OR (GT s23 (ADD s64 s65 s66 s67 s68 s69 s70 s71)) (GT s0 s25)), p0:(LEQ s23 (ADD s64 s65 s66 s67 s68 s69 s70 s71)), p2:(GT s0 s25)], 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-COL-50-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-50-08 finished in 372 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G((F(!p1)&&F(G(p0)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 120 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 120/120 places, 480/480 transitions.
Graph (complete) has 1007 edges and 120 vertex of which 96 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.2 ms
Discarding 24 places :
Also discarding 0 output transitions
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 22 place count 75 transition count 340
Iterating global reduction 0 with 21 rules applied. Total rules applied 43 place count 75 transition count 340
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 71 place count 47 transition count 88
Iterating global reduction 0 with 28 rules applied. Total rules applied 99 place count 47 transition count 88
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 111 place count 35 transition count 28
Iterating global reduction 0 with 12 rules applied. Total rules applied 123 place count 35 transition count 28
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 126 place count 32 transition count 18
Ensure Unique test removed 1 places
Iterating global reduction 0 with 4 rules applied. Total rules applied 130 place count 31 transition count 18
Applied a total of 130 rules in 13 ms. Remains 31 /120 variables (removed 89) and now considering 18/480 (removed 462) transitions.
// Phase 1: matrix 18 rows 31 cols
[2021-05-14 12:24:37] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-14 12:24:37] [INFO ] Implicit Places using invariants in 28 ms returned [4, 5, 6, 7, 8, 15, 16, 17, 18, 19, 24, 25, 26]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 29 ms to find 13 implicit places.
[2021-05-14 12:24:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 18 rows 18 cols
[2021-05-14 12:24:37] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-14 12:24:37] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Starting structural reductions, iteration 1 : 18/120 places, 18/480 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 18 transition count 8
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 8 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 7 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 22 place count 7 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 6 transition count 6
Applied a total of 24 rules in 1 ms. Remains 6 /18 variables (removed 12) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 6 cols
[2021-05-14 12:24:37] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-14 12:24:37] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2021-05-14 12:24:37] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-14 12:24:37] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 17 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 6/120 places, 6/480 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-50-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s4 s5) s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 705 reset in 79 ms.
Product exploration explored 100000 steps with 702 reset in 136 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 6
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)))), (NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Product exploration explored 100000 steps with 705 reset in 99 ms.
Product exploration explored 100000 steps with 704 reset in 92 ms.
Starting structural reductions, iteration 0 : 6/6 places, 6/6 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 6 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 5 transition count 5
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 4 transition count 3
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 4 transition count 3
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 4 transition count 2
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6 place count 3 transition count 2
Applied a total of 6 rules in 4 ms. Remains 3 /6 variables (removed 3) and now considering 2/6 (removed 4) transitions.
// Phase 1: matrix 2 rows 3 cols
[2021-05-14 12:24:38] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-14 12:24:38] [INFO ] Implicit Places using invariants in 9 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 10 ms to find 1 implicit places.
[2021-05-14 12:24:38] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-14 12:24:38] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-14 12:24:38] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Starting structural reductions, iteration 1 : 2/6 places, 2/6 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 0 transition count 0
Applied a total of 1 rules in 0 ms. Remains 0 /2 variables (removed 2) and now considering 0/2 (removed 2) transitions.
[2021-05-14 12:24:38] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-14 12:24:38] [INFO ] Implicit Places using invariants in 4 ms returned []
[2021-05-14 12:24:38] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-14 12:24:38] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 12 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 0/6 places, 0/6 transitions.
[2021-05-14 12:24:38] [INFO ] Flatten gal took : 27 ms
[2021-05-14 12:24:38] [INFO ] Flatten gal took : 26 ms
[2021-05-14 12:24:38] [INFO ] Time to serialize gal into /tmp/LTL17792327614144764588.gal : 3 ms
[2021-05-14 12:24:38] [INFO ] Time to serialize properties into /tmp/LTL8633053782745547337.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/LTL17792327614144764588.gal, -t, CGAL, -LTL, /tmp/LTL8633053782745547337.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/LTL17792327614144764588.gal -t CGAL -LTL /tmp/LTL8633053782745547337.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 5 LTL properties
Checking formula 0 : !((X(X(X((G("((((((((out7_0+out7_1)+out7_2)+out7_3)+out7_4)+out7_5)+out7_6)+out7_7)<2)"))||(("((((((((out7_0+out7_1)+out7_2)+out7_3)+out7_4)+out7_5)+out7_6)+out7_7)<2)")&&(F(("(c9_0>(((((((out1_0+out1_1)+out1_2)+out1_3)+out1_4)+out1_5)+out1_6)+out1_7))")&&(X("((((((((aux16_0+aux16_1)+aux16_2)+aux16_3)+aux16_4)+aux16_5)+aux16_6)+aux16_7)<=(((aux6_0+aux6_1)+aux6_4)+aux6_5))"))))))))))
Formula 0 simplified : !XXX(G"((((((((out7_0+out7_1)+out7_2)+out7_3)+out7_4)+out7_5)+out7_6)+out7_7)<2)" | ("((((((((out7_0+out7_1)+out7_2)+out7_3)+out7_4)+out7_5)+out7_6)+out7_7)<2)" & F("(c9_0>(((((((out1_0+out1_1)+out1_2)+out1_3)+out1_4)+out1_5)+out1_6)+out1_7))" & X"((((((((aux16_0+aux16_1)+aux16_2)+aux16_3)+aux16_4)+aux16_5)+aux16_6)+aux16_7)<=(((aux6_0+aux6_1)+aux6_4)+aux6_5))")))
Detected timeout of ITS tools.
[2021-05-14 12:24:53] [INFO ] Flatten gal took : 27 ms
[2021-05-14 12:24:53] [INFO ] Applying decomposition
[2021-05-14 12:24:53] [INFO ] Flatten gal took : 27 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/graph7763085264087889811.txt, -o, /tmp/graph7763085264087889811.bin, -w, /tmp/graph7763085264087889811.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/graph7763085264087889811.bin, -l, -1, -v, -w, /tmp/graph7763085264087889811.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 12:24:53] [INFO ] Decomposing Gal with order
[2021-05-14 12:24:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 12:24:53] [INFO ] Removed a total of 1135 redundant transitions.
[2021-05-14 12:24:53] [INFO ] Flatten gal took : 95 ms
[2021-05-14 12:24:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 10 ms.
[2021-05-14 12:24:53] [INFO ] Time to serialize gal into /tmp/LTL7508773708167687876.gal : 2 ms
[2021-05-14 12:24:53] [INFO ] Time to serialize properties into /tmp/LTL6554224226401435669.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/LTL7508773708167687876.gal, -t, CGAL, -LTL, /tmp/LTL6554224226401435669.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/LTL7508773708167687876.gal -t CGAL -LTL /tmp/LTL6554224226401435669.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 5 LTL properties
Checking formula 0 : !((X(X(X((G("((((((((gu10.out7_0+gu10.out7_1)+gu10.out7_2)+gu10.out7_3)+gu10.out7_4)+gu10.out7_5)+gu10.out7_6)+gu10.out7_7)<2)"))||(("((((((((gu10.out7_0+gu10.out7_1)+gu10.out7_2)+gu10.out7_3)+gu10.out7_4)+gu10.out7_5)+gu10.out7_6)+gu10.out7_7)<2)")&&(F(("(gu8.c9_0>(((((((gu8.out1_0+gu8.out1_1)+gu8.out1_2)+gu8.out1_3)+gu8.out1_4)+gu8.out1_5)+gu8.out1_6)+gu8.out1_7))")&&(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_1)+gu5.aux6_4)+gu5.aux6_5))"))))))))))
Formula 0 simplified : !XXX(G"((((((((gu10.out7_0+gu10.out7_1)+gu10.out7_2)+gu10.out7_3)+gu10.out7_4)+gu10.out7_5)+gu10.out7_6)+gu10.out7_7)<2)" | ("((((((((gu10.out7_0+gu10.out7_1)+gu10.out7_2)+gu10.out7_3)+gu10.out7_4)+gu10.out7_5)+gu10.out7_6)+gu10.out7_7)<2)" & F("(gu8.c9_0>(((((((gu8.out1_0+gu8.out1_1)+gu8.out1_2)+gu8.out1_3)+gu8.out1_4)+gu8.out1_5)+gu8.out1_6)+gu8.out1_7))" & 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_1)+gu5.aux6_4)+gu5.aux6_5))")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15704999170476206790
[2021-05-14 12:25:08] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15704999170476206790
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/ltsmin15704999170476206790]
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/ltsmin15704999170476206790] 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/ltsmin15704999170476206790] 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-COL-50-09 finished in 32109 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((F(p0)||G((p1 U X(p1)))))))], workingDir=/home/mcc/execution]
Support contains 19 out of 120 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 120/120 places, 480/480 transitions.
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 96 transition count 480
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 31 place count 89 transition count 466
Iterating global reduction 1 with 7 rules applied. Total rules applied 38 place count 89 transition count 466
Applied a total of 38 rules in 4 ms. Remains 89 /120 variables (removed 31) and now considering 466/480 (removed 14) transitions.
// Phase 1: matrix 466 rows 89 cols
[2021-05-14 12:25:10] [INFO ] Computed 15 place invariants in 2 ms
[2021-05-14 12:25:10] [INFO ] Implicit Places using invariants in 105 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 117 ms to find 1 implicit places.
// Phase 1: matrix 466 rows 88 cols
[2021-05-14 12:25:10] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-14 12:25:10] [INFO ] Dead Transitions using invariants and state equation in 243 ms returned []
Starting structural reductions, iteration 1 : 88/120 places, 466/480 transitions.
Applied a total of 0 rules in 10 ms. Remains 88 /88 variables (removed 0) and now considering 466/466 (removed 0) transitions.
// Phase 1: matrix 466 rows 88 cols
[2021-05-14 12:25:10] [INFO ] Computed 14 place invariants in 4 ms
[2021-05-14 12:25:10] [INFO ] Dead Transitions using invariants and state equation in 185 ms returned []
Finished structural reductions, in 2 iterations. Remains : 88/120 places, 466/480 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-COL-50-12 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(GT s3 (ADD s76 s77 s78 s79 s80 s81 s82 s83)), p1:(LEQ (ADD s68 s69 s70 s71 s72 s73 s74 s75) (ADD s42 s43))], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 4579 reset in 519 ms.
Product exploration explored 100000 steps with 4599 reset in 531 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 88 transition count 466
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)))), (NOT p0), p1]
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4679 reset in 508 ms.
Product exploration explored 100000 steps with 4636 reset in 540 ms.
Applying partial POR strategy [false, false, false, true, false]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 19 out of 88 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 88/88 places, 466/466 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 88 transition count 466
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 88 transition count 466
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 87 transition count 465
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 87 transition count 465
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 4 rules in 18 ms. Remains 87 /88 variables (removed 1) and now considering 465/466 (removed 1) transitions.
[2021-05-14 12:25:13] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 465 rows 87 cols
[2021-05-14 12:25:13] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-14 12:25:13] [INFO ] Dead Transitions using invariants and state equation in 156 ms returned []
Finished structural reductions, in 1 iterations. Remains : 87/88 places, 465/466 transitions.
Product exploration explored 100000 steps with 4632 reset in 544 ms.
Product exploration explored 100000 steps with 4619 reset in 558 ms.
[2021-05-14 12:25:14] [INFO ] Flatten gal took : 24 ms
[2021-05-14 12:25:14] [INFO ] Flatten gal took : 24 ms
[2021-05-14 12:25:14] [INFO ] Time to serialize gal into /tmp/LTL17285667496623665355.gal : 5 ms
[2021-05-14 12:25:14] [INFO ] Time to serialize properties into /tmp/LTL3271457875897204688.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/LTL17285667496623665355.gal, -t, CGAL, -LTL, /tmp/LTL3271457875897204688.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/LTL17285667496623665355.gal -t CGAL -LTL /tmp/LTL3271457875897204688.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X((F("(c13_0>(((((((aux13_0+aux13_1)+aux13_2)+aux13_3)+aux13_4)+aux13_5)+aux13_6)+aux13_7))"))||(G(("((((((((aux15_0+aux15_1)+aux15_2)+aux15_3)+aux15_4)+aux15_5)+aux15_6)+aux15_7)<=(in2_2+in2_3))")U(X("((((((((aux15_0+aux15_1)+aux15_2)+aux15_3)+aux15_4)+aux15_5)+aux15_6)+aux15_7)<=(in2_2+in2_3))"))))))))
Formula 0 simplified : !XX(F"(c13_0>(((((((aux13_0+aux13_1)+aux13_2)+aux13_3)+aux13_4)+aux13_5)+aux13_6)+aux13_7))" | G("((((((((aux15_0+aux15_1)+aux15_2)+aux15_3)+aux15_4)+aux15_5)+aux15_6)+aux15_7)<=(in2_2+in2_3))" U X"((((((((aux15_0+aux15_1)+aux15_2)+aux15_3)+aux15_4)+aux15_5)+aux15_6)+aux15_7)<=(in2_2+in2_3))"))
Detected timeout of ITS tools.
[2021-05-14 12:25:29] [INFO ] Flatten gal took : 26 ms
[2021-05-14 12:25:29] [INFO ] Applying decomposition
[2021-05-14 12:25:29] [INFO ] Flatten gal took : 23 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/graph11008942325698597938.txt, -o, /tmp/graph11008942325698597938.bin, -w, /tmp/graph11008942325698597938.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/graph11008942325698597938.bin, -l, -1, -v, -w, /tmp/graph11008942325698597938.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 12:25:29] [INFO ] Decomposing Gal with order
[2021-05-14 12:25:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 12:25:29] [INFO ] Removed a total of 581 redundant transitions.
[2021-05-14 12:25:29] [INFO ] Flatten gal took : 62 ms
[2021-05-14 12:25:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 432 labels/synchronizations in 18 ms.
[2021-05-14 12:25:29] [INFO ] Time to serialize gal into /tmp/LTL5628102810822084179.gal : 2 ms
[2021-05-14 12:25:29] [INFO ] Time to serialize properties into /tmp/LTL14423209712431269732.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/LTL5628102810822084179.gal, -t, CGAL, -LTL, /tmp/LTL14423209712431269732.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/LTL5628102810822084179.gal -t CGAL -LTL /tmp/LTL14423209712431269732.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X((F("(gu1.c13_0>(((((((gu1.aux13_0+gu1.aux13_1)+gu1.aux13_2)+gu1.aux13_3)+gu1.aux13_4)+gu1.aux13_5)+gu1.aux13_6)+gu1.aux13_7))"))||(G(("((((((((gu3.aux15_0+gu3.aux15_1)+gu3.aux15_2)+gu3.aux15_3)+gu3.aux15_4)+gu3.aux15_5)+gu3.aux15_6)+gu3.aux15_7)<=(gu3.in2_2+gu3.in2_3))")U(X("((((((((gu3.aux15_0+gu3.aux15_1)+gu3.aux15_2)+gu3.aux15_3)+gu3.aux15_4)+gu3.aux15_5)+gu3.aux15_6)+gu3.aux15_7)<=(gu3.in2_2+gu3.in2_3))"))))))))
Formula 0 simplified : !XX(F"(gu1.c13_0>(((((((gu1.aux13_0+gu1.aux13_1)+gu1.aux13_2)+gu1.aux13_3)+gu1.aux13_4)+gu1.aux13_5)+gu1.aux13_6)+gu1.aux13_7))" | G("((((((((gu3.aux15_0+gu3.aux15_1)+gu3.aux15_2)+gu3.aux15_3)+gu3.aux15_4)+gu3.aux15_5)+gu3.aux15_6)+gu3.aux15_7)<=(gu3.in2_2+gu3.in2_3))" U X"((((((((gu3.aux15_0+gu3.aux15_1)+gu3.aux15_2)+gu3.aux15_3)+gu3.aux15_4)+gu3.aux15_5)+gu3.aux15_6)+gu3.aux15_7)<=(gu3.in2_2+gu3.in2_3))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13569049966835460142
[2021-05-14 12:25:44] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13569049966835460142
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/ltsmin13569049966835460142]
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/ltsmin13569049966835460142] 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/ltsmin13569049966835460142] 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-COL-50-12 finished in 36020 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((F(p0)&&G((p1 U X(p2)))))))], workingDir=/home/mcc/execution]
Support contains 22 out of 120 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 120/120 places, 480/480 transitions.
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 104 transition count 480
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 30 place count 90 transition count 354
Iterating global reduction 1 with 14 rules applied. Total rules applied 44 place count 90 transition count 354
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 58 place count 76 transition count 228
Iterating global reduction 1 with 14 rules applied. Total rules applied 72 place count 76 transition count 228
Applied a total of 72 rules in 4 ms. Remains 76 /120 variables (removed 44) and now considering 228/480 (removed 252) transitions.
// Phase 1: matrix 228 rows 76 cols
[2021-05-14 12:25:46] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-14 12:25:46] [INFO ] Implicit Places using invariants in 53 ms returned [4, 13, 54, 63]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 54 ms to find 4 implicit places.
// Phase 1: matrix 228 rows 72 cols
[2021-05-14 12:25:46] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-14 12:25:46] [INFO ] Dead Transitions using invariants and state equation in 94 ms returned []
Starting structural reductions, iteration 1 : 72/120 places, 228/480 transitions.
Applied a total of 0 rules in 8 ms. Remains 72 /72 variables (removed 0) and now considering 228/228 (removed 0) transitions.
// Phase 1: matrix 228 rows 72 cols
[2021-05-14 12:25:46] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 12:25:46] [INFO ] Dead Transitions using invariants and state equation in 104 ms returned []
Finished structural reductions, in 2 iterations. Remains : 72/120 places, 228/480 transitions.
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (NOT p0), (NOT p2)]
Running random walk in product with property : PermAdmissibility-COL-50-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 5}], [{ cond=p1, acceptance={0} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(GT (ADD s36 s37 s38 s39) (ADD s64 s65 s66 s67 s68 s69 s70 s71)), p0:(LEQ (ADD s4 s5 s6 s7 s8 s9 s10 s11) s60), p2:(LEQ s1 s60)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25020 reset in 219 ms.
Product exploration explored 100000 steps with 24940 reset in 236 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 72 transition count 228
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 p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (NOT p1), p0, p2]
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 24885 reset in 210 ms.
Product exploration explored 100000 steps with 24986 reset in 229 ms.
Applying partial POR strategy [false, false, false, false, true, false]
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (NOT p0), (NOT p2)]
Support contains 22 out of 72 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 72/72 places, 228/228 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 72 transition count 228
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 72 transition count 228
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 72 transition count 228
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 72 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 71 transition count 227
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 71 transition count 227
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 5 rules in 11 ms. Remains 71 /72 variables (removed 1) and now considering 227/228 (removed 1) transitions.
[2021-05-14 12:25:48] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 227 rows 71 cols
[2021-05-14 12:25:48] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 12:25:48] [INFO ] Dead Transitions using invariants and state equation in 91 ms returned []
Finished structural reductions, in 1 iterations. Remains : 71/72 places, 227/228 transitions.
Product exploration explored 100000 steps with 25060 reset in 219 ms.
Product exploration explored 100000 steps with 25078 reset in 249 ms.
[2021-05-14 12:25:48] [INFO ] Flatten gal took : 12 ms
[2021-05-14 12:25:48] [INFO ] Flatten gal took : 10 ms
[2021-05-14 12:25:48] [INFO ] Time to serialize gal into /tmp/LTL18017576896740621693.gal : 1 ms
[2021-05-14 12:25:48] [INFO ] Time to serialize properties into /tmp/LTL8224919123451347642.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/LTL18017576896740621693.gal, -t, CGAL, -LTL, /tmp/LTL8224919123451347642.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/LTL18017576896740621693.gal -t CGAL -LTL /tmp/LTL8224919123451347642.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((F("((((((((aux10_0+aux10_1)+aux10_2)+aux10_3)+aux10_4)+aux10_5)+aux10_6)+aux10_7)<=c17_0)"))&&(G(("((((aux7_2+aux7_3)+aux7_6)+aux7_7)>(((((((out1_0+out1_1)+out1_2)+out1_3)+out1_4)+out1_5)+out1_6)+out1_7))")U(X("(c15_0<=c17_0)"))))))))
Formula 0 simplified : !XF(F"((((((((aux10_0+aux10_1)+aux10_2)+aux10_3)+aux10_4)+aux10_5)+aux10_6)+aux10_7)<=c17_0)" & G("((((aux7_2+aux7_3)+aux7_6)+aux7_7)>(((((((out1_0+out1_1)+out1_2)+out1_3)+out1_4)+out1_5)+out1_6)+out1_7))" U X"(c15_0<=c17_0)"))
Detected timeout of ITS tools.
[2021-05-14 12:26:03] [INFO ] Flatten gal took : 20 ms
[2021-05-14 12:26:03] [INFO ] Applying decomposition
[2021-05-14 12:26:03] [INFO ] Flatten gal took : 10 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/graph12410499615029351912.txt, -o, /tmp/graph12410499615029351912.bin, -w, /tmp/graph12410499615029351912.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/graph12410499615029351912.bin, -l, -1, -v, -w, /tmp/graph12410499615029351912.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 12:26:03] [INFO ] Decomposing Gal with order
[2021-05-14 12:26:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 12:26:03] [INFO ] Removed a total of 267 redundant transitions.
[2021-05-14 12:26:03] [INFO ] Flatten gal took : 27 ms
[2021-05-14 12:26:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 4 ms.
[2021-05-14 12:26:03] [INFO ] Time to serialize gal into /tmp/LTL9450197327838717863.gal : 1 ms
[2021-05-14 12:26:03] [INFO ] Time to serialize properties into /tmp/LTL2269435043640718868.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/LTL9450197327838717863.gal, -t, CGAL, -LTL, /tmp/LTL2269435043640718868.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/LTL9450197327838717863.gal -t CGAL -LTL /tmp/LTL2269435043640718868.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((F("((((((((gi0.gu0.aux10_0+gi0.gu0.aux10_1)+gi0.gu0.aux10_2)+gi0.gu0.aux10_3)+gi0.gu0.aux10_4)+gi0.gu0.aux10_5)+gi0.gu0.aux10_6)+gi0.gu0.aux10_7)<=gi0.gu0.c17_0)"))&&(G(("((((gu5.aux7_2+gu5.aux7_3)+gu5.aux7_6)+gu5.aux7_7)>(((((((gu5.out1_0+gu5.out1_1)+gu5.out1_2)+gu5.out1_3)+gu5.out1_4)+gu5.out1_5)+gu5.out1_6)+gu5.out1_7))")U(X("(gi0.gu0.c15_0<=gi0.gu0.c17_0)"))))))))
Formula 0 simplified : !XF(F"((((((((gi0.gu0.aux10_0+gi0.gu0.aux10_1)+gi0.gu0.aux10_2)+gi0.gu0.aux10_3)+gi0.gu0.aux10_4)+gi0.gu0.aux10_5)+gi0.gu0.aux10_6)+gi0.gu0.aux10_7)<=gi0.gu0.c17_0)" & G("((((gu5.aux7_2+gu5.aux7_3)+gu5.aux7_6)+gu5.aux7_7)>(((((((gu5.out1_0+gu5.out1_1)+gu5.out1_2)+gu5.out1_3)+gu5.out1_4)+gu5.out1_5)+gu5.out1_6)+gu5.out1_7))" U X"(gi0.gu0.c15_0<=gi0.gu0.c17_0)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16194849640873256231
[2021-05-14 12:26:18] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16194849640873256231
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/ltsmin16194849640873256231]
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/ltsmin16194849640873256231] 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/ltsmin16194849640873256231] 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-COL-50-13 finished in 33831 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15227204322494114013
[2021-05-14 12:26:19] [INFO ] Computing symmetric may disable matrix : 480 transitions.
[2021-05-14 12:26:19] [INFO ] Applying decomposition
[2021-05-14 12:26:19] [INFO ] Computation of Complete disable matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 12:26:19] [INFO ] Computing symmetric may enable matrix : 480 transitions.
[2021-05-14 12:26:19] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 12:26:19] [INFO ] Computing Do-Not-Accords matrix : 480 transitions.
[2021-05-14 12:26:19] [INFO ] Flatten gal took : 64 ms
[2021-05-14 12:26:19] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 12:26:19] [INFO ] Built C files in 109ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15227204322494114013
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/ltsmin15227204322494114013]
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/graph10322319726191623304.txt, -o, /tmp/graph10322319726191623304.bin, -w, /tmp/graph10322319726191623304.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/graph10322319726191623304.bin, -l, -1, -v, -w, /tmp/graph10322319726191623304.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 12:26:20] [INFO ] Decomposing Gal with order
[2021-05-14 12:26:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 12:26:20] [INFO ] Removed a total of 1155 redundant transitions.
[2021-05-14 12:26:20] [INFO ] Flatten gal took : 76 ms
[2021-05-14 12:26:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 116 labels/synchronizations in 13 ms.
[2021-05-14 12:26:20] [INFO ] Time to serialize gal into /tmp/LTLCardinality6459930405610757001.gal : 4 ms
[2021-05-14 12:26:20] [INFO ] Time to serialize properties into /tmp/LTLCardinality13333530316449656123.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/LTLCardinality6459930405610757001.gal, -t, CGAL, -LTL, /tmp/LTLCardinality13333530316449656123.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/LTLCardinality6459930405610757001.gal -t CGAL -LTL /tmp/LTLCardinality13333530316449656123.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 5 LTL properties
Checking formula 0 : !((X(X(X((G("((((((((gu10.out7_0+gu10.out7_1)+gu10.out7_2)+gu10.out7_3)+gu10.out7_4)+gu10.out7_5)+gu10.out7_6)+gu10.out7_7)<2)"))||(("((((((((gu10.out7_0+gu10.out7_1)+gu10.out7_2)+gu10.out7_3)+gu10.out7_4)+gu10.out7_5)+gu10.out7_6)+gu10.out7_7)<2)")&&(F(("(gu8.c9_0>(((((((gu8.out1_0+gu8.out1_1)+gu8.out1_2)+gu8.out1_3)+gu8.out1_4)+gu8.out1_5)+gu8.out1_6)+gu8.out1_7))")&&(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_1)+gu4.aux6_4)+gu4.aux6_5))"))))))))))
Formula 0 simplified : !XXX(G"((((((((gu10.out7_0+gu10.out7_1)+gu10.out7_2)+gu10.out7_3)+gu10.out7_4)+gu10.out7_5)+gu10.out7_6)+gu10.out7_7)<2)" | ("((((((((gu10.out7_0+gu10.out7_1)+gu10.out7_2)+gu10.out7_3)+gu10.out7_4)+gu10.out7_5)+gu10.out7_6)+gu10.out7_7)<2)" & F("(gu8.c9_0>(((((((gu8.out1_0+gu8.out1_1)+gu8.out1_2)+gu8.out1_3)+gu8.out1_4)+gu8.out1_5)+gu8.out1_6)+gu8.out1_7))" & 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_1)+gu4.aux6_4)+gu4.aux6_5))")))
Compilation finished in 3240 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15227204322494114013]
Link finished in 41 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/ltsmin15227204322494114013]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: 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( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.079: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.079: LTL layer: formula: X(X(X(([]((LTLAPp0==true))||((LTLAPp0==true)&&<>(((LTLAPp1==true)&&X((LTLAPp2==true)))))))))
pins2lts-mc-linux64( 3/ 8), 0.080: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.082: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.083: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.084: "X(X(X(([]((LTLAPp0==true))||((LTLAPp0==true)&&<>(((LTLAPp1==true)&&X((LTLAPp2==true)))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.084: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.084: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.084: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.085: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.094: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.105: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.340: DFS-FIFO for weak LTL, using special progress label 493
pins2lts-mc-linux64( 0/ 8), 0.340: There are 494 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.340: State length is 121, there are 499 groups
pins2lts-mc-linux64( 0/ 8), 0.340: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.340: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.340: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.340: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.554: ~1 levels ~960 states ~8512 transitions
pins2lts-mc-linux64( 1/ 8), 0.565: ~1 levels ~1920 states ~15744 transitions
pins2lts-mc-linux64( 2/ 8), 0.583: ~1 levels ~3840 states ~26240 transitions
pins2lts-mc-linux64( 1/ 8), 0.637: ~1 levels ~7680 states ~48608 transitions
pins2lts-mc-linux64( 5/ 8), 0.738: ~1 levels ~15360 states ~98464 transitions
pins2lts-mc-linux64( 0/ 8), 0.904: ~1 levels ~30720 states ~181360 transitions
pins2lts-mc-linux64( 0/ 8), 1.221: ~1 levels ~61440 states ~320576 transitions
pins2lts-mc-linux64( 4/ 8), 1.753: ~1 levels ~122880 states ~468000 transitions
pins2lts-mc-linux64( 4/ 8), 3.132: ~1 levels ~245760 states ~1014496 transitions
pins2lts-mc-linux64( 3/ 8), 5.886: ~1 levels ~491520 states ~2004640 transitions
pins2lts-mc-linux64( 3/ 8), 11.623: ~1 levels ~983040 states ~4104352 transitions
pins2lts-mc-linux64( 0/ 8), 23.172: ~1 levels ~1966080 states ~8116320 transitions
pins2lts-mc-linux64( 5/ 8), 43.966: ~1 levels ~3932160 states ~11118368 transitions
pins2lts-mc-linux64( 5/ 8), 84.008: ~1 levels ~7864320 states ~17853856 transitions
pins2lts-mc-linux64( 3/ 8), 123.109: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 123.346:
pins2lts-mc-linux64( 0/ 8), 123.346: mean standard work distribution: 7.0% (states) 9.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 123.346:
pins2lts-mc-linux64( 0/ 8), 123.346: Explored 9747050 states 36744041 transitions, fanout: 3.770
pins2lts-mc-linux64( 0/ 8), 123.346: Total exploration time 123.000 sec (122.750 sec minimum, 122.841 sec on average)
pins2lts-mc-linux64( 0/ 8), 123.346: States per second: 79244, Transitions per second: 298732
pins2lts-mc-linux64( 0/ 8), 123.346:
pins2lts-mc-linux64( 0/ 8), 123.346: Progress states detected: 19793981
pins2lts-mc-linux64( 0/ 8), 123.346: Redundant explorations: -50.7577
pins2lts-mc-linux64( 0/ 8), 123.346:
pins2lts-mc-linux64( 0/ 8), 123.346: Queue width: 8B, total height: 16326472, memory: 124.56MB
pins2lts-mc-linux64( 0/ 8), 123.346: Tree memory: 407.0MB, 21.6 B/state, compr.: 4.4%
pins2lts-mc-linux64( 0/ 8), 123.346: Tree fill ratio (roots/leafs): 14.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 123.346: Stored 482 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 123.346: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 123.346: Est. total memory use: 531.6MB (~1148.6MB 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/ltsmin15227204322494114013]
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/ltsmin15227204322494114013]
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 12:47:30] [INFO ] Applying decomposition
[2021-05-14 12:47:30] [INFO ] Flatten gal took : 111 ms
[2021-05-14 12:47:30] [INFO ] Decomposing Gal with order
[2021-05-14 12:47:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 12:47:31] [INFO ] Removed a total of 1609 redundant transitions.
[2021-05-14 12:47:31] [INFO ] Flatten gal took : 528 ms
[2021-05-14 12:47:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 17 ms.
[2021-05-14 12:47:31] [INFO ] Time to serialize gal into /tmp/LTLCardinality4199172781690404527.gal : 19 ms
[2021-05-14 12:47:31] [INFO ] Time to serialize properties into /tmp/LTLCardinality9932165831715494228.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/LTLCardinality4199172781690404527.gal, -t, CGAL, -LTL, /tmp/LTLCardinality9932165831715494228.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/LTLCardinality4199172781690404527.gal -t CGAL -LTL /tmp/LTLCardinality9932165831715494228.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 5 LTL properties
Checking formula 0 : !((X(X(X((G("((((((((ginput0.out7_0+ginput1.out7_1)+ginput2.out7_2)+ginput3.out7_3)+ginput4.out7_4)+ginput5.out7_5)+ginput6.out7_6)+ginput7.out7_7)<2)"))||(("((((((((ginput0.out7_0+ginput1.out7_1)+ginput2.out7_2)+ginput3.out7_3)+ginput4.out7_4)+ginput5.out7_5)+ginput6.out7_6)+ginput7.out7_7)<2)")&&(F(("(gc9.c9_0>(((((((ginput0.out1_0+ginput1.out1_1)+ginput2.out1_2)+ginput3.out1_3)+ginput4.out1_4)+ginput5.out1_5)+ginput6.out1_6)+ginput7.out1_7))")&&(X("((((((((ginput0.aux16_0+ginput1.aux16_1)+ginput2.aux16_2)+ginput3.aux16_3)+ginput4.aux16_4)+ginput5.aux16_5)+ginput6.aux16_6)+ginput7.aux16_7)<=(((ginput0.aux6_0+ginput1.aux6_1)+ginput4.aux6_4)+ginput5.aux6_5))"))))))))))
Formula 0 simplified : !XXX(G"((((((((ginput0.out7_0+ginput1.out7_1)+ginput2.out7_2)+ginput3.out7_3)+ginput4.out7_4)+ginput5.out7_5)+ginput6.out7_6)+ginput7.out7_7)<2)" | ("((((((((ginput0.out7_0+ginput1.out7_1)+ginput2.out7_2)+ginput3.out7_3)+ginput4.out7_4)+ginput5.out7_5)+ginput6.out7_6)+ginput7.out7_7)<2)" & F("(gc9.c9_0>(((((((ginput0.out1_0+ginput1.out1_1)+ginput2.out1_2)+ginput3.out1_3)+ginput4.out1_4)+ginput5.out1_5)+ginput6.out1_6)+ginput7.out1_7))" & X"((((((((ginput0.aux16_0+ginput1.aux16_1)+ginput2.aux16_2)+ginput3.aux16_3)+ginput4.aux16_4)+ginput5.aux16_5)+ginput6.aux16_6)+ginput7.aux16_7)<=(((ginput0.aux6_0+ginput1.aux6_1)+ginput4.aux6_4)+ginput5.aux6_5))")))
Detected timeout of ITS tools.
[2021-05-14 13:08:41] [INFO ] Flatten gal took : 138 ms
[2021-05-14 13:08:42] [INFO ] Input system was already deterministic with 480 transitions.
[2021-05-14 13:08:42] [INFO ] Transformed 120 places.
[2021-05-14 13:08:42] [INFO ] Transformed 480 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 13:08:42] [INFO ] Time to serialize gal into /tmp/LTLCardinality15900417500596885225.gal : 5 ms
[2021-05-14 13:08:42] [INFO ] Time to serialize properties into /tmp/LTLCardinality17433673319724792160.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality15900417500596885225.gal, -t, CGAL, -LTL, /tmp/LTLCardinality17433673319724792160.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/LTLCardinality15900417500596885225.gal -t CGAL -LTL /tmp/LTLCardinality17433673319724792160.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((G("((((((((out7_0+out7_1)+out7_2)+out7_3)+out7_4)+out7_5)+out7_6)+out7_7)<2)"))||(("((((((((out7_0+out7_1)+out7_2)+out7_3)+out7_4)+out7_5)+out7_6)+out7_7)<2)")&&(F(("(c9_0>(((((((out1_0+out1_1)+out1_2)+out1_3)+out1_4)+out1_5)+out1_6)+out1_7))")&&(X("((((((((aux16_0+aux16_1)+aux16_2)+aux16_3)+aux16_4)+aux16_5)+aux16_6)+aux16_7)<=(((aux6_0+aux6_1)+aux6_4)+aux6_5))"))))))))))
Formula 0 simplified : !XXX(G"((((((((out7_0+out7_1)+out7_2)+out7_3)+out7_4)+out7_5)+out7_6)+out7_7)<2)" | ("((((((((out7_0+out7_1)+out7_2)+out7_3)+out7_4)+out7_5)+out7_6)+out7_7)<2)" & F("(c9_0>(((((((out1_0+out1_1)+out1_2)+out1_3)+out1_4)+out1_5)+out1_6)+out1_7))" & X"((((((((aux16_0+aux16_1)+aux16_2)+aux16_3)+aux16_4)+aux16_5)+aux16_6)+aux16_7)<=(((aux6_0+aux6_1)+aux6_4)+aux6_5))")))
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-COL-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-COL-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-162089128000500"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-COL-50.tgz
mv PermAdmissibility-COL-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 '
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 ;