About the Execution of LoLa+red for CSRepetitions-COL-05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 958.340 | 59213.00 | 78676.00 | 647.10 | FFFFFT?FFTFFFFFT | normal |
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.r071-smll-167814397400027.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 lolaxred
Input is CSRepetitions-COL-05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-smll-167814397400027
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 8.6K Feb 25 11:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 11:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 11:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 11:56 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 4.2K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 12:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 25 12:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 136K Feb 25 12:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 15K 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-COL-05-LTLCardinality-00
FORMULA_NAME CSRepetitions-COL-05-LTLCardinality-01
FORMULA_NAME CSRepetitions-COL-05-LTLCardinality-02
FORMULA_NAME CSRepetitions-COL-05-LTLCardinality-03
FORMULA_NAME CSRepetitions-COL-05-LTLCardinality-04
FORMULA_NAME CSRepetitions-COL-05-LTLCardinality-05
FORMULA_NAME CSRepetitions-COL-05-LTLCardinality-06
FORMULA_NAME CSRepetitions-COL-05-LTLCardinality-07
FORMULA_NAME CSRepetitions-COL-05-LTLCardinality-08
FORMULA_NAME CSRepetitions-COL-05-LTLCardinality-09
FORMULA_NAME CSRepetitions-COL-05-LTLCardinality-10
FORMULA_NAME CSRepetitions-COL-05-LTLCardinality-11
FORMULA_NAME CSRepetitions-COL-05-LTLCardinality-12
FORMULA_NAME CSRepetitions-COL-05-LTLCardinality-13
FORMULA_NAME CSRepetitions-COL-05-LTLCardinality-14
FORMULA_NAME CSRepetitions-COL-05-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678223006821
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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CSRepetitions-COL-05
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-07 21:03:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-07 21:03:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 21:03:30] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-07 21:03:30] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-07 21:03:30] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 735 ms
[2023-03-07 21:03:30] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 206 PT places and 325.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
[2023-03-07 21:03:31] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 15 arcs in 9 ms.
[2023-03-07 21:03:31] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 1 formulas.
FORMULA CSRepetitions-COL-05-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 1 stable transitions
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 1 stable transitions
Incomplete random walk after 10000 steps, including 172 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 26) seen :25
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 6 cols
[2023-03-07 21:03:31] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-07 21:03:31] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 21:03:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-07 21:03:31] [INFO ] After 68ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2023-03-07 21:03:31] [INFO ] Flatten gal took : 27 ms
[2023-03-07 21:03:31] [INFO ] Flatten gal took : 4 ms
Transition Send_Answer forces synchronizations/join behavior on parameter c of sort Client
Symmetric sort wr.t. initial and guards and successors and join/free detected :Server
Symmetric sort wr.t. initial detected :Server
Symmetric sort wr.t. initial and guards detected :Server
Applying symmetric unfolding of full symmetric sort :Server domain size was 5
[2023-03-07 21:03:31] [INFO ] Unfolded HLPN to a Petri net with 102 places and 125 transitions 375 arcs in 25 ms.
[2023-03-07 21:03:31] [INFO ] Unfolded 15 HLPN properties in 1 ms.
Support contains 77 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 16 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2023-03-07 21:03:31] [INFO ] Computed 26 place invariants in 9 ms
[2023-03-07 21:03:32] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-07 21:03:32] [INFO ] Invariant cache hit.
[2023-03-07 21:03:32] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:03:32] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2023-03-07 21:03:32] [INFO ] Invariant cache hit.
[2023-03-07 21:03:32] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 587 ms. Remains : 102/102 places, 125/125 transitions.
Support contains 77 out of 102 places after structural reductions.
[2023-03-07 21:03:32] [INFO ] Flatten gal took : 31 ms
[2023-03-07 21:03:32] [INFO ] Flatten gal took : 28 ms
[2023-03-07 21:03:32] [INFO ] Input system was already deterministic with 125 transitions.
Incomplete random walk after 10000 steps, including 194 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 25) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-07 21:03:33] [INFO ] Invariant cache hit.
[2023-03-07 21:03:33] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 21:03:33] [INFO ] [Nat]Absence check using 26 positive place invariants in 9 ms returned sat
[2023-03-07 21:03:33] [INFO ] After 204ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA CSRepetitions-COL-05-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 0 stabilizing places and 25 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' '!(G(p0))'
Support contains 25 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 17 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-07 21:03:33] [INFO ] Invariant cache hit.
[2023-03-07 21:03:33] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-07 21:03:33] [INFO ] Invariant cache hit.
[2023-03-07 21:03:34] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:03:34] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2023-03-07 21:03:34] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-07 21:03:34] [INFO ] Invariant cache hit.
[2023-03-07 21:03:34] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 497 ms. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 280 ms :[true, (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-05-LTLCardinality-00 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}]], initial=1, aps=[p0:(GT 2 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA CSRepetitions-COL-05-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-05-LTLCardinality-00 finished in 840 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 26 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-07 21:03:34] [INFO ] Invariant cache hit.
[2023-03-07 21:03:34] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-07 21:03:34] [INFO ] Invariant cache hit.
[2023-03-07 21:03:34] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:03:34] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2023-03-07 21:03:34] [INFO ] Invariant cache hit.
[2023-03-07 21:03:34] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 393 ms. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-05-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25) s0)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-05-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-05-LTLCardinality-01 finished in 530 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U G((p1 U X(p2))))&&X(G(p3))))'
Support contains 27 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 7 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-07 21:03:35] [INFO ] Invariant cache hit.
[2023-03-07 21:03:35] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-07 21:03:35] [INFO ] Invariant cache hit.
[2023-03-07 21:03:35] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:03:35] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2023-03-07 21:03:35] [INFO ] Invariant cache hit.
[2023-03-07 21:03:35] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 391 ms. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 541 ms :[(OR (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), true, (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-05-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}, { cond=p1, acceptance={} source=0 dest: 5}], [{ cond=p3, acceptance={} source=1 dest: 1}, { cond=(NOT p3), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}, { cond=p1, acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(LEQ s0 s51), p0:(OR (LEQ s51 s0) (LEQ 1 (ADD s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101))),...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 1 reset in 1 ms.
FORMULA CSRepetitions-COL-05-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-05-LTLCardinality-02 finished in 964 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 26 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 0 with 75 rules applied. Total rules applied 75 place count 52 transition count 100
Applied a total of 75 rules in 27 ms. Remains 52 /102 variables (removed 50) and now considering 100/125 (removed 25) transitions.
// Phase 1: matrix 100 rows 52 cols
[2023-03-07 21:03:36] [INFO ] Computed 1 place invariants in 5 ms
[2023-03-07 21:03:36] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-07 21:03:36] [INFO ] Invariant cache hit.
[2023-03-07 21:03:36] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2023-03-07 21:03:36] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-07 21:03:36] [INFO ] Invariant cache hit.
[2023-03-07 21:03:36] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/102 places, 100/125 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 264 ms. Remains : 52/102 places, 100/125 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-05-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51) s26)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 79 steps with 4 reset in 3 ms.
FORMULA CSRepetitions-COL-05-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-05-LTLCardinality-03 finished in 384 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||(p1&&F(!p0)))))'
Support contains 76 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 8 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2023-03-07 21:03:36] [INFO ] Computed 26 place invariants in 8 ms
[2023-03-07 21:03:36] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-07 21:03:36] [INFO ] Invariant cache hit.
[2023-03-07 21:03:36] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:03:36] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2023-03-07 21:03:36] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-07 21:03:36] [INFO ] Invariant cache hit.
[2023-03-07 21:03:36] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 368 ms. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-05-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT (ADD s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101) s0), p1:(LEQ (ADD s1 s2 s3 s4 s5 s6 s7 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-COL-05-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-05-LTLCardinality-04 finished in 507 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((F(!p0)&&X((p1||X((p2 U p3)))))))'
Support contains 77 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-07 21:03:36] [INFO ] Invariant cache hit.
[2023-03-07 21:03:37] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-07 21:03:37] [INFO ] Invariant cache hit.
[2023-03-07 21:03:37] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:03:37] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2023-03-07 21:03:37] [INFO ] Invariant cache hit.
[2023-03-07 21:03:37] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 315 ms. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 299 ms :[(OR p0 (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), p0, (AND (NOT p1) (NOT p3)), (AND p0 (NOT p3))]
Running random walk in product with property : CSRepetitions-COL-05-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GT (ADD s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101) s51), p1:(LEQ s0 (ADD s52 s53 s54 s55 s...], 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]]
Product exploration explored 100000 steps with 50000 reset in 811 ms.
Product exploration explored 100000 steps with 50000 reset in 459 ms.
Computed a total of 0 stabilizing places and 25 stable transitions
Computed a total of 0 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p3) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3) p2)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 9 factoid took 171 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-COL-05-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-05-LTLCardinality-05 finished in 2086 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)))))'
Support contains 50 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-07 21:03:39] [INFO ] Invariant cache hit.
[2023-03-07 21:03:39] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-07 21:03:39] [INFO ] Invariant cache hit.
[2023-03-07 21:03:39] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:03:39] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2023-03-07 21:03:39] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-07 21:03:39] [INFO ] Invariant cache hit.
[2023-03-07 21:03:39] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 227 ms. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-COL-05-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 1 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25)), p0:(GT 3 (ADD s77 s78 s79 s80 s81 s82 s83 s84...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1794 reset in 726 ms.
Product exploration explored 100000 steps with 1795 reset in 467 ms.
Computed a total of 0 stabilizing places and 25 stable transitions
Computed a total of 0 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 300 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 198 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :1
Finished Best-First random walk after 392 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=130 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 292 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 50 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 7 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-07 21:03:41] [INFO ] Invariant cache hit.
[2023-03-07 21:03:41] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-07 21:03:41] [INFO ] Invariant cache hit.
[2023-03-07 21:03:41] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:03:41] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2023-03-07 21:03:41] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-07 21:03:41] [INFO ] Invariant cache hit.
[2023-03-07 21:03:41] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 372 ms. Remains : 102/102 places, 125/125 transitions.
Computed a total of 0 stabilizing places and 25 stable transitions
Computed a total of 0 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 265 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 205 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :1
Finished Best-First random walk after 813 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=203 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 283 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1806 reset in 578 ms.
Product exploration explored 100000 steps with 1796 reset in 797 ms.
Support contains 50 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-07 21:03:44] [INFO ] Invariant cache hit.
[2023-03-07 21:03:44] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-07 21:03:44] [INFO ] Invariant cache hit.
[2023-03-07 21:03:44] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:03:44] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2023-03-07 21:03:44] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-07 21:03:44] [INFO ] Invariant cache hit.
[2023-03-07 21:03:44] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 346 ms. Remains : 102/102 places, 125/125 transitions.
Treatment of property CSRepetitions-COL-05-LTLCardinality-06 finished in 5713 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(!p0)) U (!p1 U G(p2))))'
Support contains 27 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-07 21:03:44] [INFO ] Invariant cache hit.
[2023-03-07 21:03:44] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-07 21:03:44] [INFO ] Invariant cache hit.
[2023-03-07 21:03:44] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:03:45] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2023-03-07 21:03:45] [INFO ] Invariant cache hit.
[2023-03-07 21:03:45] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 347 ms. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 446 ms :[(NOT p2), p0, (AND p0 (NOT p2)), (AND p0 (NOT p2)), p0, true, (AND p0 (NOT p2)), (AND (NOT p2) p0), (NOT p2), (NOT p2)]
Running random walk in product with property : CSRepetitions-COL-05-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND p2 p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 6}, { cond=(AND p2 p1), acceptance={} source=2 dest: 7}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}, { cond=p2, acceptance={} source=3 dest: 7}], [{ cond=p0, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) p1 p0), acceptance={} source=6 dest: 5}, { cond=(AND p2 p1 p0), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 9}], [{ cond=(AND (NOT p2) p0), acceptance={} source=7 dest: 5}, { cond=(AND p2 p0), acceptance={} source=7 dest: 8}], [{ cond=(NOT p2), acceptance={} source=8 dest: 5}, { cond=p2, acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p2) p1), acceptance={} source=9 dest: 5}, { cond=(AND p2 p1), acceptance={} source=9 dest: 8}, { cond=(AND p2 (NOT p1)), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p2:(LEQ 3 (ADD s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76)), p1:(LEQ s0 s51), p0:(LEQ s51 s0)], 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][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 45 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-05-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-05-LTLCardinality-07 finished in 818 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(!p2) U !p1)))'
Support contains 51 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-07 21:03:45] [INFO ] Invariant cache hit.
[2023-03-07 21:03:45] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-07 21:03:45] [INFO ] Invariant cache hit.
[2023-03-07 21:03:45] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:03:45] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2023-03-07 21:03:45] [INFO ] Invariant cache hit.
[2023-03-07 21:03:45] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 291 ms. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND (NOT p1) p2)), (AND (NOT p1) p2), (NOT p1)]
Running random walk in product with property : CSRepetitions-COL-05-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 p2), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(AND (LEQ 2 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25)) (LEQ 3 (ADD s77 s78 s79 s80 s81 s82 s83 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 72 steps with 1 reset in 1 ms.
FORMULA CSRepetitions-COL-05-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-05-LTLCardinality-08 finished in 575 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 25 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 0 with 75 rules applied. Total rules applied 75 place count 52 transition count 100
Applied a total of 75 rules in 37 ms. Remains 52 /102 variables (removed 50) and now considering 100/125 (removed 25) transitions.
// Phase 1: matrix 100 rows 52 cols
[2023-03-07 21:03:46] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-07 21:03:46] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-07 21:03:46] [INFO ] Invariant cache hit.
[2023-03-07 21:03:46] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-07 21:03:46] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-07 21:03:46] [INFO ] Invariant cache hit.
[2023-03-07 21:03:46] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/102 places, 100/125 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 236 ms. Remains : 52/102 places, 100/125 transitions.
Stuttering acceptance computed with spot in 91 ms :[p0, p0]
Running random walk in product with property : CSRepetitions-COL-05-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 3 (ADD s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 30 steps with 1 reset in 1 ms.
FORMULA CSRepetitions-COL-05-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-05-LTLCardinality-10 finished in 347 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 p1) U G(!p0)))'
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 0 with 75 rules applied. Total rules applied 75 place count 52 transition count 100
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 99 place count 28 transition count 76
Iterating global reduction 0 with 24 rules applied. Total rules applied 123 place count 28 transition count 76
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 147 place count 4 transition count 28
Iterating global reduction 0 with 24 rules applied. Total rules applied 171 place count 4 transition count 28
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 195 place count 4 transition count 4
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 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 198 place count 2 transition count 3
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 199 place count 2 transition count 3
Applied a total of 199 rules in 25 ms. Remains 2 /102 variables (removed 100) and now considering 3/125 (removed 122) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-07 21:03:46] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-07 21:03:46] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-07 21:03:46] [INFO ] Invariant cache hit.
[2023-03-07 21:03:46] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-07 21:03:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-07 21:03:46] [INFO ] Invariant cache hit.
[2023-03-07 21:03:46] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/102 places, 3/125 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 100 ms. Remains : 2/102 places, 3/125 transitions.
Stuttering acceptance computed with spot in 60 ms :[p0, true]
Running random walk in product with property : CSRepetitions-COL-05-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 3 s0), p1:(LEQ 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-05-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-05-LTLCardinality-11 finished in 180 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 26 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 11 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2023-03-07 21:03:46] [INFO ] Computed 26 place invariants in 1 ms
[2023-03-07 21:03:46] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-07 21:03:46] [INFO ] Invariant cache hit.
[2023-03-07 21:03:46] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:03:47] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2023-03-07 21:03:47] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-07 21:03:47] [INFO ] Invariant cache hit.
[2023-03-07 21:03:47] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 436 ms. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-COL-05-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s51 (ADD s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 47 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-COL-05-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-05-LTLCardinality-12 finished in 497 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(((p1 U X(G(!p1)))||p0)))'
Support contains 52 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 10 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-07 21:03:47] [INFO ] Invariant cache hit.
[2023-03-07 21:03:47] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-07 21:03:47] [INFO ] Invariant cache hit.
[2023-03-07 21:03:47] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:03:47] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2023-03-07 21:03:47] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-07 21:03:47] [INFO ] Invariant cache hit.
[2023-03-07 21:03:47] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 368 ms. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, p1, (AND p1 (NOT p0)), p1]
Running random walk in product with property : CSRepetitions-COL-05-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(LEQ s51 (ADD s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101)), p0:(OR (LEQ s51 (ADD s52 s53 s54...], 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, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 36144 steps with 656 reset in 269 ms.
FORMULA CSRepetitions-COL-05-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-05-LTLCardinality-13 finished in 799 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)||(X(p1) U (X(G(p1))||(p2&&X(p1))))))'
Support contains 27 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-07 21:03:48] [INFO ] Invariant cache hit.
[2023-03-07 21:03:48] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-07 21:03:48] [INFO ] Invariant cache hit.
[2023-03-07 21:03:48] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:03:48] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2023-03-07 21:03:48] [INFO ] Invariant cache hit.
[2023-03-07 21:03:48] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 259 ms. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Running random walk in product with property : CSRepetitions-COL-05-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 s51), p1:(LEQ s0 s51), p2:(GT 3 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 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 50000 reset in 553 ms.
Product exploration explored 100000 steps with 50000 reset in 390 ms.
Computed a total of 0 stabilizing places and 25 stable transitions
Computed a total of 0 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 (NOT p1))))
Knowledge based reduction with 9 factoid took 148 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-COL-05-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-05-LTLCardinality-15 finished in 1488 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)))))'
[2023-03-07 21:03:49] [INFO ] Flatten gal took : 13 ms
[2023-03-07 21:03:49] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-07 21:03:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 102 places, 125 transitions and 375 arcs took 1 ms.
Total runtime 19772 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CSRepetitions-COL-05
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLCardinality
BK_STOP 1678223066034
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 1 (type EXCL) for 0 CSRepetitions-COL-05-LTLCardinality-06
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CSRepetitions-COL-05-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 7/32 CSRepetitions-COL-05-LTLCardinality-06 974856 m, 194971 m/sec, 2864493 t fired, .
Time elapsed: 5 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CSRepetitions-COL-05-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 13/32 CSRepetitions-COL-05-LTLCardinality-06 1956131 m, 196255 m/sec, 5958029 t fired, .
Time elapsed: 10 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CSRepetitions-COL-05-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3600 18/32 CSRepetitions-COL-05-LTLCardinality-06 2627012 m, 134176 m/sec, 8544000 t fired, .
Time elapsed: 15 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CSRepetitions-COL-05-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3600 22/32 CSRepetitions-COL-05-LTLCardinality-06 3278140 m, 130225 m/sec, 11100608 t fired, .
Time elapsed: 20 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CSRepetitions-COL-05-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3600 26/32 CSRepetitions-COL-05-LTLCardinality-06 3863808 m, 117133 m/sec, 13551560 t fired, .
Time elapsed: 25 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CSRepetitions-COL-05-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3600 29/32 CSRepetitions-COL-05-LTLCardinality-06 4434873 m, 114213 m/sec, 16015965 t fired, .
Time elapsed: 30 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for CSRepetitions-COL-05-LTLCardinality-06 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CSRepetitions-COL-05-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 35 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: Portfolio finished: no open tasks 1
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CSRepetitions-COL-05-LTLCardinality-06: LTL unknown AGGR
Time elapsed: 35 secs. Pages in use: 32
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-COL-05"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is CSRepetitions-COL-05, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r071-smll-167814397400027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-COL-05.tgz
mv CSRepetitions-COL-05 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;