Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r268-smll-171654407000148.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PermAdmissibility-COL-50, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-171654407000148
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 6.2K Apr 12 09:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 12 09:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 12 09:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 12 09:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 09:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 12 09:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 09:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 12 09:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 54K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-00
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-01
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-02
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-03
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-04
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-05
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-06
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-07
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-08
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-09
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-10
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-11
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-12
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-13
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-14
FORMULA_NAME PermAdmissibility-COL-50-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716686626299

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-COL-50
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202405141337
[2024-05-26 01:23:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 01:23:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 01:23:48] [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.
[2024-05-26 01:23:48] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 01:23:49] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1061 ms
[2024-05-26 01:23:49] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 28 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2024-05-26 01:23:49] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 6 ms.
[2024-05-26 01:23:49] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PermAdmissibility-COL-50-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-50-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-50-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Reduction of identical properties reduced properties to check from 17 to 13
RANDOM walk for 2860 steps (0 resets) in 58 ms. (48 steps per ms) remains 0/13 properties
[2024-05-26 01:23:49] [INFO ] Flatten gal took : 27 ms
[2024-05-26 01:23:49] [INFO ] Flatten gal took : 10 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :input
Symmetric sort wr.t. initial detected :input
Symmetric sort wr.t. initial and guards detected :input
Applying symmetric unfolding of full symmetric sort :input domain size was 8
[2024-05-26 01:23:49] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 20 ms.
[2024-05-26 01:23:49] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Support contains 29 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 32 transition count 16
Applied a total of 8 rules in 31 ms. Remains 32 /40 variables (removed 8) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 32 cols
[2024-05-26 01:23:50] [INFO ] Computed 16 invariants in 18 ms
[2024-05-26 01:23:50] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-05-26 01:23:50] [INFO ] Invariant cache hit.
[2024-05-26 01:23:50] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Running 15 sub problems to find dead transitions.
[2024-05-26 01:23:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 16/48 variables, 32/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 48 constraints, problems are : Problem set: 0 solved, 15 unsolved in 408 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 16/48 variables, 32/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 15/63 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/48 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 63 constraints, problems are : Problem set: 0 solved, 15 unsolved in 355 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 799ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 811ms
Starting structural reductions in LTL mode, iteration 1 : 32/40 places, 16/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1262 ms. Remains : 32/40 places, 16/16 transitions.
Support contains 29 out of 32 places after structural reductions.
[2024-05-26 01:23:51] [INFO ] Flatten gal took : 6 ms
[2024-05-26 01:23:51] [INFO ] Flatten gal took : 7 ms
[2024-05-26 01:23:51] [INFO ] Input system was already deterministic with 16 transitions.
Reduction of identical properties reduced properties to check from 17 to 13
RANDOM walk for 2860 steps (0 resets) in 29 ms. (95 steps per ms) remains 0/13 properties
FORMULA PermAdmissibility-COL-50-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 32 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U ((p1||X(p2)) U p3)))'
Support contains 12 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 16
Applied a total of 1 rules in 5 ms. Remains 31 /32 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 31 cols
[2024-05-26 01:23:51] [INFO ] Computed 15 invariants in 1 ms
[2024-05-26 01:23:51] [INFO ] Implicit Places using invariants in 65 ms returned [4, 5, 6, 7, 14, 24, 26]
[2024-05-26 01:23:51] [INFO ] Actually due to overlaps returned [4, 5, 14, 24]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 70 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 27/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 76 ms. Remains : 27/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 388 ms :[true, (OR (NOT p2) (NOT p3)), (NOT p3), (NOT p3)]
Running random walk in product with property : PermAdmissibility-COL-50-LTLFireability-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA PermAdmissibility-COL-50-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-50-LTLFireability-01 finished in 542 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(F((X(F(p0))&&p1))))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 16 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 13 ms. Remains 14 /32 variables (removed 18) and now considering 8/16 (removed 8) transitions.
// Phase 1: matrix 8 rows 14 cols
[2024-05-26 01:23:52] [INFO ] Computed 6 invariants in 1 ms
[2024-05-26 01:23:52] [INFO ] Implicit Places using invariants in 39 ms returned [4, 5, 7, 9]
[2024-05-26 01:23:52] [INFO ] Actually due to overlaps returned [4, 5, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 41 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/32 places, 8/16 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 10 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 9 transition count 6
Applied a total of 2 rules in 6 ms. Remains 9 /11 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 9 cols
[2024-05-26 01:23:52] [INFO ] Computed 3 invariants in 0 ms
[2024-05-26 01:23:52] [INFO ] Implicit Places using invariants in 29 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/32 places, 6/16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 7 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 6 transition count 4
Applied a total of 4 rules in 2 ms. Remains 6 /8 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 6 cols
[2024-05-26 01:23:52] [INFO ] Computed 2 invariants in 0 ms
[2024-05-26 01:23:52] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-26 01:23:52] [INFO ] Invariant cache hit.
[2024-05-26 01:23:52] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 6/32 places, 4/16 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 154 ms. Remains : 6/32 places, 4/16 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-50-LTLFireability-02
Stuttering criterion allowed to conclude after 44724 steps with 4612 reset in 305 ms.
FORMULA PermAdmissibility-COL-50-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-50-LTLFireability-02 finished in 642 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(G(p0))||!(p1 U !p0)))&&F(p1)))'
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 16
Applied a total of 1 rules in 1 ms. Remains 31 /32 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 31 cols
[2024-05-26 01:23:52] [INFO ] Computed 15 invariants in 7 ms
[2024-05-26 01:23:52] [INFO ] Implicit Places using invariants in 97 ms returned [4, 6, 13, 15, 16, 17, 18, 23, 24, 25, 26]
[2024-05-26 01:23:52] [INFO ] Actually due to overlaps returned [4, 13, 15, 16, 23, 24]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 101 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 104 ms. Remains : 25/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : PermAdmissibility-COL-50-LTLFireability-03
Product exploration explored 100000 steps with 4189 reset in 237 ms.
Product exploration explored 100000 steps with 4311 reset in 601 ms.
Computed a total of 25 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 25 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 317 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 1794 steps (0 resets) in 13 ms. (128 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 9 factoid took 250 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 16 rows 25 cols
[2024-05-26 01:23:54] [INFO ] Computed 9 invariants in 1 ms
[2024-05-26 01:23:54] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 5 ms returned sat
[2024-05-26 01:23:54] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-26 01:23:54] [INFO ] Computed and/alt/rep : 15/29/15 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-26 01:23:55] [INFO ] Added : 15 causal constraints over 3 iterations in 38 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 25 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 16/16 transitions.
Graph (complete) has 44 edges and 25 vertex of which 19 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 17 transition count 10
Applied a total of 2 rules in 7 ms. Remains 17 /25 variables (removed 8) and now considering 10/16 (removed 6) transitions.
// Phase 1: matrix 10 rows 17 cols
[2024-05-26 01:23:55] [INFO ] Computed 7 invariants in 1 ms
[2024-05-26 01:23:55] [INFO ] Implicit Places using invariants in 43 ms returned [5, 11, 12]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 46 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/25 places, 10/16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 9
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 13 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 12 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 4 place count 12 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 8 place count 10 transition count 6
Applied a total of 8 rules in 5 ms. Remains 10 /14 variables (removed 4) and now considering 6/10 (removed 4) transitions.
// Phase 1: matrix 6 rows 10 cols
[2024-05-26 01:23:55] [INFO ] Computed 4 invariants in 1 ms
[2024-05-26 01:23:55] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-26 01:23:55] [INFO ] Invariant cache hit.
[2024-05-26 01:23:55] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/25 places, 6/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 126 ms. Remains : 10/25 places, 6/16 transitions.
Computed a total of 10 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 10 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 820 steps (0 resets) in 6 ms. (117 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 156 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (NOT p1)]
[2024-05-26 01:23:55] [INFO ] Invariant cache hit.
[2024-05-26 01:23:55] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-26 01:23:55] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-26 01:23:55] [INFO ] Computed and/alt/rep : 5/9/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-26 01:23:55] [INFO ] Added : 5 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 7480 reset in 112 ms.
Product exploration explored 100000 steps with 7380 reset in 154 ms.
Built C files in :
/tmp/ltsmin658080273683927788
[2024-05-26 01:23:56] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2024-05-26 01:23:56] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 01:23:56] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2024-05-26 01:23:56] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 01:23:56] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2024-05-26 01:23:56] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 01:23:56] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin658080273683927788
Running compilation step : cd /tmp/ltsmin658080273683927788;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 468 ms.
Running link step : cd /tmp/ltsmin658080273683927788;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 74 ms.
Running LTSmin : cd /tmp/ltsmin658080273683927788;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11548859222624799277.hoa' '--buchi-type=spotba'
LTSmin run took 420 ms.
FORMULA PermAdmissibility-COL-50-LTLFireability-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-50-LTLFireability-03 finished in 4396 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 16
Applied a total of 2 rules in 1 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 30 cols
[2024-05-26 01:23:57] [INFO ] Computed 14 invariants in 1 ms
[2024-05-26 01:23:57] [INFO ] Implicit Places using invariants in 79 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 16, 17, 22, 24]
[2024-05-26 01:23:57] [INFO ] Actually due to overlaps returned [4, 5, 12, 13, 14, 15, 22]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 83 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/32 places, 16/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 23 /23 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 86 ms. Remains : 23/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-50-LTLFireability-04
Entered a terminal (fully accepting) state of product in 72 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-COL-50-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-50-LTLFireability-04 finished in 201 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 16 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 4 ms. Remains 14 /32 variables (removed 18) and now considering 8/16 (removed 8) transitions.
// Phase 1: matrix 8 rows 14 cols
[2024-05-26 01:23:57] [INFO ] Computed 6 invariants in 0 ms
[2024-05-26 01:23:57] [INFO ] Implicit Places using invariants in 52 ms returned [4, 5, 7, 9]
[2024-05-26 01:23:57] [INFO ] Actually due to overlaps returned [4, 5, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 55 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/32 places, 8/16 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 10 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 9 transition count 6
Applied a total of 2 rules in 4 ms. Remains 9 /11 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 9 cols
[2024-05-26 01:23:57] [INFO ] Computed 3 invariants in 1 ms
[2024-05-26 01:23:57] [INFO ] Implicit Places using invariants in 28 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/32 places, 6/16 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 7 transition count 5
Applied a total of 2 rules in 3 ms. Remains 7 /8 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 7 cols
[2024-05-26 01:23:57] [INFO ] Computed 2 invariants in 1 ms
[2024-05-26 01:23:57] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-26 01:23:57] [INFO ] Invariant cache hit.
[2024-05-26 01:23:57] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 7/32 places, 5/16 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 148 ms. Remains : 7/32 places, 5/16 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-50-LTLFireability-05
Product exploration explored 100000 steps with 398 reset in 183 ms.
Product exploration explored 100000 steps with 398 reset in 231 ms.
Computed a total of 7 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 5
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 16 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-50-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-50-LTLFireability-05 finished in 682 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||(p1 U p2)))'
Support contains 9 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Applied a total of 0 rules in 2 ms. Remains 31 /32 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 31 cols
[2024-05-26 01:23:58] [INFO ] Computed 15 invariants in 1 ms
[2024-05-26 01:23:58] [INFO ] Implicit Places using invariants in 72 ms returned [5, 7, 14, 15, 16, 17, 18, 24, 26]
[2024-05-26 01:23:58] [INFO ] Actually due to overlaps returned [5, 14, 15, 16, 24]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 74 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/32 places, 16/16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 26 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 25 transition count 15
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 25 transition count 14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 24 transition count 14
Applied a total of 4 rules in 4 ms. Remains 24 /26 variables (removed 2) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 24 cols
[2024-05-26 01:23:58] [INFO ] Computed 10 invariants in 1 ms
[2024-05-26 01:23:58] [INFO ] Implicit Places using invariants in 52 ms returned [6, 12, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 55 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/32 places, 14/16 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 20 transition count 10
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 16 transition count 10
Applied a total of 8 rules in 3 ms. Remains 16 /20 variables (removed 4) and now considering 10/14 (removed 4) transitions.
// Phase 1: matrix 10 rows 16 cols
[2024-05-26 01:23:58] [INFO ] Computed 6 invariants in 0 ms
[2024-05-26 01:23:58] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-26 01:23:58] [INFO ] Invariant cache hit.
[2024-05-26 01:23:58] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 16/32 places, 10/16 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 203 ms. Remains : 16/32 places, 10/16 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-50-LTLFireability-08
Product exploration explored 100000 steps with 3680 reset in 103 ms.
Product exploration explored 100000 steps with 3700 reset in 131 ms.
Computed a total of 16 stabilizing places and 10 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 16 transition count 10
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 11 factoid took 937 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1332 steps (0 resets) in 7 ms. (166 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT p2)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p0)]
Knowledge based reduction with 11 factoid took 952 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
[2024-05-26 01:24:00] [INFO ] Invariant cache hit.
[2024-05-26 01:24:00] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-26 01:24:00] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-26 01:24:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 01:24:01] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-26 01:24:01] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-26 01:24:01] [INFO ] Computed and/alt/rep : 9/17/9 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-26 01:24:01] [INFO ] Added : 9 causal constraints over 2 iterations in 15 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 16 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-05-26 01:24:01] [INFO ] Invariant cache hit.
[2024-05-26 01:24:01] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-26 01:24:01] [INFO ] Invariant cache hit.
[2024-05-26 01:24:01] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-05-26 01:24:01] [INFO ] Redundant transitions in 1 ms returned []
Running 9 sub problems to find dead transitions.
[2024-05-26 01:24:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/16 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 10/26 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/26 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/26 variables, and 22 constraints, problems are : Problem set: 0 solved, 9 unsolved in 207 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/16 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 10/26 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 9/31 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/26 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/26 variables, and 31 constraints, problems are : Problem set: 0 solved, 9 unsolved in 186 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 401ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 402ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 485 ms. Remains : 16/16 places, 10/10 transitions.
Computed a total of 16 stabilizing places and 10 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 16 transition count 10
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1432 steps (0 resets) in 8 ms. (159 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 145 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
[2024-05-26 01:24:02] [INFO ] Invariant cache hit.
[2024-05-26 01:24:02] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-26 01:24:02] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-26 01:24:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 01:24:02] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-26 01:24:02] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-26 01:24:02] [INFO ] Computed and/alt/rep : 9/17/9 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-26 01:24:02] [INFO ] Added : 9 causal constraints over 2 iterations in 14 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3710 reset in 167 ms.
Product exploration explored 100000 steps with 3701 reset in 196 ms.
Built C files in :
/tmp/ltsmin11198251581589594878
[2024-05-26 01:24:02] [INFO ] Computing symmetric may disable matrix : 10 transitions.
[2024-05-26 01:24:02] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 01:24:02] [INFO ] Computing symmetric may enable matrix : 10 transitions.
[2024-05-26 01:24:02] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 01:24:02] [INFO ] Computing Do-Not-Accords matrix : 10 transitions.
[2024-05-26 01:24:02] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 01:24:02] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11198251581589594878
Running compilation step : cd /tmp/ltsmin11198251581589594878;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 118 ms.
Running link step : cd /tmp/ltsmin11198251581589594878;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin11198251581589594878;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7134718809206604722.hoa' '--buchi-type=spotba'
LTSmin run took 1442 ms.
FORMULA PermAdmissibility-COL-50-LTLFireability-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-50-LTLFireability-08 finished in 6155 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G((p1&&X(G((X(G(!p0))||p2))))))))'
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 16
Applied a total of 2 rules in 3 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 30 cols
[2024-05-26 01:24:04] [INFO ] Computed 14 invariants in 1 ms
[2024-05-26 01:24:04] [INFO ] Implicit Places using invariants in 62 ms returned [4, 5, 6, 7, 12, 13, 14, 16, 23, 25]
[2024-05-26 01:24:04] [INFO ] Actually due to overlaps returned [4, 5, 12, 13, 14, 23]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 69 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 73 ms. Remains : 24/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-COL-50-LTLFireability-09
Product exploration explored 100000 steps with 7413 reset in 109 ms.
Product exploration explored 100000 steps with 7416 reset in 193 ms.
Computed a total of 24 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 252 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 40032 steps (48 resets) in 55 ms. (714 steps per ms) remains 1/6 properties
BEST_FIRST walk for 1923 steps (0 resets) in 20 ms. (91 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 11 factoid took 698 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 16/16 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 24 transition count 15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 22 transition count 14
Applied a total of 4 rules in 4 ms. Remains 22 /24 variables (removed 2) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 22 cols
[2024-05-26 01:24:06] [INFO ] Computed 8 invariants in 2 ms
[2024-05-26 01:24:06] [INFO ] Implicit Places using invariants in 65 ms returned [4, 5, 10, 17]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 67 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/24 places, 14/16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 18 transition count 11
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 15 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 14 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 8 place count 14 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 12 place count 12 transition count 8
Applied a total of 12 rules in 6 ms. Remains 12 /18 variables (removed 6) and now considering 8/14 (removed 6) transitions.
// Phase 1: matrix 8 rows 12 cols
[2024-05-26 01:24:06] [INFO ] Computed 4 invariants in 1 ms
[2024-05-26 01:24:06] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-26 01:24:06] [INFO ] Invariant cache hit.
[2024-05-26 01:24:06] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/24 places, 8/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 150 ms. Remains : 12/24 places, 8/16 transitions.
Computed a total of 12 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 405 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 21686 steps (51 resets) in 24 ms. (867 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 15 factoid took 524 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 15145 reset in 99 ms.
Product exploration explored 100000 steps with 15117 reset in 106 ms.
Built C files in :
/tmp/ltsmin10461670973467829269
[2024-05-26 01:24:08] [INFO ] Computing symmetric may disable matrix : 8 transitions.
[2024-05-26 01:24:08] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 01:24:08] [INFO ] Computing symmetric may enable matrix : 8 transitions.
[2024-05-26 01:24:08] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 01:24:08] [INFO ] Computing Do-Not-Accords matrix : 8 transitions.
[2024-05-26 01:24:08] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 01:24:08] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10461670973467829269
Running compilation step : cd /tmp/ltsmin10461670973467829269;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 131 ms.
Running link step : cd /tmp/ltsmin10461670973467829269;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin10461670973467829269;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17756898637097771783.hoa' '--buchi-type=spotba'
LTSmin run took 206 ms.
FORMULA PermAdmissibility-COL-50-LTLFireability-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-50-LTLFireability-09 finished in 5058 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(!p1 U p2))))'
Support contains 9 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 16
Applied a total of 2 rules in 1 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 30 cols
[2024-05-26 01:24:09] [INFO ] Computed 14 invariants in 1 ms
[2024-05-26 01:24:09] [INFO ] Implicit Places using invariants in 63 ms returned [4, 6, 12, 13, 14, 16, 22, 24]
[2024-05-26 01:24:09] [INFO ] Actually due to overlaps returned [4, 12, 13, 14, 22]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 65 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67 ms. Remains : 25/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-50-LTLFireability-10
Product exploration explored 100000 steps with 7443 reset in 140 ms.
Product exploration explored 100000 steps with 7408 reset in 164 ms.
Computed a total of 25 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 25 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G (NOT p2))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 658 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 770 steps (0 resets) in 5 ms. (128 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G (NOT p2))), (F (G p1))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 14 factoid took 868 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 16 rows 25 cols
[2024-05-26 01:24:11] [INFO ] Computed 9 invariants in 1 ms
[2024-05-26 01:24:11] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 5 ms returned sat
[2024-05-26 01:24:11] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-26 01:24:11] [INFO ] Computed and/alt/rep : 15/33/15 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-26 01:24:11] [INFO ] Added : 3 causal constraints over 1 iterations in 13 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 25 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2024-05-26 01:24:11] [INFO ] Invariant cache hit.
[2024-05-26 01:24:11] [INFO ] Implicit Places using invariants in 37 ms returned [5, 12, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 42 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 16/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46 ms. Remains : 22/25 places, 16/16 transitions.
Computed a total of 22 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 820 steps (0 resets) in 5 ms. (136 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 16 rows 22 cols
[2024-05-26 01:24:12] [INFO ] Computed 6 invariants in 1 ms
[2024-05-26 01:24:12] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-26 01:24:12] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-26 01:24:12] [INFO ] Computed and/alt/rep : 15/27/15 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-26 01:24:12] [INFO ] Added : 3 causal constraints over 1 iterations in 23 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7460 reset in 76 ms.
Product exploration explored 100000 steps with 7472 reset in 149 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 16/16 transitions.
Graph (complete) has 37 edges and 22 vertex of which 8 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 8 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 8 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 4 ms. Remains 8 /22 variables (removed 14) and now considering 6/16 (removed 10) transitions.
[2024-05-26 01:24:13] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
// Phase 1: matrix 6 rows 8 cols
[2024-05-26 01:24:13] [INFO ] Computed 2 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
At refinement iteration 2 (OVERLAPS) 6/13 variables, 7/9 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/14 variables, 1/10 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 10 constraints, problems are : Problem set: 2 solved, 3 unsolved in 99 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2/7 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/13 variables, 7/9 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 3/12 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1/14 variables, 1/13 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/14 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/14 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 13 constraints, problems are : Problem set: 2 solved, 3 unsolved in 85 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 201ms problems are : Problem set: 2 solved, 3 unsolved
Search for dead transitions found 2 dead transitions in 201ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 8/22 places, 4/16 transitions.
Graph (complete) has 7 edges and 8 vertex of which 6 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 6 /8 variables (removed 2) and now considering 4/4 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/22 places, 4/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 217 ms. Remains : 6/22 places, 4/16 transitions.
Built C files in :
/tmp/ltsmin9937143517262872305
[2024-05-26 01:24:13] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9937143517262872305
Running compilation step : cd /tmp/ltsmin9937143517262872305;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 195 ms.
Running link step : cd /tmp/ltsmin9937143517262872305;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin9937143517262872305;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2919860614875013233.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 22 cols
[2024-05-26 01:24:28] [INFO ] Computed 6 invariants in 1 ms
[2024-05-26 01:24:28] [INFO ] Implicit Places using invariants in 46 ms returned [4, 5, 16, 17]
[2024-05-26 01:24:28] [INFO ] Actually due to overlaps returned [4, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 48 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51 ms. Remains : 20/22 places, 16/16 transitions.
Built C files in :
/tmp/ltsmin4199299217931982073
[2024-05-26 01:24:28] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4199299217931982073
Running compilation step : cd /tmp/ltsmin4199299217931982073;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 120 ms.
Running link step : cd /tmp/ltsmin4199299217931982073;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin4199299217931982073;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12734249096379366362.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 01:24:44] [INFO ] Flatten gal took : 5 ms
[2024-05-26 01:24:44] [INFO ] Flatten gal took : 4 ms
[2024-05-26 01:24:44] [INFO ] Time to serialize gal into /tmp/LTL7703220830929528577.gal : 2 ms
[2024-05-26 01:24:44] [INFO ] Time to serialize properties into /tmp/LTL5658318580022958793.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7703220830929528577.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13883592086754353320.hoa' '-atoms' '/tmp/LTL5658318580022958793.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5658318580022958793.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13883592086754353320.hoa
Detected timeout of ITS tools.
[2024-05-26 01:24:59] [INFO ] Flatten gal took : 3 ms
[2024-05-26 01:24:59] [INFO ] Flatten gal took : 3 ms
[2024-05-26 01:24:59] [INFO ] Time to serialize gal into /tmp/LTL15388907735713027382.gal : 1 ms
[2024-05-26 01:24:59] [INFO ] Time to serialize properties into /tmp/LTL7025449276389254258.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15388907735713027382.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7025449276389254258.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((F("(((aux7>=1)&&(aux5>=1))&&(c110>=1))"))||((!("(((aux15<1)||(aux13<1))||(c18<1))"))U("(((c15>=1)&&(aux10>=1))&&(aux12>=1))"))))...156
Formula 0 simplified : X(G!"(((aux7>=1)&&(aux5>=1))&&(c110>=1))" & ("(((aux15<1)||(aux13<1))||(c18<1))" R !"(((c15>=1)&&(aux10>=1))&&(aux12>=1))"))
Detected timeout of ITS tools.
[2024-05-26 01:25:14] [INFO ] Flatten gal took : 3 ms
[2024-05-26 01:25:14] [INFO ] Applying decomposition
[2024-05-26 01:25:14] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4014817245812016444.txt' '-o' '/tmp/graph4014817245812016444.bin' '-w' '/tmp/graph4014817245812016444.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4014817245812016444.bin' '-l' '-1' '-v' '-w' '/tmp/graph4014817245812016444.weights' '-q' '0' '-e' '0.001'
[2024-05-26 01:25:14] [INFO ] Decomposing Gal with order
[2024-05-26 01:25:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 01:25:14] [INFO ] Removed a total of 2 redundant transitions.
[2024-05-26 01:25:14] [INFO ] Flatten gal took : 24 ms
[2024-05-26 01:25:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-26 01:25:14] [INFO ] Time to serialize gal into /tmp/LTL11756258914388672277.gal : 2 ms
[2024-05-26 01:25:14] [INFO ] Time to serialize properties into /tmp/LTL17587958421947939907.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11756258914388672277.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17587958421947939907.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X((F("(((i2.u3.aux7>=1)&&(i2.u2.aux5>=1))&&(i2.u2.c110>=1))"))||((!("(((i4.u7.aux15<1)||(i1.u6.aux13<1))||(i4.u7.c18<1))"))U("(((i1...204
Formula 0 simplified : X(G!"(((i2.u3.aux7>=1)&&(i2.u2.aux5>=1))&&(i2.u2.c110>=1))" & ("(((i4.u7.aux15<1)||(i1.u6.aux13<1))||(i4.u7.c18<1))" R !"(((i1.u1.c1...195
Detected timeout of ITS tools.
Treatment of property PermAdmissibility-COL-50-LTLFireability-10 finished in 80047 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||F((p1||G(!p2))))))'
Support contains 9 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 28 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 4 ms. Remains 26 /32 variables (removed 6) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 26 cols
[2024-05-26 01:25:29] [INFO ] Computed 12 invariants in 1 ms
[2024-05-26 01:25:29] [INFO ] Implicit Places using invariants in 62 ms returned [4, 6, 12, 13, 15, 17]
[2024-05-26 01:25:29] [INFO ] Actually due to overlaps returned [4, 12, 13, 15]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 65 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/32 places, 14/16 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 21 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 12
Applied a total of 2 rules in 4 ms. Remains 20 /22 variables (removed 2) and now considering 12/14 (removed 2) transitions.
// Phase 1: matrix 12 rows 20 cols
[2024-05-26 01:25:29] [INFO ] Computed 8 invariants in 1 ms
[2024-05-26 01:25:29] [INFO ] Implicit Places using invariants in 47 ms returned [5, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 48 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/32 places, 12/16 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 18 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 17 transition count 11
Applied a total of 2 rules in 2 ms. Remains 17 /18 variables (removed 1) and now considering 11/12 (removed 1) transitions.
// Phase 1: matrix 11 rows 17 cols
[2024-05-26 01:25:29] [INFO ] Computed 6 invariants in 0 ms
[2024-05-26 01:25:29] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-26 01:25:29] [INFO ] Invariant cache hit.
[2024-05-26 01:25:29] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 17/32 places, 11/16 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 203 ms. Remains : 17/32 places, 11/16 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2)]
Running random walk in product with property : PermAdmissibility-COL-50-LTLFireability-11
Product exploration explored 100000 steps with 9972 reset in 183 ms.
Product exploration explored 100000 steps with 10005 reset in 209 ms.
Computed a total of 17 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17 transition count 11
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G p2))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 525 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p0) p2), (AND (NOT p1) p2)]
RANDOM walk for 1840 steps (0 resets) in 9 ms. (184 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G p2))]
False Knowledge obtained : [(F p0), (F (NOT (OR p1 p2))), (F p1), (F (NOT p2)), (F (NOT (AND (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p0))))]
Property proved to be false thanks to negative knowledge :(F p0)
Knowledge based reduction with 12 factoid took 785 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-50-LTLFireability-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-50-LTLFireability-11 finished in 2191 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 8 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 2 ms. Remains 7 /32 variables (removed 25) and now considering 4/16 (removed 12) transitions.
// Phase 1: matrix 4 rows 7 cols
[2024-05-26 01:25:31] [INFO ] Computed 3 invariants in 0 ms
[2024-05-26 01:25:31] [INFO ] Implicit Places using invariants in 28 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/32 places, 4/16 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 5 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 4 transition count 2
Applied a total of 2 rules in 1 ms. Remains 4 /6 variables (removed 2) and now considering 2/4 (removed 2) transitions.
// Phase 1: matrix 2 rows 4 cols
[2024-05-26 01:25:31] [INFO ] Computed 2 invariants in 0 ms
[2024-05-26 01:25:31] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-26 01:25:31] [INFO ] Invariant cache hit.
[2024-05-26 01:25:31] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/32 places, 2/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 77 ms. Remains : 4/32 places, 2/16 transitions.
Stuttering acceptance computed with spot in 81 ms :[p0, p0]
Running random walk in product with property : PermAdmissibility-COL-50-LTLFireability-12
Stuttering criterion allowed to conclude after 110 steps with 4 reset in 0 ms.
FORMULA PermAdmissibility-COL-50-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-50-LTLFireability-12 finished in 176 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(p0))||F((G(p2)||p1)))))'
Support contains 9 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 20 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 2 ms. Remains 19 /32 variables (removed 13) and now considering 10/16 (removed 6) transitions.
// Phase 1: matrix 10 rows 19 cols
[2024-05-26 01:25:31] [INFO ] Computed 9 invariants in 0 ms
[2024-05-26 01:25:31] [INFO ] Implicit Places using invariants in 58 ms returned [10, 11, 13]
[2024-05-26 01:25:31] [INFO ] Actually due to overlaps returned [10, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 60 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/32 places, 10/16 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 17 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 16 transition count 9
Applied a total of 2 rules in 2 ms. Remains 16 /17 variables (removed 1) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 16 cols
[2024-05-26 01:25:31] [INFO ] Computed 7 invariants in 0 ms
[2024-05-26 01:25:31] [INFO ] Implicit Places using invariants in 34 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/32 places, 9/16 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 15 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 8
Applied a total of 2 rules in 2 ms. Remains 14 /15 variables (removed 1) and now considering 8/9 (removed 1) transitions.
// Phase 1: matrix 8 rows 14 cols
[2024-05-26 01:25:31] [INFO ] Computed 6 invariants in 0 ms
[2024-05-26 01:25:31] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-26 01:25:31] [INFO ] Invariant cache hit.
[2024-05-26 01:25:31] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 14/32 places, 8/16 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 160 ms. Remains : 14/32 places, 8/16 transitions.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : PermAdmissibility-COL-50-LTLFireability-13
Product exploration explored 100000 steps with 12179 reset in 111 ms.
Product exploration explored 100000 steps with 12193 reset in 127 ms.
Computed a total of 14 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 14 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT p0))), (F (G p1)), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 52 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-50-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-50-LTLFireability-13 finished in 651 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X((F(G(p2))&&p1)))))'
Support contains 9 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 16
Applied a total of 1 rules in 1 ms. Remains 31 /32 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 31 cols
[2024-05-26 01:25:32] [INFO ] Computed 15 invariants in 4 ms
[2024-05-26 01:25:32] [INFO ] Implicit Places using invariants in 60 ms returned [5, 7, 13, 16, 18, 23, 24, 25, 26]
[2024-05-26 01:25:32] [INFO ] Actually due to overlaps returned [5, 13, 16, 23, 24]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 61 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 26/32 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 26 /26 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64 ms. Remains : 26/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 343 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : PermAdmissibility-COL-50-LTLFireability-14
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-50-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-50-LTLFireability-14 finished in 429 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(!p1 U p2))))'
[2024-05-26 01:25:32] [INFO ] Flatten gal took : 5 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5277722243290909012
[2024-05-26 01:25:32] [INFO ] Computing symmetric may disable matrix : 16 transitions.
[2024-05-26 01:25:32] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 01:25:32] [INFO ] Computing symmetric may enable matrix : 16 transitions.
[2024-05-26 01:25:32] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 01:25:32] [INFO ] Computing Do-Not-Accords matrix : 16 transitions.
[2024-05-26 01:25:32] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 01:25:32] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5277722243290909012
Running compilation step : cd /tmp/ltsmin5277722243290909012;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-26 01:25:32] [INFO ] Applying decomposition
[2024-05-26 01:25:32] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4132841878741723365.txt' '-o' '/tmp/graph4132841878741723365.bin' '-w' '/tmp/graph4132841878741723365.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4132841878741723365.bin' '-l' '-1' '-v' '-w' '/tmp/graph4132841878741723365.weights' '-q' '0' '-e' '0.001'
[2024-05-26 01:25:32] [INFO ] Decomposing Gal with order
[2024-05-26 01:25:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 01:25:32] [INFO ] Removed a total of 3 redundant transitions.
[2024-05-26 01:25:32] [INFO ] Flatten gal took : 6 ms
[2024-05-26 01:25:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-26 01:25:33] [INFO ] Time to serialize gal into /tmp/LTLFireability11327393029130885512.gal : 2 ms
[2024-05-26 01:25:33] [INFO ] Time to serialize properties into /tmp/LTLFireability13720220717336787871.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11327393029130885512.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13720220717336787871.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((X((F("(((i3.u3.aux7>=1)&&(u2.aux5>=1))&&(i3.u3.c110>=1))"))||((!("(((u5.aux15<1)||(u5.aux13<1))||(u5.c18<1))"))U("(((u0.c15>=1)&&(u...189
Formula 0 simplified : X(G!"(((i3.u3.aux7>=1)&&(u2.aux5>=1))&&(i3.u3.c110>=1))" & ("(((u5.aux15<1)||(u5.aux13<1))||(u5.c18<1))" R !"(((u0.c15>=1)&&(u1.aux1...180
Compilation finished in 245 ms.
Running link step : cd /tmp/ltsmin5277722243290909012;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin5277722243290909012;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp0==true))||(!(LTLAPp1==true) U (LTLAPp2==true))))' '--buchi-type=spotba'
LTSmin run took 4959 ms.
FORMULA PermAdmissibility-COL-50-LTLFireability-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 110097 ms.

BK_STOP 1716686738613

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PermAdmissibility-COL-50"
export BK_EXAMINATION="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-5568"
echo " Executing tool itstools"
echo " Input is PermAdmissibility-COL-50, 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 r268-smll-171654407000148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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