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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 123K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 108K 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.2K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 06:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 06:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 08:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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-20-00
FORMULA_NAME PermAdmissibility-COL-20-01
FORMULA_NAME PermAdmissibility-COL-20-02
FORMULA_NAME PermAdmissibility-COL-20-03
FORMULA_NAME PermAdmissibility-COL-20-04
FORMULA_NAME PermAdmissibility-COL-20-05
FORMULA_NAME PermAdmissibility-COL-20-06
FORMULA_NAME PermAdmissibility-COL-20-07
FORMULA_NAME PermAdmissibility-COL-20-08
FORMULA_NAME PermAdmissibility-COL-20-09
FORMULA_NAME PermAdmissibility-COL-20-10
FORMULA_NAME PermAdmissibility-COL-20-11
FORMULA_NAME PermAdmissibility-COL-20-12
FORMULA_NAME PermAdmissibility-COL-20-13
FORMULA_NAME PermAdmissibility-COL-20-14
FORMULA_NAME PermAdmissibility-COL-20-15

=== Now, execution of the tool begins

BK_START 1620991526236

Running Version 0
[2021-05-14 11:25:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-14 11:25:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 11:25:44] [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 11:25:44] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-14 11:25:44] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 579 ms
[2021-05-14 11:25:44] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA PermAdmissibility-COL-20-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-20-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 11:25:45] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions in 4 ms.
[2021-05-14 11:25:45] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_16997022019180285670.dot
[2021-05-14 11:25:45] [INFO ] Initial state test concluded for 1 properties.
FORMULA PermAdmissibility-COL-20-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 100011 steps, including 296 resets, run finished after 82 ms. (steps per millisecond=1219 ) properties (out of 23) seen :21
Running SMT prover for 2 properties.
// Phase 1: matrix 16 rows 40 cols
[2021-05-14 11:25:45] [INFO ] Computed 24 place invariants in 9 ms
[2021-05-14 11:25:45] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 6 ms returned unsat
[2021-05-14 11:25:45] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 5 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA PermAdmissibility-COL-20-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 11:25:45] [INFO ] Flatten gal took : 20 ms
[2021-05-14 11:25:45] [INFO ] Flatten gal took : 5 ms
[2021-05-14 11:25:45] [INFO ] Unfolded HLPN to a Petri net with 208 places and 1024 transitions in 10 ms.
[2021-05-14 11:25:45] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_11990051532075799677.dot
Deduced a syphon composed of 40 places in 5 ms
Reduce places removed 40 places and 432 transitions.
Support contains 88 out of 168 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 144 transition count 592
Applied a total of 24 rules in 21 ms. Remains 144 /168 variables (removed 24) and now considering 592/592 (removed 0) transitions.
// Phase 1: matrix 592 rows 144 cols
[2021-05-14 11:25:45] [INFO ] Computed 21 place invariants in 22 ms
[2021-05-14 11:25:45] [INFO ] Implicit Places using invariants in 120 ms returned []
// Phase 1: matrix 592 rows 144 cols
[2021-05-14 11:25:45] [INFO ] Computed 21 place invariants in 12 ms
[2021-05-14 11:25:45] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
// Phase 1: matrix 592 rows 144 cols
[2021-05-14 11:25:45] [INFO ] Computed 21 place invariants in 7 ms
[2021-05-14 11:25:46] [INFO ] Dead Transitions using invariants and state equation in 238 ms returned []
Finished structural reductions, in 1 iterations. Remains : 144/168 places, 592/592 transitions.
[2021-05-14 11:25:46] [INFO ] Flatten gal took : 93 ms
[2021-05-14 11:25:46] [INFO ] Flatten gal took : 68 ms
[2021-05-14 11:25:46] [INFO ] Input system was already deterministic with 592 transitions.
Incomplete random walk after 100008 steps, including 295 resets, run finished after 129 ms. (steps per millisecond=775 ) properties (out of 22) seen :21
Running SMT prover for 1 properties.
// Phase 1: matrix 592 rows 144 cols
[2021-05-14 11:25:46] [INFO ] Computed 21 place invariants in 6 ms
[2021-05-14 11:25:46] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 9 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 144 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 144/144 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 104 transition count 592
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 68 place count 76 transition count 340
Iterating global reduction 1 with 28 rules applied. Total rules applied 96 place count 76 transition count 340
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 124 place count 48 transition count 88
Iterating global reduction 1 with 28 rules applied. Total rules applied 152 place count 48 transition count 88
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 164 place count 36 transition count 28
Iterating global reduction 1 with 12 rules applied. Total rules applied 176 place count 36 transition count 28
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 180 place count 32 transition count 16
Ensure Unique test removed 2 places
Iterating global reduction 1 with 6 rules applied. Total rules applied 186 place count 30 transition count 16
Applied a total of 186 rules in 21 ms. Remains 30 /144 variables (removed 114) and now considering 16/592 (removed 576) transitions.
// Phase 1: matrix 16 rows 30 cols
[2021-05-14 11:25:46] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-14 11:25:46] [INFO ] Implicit Places using invariants in 28 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 16, 18, 22, 23, 25, 26]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 37 ms to find 14 implicit places.
// Phase 1: matrix 16 rows 16 cols
[2021-05-14 11:25:46] [INFO ] Computed 0 place invariants in 7 ms
[2021-05-14 11:25:46] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Starting structural reductions, iteration 1 : 16/144 places, 16/592 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 16 cols
[2021-05-14 11:25:46] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-14 11:25:46] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 2 iterations. Remains : 16/144 places, 16/592 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-20-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s15)], 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 1520 reset in 195 ms.
Product exploration explored 100000 steps with 1495 reset in 157 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 16 transition count 16
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 (G (NOT p0))), (NOT p0)]
Stuttering acceptance computed with spot in 313 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1511 reset in 127 ms.
Product exploration explored 100000 steps with 1528 reset in 226 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 16 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 16 transition count 16
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 9 place count 16 transition count 16
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 14 place count 16 transition count 16
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 26 place count 4 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 38 place count 4 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 38 rules in 16 ms. Remains 4 /16 variables (removed 12) and now considering 4/16 (removed 12) transitions.
[2021-05-14 11:25:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-14 11:25:48] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-14 11:25:48] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/16 places, 4/16 transitions.
Product exploration explored 100000 steps with 33333 reset in 167 ms.
Product exploration explored 100000 steps with 33333 reset in 129 ms.
[2021-05-14 11:25:48] [INFO ] Flatten gal took : 1 ms
[2021-05-14 11:25:48] [INFO ] Flatten gal took : 1 ms
[2021-05-14 11:25:48] [INFO ] Time to serialize gal into /tmp/LTL8598979518017600036.gal : 0 ms
[2021-05-14 11:25:48] [INFO ] Time to serialize properties into /tmp/LTL6574746772805526550.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/LTL8598979518017600036.gal, -t, CGAL, -LTL, /tmp/LTL6574746772805526550.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/LTL8598979518017600036.gal -t CGAL -LTL /tmp/LTL6574746772805526550.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(c19_0>=1)"))))
Formula 0 simplified : !XF"(c19_0>=1)"
Reverse transition relation is NOT exact ! Due to transitions t400, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/15/1/16
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
349 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.50457,95492,1,0,1314,493589,56,801,693,522662,2641
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA PermAdmissibility-COL-20-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property PermAdmissibility-COL-20-02 finished in 5922 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&X(p1)))))], workingDir=/home/mcc/execution]
Support contains 13 out of 144 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 144/144 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 104 transition count 592
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 61 place count 83 transition count 354
Iterating global reduction 1 with 21 rules applied. Total rules applied 82 place count 83 transition count 354
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 96 place count 69 transition count 228
Iterating global reduction 1 with 14 rules applied. Total rules applied 110 place count 69 transition count 228
Applied a total of 110 rules in 16 ms. Remains 69 /144 variables (removed 75) and now considering 228/592 (removed 364) transitions.
// Phase 1: matrix 228 rows 69 cols
[2021-05-14 11:25:52] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-14 11:25:52] [INFO ] Implicit Places using invariants in 55 ms returned [4, 13, 62, 64, 65]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 56 ms to find 5 implicit places.
// Phase 1: matrix 228 rows 64 cols
[2021-05-14 11:25:52] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 11:25:52] [INFO ] Dead Transitions using invariants and state equation in 85 ms returned []
Starting structural reductions, iteration 1 : 64/144 places, 228/592 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 228/228 (removed 0) transitions.
// Phase 1: matrix 228 rows 64 cols
[2021-05-14 11:25:52] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 11:25:52] [INFO ] Dead Transitions using invariants and state equation in 83 ms returned []
Finished structural reductions, in 2 iterations. Remains : 64/144 places, 228/592 transitions.
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : PermAdmissibility-COL-20-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s22 (ADD s36 s37 s38 s39)), p1:(AND (OR (GT 3 (ADD s52 s53 s54 s55 s56 s57 s58 s59)) (LEQ s22 (ADD s36 s37 s38 s39))) (LEQ s22 (ADD s36 s37 s38 s39)))], 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 1 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-COL-20-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-20-04 finished in 356 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G((p1&&(p1 U p2)))))))], workingDir=/home/mcc/execution]
Support contains 33 out of 144 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 144/144 places, 592/592 transitions.
Graph (complete) has 1375 edges and 144 vertex of which 120 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.8 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 99 transition count 354
Iterating global reduction 0 with 21 rules applied. Total rules applied 43 place count 99 transition count 354
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 57 place count 85 transition count 228
Iterating global reduction 0 with 14 rules applied. Total rules applied 71 place count 85 transition count 228
Applied a total of 71 rules in 27 ms. Remains 85 /144 variables (removed 59) and now considering 228/592 (removed 364) transitions.
// Phase 1: matrix 228 rows 85 cols
[2021-05-14 11:25:52] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-14 11:25:52] [INFO ] Implicit Places using invariants in 62 ms returned [4, 13, 62, 64, 65]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 63 ms to find 5 implicit places.
[2021-05-14 11:25:52] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 228 rows 80 cols
[2021-05-14 11:25:52] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-14 11:25:53] [INFO ] Dead Transitions using invariants and state equation in 92 ms returned []
Starting structural reductions, iteration 1 : 80/144 places, 228/592 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 80 transition count 227
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 79 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 78 transition count 226
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4 place count 78 transition count 225
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 6 place count 77 transition count 225
Applied a total of 6 rules in 13 ms. Remains 77 /80 variables (removed 3) and now considering 225/228 (removed 3) transitions.
// Phase 1: matrix 225 rows 77 cols
[2021-05-14 11:25:53] [INFO ] Computed 13 place invariants in 2 ms
[2021-05-14 11:25:53] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 225 rows 77 cols
[2021-05-14 11:25:53] [INFO ] Computed 13 place invariants in 2 ms
[2021-05-14 11:25:53] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 77/144 places, 225/592 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : PermAdmissibility-COL-20-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ (ADD s11 s12 s13 s14 s15 s16 s17 s18) (ADD s61 s62 s63 s64 s65 s66 s67 s68)), p1:(LEQ (ADD s51 s52 s53 s54 s55 s56 s57 s58) s2), p2:(LEQ 1 (ADD s69 s70 s71 s72 s73 s74 s75 s76))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 683 reset in 721 ms.
Product exploration explored 100000 steps with 675 reset in 655 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 77 transition count 225
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 109 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 676 reset in 614 ms.
Product exploration explored 100000 steps with 694 reset in 647 ms.
[2021-05-14 11:25:56] [INFO ] Flatten gal took : 18 ms
[2021-05-14 11:25:56] [INFO ] Flatten gal took : 18 ms
[2021-05-14 11:25:56] [INFO ] Time to serialize gal into /tmp/LTL12710647230317467710.gal : 3 ms
[2021-05-14 11:25:56] [INFO ] Time to serialize properties into /tmp/LTL7883457452447658491.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/LTL12710647230317467710.gal, -t, CGAL, -LTL, /tmp/LTL7883457452447658491.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/LTL12710647230317467710.gal -t CGAL -LTL /tmp/LTL7883457452447658491.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((F("((((((((aux12_0+aux12_1)+aux12_2)+aux12_3)+aux12_4)+aux12_5)+aux12_6)+aux12_7)<=(((((((out5_0+out5_1)+out5_2)+out5_3)+out5_4)+out5_5)+out5_6)+out5_7))"))&&(F(G(("((((((((aux16_0+aux16_1)+aux16_2)+aux16_3)+aux16_4)+aux16_5)+aux16_6)+aux16_7)<=c13_0)")&&(("((((((((aux16_0+aux16_1)+aux16_2)+aux16_3)+aux16_4)+aux16_5)+aux16_6)+aux16_7)<=c13_0)")U("((((((((out7_0+out7_1)+out7_2)+out7_3)+out7_4)+out7_5)+out7_6)+out7_7)>=1)"))))))))
Formula 0 simplified : !G(F"((((((((aux12_0+aux12_1)+aux12_2)+aux12_3)+aux12_4)+aux12_5)+aux12_6)+aux12_7)<=(((((((out5_0+out5_1)+out5_2)+out5_3)+out5_4)+out5_5)+out5_6)+out5_7))" & FG("((((((((aux16_0+aux16_1)+aux16_2)+aux16_3)+aux16_4)+aux16_5)+aux16_6)+aux16_7)<=c13_0)" & ("((((((((aux16_0+aux16_1)+aux16_2)+aux16_3)+aux16_4)+aux16_5)+aux16_6)+aux16_7)<=c13_0)" U "((((((((out7_0+out7_1)+out7_2)+out7_3)+out7_4)+out7_5)+out7_6)+out7_7)>=1)")))
Detected timeout of ITS tools.
[2021-05-14 11:26:11] [INFO ] Flatten gal took : 15 ms
[2021-05-14 11:26:11] [INFO ] Applying decomposition
[2021-05-14 11:26:11] [INFO ] Flatten gal took : 25 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/graph16859439023260357558.txt, -o, /tmp/graph16859439023260357558.bin, -w, /tmp/graph16859439023260357558.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/graph16859439023260357558.bin, -l, -1, -v, -w, /tmp/graph16859439023260357558.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 11:26:11] [INFO ] Decomposing Gal with order
[2021-05-14 11:26:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 11:26:11] [INFO ] Removed a total of 318 redundant transitions.
[2021-05-14 11:26:11] [INFO ] Flatten gal took : 66 ms
[2021-05-14 11:26:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 8 ms.
[2021-05-14 11:26:11] [INFO ] Time to serialize gal into /tmp/LTL16315192050934774631.gal : 3 ms
[2021-05-14 11:26:11] [INFO ] Time to serialize properties into /tmp/LTL436986630917905381.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/LTL16315192050934774631.gal, -t, CGAL, -LTL, /tmp/LTL436986630917905381.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/LTL16315192050934774631.gal -t CGAL -LTL /tmp/LTL436986630917905381.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((F("((((((((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.out5_0+gu5.out5_1)+gu5.out5_2)+gu5.out5_3)+gu5.out5_4)+gu5.out5_5)+gu5.out5_6)+gu5.out5_7))"))&&(F(G(("((((((((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.c13_0)")&&(("((((((((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.c13_0)")U("((((((((gu6.out7_0+gu6.out7_1)+gu6.out7_2)+gu6.out7_3)+gu6.out7_4)+gu6.out7_5)+gu6.out7_6)+gu6.out7_7)>=1)"))))))))
Formula 0 simplified : !G(F"((((((((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.out5_0+gu5.out5_1)+gu5.out5_2)+gu5.out5_3)+gu5.out5_4)+gu5.out5_5)+gu5.out5_6)+gu5.out5_7))" & FG("((((((((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.c13_0)" & ("((((((((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.c13_0)" U "((((((((gu6.out7_0+gu6.out7_1)+gu6.out7_2)+gu6.out7_3)+gu6.out7_4)+gu6.out7_5)+gu6.out7_6)+gu6.out7_7)>=1)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6874538557240659061
[2021-05-14 11:26:26] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6874538557240659061
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/ltsmin6874538557240659061]
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/ltsmin6874538557240659061] 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/ltsmin6874538557240659061] 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-20-05 finished in 34881 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 9 out of 144 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 144/144 places, 592/592 transitions.
Graph (complete) has 1375 edges and 144 vertex of which 112 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.2 ms
Discarding 32 places :
Also discarding 0 output transitions
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 22 place count 91 transition count 354
Iterating global reduction 0 with 21 rules applied. Total rules applied 43 place count 91 transition count 354
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 57 place count 77 transition count 228
Iterating global reduction 0 with 14 rules applied. Total rules applied 71 place count 77 transition count 228
Applied a total of 71 rules in 21 ms. Remains 77 /144 variables (removed 67) and now considering 228/592 (removed 364) transitions.
// Phase 1: matrix 228 rows 77 cols
[2021-05-14 11:26:27] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-14 11:26:27] [INFO ] Implicit Places using invariants in 127 ms returned [12, 21, 54, 55, 57]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 133 ms to find 5 implicit places.
[2021-05-14 11:26:27] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 228 rows 72 cols
[2021-05-14 11:26:27] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-14 11:26:27] [INFO ] Dead Transitions using invariants and state equation in 105 ms returned []
Starting structural reductions, iteration 1 : 72/144 places, 228/592 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 72 transition count 226
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 70 transition count 226
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 70 transition count 225
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 69 transition count 225
Applied a total of 6 rules in 20 ms. Remains 69 /72 variables (removed 3) and now considering 225/228 (removed 3) transitions.
// Phase 1: matrix 225 rows 69 cols
[2021-05-14 11:26:27] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-14 11:26:28] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 225 rows 69 cols
[2021-05-14 11:26:28] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-14 11:26:28] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 69/144 places, 225/592 transitions.
Stuttering acceptance computed with spot in 30 ms :[true, (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-20-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ (ADD s61 s62 s63 s64 s65 s66 s67 s68) s60)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 69 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-20-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-20-06 finished in 491 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 8 out of 144 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 144/144 places, 592/592 transitions.
Graph (complete) has 1375 edges and 144 vertex of which 112 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.1 ms
Discarding 32 places :
Also discarding 0 output transitions
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 22 place count 91 transition count 354
Iterating global reduction 0 with 21 rules applied. Total rules applied 43 place count 91 transition count 354
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 57 place count 77 transition count 228
Iterating global reduction 0 with 14 rules applied. Total rules applied 71 place count 77 transition count 228
Applied a total of 71 rules in 28 ms. Remains 77 /144 variables (removed 67) and now considering 228/592 (removed 364) transitions.
// Phase 1: matrix 228 rows 77 cols
[2021-05-14 11:26:28] [INFO ] Computed 17 place invariants in 2 ms
[2021-05-14 11:26:28] [INFO ] Implicit Places using invariants in 95 ms returned [12, 21, 54, 64, 65]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 104 ms to find 5 implicit places.
[2021-05-14 11:26:28] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 228 rows 72 cols
[2021-05-14 11:26:28] [INFO ] Computed 12 place invariants in 4 ms
[2021-05-14 11:26:28] [INFO ] Dead Transitions using invariants and state equation in 97 ms returned []
Starting structural reductions, iteration 1 : 72/144 places, 228/592 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 72 transition count 226
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 70 transition count 226
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 70 transition count 225
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 69 transition count 225
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 68 transition count 224
Applied a total of 8 rules in 18 ms. Remains 68 /72 variables (removed 4) and now considering 224/228 (removed 4) transitions.
// Phase 1: matrix 224 rows 68 cols
[2021-05-14 11:26:28] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 11:26:28] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 224 rows 68 cols
[2021-05-14 11:26:28] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 11:26:28] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 68/144 places, 224/592 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-20-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 (ADD s60 s61 s62 s63 s64 s65 s66 s67))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1726 reset in 582 ms.
Product exploration explored 100000 steps with 1714 reset in 604 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 68 transition count 224
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 50 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1733 reset in 582 ms.
Product exploration explored 100000 steps with 1727 reset in 602 ms.
[2021-05-14 11:26:31] [INFO ] Flatten gal took : 15 ms
[2021-05-14 11:26:31] [INFO ] Flatten gal took : 14 ms
[2021-05-14 11:26:31] [INFO ] Time to serialize gal into /tmp/LTL12802682473107789957.gal : 2 ms
[2021-05-14 11:26:31] [INFO ] Time to serialize properties into /tmp/LTL7644921861158103793.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/LTL12802682473107789957.gal, -t, CGAL, -LTL, /tmp/LTL7644921861158103793.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/LTL12802682473107789957.gal -t CGAL -LTL /tmp/LTL7644921861158103793.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((out2_0+out2_1)+out2_2)+out2_3)+out2_4)+out2_5)+out2_6)+out2_7)>=2)"))))
Formula 0 simplified : !GF"((((((((out2_0+out2_1)+out2_2)+out2_3)+out2_4)+out2_5)+out2_6)+out2_7)>=2)"
Detected timeout of ITS tools.
[2021-05-14 11:26:46] [INFO ] Flatten gal took : 15 ms
[2021-05-14 11:26:46] [INFO ] Applying decomposition
[2021-05-14 11:26:46] [INFO ] Flatten gal took : 14 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/graph10518964915337582291.txt, -o, /tmp/graph10518964915337582291.bin, -w, /tmp/graph10518964915337582291.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/graph10518964915337582291.bin, -l, -1, -v, -w, /tmp/graph10518964915337582291.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 11:26:46] [INFO ] Decomposing Gal with order
[2021-05-14 11:26:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 11:26:46] [INFO ] Removed a total of 33 redundant transitions.
[2021-05-14 11:26:46] [INFO ] Flatten gal took : 33 ms
[2021-05-14 11:26:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 3 ms.
[2021-05-14 11:26:46] [INFO ] Time to serialize gal into /tmp/LTL13760758410581942857.gal : 2 ms
[2021-05-14 11:26:46] [INFO ] Time to serialize properties into /tmp/LTL832085282529002059.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/LTL13760758410581942857.gal, -t, CGAL, -LTL, /tmp/LTL832085282529002059.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/LTL13760758410581942857.gal -t CGAL -LTL /tmp/LTL832085282529002059.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((gu4.out2_0+gu4.out2_1)+gu4.out2_2)+gu4.out2_3)+gu4.out2_4)+gu4.out2_5)+gu4.out2_6)+gu4.out2_7)>=2)"))))
Formula 0 simplified : !GF"((((((((gu4.out2_0+gu4.out2_1)+gu4.out2_2)+gu4.out2_3)+gu4.out2_4)+gu4.out2_5)+gu4.out2_6)+gu4.out2_7)>=2)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9166173525878288275
[2021-05-14 11:27:01] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9166173525878288275
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/ltsmin9166173525878288275]
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/ltsmin9166173525878288275] 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/ltsmin9166173525878288275] 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-20-07 finished in 34277 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 10 out of 144 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 144/144 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 104 transition count 592
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 68 place count 76 transition count 340
Iterating global reduction 1 with 28 rules applied. Total rules applied 96 place count 76 transition count 340
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 117 place count 55 transition count 102
Iterating global reduction 1 with 21 rules applied. Total rules applied 138 place count 55 transition count 102
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 144 place count 49 transition count 72
Iterating global reduction 1 with 6 rules applied. Total rules applied 150 place count 49 transition count 72
Applied a total of 150 rules in 5 ms. Remains 49 /144 variables (removed 95) and now considering 72/592 (removed 520) transitions.
// Phase 1: matrix 72 rows 49 cols
[2021-05-14 11:27:02] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-14 11:27:02] [INFO ] Implicit Places using invariants in 48 ms returned [4, 13, 14, 27, 28, 41, 42, 44, 45]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 49 ms to find 9 implicit places.
// Phase 1: matrix 72 rows 40 cols
[2021-05-14 11:27:02] [INFO ] Computed 7 place invariants in 5 ms
[2021-05-14 11:27:02] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Starting structural reductions, iteration 1 : 40/144 places, 72/592 transitions.
Applied a total of 0 rules in 0 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 11:27:02] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-14 11:27:02] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 2 iterations. Remains : 40/144 places, 72/592 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-COL-20-08 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ 3 s0), p0:(LEQ (ADD s4 s5 s6 s7 s8 s9 s10 s11) s34)], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-20-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-20-08 finished in 221 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F(p0)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 144/144 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 104 transition count 592
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 68 place count 76 transition count 340
Iterating global reduction 1 with 28 rules applied. Total rules applied 96 place count 76 transition count 340
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 124 place count 48 transition count 88
Iterating global reduction 1 with 28 rules applied. Total rules applied 152 place count 48 transition count 88
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 164 place count 36 transition count 28
Iterating global reduction 1 with 12 rules applied. Total rules applied 176 place count 36 transition count 28
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 179 place count 33 transition count 18
Ensure Unique test removed 1 places
Iterating global reduction 1 with 4 rules applied. Total rules applied 183 place count 32 transition count 18
Applied a total of 183 rules in 7 ms. Remains 32 /144 variables (removed 112) and now considering 18/592 (removed 574) transitions.
// Phase 1: matrix 18 rows 32 cols
[2021-05-14 11:27:02] [INFO ] Computed 15 place invariants in 0 ms
[2021-05-14 11:27:02] [INFO ] Implicit Places using invariants in 27 ms returned [4, 5, 6, 7, 8, 15, 16, 17, 18, 20, 24, 25, 27, 28]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 28 ms to find 14 implicit places.
// Phase 1: matrix 18 rows 18 cols
[2021-05-14 11:27:02] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-14 11:27:02] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Starting structural reductions, iteration 1 : 18/144 places, 18/592 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 18 cols
[2021-05-14 11:27:02] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-14 11:27:02] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 2 iterations. Remains : 18/144 places, 18/592 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-20-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(GT (ADD s8 s9) s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 73 ms.
Product exploration explored 100000 steps with 25000 reset in 77 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 18
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 82 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 74 ms.
Product exploration explored 100000 steps with 25000 reset in 77 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 18 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 18/18 places, 18/18 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 18 transition count 18
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 8 place count 18 transition count 18
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 18 transition count 18
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 22 place count 8 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 32 place count 8 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 32 rules in 1 ms. Remains 8 /18 variables (removed 10) and now considering 8/18 (removed 10) transitions.
[2021-05-14 11:27:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2021-05-14 11:27:03] [INFO ] Computed 1 place invariants in 4 ms
[2021-05-14 11:27:03] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/18 places, 8/18 transitions.
Product exploration explored 100000 steps with 25000 reset in 100 ms.
Product exploration explored 100000 steps with 25000 reset in 112 ms.
[2021-05-14 11:27:03] [INFO ] Flatten gal took : 1 ms
[2021-05-14 11:27:03] [INFO ] Flatten gal took : 0 ms
[2021-05-14 11:27:03] [INFO ] Time to serialize gal into /tmp/LTL3377827108363030230.gal : 0 ms
[2021-05-14 11:27:03] [INFO ] Time to serialize properties into /tmp/LTL17044126546050788046.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/LTL3377827108363030230.gal, -t, CGAL, -LTL, /tmp/LTL17044126546050788046.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/LTL3377827108363030230.gal -t CGAL -LTL /tmp/LTL17044126546050788046.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("((in3_4+in3_5)>c19_0)"))))))
Formula 0 simplified : !XXXF"((in3_4+in3_5)>c19_0)"
Reverse transition relation is NOT exact ! Due to transitions t400, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/17/1/18
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
84 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.851961,29936,1,0,37,75033,60,25,807,82060,54
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA PermAdmissibility-COL-20-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property PermAdmissibility-COL-20-09 finished in 1877 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((!p0 U X(p1))&&X(p2)))], workingDir=/home/mcc/execution]
Support contains 19 out of 144 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 144/144 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 104 transition count 592
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 61 place count 83 transition count 354
Iterating global reduction 1 with 21 rules applied. Total rules applied 82 place count 83 transition count 354
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 96 place count 69 transition count 228
Iterating global reduction 1 with 14 rules applied. Total rules applied 110 place count 69 transition count 228
Applied a total of 110 rules in 11 ms. Remains 69 /144 variables (removed 75) and now considering 228/592 (removed 364) transitions.
// Phase 1: matrix 228 rows 69 cols
[2021-05-14 11:27:04] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-14 11:27:04] [INFO ] Implicit Places using invariants in 62 ms returned [4, 13, 54, 55, 65]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 63 ms to find 5 implicit places.
// Phase 1: matrix 228 rows 64 cols
[2021-05-14 11:27:04] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 11:27:04] [INFO ] Dead Transitions using invariants and state equation in 81 ms returned []
Starting structural reductions, iteration 1 : 64/144 places, 228/592 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 228/228 (removed 0) transitions.
// Phase 1: matrix 228 rows 64 cols
[2021-05-14 11:27:04] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 11:27:04] [INFO ] Dead Transitions using invariants and state equation in 81 ms returned []
Finished structural reductions, in 2 iterations. Remains : 64/144 places, 228/592 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), true]
Running random walk in product with property : PermAdmissibility-COL-20-10 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GT 3 (ADD s53 s54 s55 s56 s57 s58 s59 s60)), p1:(LEQ (ADD s26 s27) s49), p2:(LEQ 2 (ADD s4 s5 s6 s7 s8 s9 s10 s11))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-20-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-20-10 finished in 381 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((((p0&&F(p1)) U G(p1))||F((p2||X(p0)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 144/144 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 104 transition count 592
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 68 place count 76 transition count 340
Iterating global reduction 1 with 28 rules applied. Total rules applied 96 place count 76 transition count 340
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 124 place count 48 transition count 88
Iterating global reduction 1 with 28 rules applied. Total rules applied 152 place count 48 transition count 88
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 164 place count 36 transition count 28
Iterating global reduction 1 with 12 rules applied. Total rules applied 176 place count 36 transition count 28
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 180 place count 32 transition count 16
Ensure Unique test removed 2 places
Iterating global reduction 1 with 6 rules applied. Total rules applied 186 place count 30 transition count 16
Applied a total of 186 rules in 6 ms. Remains 30 /144 variables (removed 114) and now considering 16/592 (removed 576) transitions.
// Phase 1: matrix 16 rows 30 cols
[2021-05-14 11:27:04] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-14 11:27:04] [INFO ] Implicit Places using invariants in 25 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 16, 18, 22, 23, 25, 26]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 26 ms to find 14 implicit places.
// Phase 1: matrix 16 rows 16 cols
[2021-05-14 11:27:04] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-14 11:27:04] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Starting structural reductions, iteration 1 : 16/144 places, 16/592 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 16 cols
[2021-05-14 11:27:04] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-14 11:27:05] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 2 iterations. Remains : 16/144 places, 16/592 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : PermAdmissibility-COL-20-11 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 1 s12), p0:(LEQ s1 s0), p2:(LEQ 3 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 126 ms.
Product exploration explored 100000 steps with 50000 reset in 83 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 16 transition count 16
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 (G (NOT p1))), (F (G p0)), (F (G (NOT p2))), (NOT p1), p0, (NOT p2)]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA PermAdmissibility-COL-20-11 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property PermAdmissibility-COL-20-11 finished in 504 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((F(p0)&&X(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 144 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 144/144 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 104 transition count 592
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 68 place count 76 transition count 340
Iterating global reduction 1 with 28 rules applied. Total rules applied 96 place count 76 transition count 340
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 124 place count 48 transition count 88
Iterating global reduction 1 with 28 rules applied. Total rules applied 152 place count 48 transition count 88
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 164 place count 36 transition count 28
Iterating global reduction 1 with 12 rules applied. Total rules applied 176 place count 36 transition count 28
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 180 place count 32 transition count 16
Ensure Unique test removed 2 places
Iterating global reduction 1 with 6 rules applied. Total rules applied 186 place count 30 transition count 16
Applied a total of 186 rules in 5 ms. Remains 30 /144 variables (removed 114) and now considering 16/592 (removed 576) transitions.
// Phase 1: matrix 16 rows 30 cols
[2021-05-14 11:27:05] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-14 11:27:05] [INFO ] Implicit Places using invariants in 28 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 16, 18, 22, 23, 25, 26]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 31 ms to find 14 implicit places.
// Phase 1: matrix 16 rows 16 cols
[2021-05-14 11:27:05] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-14 11:27:05] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Starting structural reductions, iteration 1 : 16/144 places, 16/592 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 16 cols
[2021-05-14 11:27:05] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-14 11:27:05] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 2 iterations. Remains : 16/144 places, 16/592 transitions.
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-20-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GT 2 s14), p1:(GT s8 s9)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 10170 reset in 173 ms.
Product exploration explored 100000 steps with 10179 reset in 209 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 16 transition count 16
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 (G p0)), (F (G (NOT p1))), p0, (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 10312 reset in 70 ms.
Product exploration explored 100000 steps with 10221 reset in 78 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 3 out of 16 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 16 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 8 place count 16 transition count 16
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 16 transition count 16
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 16 place count 10 transition count 10
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 22 place count 10 transition count 10
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 22 rules in 2 ms. Remains 10 /16 variables (removed 6) and now considering 10/16 (removed 6) transitions.
[2021-05-14 11:27:06] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2021-05-14 11:27:06] [INFO ] Computed 0 place invariants in 7 ms
[2021-05-14 11:27:06] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/16 places, 10/16 transitions.
Product exploration explored 100000 steps with 33333 reset in 111 ms.
Product exploration explored 100000 steps with 33333 reset in 116 ms.
[2021-05-14 11:27:06] [INFO ] Flatten gal took : 1 ms
[2021-05-14 11:27:06] [INFO ] Flatten gal took : 1 ms
[2021-05-14 11:27:06] [INFO ] Time to serialize gal into /tmp/LTL14192559948927006129.gal : 0 ms
[2021-05-14 11:27:06] [INFO ] Time to serialize properties into /tmp/LTL7674334819272606687.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/LTL14192559948927006129.gal, -t, CGAL, -LTL, /tmp/LTL7674334819272606687.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/LTL14192559948927006129.gal -t CGAL -LTL /tmp/LTL7674334819272606687.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((F("(c18_0<2)"))&&(X("(c9_0>c12_0)")))))
Formula 0 simplified : !F(F"(c18_0<2)" & X"(c9_0>c12_0)")
Reverse transition relation is NOT exact ! Due to transitions t400, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/15/1/16
Computing Next relation with stutter on 1 deadlock states
62 unique states visited
0 strongly connected components in search stack
61 transitions explored
62 items max in DFS search stack
23 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.23821,21024,1,0,324,24506,58,260,702,29200,824
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA PermAdmissibility-COL-20-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property PermAdmissibility-COL-20-12 finished in 1564 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 8 out of 144 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 144/144 places, 592/592 transitions.
Graph (complete) has 1375 edges and 144 vertex of which 112 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.2 ms
Discarding 32 places :
Also discarding 0 output transitions
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 22 place count 91 transition count 354
Iterating global reduction 0 with 21 rules applied. Total rules applied 43 place count 91 transition count 354
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 57 place count 77 transition count 228
Iterating global reduction 0 with 14 rules applied. Total rules applied 71 place count 77 transition count 228
Applied a total of 71 rules in 13 ms. Remains 77 /144 variables (removed 67) and now considering 228/592 (removed 364) transitions.
// Phase 1: matrix 228 rows 77 cols
[2021-05-14 11:27:07] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-14 11:27:07] [INFO ] Implicit Places using invariants in 59 ms returned [12, 21, 54, 55, 57]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 59 ms to find 5 implicit places.
[2021-05-14 11:27:07] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 228 rows 72 cols
[2021-05-14 11:27:07] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 11:27:07] [INFO ] Dead Transitions using invariants and state equation in 89 ms returned []
Starting structural reductions, iteration 1 : 72/144 places, 228/592 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 72 transition count 225
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 69 transition count 225
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 69 transition count 224
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 68 transition count 224
Applied a total of 8 rules in 8 ms. Remains 68 /72 variables (removed 4) and now considering 224/228 (removed 4) transitions.
// Phase 1: matrix 224 rows 68 cols
[2021-05-14 11:27:07] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 11:27:07] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 224 rows 68 cols
[2021-05-14 11:27:07] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 11:27:07] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 68/144 places, 224/592 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-20-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 (ADD s60 s61 s62 s63 s64 s65 s66 s67))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2351 reset in 549 ms.
Product exploration explored 100000 steps with 2350 reset in 561 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 68 transition count 224
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 41 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2320 reset in 542 ms.
Product exploration explored 100000 steps with 2342 reset in 564 ms.
[2021-05-14 11:27:09] [INFO ] Flatten gal took : 12 ms
[2021-05-14 11:27:09] [INFO ] Flatten gal took : 12 ms
[2021-05-14 11:27:09] [INFO ] Time to serialize gal into /tmp/LTL3215864651910764365.gal : 3 ms
[2021-05-14 11:27:09] [INFO ] Time to serialize properties into /tmp/LTL9798793333765584813.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/LTL3215864651910764365.gal, -t, CGAL, -LTL, /tmp/LTL9798793333765584813.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/LTL3215864651910764365.gal -t CGAL -LTL /tmp/LTL9798793333765584813.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((out6_0+out6_1)+out6_2)+out6_3)+out6_4)+out6_5)+out6_6)+out6_7)>=1)"))))
Formula 0 simplified : !GF"((((((((out6_0+out6_1)+out6_2)+out6_3)+out6_4)+out6_5)+out6_6)+out6_7)>=1)"
Detected timeout of ITS tools.
[2021-05-14 11:27:24] [INFO ] Flatten gal took : 28 ms
[2021-05-14 11:27:24] [INFO ] Applying decomposition
[2021-05-14 11:27:24] [INFO ] Flatten gal took : 12 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/graph1466413972329728472.txt, -o, /tmp/graph1466413972329728472.bin, -w, /tmp/graph1466413972329728472.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/graph1466413972329728472.bin, -l, -1, -v, -w, /tmp/graph1466413972329728472.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 11:27:24] [INFO ] Decomposing Gal with order
[2021-05-14 11:27:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 11:27:25] [INFO ] Removed a total of 18 redundant transitions.
[2021-05-14 11:27:25] [INFO ] Flatten gal took : 22 ms
[2021-05-14 11:27:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 1 ms.
[2021-05-14 11:27:25] [INFO ] Time to serialize gal into /tmp/LTL14566927653347505904.gal : 3 ms
[2021-05-14 11:27:25] [INFO ] Time to serialize properties into /tmp/LTL11817981300123984862.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/LTL14566927653347505904.gal, -t, CGAL, -LTL, /tmp/LTL11817981300123984862.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/LTL14566927653347505904.gal -t CGAL -LTL /tmp/LTL11817981300123984862.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((gu3.out6_0+gu3.out6_1)+gu3.out6_2)+gu3.out6_3)+gu3.out6_4)+gu3.out6_5)+gu3.out6_6)+gu3.out6_7)>=1)"))))
Formula 0 simplified : !GF"((((((((gu3.out6_0+gu3.out6_1)+gu3.out6_2)+gu3.out6_3)+gu3.out6_4)+gu3.out6_5)+gu3.out6_6)+gu3.out6_7)>=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5365485336078363426
[2021-05-14 11:27:40] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5365485336078363426
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/ltsmin5365485336078363426]
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/ltsmin5365485336078363426] 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/ltsmin5365485336078363426] 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-20-14 finished in 34067 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 144 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 144/144 places, 592/592 transitions.
Graph (complete) has 1375 edges and 144 vertex of which 104 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Discarding 40 places :
Also discarding 0 output transitions
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 29 place count 76 transition count 340
Iterating global reduction 0 with 28 rules applied. Total rules applied 57 place count 76 transition count 340
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 85 place count 48 transition count 88
Iterating global reduction 0 with 28 rules applied. Total rules applied 113 place count 48 transition count 88
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 125 place count 36 transition count 28
Iterating global reduction 0 with 12 rules applied. Total rules applied 137 place count 36 transition count 28
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 141 place count 32 transition count 16
Ensure Unique test removed 2 places
Iterating global reduction 0 with 6 rules applied. Total rules applied 147 place count 30 transition count 16
Applied a total of 147 rules in 9 ms. Remains 30 /144 variables (removed 114) and now considering 16/592 (removed 576) transitions.
// Phase 1: matrix 16 rows 30 cols
[2021-05-14 11:27:41] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-14 11:27:41] [INFO ] Implicit Places using invariants in 52 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 16, 18, 22, 23, 25, 26]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 58 ms to find 14 implicit places.
[2021-05-14 11:27:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2021-05-14 11:27:41] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-14 11:27:41] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Starting structural reductions, iteration 1 : 16/144 places, 16/592 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 16 transition count 3
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 27 place count 3 transition count 2
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 2 transition count 2
Applied a total of 28 rules in 1 ms. Remains 2 /16 variables (removed 14) and now considering 2/16 (removed 14) transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-14 11:27:41] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-14 11:27:41] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-14 11:27:41] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-14 11:27:41] [INFO ] Implicit Places using invariants and state equation in 6 ms returned []
Implicit Place search using SMT with State Equation took 11 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 2/144 places, 2/592 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-20-15 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 40 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-20-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-20-15 finished in 125 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14614769090757427032
[2021-05-14 11:27:41] [INFO ] Computing symmetric may disable matrix : 592 transitions.
[2021-05-14 11:27:41] [INFO ] Applying decomposition
[2021-05-14 11:27:41] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 11:27:41] [INFO ] Computing symmetric may enable matrix : 592 transitions.
[2021-05-14 11:27:41] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 11:27:41] [INFO ] Flatten gal took : 41 ms
[2021-05-14 11:27:41] [INFO ] Computing Do-Not-Accords matrix : 592 transitions.
[2021-05-14 11:27:41] [INFO ] Computation of Completed DNA matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 11:27:41] [INFO ] Built C files in 124ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14614769090757427032
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/ltsmin14614769090757427032]
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/graph3338718361264377549.txt, -o, /tmp/graph3338718361264377549.bin, -w, /tmp/graph3338718361264377549.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/graph3338718361264377549.bin, -l, -1, -v, -w, /tmp/graph3338718361264377549.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 11:27:41] [INFO ] Decomposing Gal with order
[2021-05-14 11:27:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 11:27:41] [INFO ] Removed a total of 1449 redundant transitions.
[2021-05-14 11:27:41] [INFO ] Flatten gal took : 136 ms
[2021-05-14 11:27:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 152 labels/synchronizations in 33 ms.
[2021-05-14 11:27:41] [INFO ] Time to serialize gal into /tmp/LTLCardinality18356833417591829493.gal : 13 ms
[2021-05-14 11:27:41] [INFO ] Time to serialize properties into /tmp/LTLCardinality2998199101129724648.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/LTLCardinality18356833417591829493.gal, -t, CGAL, -LTL, /tmp/LTLCardinality2998199101129724648.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/LTLCardinality18356833417591829493.gal -t CGAL -LTL /tmp/LTLCardinality2998199101129724648.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 3 LTL properties
Checking formula 0 : !((G((F("((((((((gi1.gu1.aux12_0+gi1.gu1.aux12_1)+gi1.gu1.aux12_2)+gi1.gu1.aux12_3)+gi1.gu1.aux12_4)+gi1.gu1.aux12_5)+gi1.gu1.aux12_6)+gi1.gu1.aux12_7)<=(((((((gi1.gu1.out5_0+gi1.gu1.out5_1)+gi1.gu1.out5_2)+gi1.gu1.out5_3)+gi1.gu1.out5_4)+gi1.gu1.out5_5)+gi1.gu1.out5_6)+gi1.gu1.out5_7))"))&&(F(G(("((((((((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.c13_0)")&&(("((((((((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.c13_0)")U("((((((((gu11.out7_0+gu11.out7_1)+gu11.out7_2)+gu11.out7_3)+gu11.out7_4)+gu11.out7_5)+gu11.out7_6)+gu11.out7_7)>=1)"))))))))
Formula 0 simplified : !G(F"((((((((gi1.gu1.aux12_0+gi1.gu1.aux12_1)+gi1.gu1.aux12_2)+gi1.gu1.aux12_3)+gi1.gu1.aux12_4)+gi1.gu1.aux12_5)+gi1.gu1.aux12_6)+gi1.gu1.aux12_7)<=(((((((gi1.gu1.out5_0+gi1.gu1.out5_1)+gi1.gu1.out5_2)+gi1.gu1.out5_3)+gi1.gu1.out5_4)+gi1.gu1.out5_5)+gi1.gu1.out5_6)+gi1.gu1.out5_7))" & FG("((((((((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.c13_0)" & ("((((((((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.c13_0)" U "((((((((gu11.out7_0+gu11.out7_1)+gu11.out7_2)+gu11.out7_3)+gu11.out7_4)+gu11.out7_5)+gu11.out7_6)+gu11.out7_7)>=1)")))
Compilation finished in 3927 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin14614769090757427032]
Link finished in 66 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, []((<>((LTLAPp0==true))&&<>([](((LTLAPp1==true)&&((LTLAPp1==true) U (LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin14614769090757427032]
WARNING : LTSmin timed out (>300 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, []((<>((LTLAPp0==true))&&<>([](((LTLAPp1==true)&&((LTLAPp1==true) U (LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin14614769090757427032]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp3==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin14614769090757427032]
WARNING : LTSmin timed out (>300 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp3==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin14614769090757427032]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp4==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin14614769090757427032]
WARNING : LTSmin timed out (>300 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp4==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin14614769090757427032]
Retrying LTSmin with larger timeout 2400 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, []((<>((LTLAPp0==true))&&<>([](((LTLAPp1==true)&&((LTLAPp1==true) U (LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin14614769090757427032]
Detected timeout of ITS tools.
[2021-05-14 11:48:20] [INFO ] Applying decomposition
[2021-05-14 11:48:20] [INFO ] Flatten gal took : 77 ms
[2021-05-14 11:48:20] [INFO ] Decomposing Gal with order
[2021-05-14 11:48:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 11:48:20] [INFO ] Removed a total of 1977 redundant transitions.
[2021-05-14 11:48:20] [INFO ] Flatten gal took : 163 ms
[2021-05-14 11:48:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2021-05-14 11:48:20] [INFO ] Time to serialize gal into /tmp/LTLCardinality11104611793706415551.gal : 3 ms
[2021-05-14 11:48:20] [INFO ] Time to serialize properties into /tmp/LTLCardinality9087029283415655509.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/LTLCardinality11104611793706415551.gal, -t, CGAL, -LTL, /tmp/LTLCardinality9087029283415655509.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/LTLCardinality11104611793706415551.gal -t CGAL -LTL /tmp/LTLCardinality9087029283415655509.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 3 LTL properties
Checking formula 0 : !((G((F("((((((((ginput0.aux12_0+ginput1.aux12_1)+ginput2.aux12_2)+ginput3.aux12_3)+ginput4.aux12_4)+ginput5.aux12_5)+ginput6.aux12_6)+ginput7.aux12_7)<=(((((((ginput0.out5_0+ginput1.out5_1)+ginput2.out5_2)+ginput3.out5_3)+ginput4.out5_4)+ginput5.out5_5)+ginput6.out5_6)+ginput7.out5_7))"))&&(F(G(("((((((((ginput0.aux16_0+ginput1.aux16_1)+ginput2.aux16_2)+ginput3.aux16_3)+ginput4.aux16_4)+ginput5.aux16_5)+ginput6.aux16_6)+ginput7.aux16_7)<=gc13.c13_0)")&&(("((((((((ginput0.aux16_0+ginput1.aux16_1)+ginput2.aux16_2)+ginput3.aux16_3)+ginput4.aux16_4)+ginput5.aux16_5)+ginput6.aux16_6)+ginput7.aux16_7)<=gc13.c13_0)")U("((((((((ginput0.out7_0+ginput1.out7_1)+ginput2.out7_2)+ginput3.out7_3)+ginput4.out7_4)+ginput5.out7_5)+ginput6.out7_6)+ginput7.out7_7)>=1)"))))))))
Formula 0 simplified : !G(F"((((((((ginput0.aux12_0+ginput1.aux12_1)+ginput2.aux12_2)+ginput3.aux12_3)+ginput4.aux12_4)+ginput5.aux12_5)+ginput6.aux12_6)+ginput7.aux12_7)<=(((((((ginput0.out5_0+ginput1.out5_1)+ginput2.out5_2)+ginput3.out5_3)+ginput4.out5_4)+ginput5.out5_5)+ginput6.out5_6)+ginput7.out5_7))" & FG("((((((((ginput0.aux16_0+ginput1.aux16_1)+ginput2.aux16_2)+ginput3.aux16_3)+ginput4.aux16_4)+ginput5.aux16_5)+ginput6.aux16_6)+ginput7.aux16_7)<=gc13.c13_0)" & ("((((((((ginput0.aux16_0+ginput1.aux16_1)+ginput2.aux16_2)+ginput3.aux16_3)+ginput4.aux16_4)+ginput5.aux16_5)+ginput6.aux16_6)+ginput7.aux16_7)<=gc13.c13_0)" U "((((((((ginput0.out7_0+ginput1.out7_1)+ginput2.out7_2)+ginput3.out7_3)+ginput4.out7_4)+ginput5.out7_5)+ginput6.out7_6)+ginput7.out7_7)>=1)")))
Detected timeout of ITS tools.
[2021-05-14 12:08:59] [INFO ] Flatten gal took : 78 ms
[2021-05-14 12:08:59] [INFO ] Input system was already deterministic with 592 transitions.
[2021-05-14 12:08:59] [INFO ] Transformed 144 places.
[2021-05-14 12:08:59] [INFO ] Transformed 592 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
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 12:09:55] [INFO ] Time to serialize gal into /tmp/LTLCardinality12813797557286426675.gal : 3 ms
[2021-05-14 12:09:55] [INFO ] Time to serialize properties into /tmp/LTLCardinality18151320383499680175.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/LTLCardinality12813797557286426675.gal, -t, CGAL, -LTL, /tmp/LTLCardinality18151320383499680175.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/LTLCardinality12813797557286426675.gal -t CGAL -LTL /tmp/LTLCardinality18151320383499680175.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((F("((((((((aux12_0+aux12_1)+aux12_2)+aux12_3)+aux12_4)+aux12_5)+aux12_6)+aux12_7)<=(((((((out5_0+out5_1)+out5_2)+out5_3)+out5_4)+out5_5)+out5_6)+out5_7))"))&&(F(G(("((((((((aux16_0+aux16_1)+aux16_2)+aux16_3)+aux16_4)+aux16_5)+aux16_6)+aux16_7)<=c13_0)")&&(("((((((((aux16_0+aux16_1)+aux16_2)+aux16_3)+aux16_4)+aux16_5)+aux16_6)+aux16_7)<=c13_0)")U("((((((((out7_0+out7_1)+out7_2)+out7_3)+out7_4)+out7_5)+out7_6)+out7_7)>=1)"))))))))
Formula 0 simplified : !G(F"((((((((aux12_0+aux12_1)+aux12_2)+aux12_3)+aux12_4)+aux12_5)+aux12_6)+aux12_7)<=(((((((out5_0+out5_1)+out5_2)+out5_3)+out5_4)+out5_5)+out5_6)+out5_7))" & FG("((((((((aux16_0+aux16_1)+aux16_2)+aux16_3)+aux16_4)+aux16_5)+aux16_6)+aux16_7)<=c13_0)" & ("((((((((aux16_0+aux16_1)+aux16_2)+aux16_3)+aux16_4)+aux16_5)+aux16_6)+aux16_7)<=c13_0)" U "((((((((out7_0+out7_1)+out7_2)+out7_3)+out7_4)+out7_5)+out7_6)+out7_7)>=1)")))
WARNING : LTSmin timed out (>2400 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, []((<>((LTLAPp0==true))&&<>([](((LTLAPp1==true)&&((LTLAPp1==true) U (LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin14614769090757427032]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp3==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin14614769090757427032]

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

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

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