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.r073-smll-167814399100084.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 CSRepetitions-PT-07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r073-smll-167814399100084
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.0M
-rw-r--r-- 1 mcc users 79K Feb 25 12:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 276K Feb 25 12:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 221K Feb 25 12:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 885K Feb 25 12:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 92K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 241K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 80K Feb 25 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 249K Feb 25 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 258K Feb 25 12:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 926K Feb 25 12:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 641K Feb 25 12:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.6M Feb 25 12:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 15:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 424K 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 CSRepetitions-PT-07-LTLFireability-00
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-01
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-02
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-03
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-04
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-05
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-06
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-07
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-08
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-09
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-10
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-11
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-12
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-13
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-14
FORMULA_NAME CSRepetitions-PT-07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678262390433

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CSRepetitions-PT-07
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 07:59:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 07:59:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 07:59:53] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2023-03-08 07:59:53] [INFO ] Transformed 498 places.
[2023-03-08 07:59:53] [INFO ] Transformed 833 transitions.
[2023-03-08 07:59:53] [INFO ] Parsed PT model containing 498 places and 833 transitions and 3087 arcs in 311 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 79 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA CSRepetitions-PT-07-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-07-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-07-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-07-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-07-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 158 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 116 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
// Phase 1: matrix 833 rows 498 cols
[2023-03-08 07:59:53] [INFO ] Computed 56 place invariants in 52 ms
[2023-03-08 07:59:54] [INFO ] Implicit Places using invariants in 767 ms returned []
[2023-03-08 07:59:54] [INFO ] Invariant cache hit.
[2023-03-08 07:59:55] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-08 07:59:55] [INFO ] Implicit Places using invariants and state equation in 1012 ms returned []
Implicit Place search using SMT with State Equation took 1837 ms to find 0 implicit places.
[2023-03-08 07:59:55] [INFO ] Invariant cache hit.
[2023-03-08 07:59:56] [INFO ] Dead Transitions using invariants and state equation in 600 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2564 ms. Remains : 498/498 places, 833/833 transitions.
Support contains 158 out of 498 places after structural reductions.
[2023-03-08 07:59:56] [INFO ] Flatten gal took : 179 ms
[2023-03-08 07:59:56] [INFO ] Flatten gal took : 152 ms
[2023-03-08 07:59:57] [INFO ] Input system was already deterministic with 833 transitions.
Finished random walk after 6253 steps, including 63 resets, run visited all 19 properties in 282 ms. (steps per millisecond=22 )
Computed a total of 0 stabilizing places and 49 stable transitions
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 X(p1)))))'
Support contains 56 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 50 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2023-03-08 07:59:57] [INFO ] Invariant cache hit.
[2023-03-08 07:59:58] [INFO ] Implicit Places using invariants in 350 ms returned []
[2023-03-08 07:59:58] [INFO ] Invariant cache hit.
[2023-03-08 07:59:58] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-08 07:59:59] [INFO ] Implicit Places using invariants and state equation in 918 ms returned []
Implicit Place search using SMT with State Equation took 1272 ms to find 0 implicit places.
[2023-03-08 07:59:59] [INFO ] Invariant cache hit.
[2023-03-08 07:59:59] [INFO ] Dead Transitions using invariants and state equation in 764 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2091 ms. Remains : 498/498 places, 833/833 transitions.
Stuttering acceptance computed with spot in 305 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : CSRepetitions-PT-07-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s129 1) (GEQ s320 1) (GEQ s72 1) (GEQ s139 1) (GEQ s330 1) (GEQ s82 1) (GEQ s336 1) (GEQ s273 1) (GEQ s84 1) (GEQ s86 1) (GEQ s149 1) (GEQ s25...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 8352 reset in 3945 ms.
Product exploration explored 100000 steps with 8315 reset in 3870 ms.
Computed a total of 0 stabilizing places and 49 stable transitions
Computed a total of 0 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 435 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 898 steps, including 9 resets, run visited all 4 properties in 15 ms. (steps per millisecond=59 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F (AND p0 (NOT p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 6 factoid took 521 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 248 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-08 08:00:10] [INFO ] Invariant cache hit.
[2023-03-08 08:00:15] [INFO ] [Real]Absence check using 56 positive place invariants in 39 ms returned sat
[2023-03-08 08:00:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:00:16] [INFO ] [Real]Absence check using state equation in 317 ms returned sat
[2023-03-08 08:00:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:00:21] [INFO ] [Nat]Absence check using 56 positive place invariants in 40 ms returned sat
[2023-03-08 08:00:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:00:22] [INFO ] [Nat]Absence check using state equation in 591 ms returned sat
[2023-03-08 08:00:22] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-08 08:00:22] [INFO ] [Nat]Added 49 Read/Feed constraints in 112 ms returned sat
[2023-03-08 08:00:22] [INFO ] Computed and/alt/rep : 784/1127/784 causal constraints (skipped 0 transitions) in 65 ms.
[2023-03-08 08:00:22] [INFO ] Added : 0 causal constraints over 0 iterations in 184 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 56 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 25 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2023-03-08 08:00:22] [INFO ] Invariant cache hit.
[2023-03-08 08:00:23] [INFO ] Implicit Places using invariants in 450 ms returned []
[2023-03-08 08:00:23] [INFO ] Invariant cache hit.
[2023-03-08 08:00:23] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-08 08:00:24] [INFO ] Implicit Places using invariants and state equation in 1067 ms returned []
Implicit Place search using SMT with State Equation took 1523 ms to find 0 implicit places.
[2023-03-08 08:00:24] [INFO ] Invariant cache hit.
[2023-03-08 08:00:25] [INFO ] Dead Transitions using invariants and state equation in 736 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2290 ms. Remains : 498/498 places, 833/833 transitions.
Computed a total of 0 stabilizing places and 49 stable transitions
Computed a total of 0 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 535 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 379 steps, including 3 resets, run visited all 4 properties in 7 ms. (steps per millisecond=54 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F (AND p0 (NOT p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 6 factoid took 490 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-08 08:00:27] [INFO ] Invariant cache hit.
[2023-03-08 08:00:32] [INFO ] [Real]Absence check using 56 positive place invariants in 42 ms returned sat
[2023-03-08 08:00:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:00:33] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2023-03-08 08:00:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:00:38] [INFO ] [Nat]Absence check using 56 positive place invariants in 35 ms returned sat
[2023-03-08 08:00:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:00:39] [INFO ] [Nat]Absence check using state equation in 592 ms returned sat
[2023-03-08 08:00:39] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-08 08:00:39] [INFO ] [Nat]Added 49 Read/Feed constraints in 112 ms returned sat
[2023-03-08 08:00:39] [INFO ] Computed and/alt/rep : 784/1127/784 causal constraints (skipped 0 transitions) in 68 ms.
[2023-03-08 08:00:39] [INFO ] Added : 0 causal constraints over 0 iterations in 151 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 8315 reset in 3766 ms.
Product exploration explored 100000 steps with 8284 reset in 3709 ms.
Support contains 56 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 21 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2023-03-08 08:00:47] [INFO ] Invariant cache hit.
[2023-03-08 08:00:47] [INFO ] Implicit Places using invariants in 478 ms returned []
[2023-03-08 08:00:47] [INFO ] Invariant cache hit.
[2023-03-08 08:00:48] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-08 08:00:48] [INFO ] Implicit Places using invariants and state equation in 947 ms returned []
Implicit Place search using SMT with State Equation took 1443 ms to find 0 implicit places.
[2023-03-08 08:00:48] [INFO ] Invariant cache hit.
[2023-03-08 08:00:49] [INFO ] Dead Transitions using invariants and state equation in 678 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2143 ms. Remains : 498/498 places, 833/833 transitions.
Treatment of property CSRepetitions-PT-07-LTLFireability-00 finished in 51906 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((X(p1)||p0))&&X(G(p2))))'
Support contains 98 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 21 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2023-03-08 08:00:49] [INFO ] Invariant cache hit.
[2023-03-08 08:00:50] [INFO ] Implicit Places using invariants in 509 ms returned []
[2023-03-08 08:00:50] [INFO ] Invariant cache hit.
[2023-03-08 08:00:50] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-08 08:00:51] [INFO ] Implicit Places using invariants and state equation in 1076 ms returned []
Implicit Place search using SMT with State Equation took 1591 ms to find 0 implicit places.
[2023-03-08 08:00:51] [INFO ] Invariant cache hit.
[2023-03-08 08:00:52] [INFO ] Dead Transitions using invariants and state equation in 677 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2293 ms. Remains : 498/498 places, 833/833 transitions.
Stuttering acceptance computed with spot in 176 ms :[(NOT p2), true, (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : CSRepetitions-PT-07-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={0} source=3 dest: 0}, { cond=(NOT p2), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(OR (GEQ s391 1) (GEQ s263 1) (GEQ s387 1) (GEQ s7 1) (GEQ s196 1) (GEQ s137 1) (GEQ s271 1) (GEQ s328 1) (GEQ s265 1) (GEQ s78 1) (GEQ s23 1) (GEQ s27...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 99 steps with 0 reset in 2 ms.
FORMULA CSRepetitions-PT-07-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-07-LTLFireability-02 finished in 2501 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)&&G(F(p1))))'
Support contains 106 out of 498 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 76 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2023-03-08 08:00:52] [INFO ] Invariant cache hit.
[2023-03-08 08:00:52] [INFO ] Implicit Places using invariants in 482 ms returned []
[2023-03-08 08:00:52] [INFO ] Invariant cache hit.
[2023-03-08 08:00:53] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-08 08:00:53] [INFO ] Implicit Places using invariants and state equation in 753 ms returned []
Implicit Place search using SMT with State Equation took 1238 ms to find 0 implicit places.
[2023-03-08 08:00:53] [INFO ] Redundant transitions in 66 ms returned []
[2023-03-08 08:00:53] [INFO ] Invariant cache hit.
[2023-03-08 08:00:54] [INFO ] Dead Transitions using invariants and state equation in 582 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1970 ms. Remains : 498/498 places, 833/833 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p1) p0), p0, (NOT p1), (NOT p1)]
Running random walk in product with property : CSRepetitions-PT-07-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s255 1) (GEQ s360 1)) (AND (GEQ s121 1) (GEQ s327 1)) (AND (GEQ s233 1) (GEQ s255 1)) (AND (GEQ s201 1) (GEQ s481 1)) (AND (GEQ s33 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 10560 steps with 364 reset in 114 ms.
FORMULA CSRepetitions-PT-07-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-07-LTLFireability-05 finished in 2270 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!p0)&&F(G(p1)))))'
Support contains 98 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 9 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2023-03-08 08:00:54] [INFO ] Invariant cache hit.
[2023-03-08 08:00:54] [INFO ] Implicit Places using invariants in 449 ms returned []
[2023-03-08 08:00:54] [INFO ] Invariant cache hit.
[2023-03-08 08:00:55] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-08 08:00:56] [INFO ] Implicit Places using invariants and state equation in 1056 ms returned []
Implicit Place search using SMT with State Equation took 1507 ms to find 0 implicit places.
[2023-03-08 08:00:56] [INFO ] Invariant cache hit.
[2023-03-08 08:00:56] [INFO ] Dead Transitions using invariants and state equation in 683 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2202 ms. Remains : 498/498 places, 833/833 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : CSRepetitions-PT-07-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s391 1) (GEQ s263 1) (GEQ s387 1) (GEQ s7 1) (GEQ s196 1) (GEQ s137 1) (GEQ s271 1) (GEQ s328 1) (GEQ s265 1) (GEQ s78 1) (GEQ s23 1) (GEQ s27...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 115 steps with 0 reset in 3 ms.
FORMULA CSRepetitions-PT-07-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-07-LTLFireability-06 finished in 2432 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 49 out of 498 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 0 with 147 rules applied. Total rules applied 147 place count 400 transition count 784
Discarding 336 places :
Symmetric choice reduction at 0 with 336 rule applications. Total rules 483 place count 64 transition count 448
Iterating global reduction 0 with 336 rules applied. Total rules applied 819 place count 64 transition count 448
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 21 rules applied. Total rules applied 840 place count 50 transition count 441
Ensure Unique test removed 294 transitions
Reduce isomorphic transitions removed 294 transitions.
Iterating post reduction 0 with 294 rules applied. Total rules applied 1134 place count 50 transition count 147
Applied a total of 1134 rules in 99 ms. Remains 50 /498 variables (removed 448) and now considering 147/833 (removed 686) transitions.
// Phase 1: matrix 147 rows 50 cols
[2023-03-08 08:00:57] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-08 08:00:57] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-08 08:00:57] [INFO ] Invariant cache hit.
[2023-03-08 08:00:57] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2023-03-08 08:00:57] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 08:00:57] [INFO ] Invariant cache hit.
[2023-03-08 08:00:57] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/498 places, 147/833 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 338 ms. Remains : 50/498 places, 147/833 transitions.
Stuttering acceptance computed with spot in 146 ms :[p0]
Running random walk in product with property : CSRepetitions-PT-07-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s17 1) (GEQ s34 1) (GEQ s8 1) (GEQ s18 1) (GEQ s35 1) (GEQ s10 1) (GEQ s37 1) (GEQ s28 1) (GEQ s11 1) (GEQ s12 1) (GEQ s19 1) (GEQ s2 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3452 reset in 618 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA CSRepetitions-PT-07-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-07-LTLFireability-07 finished in 1124 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' '!((p0 U X(((p1 U G(p2))&&F(p3)))))'
Support contains 7 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 32 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
// Phase 1: matrix 833 rows 498 cols
[2023-03-08 08:00:58] [INFO ] Computed 56 place invariants in 10 ms
[2023-03-08 08:00:58] [INFO ] Implicit Places using invariants in 469 ms returned []
[2023-03-08 08:00:58] [INFO ] Invariant cache hit.
[2023-03-08 08:00:58] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-08 08:00:59] [INFO ] Implicit Places using invariants and state equation in 1066 ms returned []
Implicit Place search using SMT with State Equation took 1539 ms to find 0 implicit places.
[2023-03-08 08:00:59] [INFO ] Invariant cache hit.
[2023-03-08 08:01:00] [INFO ] Dead Transitions using invariants and state equation in 592 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2165 ms. Remains : 498/498 places, 833/833 transitions.
Stuttering acceptance computed with spot in 462 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), true, (NOT p2), (NOT p2), (NOT p3), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : CSRepetitions-PT-07-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}, { cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}, { cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=2 dest: 7}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 8}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 8}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=2 dest: 9}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p2 p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 4}, { cond=p1, acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=7 dest: 6}, { cond=(AND p2 p1 (NOT p3)), acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=8 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=8 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND p0 p2 p1), acceptance={} source=8 dest: 8}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=8 dest: 8}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=9 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=9 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=9 dest: 7}, { cond=(AND p0 p2 p1), acceptance={} source=9 dest: 8}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=9 dest: 8}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=9 dest: 9}, { cond=(AND p2 p1 (NOT p3)), acceptance={} source=9 dest: 10}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=10 dest: 6}, { cond=(AND p2 (NOT p3)), acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(AND (GEQ s80 1) (GEQ s276 1)), p2:(GEQ s321 1), p1:(AND (GEQ s44 1) (GEQ s122 1)), p3:(AND (GEQ s167 1) (GEQ s483 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 123 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-07-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-07-LTLFireability-08 finished in 2670 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(G((p1&&X((p1 U (!p2||G(p1))))))))))'
Support contains 4 out of 498 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 15 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2023-03-08 08:01:00] [INFO ] Invariant cache hit.
[2023-03-08 08:01:01] [INFO ] Implicit Places using invariants in 485 ms returned []
[2023-03-08 08:01:01] [INFO ] Invariant cache hit.
[2023-03-08 08:01:01] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-08 08:01:02] [INFO ] Implicit Places using invariants and state equation in 1062 ms returned []
Implicit Place search using SMT with State Equation took 1562 ms to find 0 implicit places.
[2023-03-08 08:01:02] [INFO ] Invariant cache hit.
[2023-03-08 08:01:02] [INFO ] Dead Transitions using invariants and state equation in 699 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2278 ms. Remains : 498/498 places, 833/833 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-07-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (GEQ s109 1) (LT s187 1)), p1:(OR (LT s80 1) (LT s429 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 2412 reset in 846 ms.
Product exploration explored 100000 steps with 2454 reset in 880 ms.
Computed a total of 0 stabilizing places and 49 stable transitions
Computed a total of 0 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 1 factoid took 185 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 143 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 104 steps, including 1 resets, run visited all 3 properties in 2 ms. (steps per millisecond=52 )
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 1 factoid took 251 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 153 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 498 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 13 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2023-03-08 08:01:05] [INFO ] Invariant cache hit.
[2023-03-08 08:01:06] [INFO ] Implicit Places using invariants in 479 ms returned []
[2023-03-08 08:01:06] [INFO ] Invariant cache hit.
[2023-03-08 08:01:06] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-08 08:01:07] [INFO ] Implicit Places using invariants and state equation in 1090 ms returned []
Implicit Place search using SMT with State Equation took 1572 ms to find 0 implicit places.
[2023-03-08 08:01:07] [INFO ] Invariant cache hit.
[2023-03-08 08:01:08] [INFO ] Dead Transitions using invariants and state equation in 774 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2360 ms. Remains : 498/498 places, 833/833 transitions.
Computed a total of 0 stabilizing places and 49 stable transitions
Computed a total of 0 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 1 factoid took 332 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 145 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 224 steps, including 2 resets, run visited all 3 properties in 3 ms. (steps per millisecond=74 )
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 1 factoid took 254 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 145 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2414 reset in 846 ms.
Stack based approach found an accepted trace after 94324 steps with 2303 reset with depth 77 and stack size 77 in 833 ms.
FORMULA CSRepetitions-PT-07-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-07-LTLFireability-09 finished in 10373 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' '!(((p0||G(!p1)) U (!p0&&G(!p1))))'
Support contains 3 out of 498 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 0 with 141 rules applied. Total rules applied 141 place count 404 transition count 786
Discarding 322 places :
Symmetric choice reduction at 0 with 322 rule applications. Total rules 463 place count 82 transition count 464
Iterating global reduction 0 with 322 rules applied. Total rules applied 785 place count 82 transition count 464
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 824 place count 43 transition count 152
Iterating global reduction 0 with 39 rules applied. Total rules applied 863 place count 43 transition count 152
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 902 place count 43 transition count 113
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 916 place count 36 transition count 106
Applied a total of 916 rules in 53 ms. Remains 36 /498 variables (removed 462) and now considering 106/833 (removed 727) transitions.
[2023-03-08 08:01:11] [INFO ] Flow matrix only has 58 transitions (discarded 48 similar events)
// Phase 1: matrix 58 rows 36 cols
[2023-03-08 08:01:11] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-08 08:01:11] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 08:01:11] [INFO ] Flow matrix only has 58 transitions (discarded 48 similar events)
[2023-03-08 08:01:11] [INFO ] Invariant cache hit.
[2023-03-08 08:01:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 08:01:11] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2023-03-08 08:01:11] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:01:11] [INFO ] Flow matrix only has 58 transitions (discarded 48 similar events)
[2023-03-08 08:01:11] [INFO ] Invariant cache hit.
[2023-03-08 08:01:11] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/498 places, 106/833 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 249 ms. Remains : 36/498 places, 106/833 transitions.
Stuttering acceptance computed with spot in 85 ms :[p1, true, (OR p0 p1)]
Running random walk in product with property : CSRepetitions-PT-07-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(AND (GEQ s7 1) (GEQ s11 1)), p0:(LT s19 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 158 steps with 4 reset in 1 ms.
FORMULA CSRepetitions-PT-07-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-07-LTLFireability-10 finished in 353 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(G(p0))))'
Support contains 2 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 22 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
// Phase 1: matrix 833 rows 498 cols
[2023-03-08 08:01:11] [INFO ] Computed 56 place invariants in 10 ms
[2023-03-08 08:01:11] [INFO ] Implicit Places using invariants in 442 ms returned []
[2023-03-08 08:01:11] [INFO ] Invariant cache hit.
[2023-03-08 08:01:12] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-08 08:01:12] [INFO ] Implicit Places using invariants and state equation in 1075 ms returned []
Implicit Place search using SMT with State Equation took 1519 ms to find 0 implicit places.
[2023-03-08 08:01:12] [INFO ] Invariant cache hit.
[2023-03-08 08:01:13] [INFO ] Dead Transitions using invariants and state equation in 684 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2228 ms. Remains : 498/498 places, 833/833 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-07-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s26 1) (GEQ s80 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-07-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-07-LTLFireability-12 finished in 2360 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))))'
Support contains 4 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 14 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2023-03-08 08:01:13] [INFO ] Invariant cache hit.
[2023-03-08 08:01:14] [INFO ] Implicit Places using invariants in 383 ms returned []
[2023-03-08 08:01:14] [INFO ] Invariant cache hit.
[2023-03-08 08:01:14] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-08 08:01:15] [INFO ] Implicit Places using invariants and state equation in 1080 ms returned []
Implicit Place search using SMT with State Equation took 1465 ms to find 0 implicit places.
[2023-03-08 08:01:15] [INFO ] Invariant cache hit.
[2023-03-08 08:01:16] [INFO ] Dead Transitions using invariants and state equation in 772 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2253 ms. Remains : 498/498 places, 833/833 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-07-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (LT s80 1) (LT s365 1) (AND (GEQ s234 1) (GEQ s427 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][false, false, false]]
Product exploration explored 100000 steps with 21551 reset in 886 ms.
Product exploration explored 100000 steps with 21247 reset in 757 ms.
Computed a total of 0 stabilizing places and 49 stable transitions
Computed a total of 0 stabilizing places and 49 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 96 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 114 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Applied a total of 0 rules in 13 ms. Remains 498 /498 variables (removed 0) and now considering 833/833 (removed 0) transitions.
[2023-03-08 08:01:18] [INFO ] Invariant cache hit.
[2023-03-08 08:01:18] [INFO ] Implicit Places using invariants in 401 ms returned []
[2023-03-08 08:01:18] [INFO ] Invariant cache hit.
[2023-03-08 08:01:19] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-08 08:01:19] [INFO ] Implicit Places using invariants and state equation in 970 ms returned []
Implicit Place search using SMT with State Equation took 1378 ms to find 0 implicit places.
[2023-03-08 08:01:19] [INFO ] Invariant cache hit.
[2023-03-08 08:01:20] [INFO ] Dead Transitions using invariants and state equation in 687 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2080 ms. Remains : 498/498 places, 833/833 transitions.
Computed a total of 0 stabilizing places and 49 stable transitions
Computed a total of 0 stabilizing places and 49 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 97 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 20 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=10 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 112 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 21302 reset in 717 ms.
Stack based approach found an accepted trace after 47185 steps with 9977 reset with depth 26 and stack size 26 in 360 ms.
FORMULA CSRepetitions-PT-07-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-07-LTLFireability-14 finished in 8441 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&&(G(p1) U p2)))))'
Support contains 3 out of 498 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 402 transition count 785
Discarding 329 places :
Symmetric choice reduction at 0 with 329 rule applications. Total rules 473 place count 73 transition count 456
Iterating global reduction 0 with 329 rules applied. Total rules applied 802 place count 73 transition count 456
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 840 place count 35 transition count 152
Iterating global reduction 0 with 38 rules applied. Total rules applied 878 place count 35 transition count 152
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 916 place count 35 transition count 114
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 930 place count 28 transition count 107
Applied a total of 930 rules in 45 ms. Remains 28 /498 variables (removed 470) and now considering 107/833 (removed 726) transitions.
[2023-03-08 08:01:22] [INFO ] Flow matrix only has 47 transitions (discarded 60 similar events)
// Phase 1: matrix 47 rows 28 cols
[2023-03-08 08:01:22] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-08 08:01:22] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-08 08:01:22] [INFO ] Flow matrix only has 47 transitions (discarded 60 similar events)
[2023-03-08 08:01:22] [INFO ] Invariant cache hit.
[2023-03-08 08:01:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 08:01:22] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2023-03-08 08:01:22] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 08:01:22] [INFO ] Flow matrix only has 47 transitions (discarded 60 similar events)
[2023-03-08 08:01:22] [INFO ] Invariant cache hit.
[2023-03-08 08:01:22] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/498 places, 107/833 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 314 ms. Remains : 28/498 places, 107/833 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : CSRepetitions-PT-07-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p2) p1)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s7 1), p2:(GEQ s26 1), p1:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 229 steps with 11 reset in 2 ms.
FORMULA CSRepetitions-PT-07-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-07-LTLFireability-15 finished in 558 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 X(p1)))))'
Found a Lengthening insensitive property : CSRepetitions-PT-07-LTLFireability-00
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 56 out of 498 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 498/498 places, 833/833 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 0 with 147 rules applied. Total rules applied 147 place count 400 transition count 784
Discarding 336 places :
Symmetric choice reduction at 0 with 336 rule applications. Total rules 483 place count 64 transition count 448
Iterating global reduction 0 with 336 rules applied. Total rules applied 819 place count 64 transition count 448
Applied a total of 819 rules in 36 ms. Remains 64 /498 variables (removed 434) and now considering 448/833 (removed 385) transitions.
// Phase 1: matrix 448 rows 64 cols
[2023-03-08 08:01:23] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-08 08:01:23] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-08 08:01:23] [INFO ] Invariant cache hit.
[2023-03-08 08:01:23] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2023-03-08 08:01:23] [INFO ] Invariant cache hit.
[2023-03-08 08:01:23] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 64/498 places, 448/833 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 485 ms. Remains : 64/498 places, 448/833 transitions.
Running random walk in product with property : CSRepetitions-PT-07-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s25 1) (GEQ s46 1) (GEQ s16 1) (GEQ s26 1) (GEQ s48 1) (GEQ s18 1) (GEQ s50 1) (GEQ s39 1) (GEQ s19 1) (GEQ s20 1) (GEQ s28 1) (GEQ s8 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 32935 reset in 945 ms.
Stack based approach found an accepted trace after 81414 steps with 26817 reset with depth 5 and stack size 5 in 698 ms.
Treatment of property CSRepetitions-PT-07-LTLFireability-00 finished in 2363 ms.
FORMULA CSRepetitions-PT-07-LTLFireability-00 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-08 08:01:25] [INFO ] Flatten gal took : 61 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 92372 ms.
ITS solved all properties within timeout

BK_STOP 1678262486271

--------------------
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 LTLFireability -timeout 360 -rebuildPNML

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="CSRepetitions-PT-07"
export BK_EXAMINATION="LTLFireability"
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 CSRepetitions-PT-07, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r073-smll-167814399100084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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