Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 8.1K Feb 26 01:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 01:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 01:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 01:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 01:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 01:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 01:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 01:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 54K Mar 5 18:23 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-05-LTLCardinality-00
FORMULA_NAME PermAdmissibility-COL-05-LTLCardinality-01
FORMULA_NAME PermAdmissibility-COL-05-LTLCardinality-02
FORMULA_NAME PermAdmissibility-COL-05-LTLCardinality-03
FORMULA_NAME PermAdmissibility-COL-05-LTLCardinality-04
FORMULA_NAME PermAdmissibility-COL-05-LTLCardinality-05
FORMULA_NAME PermAdmissibility-COL-05-LTLCardinality-06
FORMULA_NAME PermAdmissibility-COL-05-LTLCardinality-07
FORMULA_NAME PermAdmissibility-COL-05-LTLCardinality-08
FORMULA_NAME PermAdmissibility-COL-05-LTLCardinality-09
FORMULA_NAME PermAdmissibility-COL-05-LTLCardinality-10
FORMULA_NAME PermAdmissibility-COL-05-LTLCardinality-11
FORMULA_NAME PermAdmissibility-COL-05-LTLCardinality-12
FORMULA_NAME PermAdmissibility-COL-05-LTLCardinality-13
FORMULA_NAME PermAdmissibility-COL-05-LTLCardinality-14
FORMULA_NAME PermAdmissibility-COL-05-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678940207181

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-COL-05
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202303021504
[2023-03-16 04:16:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 04:16:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 04:16:50] [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.
[2023-03-16 04:16:50] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-16 04:16:51] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 907 ms
[2023-03-16 04:16:51] [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/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
[2023-03-16 04:16:51] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 6 ms.
[2023-03-16 04:16:51] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PermAdmissibility-COL-05-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-05-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-05-LTLCardinality-12 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).
Incomplete random walk after 10004 steps, including 103 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 28) seen :27
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 16 rows 40 cols
[2023-03-16 04:16:51] [INFO ] Computed 24 place invariants in 15 ms
[2023-03-16 04:16:51] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 04:16:51] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 22 ms returned sat
[2023-03-16 04:16:51] [INFO ] After 73ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2023-03-16 04:16:52] [INFO ] Flatten gal took : 35 ms
[2023-03-16 04:16:52] [INFO ] Flatten gal took : 9 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
[2023-03-16 04:16:52] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 11 ms.
[2023-03-16 04:16:52] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Support contains 26 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 37 transition count 16
Applied a total of 3 rules in 17 ms. Remains 37 /40 variables (removed 3) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 37 cols
[2023-03-16 04:16:52] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-16 04:16:52] [INFO ] Implicit Places using invariants in 76 ms returned [4, 7, 16, 22, 25]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 80 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/40 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 98 ms. Remains : 32/40 places, 16/16 transitions.
Support contains 26 out of 32 places after structural reductions.
[2023-03-16 04:16:52] [INFO ] Flatten gal took : 4 ms
[2023-03-16 04:16:52] [INFO ] Flatten gal took : 5 ms
[2023-03-16 04:16:52] [INFO ] Input system was already deterministic with 16 transitions.
Support contains 25 out of 32 places (down from 26) after GAL structural reductions.
Finished random walk after 96 steps, including 0 resets, run visited all 26 properties in 5 ms. (steps per millisecond=19 )
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0 U p1)||G(F(p2))))))'
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 26 transition count 16
Applied a total of 6 rules in 2 ms. Remains 26 /32 variables (removed 6) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 26 cols
[2023-03-16 04:16:52] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-16 04:16:52] [INFO ] Implicit Places using invariants in 78 ms returned [4, 5, 10, 11, 12, 13, 15]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 79 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 19/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 82 ms. Remains : 19/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 562 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PermAdmissibility-COL-05-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ s18 s12), p0:(OR (LEQ s14 s12) (LEQ 2 s3)), p2:(GT 2 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 397 ms.
Product exploration explored 100000 steps with 33333 reset in 182 ms.
Computed a total of 19 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 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 p1 p0 p2), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p2))
Knowledge based reduction with 8 factoid took 255 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-05-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-05-LTLCardinality-01 finished in 1620 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0||X(F(p1))))&&(p0||G(p2)))))'
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 27 transition count 16
Applied a total of 5 rules in 2 ms. Remains 27 /32 variables (removed 5) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 27 cols
[2023-03-16 04:16:54] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-16 04:16:54] [INFO ] Implicit Places using invariants in 103 ms returned [4, 5, 10, 11, 12, 13, 15, 19]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 105 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 19/32 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 19 /19 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 107 ms. Remains : 19/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(OR p0 p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s0 s17), p2:(LEQ 1 s18), p1:(LEQ s13 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 107 ms.
Product exploration explored 100000 steps with 33333 reset in 86 ms.
Computed a total of 19 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 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 p0 (NOT p2) p1), (X (OR p0 p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), true, (X (X (NOT p2))), (X (X p0)), (F (G p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 10 factoid took 300 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-05-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-05-LTLCardinality-02 finished in 870 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((F(p0)&&F(p1)))||(F(p0)&&X((F(p1)&&F(p2)))))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 25 transition count 16
Applied a total of 7 rules in 1 ms. Remains 25 /32 variables (removed 7) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 25 cols
[2023-03-16 04:16:55] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-16 04:16:55] [INFO ] Implicit Places using invariants in 80 ms returned [4, 5, 10, 11, 13, 15, 21]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 81 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 83 ms. Remains : 18/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 416 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PermAdmissibility-COL-05-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=(NOT p2), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(GT 3 s1), p1:(GT 3 s8), p2:(LEQ 3 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2975 reset in 178 ms.
Product exploration explored 100000 steps with 3029 reset in 322 ms.
Computed a total of 18 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 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 p0 p1 (NOT p2)), (X p0), (X p1), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 728 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Finished random walk after 54 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X p1), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 10 factoid took 724 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 2 out of 18 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 18 cols
[2023-03-16 04:16:58] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-16 04:16:58] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-16 04:16:58] [INFO ] Invariant cache hit.
[2023-03-16 04:16:58] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-03-16 04:16:58] [INFO ] Invariant cache hit.
[2023-03-16 04:16:58] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 153 ms. Remains : 18/18 places, 16/16 transitions.
Computed a total of 18 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 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 p2) p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 317 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Finished random walk after 54 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND (NOT p2) p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p2), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 5 factoid took 288 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 3003 reset in 240 ms.
Product exploration explored 100000 steps with 3008 reset in 319 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 2 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 16/16 transitions.
Graph (complete) has 21 edges and 18 vertex of which 16 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 16 transition count 14
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 5 place count 16 transition count 14
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 16 transition count 14
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 13 place count 12 transition count 10
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 17 place count 12 transition count 10
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 17 rules in 18 ms. Remains 12 /18 variables (removed 6) and now considering 10/16 (removed 6) transitions.
[2023-03-16 04:17:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2023-03-16 04:17:00] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-16 04:17:01] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/18 places, 10/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59 ms. Remains : 12/18 places, 10/16 transitions.
Built C files in :
/tmp/ltsmin10785316509884425818
[2023-03-16 04:17:01] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10785316509884425818
Running compilation step : cd /tmp/ltsmin10785316509884425818;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 426 ms.
Running link step : cd /tmp/ltsmin10785316509884425818;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin10785316509884425818;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12612499388387040073.hoa' '--buchi-type=spotba'
LTSmin run took 659 ms.
FORMULA PermAdmissibility-COL-05-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-05-LTLCardinality-03 finished in 6977 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 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 61 edges and 32 vertex of which 25 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 25 /32 variables (removed 7) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 25 cols
[2023-03-16 04:17:02] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-16 04:17:02] [INFO ] Implicit Places using invariants in 72 ms returned [4, 5, 10, 11, 12, 13, 15, 19, 21]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 74 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/32 places, 16/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 15 transition count 3
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 24 place count 3 transition count 2
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 26 place count 2 transition count 2
Applied a total of 26 rules in 3 ms. Remains 2 /16 variables (removed 14) and now considering 2/16 (removed 14) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-16 04:17:02] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-16 04:17:02] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-16 04:17:02] [INFO ] Invariant cache hit.
[2023-03-16 04:17:02] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/32 places, 2/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 127 ms. Remains : 2/32 places, 2/16 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 3 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 9090 reset in 194 ms.
Product exploration explored 100000 steps with 9090 reset in 232 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
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 :(F (G p0))
Knowledge based reduction with 4 factoid took 120 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-05-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-05-LTLCardinality-05 finished in 788 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((G(p1) U (p0&&G(p1)))))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 25 transition count 16
Applied a total of 7 rules in 2 ms. Remains 25 /32 variables (removed 7) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 25 cols
[2023-03-16 04:17:02] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-16 04:17:03] [INFO ] Implicit Places using invariants in 68 ms returned [4, 10, 11, 12, 13, 15, 19, 21]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 70 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 17/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 73 ms. Remains : 17/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 234 ms :[(NOT p1), (NOT p0), true, (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-COL-05-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 0}, { cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(GT s8 s3), p0:(GT 2 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 82 ms.
Product exploration explored 100000 steps with 50000 reset in 101 ms.
Computed a total of 17 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17 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 p0), (X (X (NOT (AND (NOT p0) p1)))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 270 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-05-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-05-LTLCardinality-06 finished in 830 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0&&X(X(p1))))||X(!p1)))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 26 transition count 16
Applied a total of 6 rules in 2 ms. Remains 26 /32 variables (removed 6) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 26 cols
[2023-03-16 04:17:03] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-16 04:17:03] [INFO ] Implicit Places using invariants in 75 ms returned [4, 5, 10, 11, 12, 13, 15, 19, 21]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 77 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 17/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 82 ms. Remains : 17/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 222 ms :[true, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-COL-05-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(LEQ 1 s13), p0:(OR (LEQ 2 s9) (LEQ 2 s16))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 144 ms.
Product exploration explored 100000 steps with 50000 reset in 103 ms.
Computed a total of 17 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17 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) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 p1)))
Knowledge based reduction with 9 factoid took 211 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-05-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-05-LTLCardinality-07 finished in 833 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U (G(p0)||(p0&&G(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 61 edges and 32 vertex of which 23 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Applied a total of 1 rules in 4 ms. Remains 23 /32 variables (removed 9) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 23 cols
[2023-03-16 04:17:04] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-16 04:17:04] [INFO ] Implicit Places using invariants in 75 ms returned [4, 5, 10, 11, 12, 13, 15, 19]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 91 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/32 places, 14/16 transitions.
Graph (complete) has 14 edges and 15 vertex of which 14 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 13 transition count 7
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 8 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 6 transition count 5
Applied a total of 15 rules in 5 ms. Remains 6 /15 variables (removed 9) and now considering 5/14 (removed 9) transitions.
// Phase 1: matrix 5 rows 6 cols
[2023-03-16 04:17:04] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-16 04:17:04] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-16 04:17:04] [INFO ] Invariant cache hit.
[2023-03-16 04:17:04] [INFO ] Implicit Places using invariants and state equation in 23 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 2 : 6/32 places, 5/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 150 ms. Remains : 6/32 places, 5/16 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-COL-05-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 1}]], initial=0, aps=[p1:(GT 2 s0), p0:(GT s5 s3)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3846 reset in 415 ms.
Product exploration explored 100000 steps with 3846 reset in 197 ms.
Computed a total of 6 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 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 : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 542 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (AND (NOT p1) (NOT p0))]
Finished random walk after 547 steps, including 17 resets, run visited all 5 properties in 5 ms. (steps per millisecond=109 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0)), (F (AND p1 p0)), (F p0)]
Knowledge based reduction with 13 factoid took 774 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (AND (NOT p1) (NOT p0))]
[2023-03-16 04:17:07] [INFO ] Invariant cache hit.
[2023-03-16 04:17:07] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 04:17:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 04:17:07] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-16 04:17:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 04:17:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 04:17:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 04:17:07] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-16 04:17:07] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 04:17:07] [INFO ] Added : 4 causal constraints over 1 iterations in 12 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 2 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-16 04:17:07] [INFO ] Invariant cache hit.
[2023-03-16 04:17:07] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-16 04:17:07] [INFO ] Invariant cache hit.
[2023-03-16 04:17:07] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-16 04:17:07] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 04:17:07] [INFO ] Invariant cache hit.
[2023-03-16 04:17:07] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91 ms. Remains : 6/6 places, 5/5 transitions.
Computed a total of 6 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 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 : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 609 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (AND (NOT p1) (NOT p0))]
Finished random walk after 1074 steps, including 34 resets, run visited all 5 properties in 5 ms. (steps per millisecond=214 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0)), (F (AND p1 p0)), (F p0)]
Knowledge based reduction with 13 factoid took 752 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (AND (NOT p1) (NOT p0))]
[2023-03-16 04:17:09] [INFO ] Invariant cache hit.
[2023-03-16 04:17:09] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2023-03-16 04:17:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 04:17:09] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-16 04:17:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 04:17:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-16 04:17:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 04:17:09] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-16 04:17:09] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-16 04:17:09] [INFO ] Added : 4 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3846 reset in 154 ms.
Product exploration explored 100000 steps with 3846 reset in 207 ms.
Built C files in :
/tmp/ltsmin12714816004332165099
[2023-03-16 04:17:09] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2023-03-16 04:17:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 04:17:09] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2023-03-16 04:17:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 04:17:09] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2023-03-16 04:17:09] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 04:17:09] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12714816004332165099
Running compilation step : cd /tmp/ltsmin12714816004332165099;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 103 ms.
Running link step : cd /tmp/ltsmin12714816004332165099;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin12714816004332165099;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13698473213840442125.hoa' '--buchi-type=spotba'
LTSmin run took 62 ms.
FORMULA PermAdmissibility-COL-05-LTLCardinality-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-05-LTLCardinality-08 finished in 5348 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 26 transition count 16
Applied a total of 6 rules in 2 ms. Remains 26 /32 variables (removed 6) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 26 cols
[2023-03-16 04:17:10] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-16 04:17:10] [INFO ] Implicit Places using invariants in 73 ms returned [4, 5, 10, 11, 12, 13, 15, 19, 21]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 75 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 17/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 78 ms. Remains : 17/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 238 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(GT 3 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 71 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-05-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-LTLCardinality-09 finished in 334 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 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 61 edges and 32 vertex of which 23 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Applied a total of 1 rules in 2 ms. Remains 23 /32 variables (removed 9) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 23 cols
[2023-03-16 04:17:10] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-16 04:17:10] [INFO ] Implicit Places using invariants in 56 ms returned [4, 5, 10, 11, 12, 15, 19]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 59 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/32 places, 14/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 15 transition count 6
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 7 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 16 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 3 with 2 rules applied. Total rules applied 18 place count 6 transition count 4
Applied a total of 18 rules in 2 ms. Remains 6 /16 variables (removed 10) and now considering 4/14 (removed 10) transitions.
// Phase 1: matrix 4 rows 6 cols
[2023-03-16 04:17:10] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-16 04:17:10] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-16 04:17:10] [INFO ] Invariant cache hit.
[2023-03-16 04:17:10] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/32 places, 4/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 110 ms. Remains : 6/32 places, 4/16 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s2 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 77 ms.
Product exploration explored 100000 steps with 50000 reset in 98 ms.
Computed a total of 6 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 4
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 p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 82 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-05-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-05-LTLCardinality-10 finished in 457 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 26 transition count 16
Applied a total of 6 rules in 2 ms. Remains 26 /32 variables (removed 6) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 26 cols
[2023-03-16 04:17:10] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-16 04:17:10] [INFO ] Implicit Places using invariants in 68 ms returned [4, 5, 11, 12, 13, 15, 19, 21]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 70 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 73 ms. Remains : 18/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s17 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 81 ms.
Product exploration explored 100000 steps with 50000 reset in 94 ms.
Computed a total of 18 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 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 : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-05-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-05-LTLCardinality-11 finished in 529 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U G(p1)) U X(p2))))'
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 26 transition count 16
Applied a total of 6 rules in 1 ms. Remains 26 /32 variables (removed 6) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 26 cols
[2023-03-16 04:17:11] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-16 04:17:11] [INFO ] Implicit Places using invariants in 75 ms returned [4, 5, 10, 11, 13, 15, 19, 21]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 77 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/32 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 81 ms. Remains : 18/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 369 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND p1 p0), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p1) p0), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(LEQ 2 s13), p0:(LEQ s8 s6), p2:(LEQ 3 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-COL-05-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-LTLCardinality-13 finished in 473 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 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 61 edges and 32 vertex of which 9 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.0 ms
Discarding 23 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Applied a total of 1 rules in 2 ms. Remains 9 /32 variables (removed 23) and now considering 6/16 (removed 10) transitions.
// Phase 1: matrix 6 rows 9 cols
[2023-03-16 04:17:11] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-16 04:17:11] [INFO ] Implicit Places using invariants in 32 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/32 places, 6/16 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 5
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 7 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 6 transition count 4
Applied a total of 4 rules in 4 ms. Remains 6 /8 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 6 cols
[2023-03-16 04:17:11] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-16 04:17:11] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-16 04:17:11] [INFO ] Invariant cache hit.
[2023-03-16 04:17:11] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/32 places, 4/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 107 ms. Remains : 6/32 places, 4/16 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LEQ 3 s2) (LEQ 1 s4)), p1:(LEQ 1 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-05-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-LTLCardinality-14 finished in 258 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 26 transition count 16
Applied a total of 6 rules in 2 ms. Remains 26 /32 variables (removed 6) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 26 cols
[2023-03-16 04:17:12] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-16 04:17:12] [INFO ] Implicit Places using invariants in 82 ms returned [4, 5, 10, 12, 13, 15, 19, 21]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 102 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/32 places, 16/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106 ms. Remains : 18/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-COL-05-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(GT s0 s16), p0:(LEQ s8 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2938 reset in 163 ms.
Product exploration explored 100000 steps with 2904 reset in 208 ms.
Computed a total of 18 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 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) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 379 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10003 steps, including 103 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :1
Finished Best-First random walk after 70 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=35 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 418 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 16 rows 18 cols
[2023-03-16 04:17:13] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-16 04:17:13] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-16 04:17:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 04:17:13] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-16 04:17:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 04:17:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-16 04:17:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 04:17:13] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-16 04:17:13] [INFO ] Computed and/alt/rep : 15/15/15 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-16 04:17:13] [INFO ] Added : 12 causal constraints over 3 iterations in 26 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 4 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-16 04:17:13] [INFO ] Invariant cache hit.
[2023-03-16 04:17:13] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-16 04:17:13] [INFO ] Invariant cache hit.
[2023-03-16 04:17:13] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-03-16 04:17:13] [INFO ] Invariant cache hit.
[2023-03-16 04:17:14] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120 ms. Remains : 18/18 places, 16/16 transitions.
Computed a total of 18 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 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) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 362 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10003 steps, including 103 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :1
Finished Best-First random walk after 149 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=149 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 365 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-16 04:17:15] [INFO ] Invariant cache hit.
[2023-03-16 04:17:15] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-16 04:17:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 04:17:15] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-16 04:17:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 04:17:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-16 04:17:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 04:17:15] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-16 04:17:15] [INFO ] Computed and/alt/rep : 15/15/15 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 04:17:15] [INFO ] Added : 12 causal constraints over 3 iterations in 25 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 2928 reset in 105 ms.
Product exploration explored 100000 steps with 2919 reset in 144 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 16/16 transitions.
Graph (complete) has 18 edges and 18 vertex of which 17 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 17 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 8 place count 17 transition count 15
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 17 transition count 15
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 15 place count 12 transition count 10
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 20 place count 12 transition count 10
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 20 rules in 11 ms. Remains 12 /18 variables (removed 6) and now considering 10/16 (removed 6) transitions.
[2023-03-16 04:17:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2023-03-16 04:17:15] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-16 04:17:15] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/18 places, 10/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46 ms. Remains : 12/18 places, 10/16 transitions.
Built C files in :
/tmp/ltsmin2587959276781505944
[2023-03-16 04:17:15] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2587959276781505944
Running compilation step : cd /tmp/ltsmin2587959276781505944;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 143 ms.
Running link step : cd /tmp/ltsmin2587959276781505944;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin2587959276781505944;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4399590259377093625.hoa' '--buchi-type=spotba'
LTSmin run took 325 ms.
FORMULA PermAdmissibility-COL-05-LTLCardinality-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-05-LTLCardinality-15 finished in 4302 ms.
All properties solved by simple procedures.
Total runtime 26184 ms.

BK_STOP 1678940237628

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-05"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is PermAdmissibility-COL-05, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r261-smll-167863536400475"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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