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.r169-tall-167838855400099.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 ltsminxred
Input is Echo-PT-d03r07, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838855400099
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.7M
-rw-r--r-- 1 mcc users 9.4K Feb 25 14:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 25 14:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 14:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 14:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 14:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 25 14:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 2.2M Mar 5 18:22 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 Echo-PT-d03r07-LTLCardinality-00
FORMULA_NAME Echo-PT-d03r07-LTLCardinality-01
FORMULA_NAME Echo-PT-d03r07-LTLCardinality-02
FORMULA_NAME Echo-PT-d03r07-LTLCardinality-03
FORMULA_NAME Echo-PT-d03r07-LTLCardinality-04
FORMULA_NAME Echo-PT-d03r07-LTLCardinality-05
FORMULA_NAME Echo-PT-d03r07-LTLCardinality-06
FORMULA_NAME Echo-PT-d03r07-LTLCardinality-07
FORMULA_NAME Echo-PT-d03r07-LTLCardinality-08
FORMULA_NAME Echo-PT-d03r07-LTLCardinality-09
FORMULA_NAME Echo-PT-d03r07-LTLCardinality-10
FORMULA_NAME Echo-PT-d03r07-LTLCardinality-11
FORMULA_NAME Echo-PT-d03r07-LTLCardinality-12
FORMULA_NAME Echo-PT-d03r07-LTLCardinality-13
FORMULA_NAME Echo-PT-d03r07-LTLCardinality-14
FORMULA_NAME Echo-PT-d03r07-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678482403173

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Echo-PT-d03r07
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-10 21:06:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 21:06:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 21:06:45] [INFO ] Load time of PNML (sax parser for PT used): 253 ms
[2023-03-10 21:06:45] [INFO ] Transformed 4209 places.
[2023-03-10 21:06:45] [INFO ] Transformed 3518 transitions.
[2023-03-10 21:06:45] [INFO ] Found NUPN structural information;
[2023-03-10 21:06:45] [INFO ] Parsed PT model containing 4209 places and 3518 transitions and 25540 arcs in 604 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA Echo-PT-d03r07-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r07-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r07-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r07-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r07-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 4209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4209/4209 places, 3518/3518 transitions.
Reduce places removed 342 places and 0 transitions.
Iterating post reduction 0 with 342 rules applied. Total rules applied 342 place count 3867 transition count 3518
Applied a total of 342 rules in 424 ms. Remains 3867 /4209 variables (removed 342) and now considering 3518/3518 (removed 0) transitions.
// Phase 1: matrix 3518 rows 3867 cols
[2023-03-10 21:06:55] [INFO ] Invariants computation overflowed in 9530 ms
[2023-03-10 21:06:56] [INFO ] Implicit Places using invariants in 10183 ms returned []
// Phase 1: matrix 3518 rows 3867 cols
[2023-03-10 21:07:05] [INFO ] Invariants computation overflowed in 9314 ms
[2023-03-10 21:07:06] [INFO ] Implicit Places using invariants and state equation in 10198 ms returned []
Implicit Place search using SMT with State Equation took 20410 ms to find 0 implicit places.
// Phase 1: matrix 3518 rows 3867 cols
[2023-03-10 21:07:15] [INFO ] Invariants computation overflowed in 9587 ms
[2023-03-10 21:07:16] [INFO ] Dead Transitions using invariants and state equation in 10169 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3867/4209 places, 3518/3518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31010 ms. Remains : 3867/4209 places, 3518/3518 transitions.
Support contains 36 out of 3867 places after structural reductions.
[2023-03-10 21:07:17] [INFO ] Flatten gal took : 396 ms
[2023-03-10 21:07:17] [INFO ] Flatten gal took : 240 ms
[2023-03-10 21:07:17] [INFO ] Input system was already deterministic with 3518 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 578 ms. (steps per millisecond=17 ) properties (out of 20) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3518 rows 3867 cols
[2023-03-10 21:07:27] [INFO ] Invariants computation overflowed in 9390 ms
[2023-03-10 21:07:53] [INFO ] After 25040ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 3867 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3867/3867 places, 3518/3518 transitions.
Graph (complete) has 14535 edges and 3867 vertex of which 3853 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.18 ms
Discarding 14 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 3853 transition count 3511
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 3852 transition count 3510
Applied a total of 8 rules in 629 ms. Remains 3852 /3867 variables (removed 15) and now considering 3510/3518 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 630 ms. Remains : 3852/3867 places, 3510/3518 transitions.
Finished random walk after 2475 steps, including 3 resets, run visited all 1 properties in 108 ms. (steps per millisecond=22 )
FORMULA Echo-PT-d03r07-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 3867 stabilizing places and 3518 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3867 transition count 3518
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(F((G(p1)||p0))))'
Support contains 3 out of 3867 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3867/3867 places, 3518/3518 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3866 transition count 3518
Applied a total of 1 rules in 208 ms. Remains 3866 /3867 variables (removed 1) and now considering 3518/3518 (removed 0) transitions.
// Phase 1: matrix 3518 rows 3866 cols
[2023-03-10 21:08:01] [INFO ] Invariants computation overflowed in 7103 ms
[2023-03-10 21:08:04] [INFO ] Implicit Places using invariants in 10562 ms returned []
// Phase 1: matrix 3518 rows 3866 cols
[2023-03-10 21:08:11] [INFO ] Invariants computation overflowed in 7035 ms
[2023-03-10 21:08:12] [INFO ] Implicit Places using invariants and state equation in 7862 ms returned []
Implicit Place search using SMT with State Equation took 18447 ms to find 0 implicit places.
// Phase 1: matrix 3518 rows 3866 cols
[2023-03-10 21:08:19] [INFO ] Invariants computation overflowed in 7132 ms
[2023-03-10 21:08:22] [INFO ] Dead Transitions using invariants and state equation in 9562 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3866/3867 places, 3518/3518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28223 ms. Remains : 3866/3867 places, 3518/3518 transitions.
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Echo-PT-d03r07-LTLCardinality-03 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:(EQ s2706 1), p0:(OR (EQ s3627 0) (EQ s3379 1))], 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 50000 reset in 3134 ms.
Product exploration explored 100000 steps with 50000 reset in 3099 ms.
Computed a total of 3866 stabilizing places and 3518 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3866 transition count 3518
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 (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) p0)
Knowledge based reduction with 7 factoid took 250 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d03r07-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d03r07-LTLCardinality-03 finished in 37028 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((G(p1)||p0)) U G(p1)))'
Support contains 4 out of 3867 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3867/3867 places, 3518/3518 transitions.
Graph (complete) has 14535 edges and 3867 vertex of which 3860 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.31 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 357 ms. Remains 3859 /3867 variables (removed 8) and now considering 3516/3518 (removed 2) transitions.
// Phase 1: matrix 3516 rows 3859 cols
[2023-03-10 21:08:37] [INFO ] Invariants computation overflowed in 5628 ms
[2023-03-10 21:08:37] [INFO ] Implicit Places using invariants in 6194 ms returned []
// Phase 1: matrix 3516 rows 3859 cols
[2023-03-10 21:08:43] [INFO ] Invariants computation overflowed in 6035 ms
[2023-03-10 21:08:44] [INFO ] Implicit Places using invariants and state equation in 6964 ms returned []
Implicit Place search using SMT with State Equation took 13164 ms to find 0 implicit places.
[2023-03-10 21:08:44] [INFO ] Redundant transitions in 242 ms returned []
// Phase 1: matrix 3516 rows 3859 cols
[2023-03-10 21:08:51] [INFO ] Invariants computation overflowed in 6074 ms
[2023-03-10 21:08:51] [INFO ] Dead Transitions using invariants and state equation in 6577 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3859/3867 places, 3516/3518 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20365 ms. Remains : 3859/3867 places, 3516/3518 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : Echo-PT-d03r07-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s1311 0) (EQ s3838 1)), p0:(OR (EQ s1048 0) (EQ s3184 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 2364 steps with 3 reset in 88 ms.
FORMULA Echo-PT-d03r07-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r07-LTLCardinality-04 finished in 20633 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(p0)||(p1 U (p2||G(p1))))))'
Support contains 2 out of 3867 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3867/3867 places, 3518/3518 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3866 transition count 3518
Applied a total of 1 rules in 187 ms. Remains 3866 /3867 variables (removed 1) and now considering 3518/3518 (removed 0) transitions.
// Phase 1: matrix 3518 rows 3866 cols
[2023-03-10 21:08:58] [INFO ] Invariants computation overflowed in 6934 ms
[2023-03-10 21:09:01] [INFO ] Implicit Places using invariants in 9690 ms returned []
// Phase 1: matrix 3518 rows 3866 cols
[2023-03-10 21:09:08] [INFO ] Invariants computation overflowed in 6896 ms
[2023-03-10 21:09:09] [INFO ] Implicit Places using invariants and state equation in 7832 ms returned []
Implicit Place search using SMT with State Equation took 17539 ms to find 0 implicit places.
// Phase 1: matrix 3518 rows 3866 cols
[2023-03-10 21:09:16] [INFO ] Invariants computation overflowed in 6916 ms
[2023-03-10 21:09:18] [INFO ] Dead Transitions using invariants and state equation in 9095 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3866/3867 places, 3518/3518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26830 ms. Remains : 3866/3867 places, 3518/3518 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Echo-PT-d03r07-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(AND (NEQ s650 1) (NEQ s1030 1)), p1:(NEQ s1030 1), p0:(EQ s1030 0)], 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 3326 ms.
Product exploration explored 100000 steps with 50000 reset in 3330 ms.
Computed a total of 3866 stabilizing places and 3518 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3866 transition count 3518
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 p2 p1 p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), true, (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p2 p1 p0)
Knowledge based reduction with 16 factoid took 658 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d03r07-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d03r07-LTLCardinality-06 finished in 36148 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(F((p0&&X(F(p1)))))))'
Support contains 2 out of 3867 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3867/3867 places, 3518/3518 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3866 transition count 3518
Applied a total of 1 rules in 190 ms. Remains 3866 /3867 variables (removed 1) and now considering 3518/3518 (removed 0) transitions.
// Phase 1: matrix 3518 rows 3866 cols
[2023-03-10 21:09:35] [INFO ] Invariants computation overflowed in 6943 ms
[2023-03-10 21:09:37] [INFO ] Implicit Places using invariants in 9770 ms returned []
// Phase 1: matrix 3518 rows 3866 cols
[2023-03-10 21:09:44] [INFO ] Invariants computation overflowed in 6955 ms
[2023-03-10 21:09:45] [INFO ] Implicit Places using invariants and state equation in 7793 ms returned []
Implicit Place search using SMT with State Equation took 17604 ms to find 0 implicit places.
// Phase 1: matrix 3518 rows 3866 cols
[2023-03-10 21:09:52] [INFO ] Invariants computation overflowed in 6985 ms
[2023-03-10 21:09:54] [INFO ] Dead Transitions using invariants and state equation in 9167 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3866/3867 places, 3518/3518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26972 ms. Remains : 3866/3867 places, 3518/3518 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Echo-PT-d03r07-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(EQ s3160 0), p0:(EQ s3350 1)], 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][false, false, false, false]]
Product exploration explored 100000 steps with 411 reset in 4103 ms.
Product exploration explored 100000 steps with 389 reset in 4515 ms.
Computed a total of 3866 stabilizing places and 3518 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3866 transition count 3518
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 (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 208 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 183 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Finished random walk after 297 steps, including 0 resets, run visited all 2 properties in 20 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 4 factoid took 203 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 156 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
// Phase 1: matrix 3518 rows 3866 cols
[2023-03-10 21:10:13] [INFO ] Invariants computation overflowed in 6960 ms
[2023-03-10 21:10:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 21:10:28] [INFO ] [Real]Absence check using state equation in 6254 ms returned unknown
Could not prove EG (NOT p0)
// Phase 1: matrix 3518 rows 3866 cols
[2023-03-10 21:10:35] [INFO ] Invariants computation overflowed in 7184 ms
[2023-03-10 21:10:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 21:10:50] [INFO ] [Real]Absence check using state equation in 6107 ms returned unknown
Could not prove EG (NOT p1)
Support contains 2 out of 3866 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3866/3866 places, 3518/3518 transitions.
Applied a total of 0 rules in 165 ms. Remains 3866 /3866 variables (removed 0) and now considering 3518/3518 (removed 0) transitions.
// Phase 1: matrix 3518 rows 3866 cols
[2023-03-10 21:10:58] [INFO ] Invariants computation overflowed in 7184 ms
[2023-03-10 21:11:01] [INFO ] Implicit Places using invariants in 10215 ms returned []
// Phase 1: matrix 3518 rows 3866 cols
[2023-03-10 21:11:08] [INFO ] Invariants computation overflowed in 7172 ms
[2023-03-10 21:11:09] [INFO ] Implicit Places using invariants and state equation in 8009 ms returned []
Implicit Place search using SMT with State Equation took 18236 ms to find 0 implicit places.
// Phase 1: matrix 3518 rows 3866 cols
[2023-03-10 21:11:16] [INFO ] Invariants computation overflowed in 7153 ms
[2023-03-10 21:11:18] [INFO ] Dead Transitions using invariants and state equation in 9632 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28036 ms. Remains : 3866/3866 places, 3518/3518 transitions.
Computed a total of 3866 stabilizing places and 3518 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3866 transition count 3518
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 (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 169 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 139 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Finished random walk after 248 steps, including 0 resets, run visited all 2 properties in 16 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 4 factoid took 208 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 141 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
// Phase 1: matrix 3518 rows 3866 cols
[2023-03-10 21:11:28] [INFO ] Invariants computation overflowed in 7187 ms
[2023-03-10 21:11:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 21:11:43] [INFO ] [Real]Absence check using state equation in 5904 ms returned unknown
Could not prove EG (NOT p0)
// Phase 1: matrix 3518 rows 3866 cols
[2023-03-10 21:11:51] [INFO ] Invariants computation overflowed in 7210 ms
[2023-03-10 21:11:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 21:12:06] [INFO ] [Real]Absence check using state equation in 6210 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 411 reset in 4223 ms.
Product exploration explored 100000 steps with 399 reset in 4600 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 2 out of 3866 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3866/3866 places, 3518/3518 transitions.
Graph (complete) has 14527 edges and 3866 vertex of which 3859 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.16 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 408 ms. Remains 3859 /3866 variables (removed 7) and now considering 3517/3518 (removed 1) transitions.
[2023-03-10 21:12:16] [INFO ] Redundant transitions in 87 ms returned []
// Phase 1: matrix 3517 rows 3859 cols
[2023-03-10 21:12:27] [INFO ] Invariants computation overflowed in 11210 ms
[2023-03-10 21:12:29] [INFO ] Dead Transitions using invariants and state equation in 13542 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3859/3866 places, 3517/3518 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14089 ms. Remains : 3859/3866 places, 3517/3518 transitions.
Support contains 2 out of 3866 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3866/3866 places, 3518/3518 transitions.
Applied a total of 0 rules in 169 ms. Remains 3866 /3866 variables (removed 0) and now considering 3518/3518 (removed 0) transitions.
// Phase 1: matrix 3518 rows 3866 cols
[2023-03-10 21:12:37] [INFO ] Invariants computation overflowed in 7211 ms
[2023-03-10 21:12:39] [INFO ] Implicit Places using invariants in 10165 ms returned []
// Phase 1: matrix 3518 rows 3866 cols
[2023-03-10 21:12:47] [INFO ] Invariants computation overflowed in 7152 ms
[2023-03-10 21:12:47] [INFO ] Implicit Places using invariants and state equation in 7971 ms returned []
Implicit Place search using SMT with State Equation took 18177 ms to find 0 implicit places.
// Phase 1: matrix 3518 rows 3866 cols
[2023-03-10 21:12:55] [INFO ] Invariants computation overflowed in 7158 ms
[2023-03-10 21:12:57] [INFO ] Dead Transitions using invariants and state equation in 9392 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27759 ms. Remains : 3866/3866 places, 3518/3518 transitions.
Treatment of property Echo-PT-d03r07-LTLCardinality-07 finished in 210152 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)))'
Support contains 2 out of 3867 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3867/3867 places, 3518/3518 transitions.
Graph (complete) has 14535 edges and 3867 vertex of which 3859 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.9 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 219 ms. Remains 3858 /3867 variables (removed 9) and now considering 3516/3518 (removed 2) transitions.
// Phase 1: matrix 3516 rows 3858 cols
[2023-03-10 21:13:04] [INFO ] Invariants computation overflowed in 6523 ms
[2023-03-10 21:13:07] [INFO ] Implicit Places using invariants in 9458 ms returned []
// Phase 1: matrix 3516 rows 3858 cols
[2023-03-10 21:13:13] [INFO ] Invariants computation overflowed in 6054 ms
[2023-03-10 21:13:14] [INFO ] Implicit Places using invariants and state equation in 6948 ms returned []
Implicit Place search using SMT with State Equation took 16433 ms to find 0 implicit places.
[2023-03-10 21:13:14] [INFO ] Redundant transitions in 161 ms returned []
// Phase 1: matrix 3516 rows 3858 cols
[2023-03-10 21:13:20] [INFO ] Invariants computation overflowed in 6069 ms
[2023-03-10 21:13:21] [INFO ] Dead Transitions using invariants and state equation in 6561 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3858/3867 places, 3516/3518 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23384 ms. Remains : 3858/3867 places, 3516/3518 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d03r07-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s2556 0) (EQ s2649 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 684 steps with 0 reset in 26 ms.
FORMULA Echo-PT-d03r07-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r07-LTLCardinality-09 finished in 23537 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)))'
Support contains 7 out of 3867 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3867/3867 places, 3518/3518 transitions.
Graph (complete) has 14535 edges and 3867 vertex of which 3859 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.11 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 214 ms. Remains 3859 /3867 variables (removed 8) and now considering 3517/3518 (removed 1) transitions.
// Phase 1: matrix 3517 rows 3859 cols
[2023-03-10 21:13:33] [INFO ] Invariants computation overflowed in 11990 ms
[2023-03-10 21:13:36] [INFO ] Implicit Places using invariants in 15081 ms returned []
// Phase 1: matrix 3517 rows 3859 cols
[2023-03-10 21:13:48] [INFO ] Invariants computation overflowed in 11967 ms
[2023-03-10 21:13:49] [INFO ] Implicit Places using invariants and state equation in 12891 ms returned []
Implicit Place search using SMT with State Equation took 27975 ms to find 0 implicit places.
[2023-03-10 21:13:49] [INFO ] Redundant transitions in 159 ms returned []
// Phase 1: matrix 3517 rows 3859 cols
[2023-03-10 21:14:01] [INFO ] Invariants computation overflowed in 11149 ms
[2023-03-10 21:14:01] [INFO ] Dead Transitions using invariants and state equation in 11678 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3859/3867 places, 3517/3518 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40037 ms. Remains : 3859/3867 places, 3517/3518 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d03r07-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s2903 0) (EQ s402 1) (AND (OR (EQ s2911 0) (EQ s800 1)) (OR (EQ s3041 0) (EQ s2802 1))) (AND (EQ s125 1) (OR (EQ s2911 0) (EQ s800 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 297 reset in 3715 ms.
Product exploration explored 100000 steps with 279 reset in 4091 ms.
Computed a total of 3859 stabilizing places and 3517 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3859 transition count 3517
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 (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 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d03r07-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d03r07-LTLCardinality-10 finished in 50077 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)) U (F(!p1) U G(p2))))'
Support contains 5 out of 3867 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3867/3867 places, 3518/3518 transitions.
Graph (complete) has 14535 edges and 3867 vertex of which 3859 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.9 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 222 ms. Remains 3858 /3867 variables (removed 9) and now considering 3516/3518 (removed 2) transitions.
// Phase 1: matrix 3516 rows 3858 cols
[2023-03-10 21:14:17] [INFO ] Invariants computation overflowed in 6062 ms
[2023-03-10 21:14:21] [INFO ] Implicit Places using invariants in 9151 ms returned []
// Phase 1: matrix 3516 rows 3858 cols
[2023-03-10 21:14:27] [INFO ] Invariants computation overflowed in 6304 ms
[2023-03-10 21:14:28] [INFO ] Implicit Places using invariants and state equation in 7136 ms returned []
Implicit Place search using SMT with State Equation took 16290 ms to find 0 implicit places.
[2023-03-10 21:14:28] [INFO ] Redundant transitions in 157 ms returned []
// Phase 1: matrix 3516 rows 3858 cols
[2023-03-10 21:14:34] [INFO ] Invariants computation overflowed in 6164 ms
[2023-03-10 21:14:35] [INFO ] Dead Transitions using invariants and state equation in 6696 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3858/3867 places, 3516/3518 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23375 ms. Remains : 3858/3867 places, 3516/3518 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p2), (AND p1 (NOT p0))]
Running random walk in product with property : Echo-PT-d03r07-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(OR (EQ s498 0) (EQ s1672 1)), p1:(AND (OR (EQ s498 0) (EQ s1672 1)) (OR (EQ s910 0) (EQ s1666 1))), p0:(EQ s220 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 145 reset in 3761 ms.
Product exploration explored 100000 steps with 145 reset in 4023 ms.
Computed a total of 3858 stabilizing places and 3516 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3858 transition count 3516
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 p2 p1 (NOT p0)), (X p2), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p2) p1))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 10 factoid took 506 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p2), (AND p1 (NOT p0))]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 415 ms. (steps per millisecond=24 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3516 rows 3858 cols
[2023-03-10 21:14:52] [INFO ] Invariants computation overflowed in 6148 ms
[2023-03-10 21:14:52] [INFO ] After 555ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p2) p1))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p2) p1)))]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (AND (NOT p0) p1))), (F (NOT p2)), (F (AND p0 p1))]
Knowledge based reduction with 11 factoid took 615 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p2)]
Support contains 2 out of 3858 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 : 3858/3858 places, 3516/3516 transitions.
Applied a total of 0 rules in 200 ms. Remains 3858 /3858 variables (removed 0) and now considering 3516/3516 (removed 0) transitions.
// Phase 1: matrix 3516 rows 3858 cols
[2023-03-10 21:14:59] [INFO ] Invariants computation overflowed in 6089 ms
[2023-03-10 21:15:02] [INFO ] Implicit Places using invariants in 9169 ms returned []
// Phase 1: matrix 3516 rows 3858 cols
[2023-03-10 21:15:09] [INFO ] Invariants computation overflowed in 6132 ms
[2023-03-10 21:15:10] [INFO ] Implicit Places using invariants and state equation in 7054 ms returned []
Implicit Place search using SMT with State Equation took 16227 ms to find 0 implicit places.
[2023-03-10 21:15:10] [INFO ] Redundant transitions in 158 ms returned []
// Phase 1: matrix 3516 rows 3858 cols
[2023-03-10 21:15:16] [INFO ] Invariants computation overflowed in 6382 ms
[2023-03-10 21:15:18] [INFO ] Dead Transitions using invariants and state equation in 8639 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25243 ms. Remains : 3858/3858 places, 3516/3516 transitions.
Computed a total of 3858 stabilizing places and 3516 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3858 transition count 3516
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 : [p2, (X p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 166 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p2)]
Finished random walk after 164 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=18 )
Knowledge obtained : [p2, (X p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 4 factoid took 169 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p2)]
Product exploration explored 100000 steps with 145 reset in 3735 ms.
Product exploration explored 100000 steps with 145 reset in 4110 ms.
Support contains 2 out of 3858 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3858/3858 places, 3516/3516 transitions.
Applied a total of 0 rules in 212 ms. Remains 3858 /3858 variables (removed 0) and now considering 3516/3516 (removed 0) transitions.
// Phase 1: matrix 3516 rows 3858 cols
[2023-03-10 21:15:35] [INFO ] Invariants computation overflowed in 6012 ms
[2023-03-10 21:15:38] [INFO ] Implicit Places using invariants in 9123 ms returned []
// Phase 1: matrix 3516 rows 3858 cols
[2023-03-10 21:15:44] [INFO ] Invariants computation overflowed in 6054 ms
[2023-03-10 21:15:45] [INFO ] Implicit Places using invariants and state equation in 6934 ms returned []
Implicit Place search using SMT with State Equation took 16061 ms to find 0 implicit places.
[2023-03-10 21:15:45] [INFO ] Redundant transitions in 164 ms returned []
// Phase 1: matrix 3516 rows 3858 cols
[2023-03-10 21:15:51] [INFO ] Invariants computation overflowed in 6155 ms
[2023-03-10 21:15:54] [INFO ] Dead Transitions using invariants and state equation in 8431 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24903 ms. Remains : 3858/3858 places, 3516/3516 transitions.
Treatment of property Echo-PT-d03r07-LTLCardinality-11 finished in 102605 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)&&F(p1)))'
Support contains 4 out of 3867 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3867/3867 places, 3518/3518 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3866 transition count 3518
Applied a total of 1 rules in 177 ms. Remains 3866 /3867 variables (removed 1) and now considering 3518/3518 (removed 0) transitions.
// Phase 1: matrix 3518 rows 3866 cols
[2023-03-10 21:16:02] [INFO ] Invariants computation overflowed in 7775 ms
[2023-03-10 21:16:02] [INFO ] Implicit Places using invariants in 8278 ms returned []
// Phase 1: matrix 3518 rows 3866 cols
[2023-03-10 21:16:10] [INFO ] Invariants computation overflowed in 7762 ms
[2023-03-10 21:16:11] [INFO ] Implicit Places using invariants and state equation in 8609 ms returned []
Implicit Place search using SMT with State Equation took 16929 ms to find 0 implicit places.
// Phase 1: matrix 3518 rows 3866 cols
[2023-03-10 21:16:19] [INFO ] Invariants computation overflowed in 7738 ms
[2023-03-10 21:16:21] [INFO ] Dead Transitions using invariants and state equation in 10041 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3866/3867 places, 3518/3518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27167 ms. Remains : 3866/3867 places, 3518/3518 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : Echo-PT-d03r07-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s625 0) (EQ s2807 1)), p0:(OR (EQ s2653 0) (EQ s2594 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3400 ms.
Product exploration explored 100000 steps with 50000 reset in 3509 ms.
Computed a total of 3866 stabilizing places and 3518 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3866 transition count 3518
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), (X p0), (X p1), true, (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 7 factoid took 108 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d03r07-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d03r07-LTLCardinality-13 finished in 36388 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 1 out of 3867 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3867/3867 places, 3518/3518 transitions.
Graph (complete) has 14535 edges and 3867 vertex of which 3859 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.9 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 211 ms. Remains 3858 /3867 variables (removed 9) and now considering 3516/3518 (removed 2) transitions.
// Phase 1: matrix 3516 rows 3858 cols
[2023-03-10 21:16:37] [INFO ] Invariants computation overflowed in 6109 ms
[2023-03-10 21:16:40] [INFO ] Implicit Places using invariants in 9156 ms returned []
// Phase 1: matrix 3516 rows 3858 cols
[2023-03-10 21:16:46] [INFO ] Invariants computation overflowed in 5985 ms
[2023-03-10 21:16:46] [INFO ] Implicit Places using invariants and state equation in 6900 ms returned []
Implicit Place search using SMT with State Equation took 16058 ms to find 0 implicit places.
[2023-03-10 21:16:47] [INFO ] Redundant transitions in 162 ms returned []
// Phase 1: matrix 3516 rows 3858 cols
[2023-03-10 21:16:53] [INFO ] Invariants computation overflowed in 6522 ms
[2023-03-10 21:16:54] [INFO ] Dead Transitions using invariants and state equation in 7068 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3858/3867 places, 3516/3518 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23511 ms. Remains : 3858/3867 places, 3516/3518 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : Echo-PT-d03r07-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s355 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 293 reset in 4573 ms.
Product exploration explored 100000 steps with 298 reset in 5159 ms.
Computed a total of 3858 stabilizing places and 3516 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3858 transition count 3516
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 136 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 329 steps, including 0 resets, run visited all 1 properties in 18 ms. (steps per millisecond=18 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 251 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
// Phase 1: matrix 3516 rows 3858 cols
[2023-03-10 21:17:12] [INFO ] Invariants computation overflowed in 6248 ms
[2023-03-10 21:17:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 21:17:27] [INFO ] [Real]Absence check using state equation in 5891 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1 out of 3858 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3858/3858 places, 3516/3516 transitions.
Applied a total of 0 rules in 199 ms. Remains 3858 /3858 variables (removed 0) and now considering 3516/3516 (removed 0) transitions.
// Phase 1: matrix 3516 rows 3858 cols
[2023-03-10 21:17:34] [INFO ] Invariants computation overflowed in 6329 ms
[2023-03-10 21:17:37] [INFO ] Implicit Places using invariants in 9406 ms returned []
// Phase 1: matrix 3516 rows 3858 cols
[2023-03-10 21:17:43] [INFO ] Invariants computation overflowed in 6294 ms
[2023-03-10 21:17:44] [INFO ] Implicit Places using invariants and state equation in 7146 ms returned []
Implicit Place search using SMT with State Equation took 16556 ms to find 0 implicit places.
[2023-03-10 21:17:44] [INFO ] Redundant transitions in 95 ms returned []
// Phase 1: matrix 3516 rows 3858 cols
[2023-03-10 21:17:50] [INFO ] Invariants computation overflowed in 6234 ms
[2023-03-10 21:17:53] [INFO ] Dead Transitions using invariants and state equation in 8661 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25523 ms. Remains : 3858/3858 places, 3516/3516 transitions.
Computed a total of 3858 stabilizing places and 3516 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3858 transition count 3516
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 (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 165 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 237 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=18 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 198 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
// Phase 1: matrix 3516 rows 3858 cols
[2023-03-10 21:18:02] [INFO ] Invariants computation overflowed in 6211 ms
[2023-03-10 21:18:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 21:18:17] [INFO ] [Real]Absence check using state equation in 6504 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 300 reset in 4702 ms.
Product exploration explored 100000 steps with 284 reset in 4941 ms.
Support contains 1 out of 3858 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3858/3858 places, 3516/3516 transitions.
Applied a total of 0 rules in 192 ms. Remains 3858 /3858 variables (removed 0) and now considering 3516/3516 (removed 0) transitions.
// Phase 1: matrix 3516 rows 3858 cols
[2023-03-10 21:18:33] [INFO ] Invariants computation overflowed in 6662 ms
[2023-03-10 21:18:36] [INFO ] Implicit Places using invariants in 9668 ms returned []
// Phase 1: matrix 3516 rows 3858 cols
[2023-03-10 21:18:43] [INFO ] Invariants computation overflowed in 6374 ms
[2023-03-10 21:18:44] [INFO ] Implicit Places using invariants and state equation in 7292 ms returned []
Implicit Place search using SMT with State Equation took 16966 ms to find 0 implicit places.
[2023-03-10 21:18:44] [INFO ] Redundant transitions in 93 ms returned []
// Phase 1: matrix 3516 rows 3858 cols
[2023-03-10 21:18:50] [INFO ] Invariants computation overflowed in 6387 ms
[2023-03-10 21:18:52] [INFO ] Dead Transitions using invariants and state equation in 8617 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25880 ms. Remains : 3858/3858 places, 3516/3516 transitions.
Treatment of property Echo-PT-d03r07-LTLCardinality-14 finished in 142344 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(F(!p0))||(F(!p0)&&X(G(!p1))))))'
Support contains 4 out of 3867 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3867/3867 places, 3518/3518 transitions.
Graph (complete) has 14535 edges and 3867 vertex of which 3859 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.5 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 205 ms. Remains 3858 /3867 variables (removed 9) and now considering 3516/3518 (removed 2) transitions.
// Phase 1: matrix 3516 rows 3858 cols
[2023-03-10 21:18:59] [INFO ] Invariants computation overflowed in 6337 ms
[2023-03-10 21:19:02] [INFO ] Implicit Places using invariants in 9214 ms returned []
// Phase 1: matrix 3516 rows 3858 cols
[2023-03-10 21:19:08] [INFO ] Invariants computation overflowed in 6275 ms
[2023-03-10 21:19:09] [INFO ] Implicit Places using invariants and state equation in 7223 ms returned []
Implicit Place search using SMT with State Equation took 16443 ms to find 0 implicit places.
[2023-03-10 21:19:09] [INFO ] Redundant transitions in 91 ms returned []
// Phase 1: matrix 3516 rows 3858 cols
[2023-03-10 21:19:16] [INFO ] Invariants computation overflowed in 6300 ms
[2023-03-10 21:19:18] [INFO ] Dead Transitions using invariants and state equation in 8610 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3858/3867 places, 3516/3518 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25368 ms. Remains : 3858/3867 places, 3516/3518 transitions.
Stuttering acceptance computed with spot in 113 ms :[p0, (AND p0 p1), p0]
Running random walk in product with property : Echo-PT-d03r07-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s977 0) (EQ s2722 1)), p1:(OR (EQ s2505 0) (EQ s2637 1))], 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 5359 steps with 15 reset in 250 ms.
FORMULA Echo-PT-d03r07-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r07-LTLCardinality-15 finished in 25769 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(F((p0&&X(F(p1)))))))'
Found a Shortening insensitive property : Echo-PT-d03r07-LTLCardinality-07
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 2 out of 3867 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3867/3867 places, 3518/3518 transitions.
Graph (complete) has 14535 edges and 3867 vertex of which 3859 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.10 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 210 ms. Remains 3858 /3867 variables (removed 9) and now considering 3516/3518 (removed 2) transitions.
// Phase 1: matrix 3516 rows 3858 cols
[2023-03-10 21:19:25] [INFO ] Invariants computation overflowed in 6230 ms
[2023-03-10 21:19:26] [INFO ] Implicit Places using invariants in 6722 ms returned []
// Phase 1: matrix 3516 rows 3858 cols
[2023-03-10 21:19:32] [INFO ] Invariants computation overflowed in 6177 ms
[2023-03-10 21:19:33] [INFO ] Implicit Places using invariants and state equation in 7096 ms returned []
Implicit Place search using SMT with State Equation took 13820 ms to find 0 implicit places.
// Phase 1: matrix 3516 rows 3858 cols
[2023-03-10 21:19:39] [INFO ] Invariants computation overflowed in 6185 ms
[2023-03-10 21:19:41] [INFO ] Dead Transitions using invariants and state equation in 8493 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 3858/3867 places, 3516/3518 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 22526 ms. Remains : 3858/3867 places, 3516/3518 transitions.
Running random walk in product with property : Echo-PT-d03r07-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(EQ s3152 0), p0:(EQ s3342 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 397 reset in 4468 ms.
Product exploration explored 100000 steps with 403 reset in 4735 ms.
Computed a total of 3858 stabilizing places and 3516 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3858 transition count 3516
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 (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 162 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 157 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Finished random walk after 653 steps, including 0 resets, run visited all 2 properties in 36 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 4 factoid took 214 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 157 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
// Phase 1: matrix 3516 rows 3858 cols
[2023-03-10 21:19:59] [INFO ] Invariants computation overflowed in 6259 ms
[2023-03-10 21:20:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 21:20:14] [INFO ] [Real]Absence check using state equation in 5706 ms returned unknown
Could not prove EG (NOT p0)
// Phase 1: matrix 3516 rows 3858 cols
[2023-03-10 21:20:21] [INFO ] Invariants computation overflowed in 6258 ms
[2023-03-10 21:20:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 21:20:36] [INFO ] [Real]Absence check using state equation in 6480 ms returned unknown
Could not prove EG (NOT p1)
Support contains 2 out of 3858 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3858/3858 places, 3516/3516 transitions.
Applied a total of 0 rules in 166 ms. Remains 3858 /3858 variables (removed 0) and now considering 3516/3516 (removed 0) transitions.
// Phase 1: matrix 3516 rows 3858 cols
[2023-03-10 21:20:42] [INFO ] Invariants computation overflowed in 6039 ms
[2023-03-10 21:20:43] [INFO ] Implicit Places using invariants in 6590 ms returned []
// Phase 1: matrix 3516 rows 3858 cols
[2023-03-10 21:20:49] [INFO ] Invariants computation overflowed in 6585 ms
[2023-03-10 21:20:50] [INFO ] Implicit Places using invariants and state equation in 7508 ms returned []
Implicit Place search using SMT with State Equation took 14108 ms to find 0 implicit places.
// Phase 1: matrix 3516 rows 3858 cols
[2023-03-10 21:20:56] [INFO ] Invariants computation overflowed in 6022 ms
[2023-03-10 21:20:58] [INFO ] Dead Transitions using invariants and state equation in 8133 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22408 ms. Remains : 3858/3858 places, 3516/3516 transitions.
Computed a total of 3858 stabilizing places and 3516 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3858 transition count 3516
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 (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 204 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 158 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Finished random walk after 206 steps, including 0 resets, run visited all 2 properties in 14 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 4 factoid took 224 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 180 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
// Phase 1: matrix 3516 rows 3858 cols
[2023-03-10 21:21:08] [INFO ] Invariants computation overflowed in 6404 ms
[2023-03-10 21:21:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 21:21:23] [INFO ] [Real]Absence check using state equation in 5932 ms returned unknown
Could not prove EG (NOT p0)
// Phase 1: matrix 3516 rows 3858 cols
[2023-03-10 21:21:29] [INFO ] Invariants computation overflowed in 6112 ms
[2023-03-10 21:21:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 21:21:44] [INFO ] [Real]Absence check using state equation in 6408 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 282 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 417 reset in 4244 ms.
Product exploration explored 100000 steps with 395 reset in 4953 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 2 out of 3858 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3858/3858 places, 3516/3516 transitions.
Applied a total of 0 rules in 204 ms. Remains 3858 /3858 variables (removed 0) and now considering 3516/3516 (removed 0) transitions.
[2023-03-10 21:21:54] [INFO ] Redundant transitions in 93 ms returned []
// Phase 1: matrix 3516 rows 3858 cols
[2023-03-10 21:22:00] [INFO ] Invariants computation overflowed in 6076 ms
[2023-03-10 21:22:02] [INFO ] Dead Transitions using invariants and state equation in 8431 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8745 ms. Remains : 3858/3858 places, 3516/3516 transitions.
Support contains 2 out of 3858 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3858/3858 places, 3516/3516 transitions.
Applied a total of 0 rules in 170 ms. Remains 3858 /3858 variables (removed 0) and now considering 3516/3516 (removed 0) transitions.
// Phase 1: matrix 3516 rows 3858 cols
[2023-03-10 21:22:09] [INFO ] Invariants computation overflowed in 6206 ms
[2023-03-10 21:22:12] [INFO ] Implicit Places using invariants in 9349 ms returned []
// Phase 1: matrix 3516 rows 3858 cols
[2023-03-10 21:22:18] [INFO ] Invariants computation overflowed in 6484 ms
[2023-03-10 21:22:19] [INFO ] Implicit Places using invariants and state equation in 7343 ms returned []
Implicit Place search using SMT with State Equation took 16697 ms to find 0 implicit places.
// Phase 1: matrix 3516 rows 3858 cols
[2023-03-10 21:22:26] [INFO ] Invariants computation overflowed in 6492 ms
[2023-03-10 21:22:28] [INFO ] Dead Transitions using invariants and state equation in 8898 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25768 ms. Remains : 3858/3858 places, 3516/3516 transitions.
Treatment of property Echo-PT-d03r07-LTLCardinality-07 finished in 189929 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)) U (F(!p1) U G(p2))))'
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))'
[2023-03-10 21:22:29] [INFO ] Flatten gal took : 224 ms
[2023-03-10 21:22:29] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-10 21:22:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3867 places, 3518 transitions and 23785 arcs took 40 ms.
Total runtime 944501 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1693/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1693/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1693/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Echo-PT-d03r07-LTLCardinality-07
Could not compute solution for formula : Echo-PT-d03r07-LTLCardinality-11
Could not compute solution for formula : Echo-PT-d03r07-LTLCardinality-14

