About the Execution of ITS-Tools for LamportFastMutEx-COL-5
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2835.896 | 253983.00 | 876474.00 | 209.40 | FFFTFTFFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r132-tall-165271820800364.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is LamportFastMutEx-COL-5, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271820800364
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 284K
-rw-r--r-- 1 mcc users 7.6K Apr 29 19:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 29 19:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 29 19:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 29 19:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 41K May 10 09:34 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 LamportFastMutEx-COL-5-LTLFireability-00
FORMULA_NAME LamportFastMutEx-COL-5-LTLFireability-01
FORMULA_NAME LamportFastMutEx-COL-5-LTLFireability-02
FORMULA_NAME LamportFastMutEx-COL-5-LTLFireability-03
FORMULA_NAME LamportFastMutEx-COL-5-LTLFireability-04
FORMULA_NAME LamportFastMutEx-COL-5-LTLFireability-05
FORMULA_NAME LamportFastMutEx-COL-5-LTLFireability-06
FORMULA_NAME LamportFastMutEx-COL-5-LTLFireability-07
FORMULA_NAME LamportFastMutEx-COL-5-LTLFireability-08
FORMULA_NAME LamportFastMutEx-COL-5-LTLFireability-09
FORMULA_NAME LamportFastMutEx-COL-5-LTLFireability-10
FORMULA_NAME LamportFastMutEx-COL-5-LTLFireability-11
FORMULA_NAME LamportFastMutEx-COL-5-LTLFireability-12
FORMULA_NAME LamportFastMutEx-COL-5-LTLFireability-13
FORMULA_NAME LamportFastMutEx-COL-5-LTLFireability-14
FORMULA_NAME LamportFastMutEx-COL-5-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652777274749
Running Version 202205111006
[2022-05-17 08:47:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 08:47:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 08:47:55] [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.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-17 08:47:56] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 08:47:56] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 564 ms
[2022-05-17 08:47:56] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 174 PT places and 396.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2022-05-17 08:47:56] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 7 ms.
[2022-05-17 08:47:56] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Initial state reduction rules removed 3 formulas.
FORMULA LamportFastMutEx-COL-5-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 8864 steps, including 2 resets, run visited all 17 properties in 98 ms. (steps per millisecond=90 )
[2022-05-17 08:47:56] [INFO ] Flatten gal took : 15 ms
[2022-05-17 08:47:56] [INFO ] Flatten gal took : 3 ms
Domain [pid(6), pid(6)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2022-05-17 08:47:56] [INFO ] Unfolded HLPN to a Petri net with 174 places and 318 transitions 1380 arcs in 16 ms.
[2022-05-17 08:47:56] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 58 transitions.
Support contains 127 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 9 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2022-05-17 08:47:56] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:47:56] [INFO ] Computed 37 place invariants in 9 ms
[2022-05-17 08:47:57] [INFO ] Implicit Places using invariants in 153 ms returned []
[2022-05-17 08:47:57] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:47:57] [INFO ] Computed 37 place invariants in 11 ms
[2022-05-17 08:47:57] [INFO ] State equation strengthened by 55 read => feed constraints.
[2022-05-17 08:47:57] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2022-05-17 08:47:57] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:47:57] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-17 08:47:57] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 137/137 places, 260/260 transitions.
Support contains 127 out of 137 places after structural reductions.
[2022-05-17 08:47:57] [INFO ] Flatten gal took : 28 ms
[2022-05-17 08:47:57] [INFO ] Flatten gal took : 33 ms
[2022-05-17 08:47:57] [INFO ] Input system was already deterministic with 260 transitions.
Finished random walk after 109 steps, including 0 resets, run visited all 22 properties in 10 ms. (steps per millisecond=10 )
FORMULA LamportFastMutEx-COL-5-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 5 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X((G(p1)||p0)))))'
Support contains 56 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 5 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2022-05-17 08:47:57] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:47:57] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-17 08:47:58] [INFO ] Implicit Places using invariants in 68 ms returned []
[2022-05-17 08:47:58] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:47:58] [INFO ] Computed 37 place invariants in 6 ms
[2022-05-17 08:47:58] [INFO ] State equation strengthened by 55 read => feed constraints.
[2022-05-17 08:47:58] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2022-05-17 08:47:58] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:47:58] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-17 08:47:58] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 137/137 places, 260/260 transitions.
Stuttering acceptance computed with spot in 345 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : LamportFastMutEx-COL-5-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(AND (OR (LT s11 1) (LT s44 1)) (OR (LT s16 1) (LT s45 1)) (OR (LT s11 1) (LT s43 1)) (OR (LT s16 1) (LT s44 1)) (OR (LT s11 1) (LT s42 1)) (OR (LT s16...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1448 steps with 0 reset in 28 ms.
FORMULA LamportFastMutEx-COL-5-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-5-LTLFireability-01 finished in 756 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 16 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 6 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2022-05-17 08:47:58] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:47:58] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-17 08:47:58] [INFO ] Implicit Places using invariants in 91 ms returned [87, 88, 89, 90, 91]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 93 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/137 places, 260/260 transitions.
Applied a total of 0 rules in 4 ms. Remains 132 /132 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 132/137 places, 260/260 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : LamportFastMutEx-COL-5-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (GEQ s57 1) (GEQ s59 1) (GEQ s58 1) (GEQ s61 1) (GEQ s60 1)), p0:(OR (AND (GEQ s5 1) (GEQ s30 1)) (AND (GEQ s5 1) (GEQ s31 1)) (AND (GEQ s9 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA LamportFastMutEx-COL-5-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-5-LTLFireability-02 finished in 233 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 40 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 19 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2022-05-17 08:47:58] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:47:58] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-17 08:47:58] [INFO ] Implicit Places using invariants in 66 ms returned []
[2022-05-17 08:47:58] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:47:58] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-17 08:47:59] [INFO ] State equation strengthened by 55 read => feed constraints.
[2022-05-17 08:47:59] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2022-05-17 08:47:59] [INFO ] Redundant transitions in 12 ms returned []
[2022-05-17 08:47:59] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:47:59] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-17 08:47:59] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 137/137 places, 260/260 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-5-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s6 1) (GEQ s47 1)) (AND (GEQ s7 1) (GEQ s48 1)) (AND (GEQ s8 1) (GEQ s49 1)) (AND (GEQ s9 1) (GEQ s50 1)) (AND (GEQ s10 1) (GEQ s51 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4138 reset in 282 ms.
Product exploration explored 100000 steps with 4153 reset in 257 ms.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2022-05-17 08:48:00] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:48:00] [INFO ] Computed 37 place invariants in 3 ms
[2022-05-17 08:48:00] [INFO ] [Real]Absence check using 37 positive place invariants in 10 ms returned sat
[2022-05-17 08:48:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:48:00] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2022-05-17 08:48:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:48:00] [INFO ] [Nat]Absence check using 37 positive place invariants in 10 ms returned sat
[2022-05-17 08:48:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:48:00] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2022-05-17 08:48:00] [INFO ] State equation strengthened by 55 read => feed constraints.
[2022-05-17 08:48:00] [INFO ] [Nat]Added 55 Read/Feed constraints in 13 ms returned sat
[2022-05-17 08:48:00] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 2 ms to minimize.
[2022-05-17 08:48:00] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2022-05-17 08:48:00] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2022-05-17 08:48:00] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 2 ms to minimize.
[2022-05-17 08:48:00] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2022-05-17 08:48:01] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2022-05-17 08:48:01] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2022-05-17 08:48:01] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 361 ms
[2022-05-17 08:48:01] [INFO ] Computed and/alt/rep : 175/790/175 causal constraints (skipped 20 transitions) in 13 ms.
[2022-05-17 08:48:01] [INFO ] Added : 115 causal constraints over 24 iterations in 447 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 40 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 11 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2022-05-17 08:48:01] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:48:01] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-17 08:48:01] [INFO ] Implicit Places using invariants in 78 ms returned []
[2022-05-17 08:48:01] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:48:01] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-17 08:48:01] [INFO ] State equation strengthened by 55 read => feed constraints.
[2022-05-17 08:48:01] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2022-05-17 08:48:01] [INFO ] Redundant transitions in 10 ms returned []
[2022-05-17 08:48:01] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:48:01] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-17 08:48:01] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 137/137 places, 260/260 transitions.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 30 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=30 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2022-05-17 08:48:02] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:48:02] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-17 08:48:02] [INFO ] [Real]Absence check using 37 positive place invariants in 11 ms returned sat
[2022-05-17 08:48:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:48:02] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2022-05-17 08:48:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:48:02] [INFO ] [Nat]Absence check using 37 positive place invariants in 9 ms returned sat
[2022-05-17 08:48:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:48:02] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2022-05-17 08:48:02] [INFO ] State equation strengthened by 55 read => feed constraints.
[2022-05-17 08:48:02] [INFO ] [Nat]Added 55 Read/Feed constraints in 12 ms returned sat
[2022-05-17 08:48:02] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2022-05-17 08:48:02] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2022-05-17 08:48:02] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2022-05-17 08:48:02] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2022-05-17 08:48:02] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2022-05-17 08:48:02] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2022-05-17 08:48:02] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2022-05-17 08:48:03] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 349 ms
[2022-05-17 08:48:03] [INFO ] Computed and/alt/rep : 175/790/175 causal constraints (skipped 20 transitions) in 14 ms.
[2022-05-17 08:48:03] [INFO ] Added : 115 causal constraints over 24 iterations in 440 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4135 reset in 240 ms.
Product exploration explored 100000 steps with 4139 reset in 219 ms.
Built C files in :
/tmp/ltsmin4334346370532478882
[2022-05-17 08:48:03] [INFO ] Computing symmetric may disable matrix : 260 transitions.
[2022-05-17 08:48:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 08:48:03] [INFO ] Computing symmetric may enable matrix : 260 transitions.
[2022-05-17 08:48:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 08:48:03] [INFO ] Computing Do-Not-Accords matrix : 260 transitions.
[2022-05-17 08:48:03] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 08:48:03] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4334346370532478882
Running compilation step : cd /tmp/ltsmin4334346370532478882;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 548 ms.
Running link step : cd /tmp/ltsmin4334346370532478882;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin4334346370532478882;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3123029822987322935.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 40 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 9 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2022-05-17 08:48:19] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:48:19] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-17 08:48:19] [INFO ] Implicit Places using invariants in 71 ms returned []
[2022-05-17 08:48:19] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:48:19] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-17 08:48:19] [INFO ] State equation strengthened by 55 read => feed constraints.
[2022-05-17 08:48:19] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2022-05-17 08:48:19] [INFO ] Redundant transitions in 4 ms returned []
[2022-05-17 08:48:19] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:48:19] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-17 08:48:19] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 137/137 places, 260/260 transitions.
Built C files in :
/tmp/ltsmin8200496992766181360
[2022-05-17 08:48:19] [INFO ] Computing symmetric may disable matrix : 260 transitions.
[2022-05-17 08:48:19] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 08:48:19] [INFO ] Computing symmetric may enable matrix : 260 transitions.
[2022-05-17 08:48:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 08:48:19] [INFO ] Computing Do-Not-Accords matrix : 260 transitions.
[2022-05-17 08:48:19] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 08:48:19] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8200496992766181360
Running compilation step : cd /tmp/ltsmin8200496992766181360;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 463 ms.
Running link step : cd /tmp/ltsmin8200496992766181360;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin8200496992766181360;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3208691583430940918.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 08:48:34] [INFO ] Flatten gal took : 16 ms
[2022-05-17 08:48:34] [INFO ] Flatten gal took : 15 ms
[2022-05-17 08:48:34] [INFO ] Time to serialize gal into /tmp/LTL10539462937914544981.gal : 3 ms
[2022-05-17 08:48:34] [INFO ] Time to serialize properties into /tmp/LTL17534122225216495357.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10539462937914544981.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17534122225216495357.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1053946...268
Read 1 LTL properties
Checking formula 0 : !((F("((((((x_1>=1)&&(P_ifxi_10_1>=1))||((x_2>=1)&&(P_ifxi_10_2>=1)))||(((x_3>=1)&&(P_ifxi_10_3>=1))||((x_4>=1)&&(P_ifxi_10_4>=1))))||...739
Formula 0 simplified : !F"((((((x_1>=1)&&(P_ifxi_10_1>=1))||((x_2>=1)&&(P_ifxi_10_2>=1)))||(((x_3>=1)&&(P_ifxi_10_3>=1))||((x_4>=1)&&(P_ifxi_10_4>=1))))||(...735
Detected timeout of ITS tools.
[2022-05-17 08:48:49] [INFO ] Flatten gal took : 14 ms
[2022-05-17 08:48:49] [INFO ] Applying decomposition
[2022-05-17 08:48:49] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6800268806673199341.txt' '-o' '/tmp/graph6800268806673199341.bin' '-w' '/tmp/graph6800268806673199341.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6800268806673199341.bin' '-l' '-1' '-v' '-w' '/tmp/graph6800268806673199341.weights' '-q' '0' '-e' '0.001'
[2022-05-17 08:48:49] [INFO ] Decomposing Gal with order
[2022-05-17 08:48:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 08:48:49] [INFO ] Removed a total of 358 redundant transitions.
[2022-05-17 08:48:49] [INFO ] Flatten gal took : 44 ms
[2022-05-17 08:48:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 10 ms.
[2022-05-17 08:48:49] [INFO ] Time to serialize gal into /tmp/LTL280235243037091164.gal : 4 ms
[2022-05-17 08:48:49] [INFO ] Time to serialize properties into /tmp/LTL18208821393748132673.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL280235243037091164.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18208821393748132673.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2802352...245
Read 1 LTL properties
Checking formula 0 : !((F("((((((i4.u6.x_1>=1)&&(i5.u14.P_ifxi_10_1>=1))||((i0.u7.x_2>=1)&&(i5.u10.P_ifxi_10_2>=1)))||(((i1.i0.u8.x_3>=1)&&(i1.i0.u11.P_ifx...1059
Formula 0 simplified : !F"((((((i4.u6.x_1>=1)&&(i5.u14.P_ifxi_10_1>=1))||((i0.u7.x_2>=1)&&(i5.u10.P_ifxi_10_2>=1)))||(((i1.i0.u8.x_3>=1)&&(i1.i0.u11.P_ifxi...1055
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15929254371848050020
[2022-05-17 08:49:04] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15929254371848050020
Running compilation step : cd /tmp/ltsmin15929254371848050020;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 377 ms.
Running link step : cd /tmp/ltsmin15929254371848050020;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin15929254371848050020;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property LamportFastMutEx-COL-5-LTLFireability-03 finished in 81086 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((p0 U p1)))))'
Support contains 21 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 132 transition count 255
Applied a total of 10 rules in 20 ms. Remains 132 /137 variables (removed 5) and now considering 255/260 (removed 5) transitions.
[2022-05-17 08:49:19] [INFO ] Flow matrix only has 195 transitions (discarded 60 similar events)
// Phase 1: matrix 195 rows 132 cols
[2022-05-17 08:49:19] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-17 08:49:20] [INFO ] Implicit Places using invariants in 94 ms returned [82, 83, 84, 85, 86]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 94 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 127/137 places, 255/260 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 127 transition count 250
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 122 transition count 250
Applied a total of 10 rules in 11 ms. Remains 122 /127 variables (removed 5) and now considering 250/255 (removed 5) transitions.
[2022-05-17 08:49:20] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2022-05-17 08:49:20] [INFO ] Computed 32 place invariants in 2 ms
[2022-05-17 08:49:20] [INFO ] Implicit Places using invariants in 81 ms returned []
[2022-05-17 08:49:20] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2022-05-17 08:49:20] [INFO ] Computed 32 place invariants in 0 ms
[2022-05-17 08:49:20] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-17 08:49:20] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 122/137 places, 250/260 transitions.
Finished structural reductions, in 2 iterations. Remains : 122/137 places, 250/260 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : LamportFastMutEx-COL-5-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s6 1) (GEQ s47 1)) (AND (GEQ s7 1) (GEQ s48 1)) (AND (GEQ s8 1) (GEQ s49 1)) (AND (GEQ s9 1) (GEQ s50 1)) (AND (GEQ s10 1) (GEQ s51 1))),...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 624 ms.
Stack based approach found an accepted trace after 233 steps with 0 reset with depth 234 and stack size 234 in 2 ms.
FORMULA LamportFastMutEx-COL-5-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-5-LTLFireability-04 finished in 1051 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((((p0 U p1)&&p2) U X(p3))||G(p4)))'
Support contains 41 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 4 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2022-05-17 08:49:21] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:49:21] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-17 08:49:21] [INFO ] Implicit Places using invariants in 75 ms returned [87, 88, 89, 90, 91]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 75 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/137 places, 260/260 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 132/137 places, 260/260 transitions.
Stuttering acceptance computed with spot in 441 ms :[(AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p4) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), true, (NOT p4), (NOT p1), (AND (NOT p1) (NOT p4))]
Running random walk in product with property : LamportFastMutEx-COL-5-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p0) (NOT p4))), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p2) p4) (AND (NOT p1) (NOT p0) p4)), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p1) p0 (NOT p4)), acceptance={} source=0 dest: 3}, { cond=(OR (AND p2 p1 (NOT p4)) (AND p2 p0 (NOT p4))), acceptance={} source=0 dest: 4}, { cond=(AND p2 (NOT p1) p0 p4), acceptance={} source=0 dest: 5}, { cond=(OR (AND p2 p1 p4) (AND p2 p0 p4)), acceptance={} source=0 dest: 6}], [{ cond=(NOT p3), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={} source=2 dest: 7}, { cond=(AND p4 (NOT p3)), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=3 dest: 9}], [{ cond=(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p0) (NOT p3))), acceptance={0} source=4 dest: 1}, { cond=(AND p2 (NOT p1) p0 (NOT p3)), acceptance={0} source=4 dest: 3}, { cond=(OR (AND p2 p1 (NOT p3)) (AND p2 p0 (NOT p3))), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p4) (NOT p3)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p1) (NOT p0) p4 (NOT p3)), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p1) p0 (NOT p4) (NOT p3)), acceptance={} source=5 dest: 9}, { cond=(AND (NOT p1) p0 p4 (NOT p3)), acceptance={} source=5 dest: 10}], [{ cond=(OR (AND (NOT p2) (NOT p4) (NOT p3)) (AND (NOT p1) (NOT p0) (NOT p4) (NOT p3))), acceptance={} source=6 dest: 1}, { cond=(OR (AND (NOT p2) p4 (NOT p3)) (AND (NOT p1) (NOT p0) p4 (NOT p3))), acceptance={} source=6 dest: 2}, { cond=(AND p2 (NOT p1) p0 (NOT p4) (NOT p3)), acceptance={} source=6 dest: 3}, { cond=(OR (AND p2 p1 (NOT p4) (NOT p3)) (AND p2 p0 (NOT p4) (NOT p3))), acceptance={} source=6 dest: 4}, { cond=(AND p2 (NOT p1) p0 p4 (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(OR (AND p2 p1 p4 (NOT p3)) (AND p2 p0 p4 (NOT p3))), acceptance={} source=6 dest: 6}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(NOT p4), acceptance={} source=8 dest: 7}, { cond=p4, acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=9 dest: 7}, { cond=(AND (NOT p1) p0), acceptance={0} source=9 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p4)), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p1) (NOT p0) p4), acceptance={} source=10 dest: 8}, { cond=(AND (NOT p1) p0 (NOT p4)), acceptance={} source=10 dest: 9}, { cond=(AND (NOT p1) p0 p4), acceptance={} source=10 dest: 10}]], initial=0, aps=[p2:(OR (AND (GEQ s26 1) (GEQ s56 1)) (AND (GEQ s17 1) (GEQ s52 1)) (AND (GEQ s19 1) (GEQ s53 1)) (AND (GEQ s24 1) (GEQ s55 1)) (AND (GEQ s18 1) (GEQ s52 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-COL-5-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-5-LTLFireability-06 finished in 555 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||X(G((F(p0) U p0)))))'
Support contains 15 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 132 transition count 255
Applied a total of 10 rules in 18 ms. Remains 132 /137 variables (removed 5) and now considering 255/260 (removed 5) transitions.
[2022-05-17 08:49:21] [INFO ] Flow matrix only has 195 transitions (discarded 60 similar events)
// Phase 1: matrix 195 rows 132 cols
[2022-05-17 08:49:21] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-17 08:49:21] [INFO ] Implicit Places using invariants in 77 ms returned [82, 83, 84, 85, 86]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 78 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 127/137 places, 255/260 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 127 transition count 250
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 122 transition count 250
Applied a total of 10 rules in 10 ms. Remains 122 /127 variables (removed 5) and now considering 250/255 (removed 5) transitions.
[2022-05-17 08:49:21] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2022-05-17 08:49:21] [INFO ] Computed 32 place invariants in 2 ms
[2022-05-17 08:49:21] [INFO ] Implicit Places using invariants in 80 ms returned []
[2022-05-17 08:49:21] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2022-05-17 08:49:21] [INFO ] Computed 32 place invariants in 1 ms
[2022-05-17 08:49:21] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-17 08:49:21] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 122/137 places, 250/260 transitions.
Finished structural reductions, in 2 iterations. Remains : 122/137 places, 250/260 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-5-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s26 1) (GEQ s56 1)) (AND (GEQ s17 1) (GEQ s52 1)) (AND (GEQ s19 1) (GEQ s53 1)) (AND (GEQ s24 1) (GEQ s55 1)) (AND (GEQ s18 1) (GEQ s52 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6125 reset in 215 ms.
Stack based approach found an accepted trace after 63884 steps with 3914 reset with depth 36 and stack size 36 in 155 ms.
FORMULA LamportFastMutEx-COL-5-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-5-LTLFireability-07 finished in 810 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(!(X(G(!p1)) U (X(p1)||p2)))&&p0))))'
Support contains 11 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 4 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2022-05-17 08:49:22] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:49:22] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-17 08:49:22] [INFO ] Implicit Places using invariants in 79 ms returned [87, 88, 89, 90, 91]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 80 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/137 places, 260/260 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 132/137 places, 260/260 transitions.
Stuttering acceptance computed with spot in 184 ms :[true, (OR (NOT p0) p1 p2), (OR p1 p2), (OR (NOT p0) p1 p2), (OR (NOT p0) p1 p2)]
Running random walk in product with property : LamportFastMutEx-COL-5-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) p2), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(OR p2 p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(AND (OR (LT s11 1) (LT s41 1)) (OR (LT s11 1) (LT s40 1)) (OR (LT s11 1) (LT s39 1)) (OR (LT s11 1) (LT s38 1)) (OR (LT s11 1) (LT s37 1))), p2:(OR (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA LamportFastMutEx-COL-5-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-5-LTLFireability-09 finished in 297 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((F(p1)||p0))))'
Support contains 46 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 9 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2022-05-17 08:49:22] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:49:22] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-17 08:49:22] [INFO ] Implicit Places using invariants in 63 ms returned []
[2022-05-17 08:49:22] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:49:22] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-17 08:49:22] [INFO ] State equation strengthened by 55 read => feed constraints.
[2022-05-17 08:49:22] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2022-05-17 08:49:22] [INFO ] Redundant transitions in 5 ms returned []
[2022-05-17 08:49:22] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:49:22] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-17 08:49:22] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 137/137 places, 260/260 transitions.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : LamportFastMutEx-COL-5-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s23 1) (GEQ s75 1) (GEQ s89 1)) (AND (GEQ s25 1) (GEQ s66 1) (GEQ s87 1)) (AND (GEQ s19 1) (GEQ s68 1) (GEQ s88 1)) (AND (GEQ s21 1) (GEQ...], 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 4987 reset in 403 ms.
Product exploration explored 100000 steps with 5052 reset in 419 ms.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 46 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 9 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2022-05-17 08:49:24] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:49:24] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-17 08:49:24] [INFO ] Implicit Places using invariants in 63 ms returned []
[2022-05-17 08:49:24] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:49:24] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-17 08:49:24] [INFO ] State equation strengthened by 55 read => feed constraints.
[2022-05-17 08:49:24] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2022-05-17 08:49:24] [INFO ] Redundant transitions in 2 ms returned []
[2022-05-17 08:49:24] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:49:24] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-17 08:49:24] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 137/137 places, 260/260 transitions.
Computed a total of 1 stabilizing places and 5 stable transitions
Computed a total of 1 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5079 reset in 416 ms.
Product exploration explored 100000 steps with 5120 reset in 415 ms.
Built C files in :
/tmp/ltsmin16247825115534910066
[2022-05-17 08:49:26] [INFO ] Computing symmetric may disable matrix : 260 transitions.
[2022-05-17 08:49:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 08:49:26] [INFO ] Computing symmetric may enable matrix : 260 transitions.
[2022-05-17 08:49:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 08:49:26] [INFO ] Computing Do-Not-Accords matrix : 260 transitions.
[2022-05-17 08:49:26] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 08:49:26] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16247825115534910066
Running compilation step : cd /tmp/ltsmin16247825115534910066;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 486 ms.
Running link step : cd /tmp/ltsmin16247825115534910066;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin16247825115534910066;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased576689017015797351.hoa' '--buchi-type=spotba'
LTSmin run took 169 ms.
FORMULA LamportFastMutEx-COL-5-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-COL-5-LTLFireability-11 finished in 4090 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(G(p0))) U G(X(p1))))'
Support contains 20 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 1 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2022-05-17 08:49:26] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:49:26] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-17 08:49:26] [INFO ] Implicit Places using invariants in 82 ms returned [87, 88, 89, 90, 91]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 83 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/137 places, 260/260 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 132/137 places, 260/260 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-5-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s24 1) (GEQ s35 1)) (AND (GEQ s20 1) (GEQ s33 1)) (AND (GEQ s25 1) (GEQ s36 1)) (AND (GEQ s17 1) (GEQ s32 1)) (AND (GEQ s23 1) (GEQ s35 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 180 ms.
Stack based approach found an accepted trace after 284 steps with 0 reset with depth 285 and stack size 285 in 0 ms.
FORMULA LamportFastMutEx-COL-5-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-5-LTLFireability-12 finished in 382 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(p1))||p0)))'
Support contains 45 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 9 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2022-05-17 08:49:27] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:49:27] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-17 08:49:27] [INFO ] Implicit Places using invariants in 70 ms returned []
[2022-05-17 08:49:27] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:49:27] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-17 08:49:27] [INFO ] State equation strengthened by 55 read => feed constraints.
[2022-05-17 08:49:27] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2022-05-17 08:49:27] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-17 08:49:27] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:49:27] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-17 08:49:27] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 137/137 places, 260/260 transitions.
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : LamportFastMutEx-COL-5-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (AND (GEQ s23 1) (GEQ s75 1) (GEQ s89 1)) (AND (GEQ s25 1) (GEQ s66 1) (GEQ s87 1)) (AND (GEQ s19 1) (GEQ s68 1) (GEQ s88 1)) (AND (GEQ s21 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2433 reset in 438 ms.
Stack based approach found an accepted trace after 48448 steps with 1189 reset with depth 68 and stack size 68 in 217 ms.
FORMULA LamportFastMutEx-COL-5-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-5-LTLFireability-13 finished in 1029 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0)||X(p1))&&(F(p3)||p2))))'
Support contains 50 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 1 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2022-05-17 08:49:28] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:49:28] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-17 08:49:28] [INFO ] Implicit Places using invariants in 64 ms returned []
[2022-05-17 08:49:28] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:49:28] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-17 08:49:28] [INFO ] State equation strengthened by 55 read => feed constraints.
[2022-05-17 08:49:28] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2022-05-17 08:49:28] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:49:28] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-17 08:49:28] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 137/137 places, 260/260 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p3), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-5-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (OR (LT s91 1) (LT s112 1) (LT s113 1) (LT s114 1) (LT s115 1) (LT s116 1)) (OR (LT s88 1) (LT s97 1) (LT s98 1) (LT s99 1) (LT s100 1) (LT s101 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 30 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-COL-5-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-5-LTLFireability-14 finished in 564 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(G(X((F(p0)&&X(X(p1))&&p2)))))))'
Support contains 56 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 7 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2022-05-17 08:49:28] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:49:28] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-17 08:49:28] [INFO ] Implicit Places using invariants in 59 ms returned []
[2022-05-17 08:49:28] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:49:28] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-17 08:49:28] [INFO ] State equation strengthened by 55 read => feed constraints.
[2022-05-17 08:49:28] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2022-05-17 08:49:28] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-17 08:49:28] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2022-05-17 08:49:28] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-17 08:49:29] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 137/137 places, 260/260 transitions.
Stuttering acceptance computed with spot in 64 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-5-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p2 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(OR (AND (GEQ s6 1) (GEQ s47 1)) (AND (GEQ s7 1) (GEQ s48 1)) (AND (GEQ s8 1) (GEQ s49 1)) (AND (GEQ s9 1) (GEQ s50 1)) (AND (GEQ s10 1) (GEQ s51 1))),...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 392 ms.
Stack based approach found an accepted trace after 237 steps with 0 reset with depth 238 and stack size 238 in 1 ms.
FORMULA LamportFastMutEx-COL-5-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-5-LTLFireability-15 finished in 764 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
[2022-05-17 08:49:29] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12710891020496068321
[2022-05-17 08:49:29] [INFO ] Computing symmetric may disable matrix : 260 transitions.
[2022-05-17 08:49:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 08:49:29] [INFO ] Computing symmetric may enable matrix : 260 transitions.
[2022-05-17 08:49:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 08:49:29] [INFO ] Applying decomposition
[2022-05-17 08:49:29] [INFO ] Computing Do-Not-Accords matrix : 260 transitions.
[2022-05-17 08:49:29] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 08:49:29] [INFO ] Flatten gal took : 13 ms
[2022-05-17 08:49:29] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12710891020496068321
Running compilation step : cd /tmp/ltsmin12710891020496068321;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3417479927822621938.txt' '-o' '/tmp/graph3417479927822621938.bin' '-w' '/tmp/graph3417479927822621938.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3417479927822621938.bin' '-l' '-1' '-v' '-w' '/tmp/graph3417479927822621938.weights' '-q' '0' '-e' '0.001'
[2022-05-17 08:49:29] [INFO ] Decomposing Gal with order
[2022-05-17 08:49:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 08:49:29] [INFO ] Removed a total of 358 redundant transitions.
[2022-05-17 08:49:29] [INFO ] Flatten gal took : 24 ms
[2022-05-17 08:49:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 9 ms.
[2022-05-17 08:49:29] [INFO ] Time to serialize gal into /tmp/LTLFireability13407557578025127778.gal : 3 ms
[2022-05-17 08:49:29] [INFO ] Time to serialize properties into /tmp/LTLFireability3292416216083650871.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13407557578025127778.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3292416216083650871.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !((F("((((((i0.u5.x_1>=1)&&(i7.u12.P_ifxi_10_1>=1))||((i1.i0.u6.x_2>=1)&&(i7.u10.P_ifxi_10_2>=1)))||(((i4.i0.u7.x_3>=1)&&(u13.P_ifxi_1...1089
Formula 0 simplified : !F"((((((i0.u5.x_1>=1)&&(i7.u12.P_ifxi_10_1>=1))||((i1.i0.u6.x_2>=1)&&(i7.u10.P_ifxi_10_2>=1)))||(((i4.i0.u7.x_3>=1)&&(u13.P_ifxi_10...1085
Compilation finished in 483 ms.
Running link step : cd /tmp/ltsmin12710891020496068321;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin12710891020496068321;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t5, t10, t11, t12, t13, t14, t16, t17, t18, t19, t20, t22, t23, t24, t25, t26, t28, t29, t30,...1014
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
6471 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,64.7399,1187728,1,0,2.26784e+06,457,2957,3.1433e+06,236,1997,4057472
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA LamportFastMutEx-COL-5-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 252860 ms.
BK_STOP 1652777528732
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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="LamportFastMutEx-COL-5"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is LamportFastMutEx-COL-5, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-tall-165271820800364"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-5.tgz
mv LamportFastMutEx-COL-5 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;