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.r105-tall-167814481400620.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 DLCround-PT-03a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481400620
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.2K Feb 25 18:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 25 18:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 25 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Feb 25 18:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 18:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 18:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Feb 25 18:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 148K 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 DLCround-PT-03a-LTLFireability-00
FORMULA_NAME DLCround-PT-03a-LTLFireability-01
FORMULA_NAME DLCround-PT-03a-LTLFireability-02
FORMULA_NAME DLCround-PT-03a-LTLFireability-03
FORMULA_NAME DLCround-PT-03a-LTLFireability-04
FORMULA_NAME DLCround-PT-03a-LTLFireability-05
FORMULA_NAME DLCround-PT-03a-LTLFireability-06
FORMULA_NAME DLCround-PT-03a-LTLFireability-07
FORMULA_NAME DLCround-PT-03a-LTLFireability-08
FORMULA_NAME DLCround-PT-03a-LTLFireability-09
FORMULA_NAME DLCround-PT-03a-LTLFireability-10
FORMULA_NAME DLCround-PT-03a-LTLFireability-11
FORMULA_NAME DLCround-PT-03a-LTLFireability-12
FORMULA_NAME DLCround-PT-03a-LTLFireability-13
FORMULA_NAME DLCround-PT-03a-LTLFireability-14
FORMULA_NAME DLCround-PT-03a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678350710903

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=DLCround-PT-03a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-09 08:31:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 08:31:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 08:31:52] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2023-03-09 08:31:52] [INFO ] Transformed 113 places.
[2023-03-09 08:31:52] [INFO ] Transformed 617 transitions.
[2023-03-09 08:31:52] [INFO ] Found NUPN structural information;
[2023-03-09 08:31:52] [INFO ] Parsed PT model containing 113 places and 617 transitions and 2269 arcs in 150 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 72 transitions
Reduce redundant transitions removed 72 transitions.
FORMULA DLCround-PT-03a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03a-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 545/545 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 104 transition count 496
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 104 transition count 496
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 104 transition count 492
Drop transitions removed 165 transitions
Redundant transition composition rules discarded 165 transitions
Iterating global reduction 1 with 165 rules applied. Total rules applied 187 place count 104 transition count 327
Applied a total of 187 rules in 28 ms. Remains 104 /113 variables (removed 9) and now considering 327/545 (removed 218) transitions.
[2023-03-09 08:31:52] [INFO ] Flow matrix only has 93 transitions (discarded 234 similar events)
// Phase 1: matrix 93 rows 104 cols
[2023-03-09 08:31:52] [INFO ] Computed 52 place invariants in 9 ms
[2023-03-09 08:31:53] [INFO ] Implicit Places using invariants in 421 ms returned [60, 62, 63, 65, 66, 67, 68, 70, 71, 72, 74, 75, 76, 78, 80, 81, 82, 84, 88, 89, 90, 92, 95, 96, 100, 103]
Discarding 26 places :
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Implicit Place search using SMT only with invariants took 445 ms to find 26 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 78/113 places, 239/545 transitions.
Drop transitions removed 110 transitions
Redundant transition composition rules discarded 110 transitions
Iterating global reduction 0 with 110 rules applied. Total rules applied 110 place count 78 transition count 129
Applied a total of 110 rules in 3 ms. Remains 78 /78 variables (removed 0) and now considering 129/239 (removed 110) transitions.
[2023-03-09 08:31:53] [INFO ] Flow matrix only has 93 transitions (discarded 36 similar events)
// Phase 1: matrix 93 rows 78 cols
[2023-03-09 08:31:53] [INFO ] Computed 26 place invariants in 2 ms
[2023-03-09 08:31:53] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-09 08:31:53] [INFO ] Flow matrix only has 93 transitions (discarded 36 similar events)
[2023-03-09 08:31:53] [INFO ] Invariant cache hit.
[2023-03-09 08:31:53] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 08:31:53] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 78/113 places, 129/545 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 588 ms. Remains : 78/113 places, 129/545 transitions.
Support contains 40 out of 78 places after structural reductions.
[2023-03-09 08:31:53] [INFO ] Flatten gal took : 26 ms
[2023-03-09 08:31:53] [INFO ] Flatten gal took : 10 ms
[2023-03-09 08:31:53] [INFO ] Input system was already deterministic with 129 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 32) seen :31
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 08:31:53] [INFO ] Flow matrix only has 93 transitions (discarded 36 similar events)
[2023-03-09 08:31:53] [INFO ] Invariant cache hit.
[2023-03-09 08:31:53] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2023-03-09 08:31:53] [INFO ] After 57ms 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 1 ms.
FORMULA DLCround-PT-03a-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DLCround-PT-03a-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA DLCround-PT-03a-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 19 stabilizing places and 1 stable transitions
Graph (complete) has 164 edges and 78 vertex of which 64 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 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)||X(F(p1)))) U p0))'
Support contains 3 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 129/129 transitions.
Graph (trivial) has 115 edges and 78 vertex of which 52 / 78 are part of one of the 8 SCC in 3 ms
Free SCC test removed 44 places
Ensure Unique test removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Graph (complete) has 63 edges and 34 vertex of which 21 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 21 transition count 27
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 20 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 19 transition count 26
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 15 place count 10 transition count 14
Iterating global reduction 3 with 9 rules applied. Total rules applied 24 place count 10 transition count 14
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 25 place count 10 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 27 place count 9 transition count 12
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 29 place count 9 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 30 place count 8 transition count 10
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 31 place count 7 transition count 9
Iterating global reduction 5 with 1 rules applied. Total rules applied 32 place count 7 transition count 9
Applied a total of 32 rules in 15 ms. Remains 7 /78 variables (removed 71) and now considering 9/129 (removed 120) transitions.
[2023-03-09 08:31:54] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 7 cols
[2023-03-09 08:31:54] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-09 08:31:54] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-09 08:31:54] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
[2023-03-09 08:31:54] [INFO ] Invariant cache hit.
[2023-03-09 08:31:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:31:54] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2023-03-09 08:31:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 08:31:54] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
[2023-03-09 08:31:54] [INFO ] Invariant cache hit.
[2023-03-09 08:31:54] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/78 places, 9/129 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 90 ms. Remains : 7/78 places, 9/129 transitions.
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : DLCround-PT-03a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s4 1) (EQ s6 1)), p1:(NEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 3 ms.
FORMULA DLCround-PT-03a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-03a-LTLFireability-00 finished in 358 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 3 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 129/129 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 65 transition count 129
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 22 place count 56 transition count 111
Iterating global reduction 1 with 9 rules applied. Total rules applied 31 place count 56 transition count 111
Applied a total of 31 rules in 7 ms. Remains 56 /78 variables (removed 22) and now considering 111/129 (removed 18) transitions.
[2023-03-09 08:31:54] [INFO ] Flow matrix only has 87 transitions (discarded 24 similar events)
// Phase 1: matrix 87 rows 56 cols
[2023-03-09 08:31:54] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-09 08:31:54] [INFO ] Implicit Places using invariants in 39 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/78 places, 111/129 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49 ms. Remains : 55/78 places, 111/129 transitions.
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-03a-LTLFireability-01 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:(AND (EQ s37 1) (EQ s54 1)), p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-03a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-03a-LTLFireability-01 finished in 297 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)||(F(p2)&&p1)))))'
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 129/129 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 65 transition count 129
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 21 place count 57 transition count 113
Iterating global reduction 1 with 8 rules applied. Total rules applied 29 place count 57 transition count 113
Applied a total of 29 rules in 11 ms. Remains 57 /78 variables (removed 21) and now considering 113/129 (removed 16) transitions.
[2023-03-09 08:31:54] [INFO ] Flow matrix only has 87 transitions (discarded 26 similar events)
// Phase 1: matrix 87 rows 57 cols
[2023-03-09 08:31:54] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-09 08:31:54] [INFO ] Implicit Places using invariants in 31 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 56/78 places, 113/129 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 56 transition count 111
Applied a total of 2 rules in 2 ms. Remains 56 /56 variables (removed 0) and now considering 111/113 (removed 2) transitions.
[2023-03-09 08:31:54] [INFO ] Flow matrix only has 87 transitions (discarded 24 similar events)
// Phase 1: matrix 87 rows 56 cols
[2023-03-09 08:31:54] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-09 08:31:54] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-09 08:31:54] [INFO ] Flow matrix only has 87 transitions (discarded 24 similar events)
[2023-03-09 08:31:54] [INFO ] Invariant cache hit.
[2023-03-09 08:31:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:31:54] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 56/78 places, 111/129 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 130 ms. Remains : 56/78 places, 111/129 transitions.
Stuttering acceptance computed with spot in 232 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : DLCround-PT-03a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 2}]], initial=5, aps=[p2:(AND (EQ s44 1) (EQ s55 1)), p0:(AND (EQ s33 1) (EQ s54 1)), p1:(AND (EQ s33 1) (EQ s54 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, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-03a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-03a-LTLFireability-02 finished in 387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(p1)))'
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 129/129 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 65 transition count 129
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 21 place count 57 transition count 113
Iterating global reduction 1 with 8 rules applied. Total rules applied 29 place count 57 transition count 113
Applied a total of 29 rules in 5 ms. Remains 57 /78 variables (removed 21) and now considering 113/129 (removed 16) transitions.
[2023-03-09 08:31:55] [INFO ] Flow matrix only has 87 transitions (discarded 26 similar events)
// Phase 1: matrix 87 rows 57 cols
[2023-03-09 08:31:55] [INFO ] Computed 11 place invariants in 5 ms
[2023-03-09 08:31:55] [INFO ] Implicit Places using invariants in 32 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 56/78 places, 113/129 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 56 transition count 111
Applied a total of 2 rules in 2 ms. Remains 56 /56 variables (removed 0) and now considering 111/113 (removed 2) transitions.
[2023-03-09 08:31:55] [INFO ] Flow matrix only has 87 transitions (discarded 24 similar events)
// Phase 1: matrix 87 rows 56 cols
[2023-03-09 08:31:55] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-09 08:31:55] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-09 08:31:55] [INFO ] Flow matrix only has 87 transitions (discarded 24 similar events)
[2023-03-09 08:31:55] [INFO ] Invariant cache hit.
[2023-03-09 08:31:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:31:55] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 56/78 places, 111/129 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 111 ms. Remains : 56/78 places, 111/129 transitions.
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : DLCround-PT-03a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (EQ s45 0) (EQ s55 0)), p0:(AND (EQ s33 1) (EQ s54 1))], 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 326 ms.
Product exploration explored 100000 steps with 50000 reset in 228 ms.
Computed a total of 3 stabilizing places and 1 stable transitions
Graph (complete) has 120 edges and 56 vertex of which 54 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Computed a total of 3 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 6 factoid took 100 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-03a-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-03a-LTLFireability-03 finished in 922 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)&&X(X(G((p1||F((F(p3)&&p2)))))))))'
Support contains 8 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 129/129 transitions.
Graph (trivial) has 104 edges and 78 vertex of which 43 / 78 are part of one of the 6 SCC in 1 ms
Free SCC test removed 37 places
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Graph (complete) has 78 edges and 41 vertex of which 30 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 0 output transitions
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 30 transition count 39
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 26 transition count 38
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 11 place count 26 transition count 37
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 25 transition count 37
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 18 place count 20 transition count 30
Iterating global reduction 2 with 5 rules applied. Total rules applied 23 place count 20 transition count 30
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 19 transition count 29
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 19 transition count 25
Applied a total of 29 rules in 11 ms. Remains 19 /78 variables (removed 59) and now considering 25/129 (removed 104) transitions.
[2023-03-09 08:31:56] [INFO ] Flow matrix only has 16 transitions (discarded 9 similar events)
// Phase 1: matrix 16 rows 19 cols
[2023-03-09 08:31:56] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-09 08:31:56] [INFO ] Implicit Places using invariants in 21 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 21 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/78 places, 25/129 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 18 transition count 24
Applied a total of 1 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 24/25 (removed 1) transitions.
[2023-03-09 08:31:56] [INFO ] Flow matrix only has 16 transitions (discarded 8 similar events)
// Phase 1: matrix 16 rows 18 cols
[2023-03-09 08:31:56] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-09 08:31:56] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-09 08:31:56] [INFO ] Flow matrix only has 16 transitions (discarded 8 similar events)
[2023-03-09 08:31:56] [INFO ] Invariant cache hit.
[2023-03-09 08:31:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:31:56] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/78 places, 24/129 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 87 ms. Remains : 18/78 places, 24/129 transitions.
Stuttering acceptance computed with spot in 820 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : DLCround-PT-03a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={1} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={} source=3 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 8}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=3 dest: 9}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=3 dest: 10}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 7}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=4 dest: 9}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 14}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=4 dest: 16}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=5 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={1} source=5 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=5 dest: 8}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=5 dest: 9}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=5 dest: 10}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0, 1} source=6 dest: 6}, { cond=(AND p0 (NOT p3)), acceptance={1} source=6 dest: 9}, { cond=(AND p0 (NOT p3)), acceptance={0, 1} source=6 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=7 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={1} source=7 dest: 7}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=8 dest: 11}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=8 dest: 12}, { cond=(AND p0 (NOT p2)), acceptance={1} source=8 dest: 13}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=8 dest: 14}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=8 dest: 15}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=8 dest: 16}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0, 1} source=9 dest: 6}, { cond=(AND p0 (NOT p3)), acceptance={1} source=9 dest: 9}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0, 1} source=10 dest: 12}, { cond=(AND p0 (NOT p3)), acceptance={1} source=10 dest: 15}, { cond=(AND p0 (NOT p3)), acceptance={0, 1} source=10 dest: 16}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=11 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={} source=11 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=11 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=11 dest: 8}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=11 dest: 9}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=11 dest: 10}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=11 dest: 11}, { cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={} source=11 dest: 12}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=11 dest: 13}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=11 dest: 14}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={} source=11 dest: 15}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={} source=11 dest: 16}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0, 1} source=12 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={1} source=12 dest: 9}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0, 1} source=12 dest: 10}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={0} source=12 dest: 12}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=12 dest: 15}, { cond=(AND p0 p1 (NOT p3)), acceptance={0} source=12 dest: 16}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=13 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={} source=13 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=13 dest: 7}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=13 dest: 9}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=14 dest: 11}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=14 dest: 11}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=14 dest: 12}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=14 dest: 13}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=14 dest: 13}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=14 dest: 14}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=14 dest: 14}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=14 dest: 15}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=14 dest: 16}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0, 1} source=15 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={1} source=15 dest: 9}], [{ cond=(AND (NOT p0) p1 (NOT p3)), acceptance={0} source=16 dest: 12}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0, 1} source=16 dest: 12}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=16 dest: 15}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={1} source=16 dest: 15}, { cond=(AND p0 p1 (NOT p3)), acceptance={0} source=16 dest: 16}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0, 1} source=16 dest: 16}]], initial=0, aps=[p0:(AND (EQ s9 1) (EQ s17 1)), p1:(AND (EQ s7 1) (EQ s15 1)), p2:(AND (EQ s3 1) (EQ s14 1)), p3:(AND (EQ s12 1) (EQ s16 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-03a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-03a-LTLFireability-06 finished in 943 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U p1))'
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 129/129 transitions.
Graph (trivial) has 107 edges and 78 vertex of which 45 / 78 are part of one of the 8 SCC in 1 ms
Free SCC test removed 37 places
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Graph (complete) has 80 edges and 41 vertex of which 28 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.0 ms
Discarding 13 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 28 transition count 43
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 26 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 25 transition count 42
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 16 place count 17 transition count 31
Iterating global reduction 3 with 8 rules applied. Total rules applied 24 place count 17 transition count 31
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 26 place count 17 transition count 29
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 28 place count 16 transition count 28
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 32 place count 16 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 33 place count 15 transition count 24
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 34 place count 14 transition count 23
Iterating global reduction 5 with 1 rules applied. Total rules applied 35 place count 14 transition count 23
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 36 place count 14 transition count 23
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 37 place count 13 transition count 22
Iterating global reduction 5 with 1 rules applied. Total rules applied 38 place count 13 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 39 place count 13 transition count 21
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 40 place count 13 transition count 20
Applied a total of 40 rules in 7 ms. Remains 13 /78 variables (removed 65) and now considering 20/129 (removed 109) transitions.
[2023-03-09 08:31:56] [INFO ] Flow matrix only has 13 transitions (discarded 7 similar events)
// Phase 1: matrix 13 rows 13 cols
[2023-03-09 08:31:56] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-09 08:31:56] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-09 08:31:56] [INFO ] Flow matrix only has 13 transitions (discarded 7 similar events)
[2023-03-09 08:31:56] [INFO ] Invariant cache hit.
[2023-03-09 08:31:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:31:56] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-09 08:31:56] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 08:31:56] [INFO ] Flow matrix only has 13 transitions (discarded 7 similar events)
[2023-03-09 08:31:56] [INFO ] Invariant cache hit.
[2023-03-09 08:31:57] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/78 places, 20/129 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96 ms. Remains : 13/78 places, 20/129 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), p0]
Running random walk in product with property : DLCround-PT-03a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s9 1) (EQ s12 1)), p0:(AND (EQ s3 1) (EQ s11 1))], nbAcceptance=0, 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 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-03a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-03a-LTLFireability-07 finished in 215 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(G(p2))&&p1)))'
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 129/129 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 65 transition count 129
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 22 place count 56 transition count 111
Iterating global reduction 1 with 9 rules applied. Total rules applied 31 place count 56 transition count 111
Applied a total of 31 rules in 5 ms. Remains 56 /78 variables (removed 22) and now considering 111/129 (removed 18) transitions.
[2023-03-09 08:31:57] [INFO ] Flow matrix only has 86 transitions (discarded 25 similar events)
// Phase 1: matrix 86 rows 56 cols
[2023-03-09 08:31:57] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-09 08:31:57] [INFO ] Implicit Places using invariants in 26 ms returned [53]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/78 places, 111/129 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 55 transition count 109
Applied a total of 2 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 109/111 (removed 2) transitions.
[2023-03-09 08:31:57] [INFO ] Flow matrix only has 86 transitions (discarded 23 similar events)
// Phase 1: matrix 86 rows 55 cols
[2023-03-09 08:31:57] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-09 08:31:57] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-09 08:31:57] [INFO ] Flow matrix only has 86 transitions (discarded 23 similar events)
[2023-03-09 08:31:57] [INFO ] Invariant cache hit.
[2023-03-09 08:31:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:31:57] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 55/78 places, 109/129 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 100 ms. Remains : 55/78 places, 109/129 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : DLCround-PT-03a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(OR (AND p1 p0) (AND p0 p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s52 1) (EQ s54 1)), p0:(AND (EQ s52 1) (EQ s54 1)), p2:(AND (EQ s5 1) (EQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-03a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-03a-LTLFireability-09 finished in 247 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(p2)&&p1)||p0))&&F(p3)))'
Support contains 7 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 129/129 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 67 transition count 129
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 19 place count 59 transition count 113
Iterating global reduction 1 with 8 rules applied. Total rules applied 27 place count 59 transition count 113
Applied a total of 27 rules in 5 ms. Remains 59 /78 variables (removed 19) and now considering 113/129 (removed 16) transitions.
[2023-03-09 08:31:57] [INFO ] Flow matrix only has 88 transitions (discarded 25 similar events)
// Phase 1: matrix 88 rows 59 cols
[2023-03-09 08:31:57] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-09 08:31:57] [INFO ] Implicit Places using invariants in 31 ms returned [55]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 58/78 places, 113/129 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 113/113 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39 ms. Remains : 58/78 places, 113/129 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p3), true, (NOT p2)]
Running random walk in product with property : DLCround-PT-03a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(AND (EQ s36 1) (EQ s57 1)), p0:(OR (EQ s48 1) (AND (EQ s36 1) (EQ s57 1))), p1:(AND (EQ s33 1) (EQ s55 1)), p2:(OR (EQ s32 0) (EQ s56 0))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-03a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-03a-LTLFireability-10 finished in 229 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(p1)))))'
Support contains 5 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 129/129 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 66 transition count 129
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 20 place count 58 transition count 113
Iterating global reduction 1 with 8 rules applied. Total rules applied 28 place count 58 transition count 113
Applied a total of 28 rules in 6 ms. Remains 58 /78 variables (removed 20) and now considering 113/129 (removed 16) transitions.
[2023-03-09 08:31:57] [INFO ] Flow matrix only has 88 transitions (discarded 25 similar events)
// Phase 1: matrix 88 rows 58 cols
[2023-03-09 08:31:57] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-09 08:31:57] [INFO ] Implicit Places using invariants in 33 ms returned [55]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/78 places, 113/129 transitions.
Applied a total of 0 rules in 2 ms. Remains 57 /57 variables (removed 0) and now considering 113/113 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42 ms. Remains : 57/78 places, 113/129 transitions.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCround-PT-03a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s52 1) (EQ s56 1) (EQ s42 1) (EQ s55 1)), p1:(OR (AND (EQ s52 1) (EQ s56 1)) (EQ s31 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]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-03a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-03a-LTLFireability-11 finished in 163 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((G(!p0)||(!p0&&F(!p1))))))'
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 129/129 transitions.
Graph (trivial) has 107 edges and 78 vertex of which 45 / 78 are part of one of the 9 SCC in 2 ms
Free SCC test removed 36 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Graph (complete) has 84 edges and 42 vertex of which 30 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 30 transition count 46
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 27 transition count 46
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 16 place count 19 transition count 35
Iterating global reduction 2 with 8 rules applied. Total rules applied 24 place count 19 transition count 35
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 19 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 18 transition count 33
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 31 place count 18 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 32 place count 17 transition count 29
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 33 place count 16 transition count 28
Iterating global reduction 4 with 1 rules applied. Total rules applied 34 place count 16 transition count 28
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 35 place count 16 transition count 28
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 36 place count 15 transition count 27
Iterating global reduction 4 with 1 rules applied. Total rules applied 37 place count 15 transition count 27
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 38 place count 15 transition count 26
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 39 place count 15 transition count 25
Applied a total of 39 rules in 19 ms. Remains 15 /78 variables (removed 63) and now considering 25/129 (removed 104) transitions.
[2023-03-09 08:31:57] [INFO ] Flow matrix only has 15 transitions (discarded 10 similar events)
// Phase 1: matrix 15 rows 15 cols
[2023-03-09 08:31:57] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-09 08:31:57] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-09 08:31:57] [INFO ] Flow matrix only has 15 transitions (discarded 10 similar events)
[2023-03-09 08:31:57] [INFO ] Invariant cache hit.
[2023-03-09 08:31:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:31:57] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-09 08:31:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 08:31:57] [INFO ] Flow matrix only has 15 transitions (discarded 10 similar events)
[2023-03-09 08:31:57] [INFO ] Invariant cache hit.
[2023-03-09 08:31:57] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/78 places, 25/129 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 119 ms. Remains : 15/78 places, 25/129 transitions.
Stuttering acceptance computed with spot in 119 ms :[p0, (AND p1 p0), p0]
Running random walk in product with property : DLCround-PT-03a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s12 1) (EQ s14 1)), p0:(AND (EQ s6 1) (EQ s13 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 4 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-03a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-03a-LTLFireability-12 finished in 258 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((!(!F(G(p0)) U !p1)&&p2)))&&X(p0)))'
Support contains 3 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 129/129 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 65 transition count 129
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 23 place count 55 transition count 109
Iterating global reduction 1 with 10 rules applied. Total rules applied 33 place count 55 transition count 109
Applied a total of 33 rules in 9 ms. Remains 55 /78 variables (removed 23) and now considering 109/129 (removed 20) transitions.
[2023-03-09 08:31:58] [INFO ] Flow matrix only has 86 transitions (discarded 23 similar events)
// Phase 1: matrix 86 rows 55 cols
[2023-03-09 08:31:58] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-09 08:31:58] [INFO ] Implicit Places using invariants in 31 ms returned [53]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/78 places, 109/129 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42 ms. Remains : 54/78 places, 109/129 transitions.
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : DLCround-PT-03a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), acceptance={} source=1 dest: 3}, { cond=(AND p0 p2 p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0, 1} source=2 dest: 2}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={1} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 5}], [{ cond=(AND p0 p2 p1), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=5 dest: 4}, { cond=(OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), acceptance={1} source=5 dest: 5}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={0, 1} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s30 1), p2:(EQ s30 0), p1:(AND (EQ s35 1) (EQ s53 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-03a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-03a-LTLFireability-14 finished in 298 ms.
All properties solved by simple procedures.
Total runtime 5998 ms.
ITS solved all properties within timeout

BK_STOP 1678350719322

--------------------
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="DLCround-PT-03a"
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 DLCround-PT-03a, 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 r105-tall-167814481400620"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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