BK_STOP 1678483356755

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name Echo-PT-d03r07-LTLCardinality-07
ltl formula formula --ltl=/tmp/1693/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 3867 places, 3518 transitions and 23785 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.390 real 0.120 user 0.160 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1693/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1693/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1693/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1693/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name Echo-PT-d03r07-LTLCardinality-11
ltl formula formula --ltl=/tmp/1693/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 3867 places, 3518 transitions and 23785 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.400 real 0.160 user 0.120 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1693/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1693/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1693/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1693/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x561e9245a3f4]
1: pnml2lts-mc(+0xa2496) [0x561e9245a496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f3454acc140]
3: pnml2lts-mc(+0x405be5) [0x561e927bdbe5]
4: pnml2lts-mc(+0x16b3f9) [0x561e925233f9]
5: pnml2lts-mc(+0x164ac4) [0x561e9251cac4]
6: pnml2lts-mc(+0x272e0a) [0x561e9262ae0a]
7: pnml2lts-mc(+0xb61f0) [0x561e9246e1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f345491f4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f345491f67a]
10: pnml2lts-mc(+0xa1581) [0x561e92459581]
11: pnml2lts-mc(+0xa1910) [0x561e92459910]
12: pnml2lts-mc(+0xa32a2) [0x561e9245b2a2]
13: pnml2lts-mc(+0xa50f4) [0x561e9245d0f4]
14: pnml2lts-mc(+0x3f34b3) [0x561e927ab4b3]
15: pnml2lts-mc(+0x7c63d) [0x561e9243463d]
16: pnml2lts-mc(+0x67d86) [0x561e9241fd86]
17: pnml2lts-mc(+0x60a8a) [0x561e92418a8a]
18: pnml2lts-mc(+0x5eb15) [0x561e92416b15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f3454907d0a]
20: pnml2lts-mc(+0x6075e) [0x561e9241875e]
ltl formula name Echo-PT-d03r07-LTLCardinality-14
ltl formula formula --ltl=/tmp/1693/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 3867 places, 3518 transitions and 23785 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.400 real 0.140 user 0.140 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1693/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1693/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1693/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1693/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55abe43b03f4]
1: pnml2lts-mc(+0xa2496) [0x55abe43b0496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f4203d63140]
3: pnml2lts-mc(+0x405be5) [0x55abe4713be5]
4: pnml2lts-mc(+0x16b3f9) [0x55abe44793f9]
5: pnml2lts-mc(+0x164ac4) [0x55abe4472ac4]
6: pnml2lts-mc(+0x272e0a) [0x55abe4580e0a]
7: pnml2lts-mc(+0xb61f0) [0x55abe43c41f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f4203bb64d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f4203bb667a]
10: pnml2lts-mc(+0xa1581) [0x55abe43af581]
11: pnml2lts-mc(+0xa1910) [0x55abe43af910]
12: pnml2lts-mc(+0xa32a2) [0x55abe43b12a2]
13: pnml2lts-mc(+0xa50f4) [0x55abe43b30f4]
14: pnml2lts-mc(+0xa516b) [0x55abe43b316b]
15: pnml2lts-mc(+0x3f34b3) [0x55abe47014b3]
16: pnml2lts-mc(+0x7c63d) [0x55abe438a63d]
17: pnml2lts-mc(+0x67d86) [0x55abe4375d86]
18: pnml2lts-mc(+0x60a8a) [0x55abe436ea8a]
19: pnml2lts-mc(+0x5eb15) [0x55abe436cb15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f4203b9ed0a]
21: pnml2lts-mc(+0x6075e) [0x55abe436e75e]

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="Echo-PT-d03r07"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Echo-PT-d03r07, 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 r169-tall-167838855400099"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Echo-PT-d03r07.tgz
mv Echo-PT-d03r07 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 ;