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-167814397400003.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-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-smll-167814397400003
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 8.4K Feb 25 11:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 11:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 11:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 11:50 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.8K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 19K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 25 11:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 11:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 11:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 11:53 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 13K 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-02-LTLCardinality-00
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-01
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-02
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-03
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-04
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-05
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-06
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-07
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-08
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-09
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-10
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-11
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-12
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-13
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-14
FORMULA_NAME CSRepetitions-COL-02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678218661270

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-02
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-07 19:51:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-07 19:51:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 19:51:04] [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 19:51:05] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-07 19:51:05] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 764 ms
[2023-03-07 19:51:05] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 23 PT places and 28.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
[2023-03-07 19:51:05] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 15 arcs in 8 ms.
[2023-03-07 19:51:05] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 3 formulas.
FORMULA CSRepetitions-COL-02-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-02-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-02-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 1 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 1 stable transitions
Incomplete random walk after 10001 steps, including 485 resets, run finished after 382 ms. (steps per millisecond=26 ) properties (out of 21) seen :19
Incomplete Best-First random walk after 10001 steps, including 180 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 5 rows 6 cols
[2023-03-07 19:51:06] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-07 19:51:07] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-07 19:51:07] [INFO ] After 454ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-07 19:51:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-07 19:51:07] [INFO ] After 60ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA CSRepetitions-COL-02-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-07 19:51:07] [INFO ] Flatten gal took : 32 ms
[2023-03-07 19:51:07] [INFO ] Flatten gal took : 5 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 2
[2023-03-07 19:51:07] [INFO ] Unfolded HLPN to a Petri net with 18 places and 20 transitions 60 arcs in 14 ms.
[2023-03-07 19:51:07] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Support contains 14 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 12 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 18 cols
[2023-03-07 19:51:07] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-07 19:51:07] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-07 19:51:07] [INFO ] Invariant cache hit.
[2023-03-07 19:51:07] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 19:51:07] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2023-03-07 19:51:07] [INFO ] Invariant cache hit.
[2023-03-07 19:51:07] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 231 ms. Remains : 18/18 places, 20/20 transitions.
Support contains 14 out of 18 places after structural reductions.
[2023-03-07 19:51:07] [INFO ] Flatten gal took : 10 ms
[2023-03-07 19:51:07] [INFO ] Flatten gal took : 9 ms
[2023-03-07 19:51:07] [INFO ] Input system was already deterministic with 20 transitions.
Incomplete random walk after 10000 steps, including 592 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 20) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-07 19:51:08] [INFO ] Invariant cache hit.
[2023-03-07 19:51:08] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 19:51:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-07 19:51:08] [INFO ] After 105ms 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-02-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 0 stabilizing places and 4 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(G(p1)))))'
Support contains 6 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 10 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-07 19:51:08] [INFO ] Invariant cache hit.
[2023-03-07 19:51:08] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-07 19:51:08] [INFO ] Invariant cache hit.
[2023-03-07 19:51:08] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 19:51:08] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2023-03-07 19:51:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-07 19:51:08] [INFO ] Invariant cache hit.
[2023-03-07 19:51:08] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 214 ms. Remains : 18/18 places, 20/20 transitions.
Stuttering acceptance computed with spot in 411 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-02-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 1 (ADD s1 s2 s3 s4)), p1:(LEQ s0 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 6233 reset in 572 ms.
Stack based approach found an accepted trace after 53 steps with 3 reset with depth 7 and stack size 7 in 1 ms.
FORMULA CSRepetitions-COL-02-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-02-LTLCardinality-00 finished in 1317 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(p1))&&p0))))'
Support contains 9 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-07 19:51:10] [INFO ] Invariant cache hit.
[2023-03-07 19:51:10] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-07 19:51:10] [INFO ] Invariant cache hit.
[2023-03-07 19:51:10] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 19:51:10] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2023-03-07 19:51:10] [INFO ] Invariant cache hit.
[2023-03-07 19:51:10] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 181 ms. Remains : 18/18 places, 20/20 transitions.
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-02-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (LEQ 1 (ADD s14 s15 s16 s17)) (OR (GT s9 (ADD s1 s2 s3 s4)) (LEQ (ADD s14 s15 s16 s17) (ADD s1 s2 s3 s4)))), p1:(LEQ (ADD s14 s15 s16 s17) (ADD s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 80 steps with 6 reset in 1 ms.
FORMULA CSRepetitions-COL-02-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-02-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' '!(G((F(p0)&&F(G((!p0||X(p1)))))))'
Support contains 5 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-07 19:51:10] [INFO ] Invariant cache hit.
[2023-03-07 19:51:10] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-07 19:51:10] [INFO ] Invariant cache hit.
[2023-03-07 19:51:10] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 19:51:10] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2023-03-07 19:51:10] [INFO ] Invariant cache hit.
[2023-03-07 19:51:10] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 206 ms. Remains : 18/18 places, 20/20 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : CSRepetitions-COL-02-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT 1 (ADD s10 s11 s12 s13)), p1:(GT s9 (ADD s10 s11 s12 s13))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 9966 reset in 314 ms.
Stack based approach found an accepted trace after 96 steps with 8 reset with depth 5 and stack size 5 in 1 ms.
FORMULA CSRepetitions-COL-02-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-02-LTLCardinality-03 finished in 771 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 5 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 10 transition count 16
Applied a total of 12 rules in 9 ms. Remains 10 /18 variables (removed 8) and now considering 16/20 (removed 4) transitions.
// Phase 1: matrix 16 rows 10 cols
[2023-03-07 19:51:11] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-07 19:51:11] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-07 19:51:11] [INFO ] Invariant cache hit.
[2023-03-07 19:51:11] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2023-03-07 19:51:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-07 19:51:11] [INFO ] Invariant cache hit.
[2023-03-07 19:51:11] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/18 places, 16/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 174 ms. Remains : 10/18 places, 16/20 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-02-LTLCardinality-05 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:(LEQ (ADD s6 s7 s8 s9) s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 11441 reset in 267 ms.
Stack based approach found an accepted trace after 169 steps with 19 reset with depth 8 and stack size 8 in 1 ms.
FORMULA CSRepetitions-COL-02-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-02-LTLCardinality-05 finished in 572 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 9 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 18 cols
[2023-03-07 19:51:11] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-07 19:51:11] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-07 19:51:11] [INFO ] Invariant cache hit.
[2023-03-07 19:51:12] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 19:51:12] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2023-03-07 19:51:12] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-07 19:51:12] [INFO ] Invariant cache hit.
[2023-03-07 19:51:12] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 203 ms. Remains : 18/18 places, 20/20 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-COL-02-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LEQ (ADD s10 s11 s12 s13) (ADD s1 s2 s3 s4)) (OR (GT (ADD s10 s11 s12 s13) (ADD s1 s2 s3 s4)) (GT 3 s0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 6263 reset in 327 ms.
Stack based approach found an accepted trace after 157 steps with 10 reset with depth 8 and stack size 8 in 1 ms.
FORMULA CSRepetitions-COL-02-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-02-LTLCardinality-07 finished in 596 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 U p1)&&(p0 U p2)))))'
Support contains 13 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-07 19:51:12] [INFO ] Invariant cache hit.
[2023-03-07 19:51:12] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-07 19:51:12] [INFO ] Invariant cache hit.
[2023-03-07 19:51:12] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 19:51:12] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-03-07 19:51:12] [INFO ] Invariant cache hit.
[2023-03-07 19:51:12] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 18/18 places, 20/20 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (NOT p1), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : CSRepetitions-COL-02-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s9 (ADD s1 s2 s3 s4)), p2:(GT (ADD s10 s11 s12 s13) (ADD s14 s15 s16 s17)), p1:(LEQ 1 s9)], 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 264 ms.
Product exploration explored 100000 steps with 50000 reset in 237 ms.
Computed a total of 0 stabilizing places and 4 stable transitions
Computed a total of 0 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) p2 p1)
Knowledge based reduction with 11 factoid took 495 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-COL-02-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-02-LTLCardinality-10 finished in 1363 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 5 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 10 transition count 16
Applied a total of 12 rules in 4 ms. Remains 10 /18 variables (removed 8) and now considering 16/20 (removed 4) transitions.
// Phase 1: matrix 16 rows 10 cols
[2023-03-07 19:51:13] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-07 19:51:13] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-07 19:51:13] [INFO ] Invariant cache hit.
[2023-03-07 19:51:13] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2023-03-07 19:51:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-07 19:51:13] [INFO ] Invariant cache hit.
[2023-03-07 19:51:13] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/18 places, 16/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 140 ms. Remains : 10/18 places, 16/20 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-COL-02-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s0 (ADD s6 s7 s8 s9))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 29326 reset in 144 ms.
Stack based approach found an accepted trace after 197 steps with 59 reset with depth 3 and stack size 3 in 1 ms.
FORMULA CSRepetitions-COL-02-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-02-LTLCardinality-11 finished in 362 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0 U p1))))))'
Support contains 6 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 18 cols
[2023-03-07 19:51:14] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-07 19:51:14] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-07 19:51:14] [INFO ] Invariant cache hit.
[2023-03-07 19:51:14] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 19:51:14] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2023-03-07 19:51:14] [INFO ] Invariant cache hit.
[2023-03-07 19:51:14] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 170 ms. Remains : 18/18 places, 20/20 transitions.
Stuttering acceptance computed with spot in 323 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : CSRepetitions-COL-02-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(GT s0 (ADD s10 s11 s12 s13)), p0:(OR (LEQ s0 (ADD s10 s11 s12 s13)) (LEQ s9 (ADD s10 s11 s12 s13)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-02-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-02-LTLCardinality-12 finished in 522 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)||G(F(p1)))))'
Support contains 6 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 10 transition count 16
Applied a total of 12 rules in 4 ms. Remains 10 /18 variables (removed 8) and now considering 16/20 (removed 4) transitions.
// Phase 1: matrix 16 rows 10 cols
[2023-03-07 19:51:14] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-07 19:51:14] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-07 19:51:14] [INFO ] Invariant cache hit.
[2023-03-07 19:51:14] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-07 19:51:14] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-07 19:51:14] [INFO ] Invariant cache hit.
[2023-03-07 19:51:14] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/18 places, 16/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 137 ms. Remains : 10/18 places, 16/20 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-COL-02-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s5 (ADD s6 s7 s8 s9)), p1:(LEQ 2 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-02-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-02-LTLCardinality-13 finished in 268 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 U !p0))))'
Support contains 9 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 18 cols
[2023-03-07 19:51:15] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-07 19:51:15] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-07 19:51:15] [INFO ] Invariant cache hit.
[2023-03-07 19:51:15] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 19:51:15] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2023-03-07 19:51:15] [INFO ] Invariant cache hit.
[2023-03-07 19:51:15] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 151 ms. Remains : 18/18 places, 20/20 transitions.
Stuttering acceptance computed with spot in 233 ms :[true, p0, false, false, (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-02-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=3, aps=[p0:(GT 3 (ADD s1 s2 s3 s4)), p1:(OR (LEQ (ADD s1 s2 s3 s4) (ADD s10 s11 s12 s13)) (LEQ 3 s0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 17012 reset in 247 ms.
Product exploration explored 100000 steps with 17053 reset in 264 ms.
Computed a total of 0 stabilizing places and 4 stable transitions
Computed a total of 0 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 393 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[true, false, false, (NOT p0)]
Incomplete random walk after 10000 steps, including 581 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 127 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-07 19:51:16] [INFO ] Invariant cache hit.
[2023-03-07 19:51:16] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 19:51:16] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-07 19:51:16] [INFO ] After 32ms 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.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT p0))]
Property proved to be true thanks to knowledge :(G (NOT (AND p0 (NOT p1))))
Knowledge based reduction with 8 factoid took 363 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-COL-02-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-02-LTLCardinality-14 finished in 2118 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1) U X((F(!p0)||X(!p2))))))'
Support contains 10 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-07 19:51:17] [INFO ] Invariant cache hit.
[2023-03-07 19:51:17] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-07 19:51:17] [INFO ] Invariant cache hit.
[2023-03-07 19:51:17] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 19:51:17] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-07 19:51:17] [INFO ] Invariant cache hit.
[2023-03-07 19:51:17] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129 ms. Remains : 18/18 places, 20/20 transitions.
Stuttering acceptance computed with spot in 608 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2), (AND p0 p2), (AND (NOT p1) p0 p2), (AND p0 p2), (AND p0 p2), (AND (NOT p1) p0 p2), (AND (NOT p1) p0 p2), p0, (AND (NOT p1) p0)]
Running random walk in product with property : CSRepetitions-COL-02-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(OR p1 p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 8}], [{ cond=(AND p0 p2), acceptance={} source=5 dest: 9}], [{ cond=(AND p0 p2), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) p0 p2), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p1) p0 p2), acceptance={} source=8 dest: 10}], [{ cond=p0, acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p1) p0), acceptance={} source=10 dest: 10}]], initial=0, aps=[p1:(LEQ s9 (ADD s14 s15 s16 s17)), p0:(LEQ (ADD s1 s2 s3 s4) s0), p2:(LEQ s9 (ADD s1 s2 s3 s4))], 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, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24874 reset in 313 ms.
Product exploration explored 100000 steps with 24880 reset in 303 ms.
Computed a total of 0 stabilizing places and 4 stable transitions
Computed a total of 0 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (OR p1 p0)), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 344 ms. Reduced automaton from 11 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 367 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2), (AND p0 p2), (AND p0 (NOT p1) p2), (AND p0 (NOT p1) p2), (AND p0 (NOT p1))]
Finished random walk after 23 steps, including 1 resets, run visited all 3 properties in 1 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (OR p1 p0)), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X p0))]
False Knowledge obtained : [(F (AND p2 p0)), (F (NOT (AND (NOT p1) p0))), (F (AND p2 (NOT p1) p0))]
Knowledge based reduction with 6 factoid took 492 ms. Reduced automaton from 7 states, 9 edges and 3 AP (stutter sensitive) to 7 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 533 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2), (AND p0 p2), (AND p0 (NOT p1) p2), (AND p0 (NOT p1) p2), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 407 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2), (AND p0 p2), (AND p0 (NOT p1) p2), (AND p0 (NOT p1) p2), (AND p0 (NOT p1))]
Support contains 10 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-07 19:51:20] [INFO ] Invariant cache hit.
[2023-03-07 19:51:20] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-07 19:51:20] [INFO ] Invariant cache hit.
[2023-03-07 19:51:20] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 19:51:20] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-07 19:51:20] [INFO ] Invariant cache hit.
[2023-03-07 19:51:20] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124 ms. Remains : 18/18 places, 20/20 transitions.
Computed a total of 0 stabilizing places and 4 stable transitions
Computed a total of 0 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 155 ms. Reduced automaton from 7 states, 9 edges and 3 AP (stutter sensitive) to 7 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 423 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2), (AND p0 p2), (AND p0 (NOT p1) p2), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 3 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), true]
False Knowledge obtained : [(F (AND p0 p2)), (F (NOT (AND p0 (NOT p1)))), (F (AND p0 p2 (NOT p1)))]
Knowledge based reduction with 2 factoid took 248 ms. Reduced automaton from 7 states, 9 edges and 3 AP (stutter sensitive) to 7 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 351 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2), (AND p0 p2), (AND p0 (NOT p1) p2), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 361 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2), (AND p0 p2), (AND p0 (NOT p1) p2), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 435 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2), (AND p0 p2), (AND p0 (NOT p1) p2), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 24765 reset in 407 ms.
Product exploration explored 100000 steps with 24764 reset in 239 ms.
Applying partial POR strategy [false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 302 ms :[(AND p0 p2), (AND p0 p2), (AND p0 p2), (AND p0 p2), (AND p0 (NOT p1) p2), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1))]
Support contains 10 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-07 19:51:23] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-07 19:51:23] [INFO ] Invariant cache hit.
[2023-03-07 19:51:24] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54 ms. Remains : 18/18 places, 20/20 transitions.
Support contains 10 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-07 19:51:24] [INFO ] Invariant cache hit.
[2023-03-07 19:51:24] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-07 19:51:24] [INFO ] Invariant cache hit.
[2023-03-07 19:51:24] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 19:51:24] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-07 19:51:24] [INFO ] Invariant cache hit.
[2023-03-07 19:51:24] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120 ms. Remains : 18/18 places, 20/20 transitions.
Treatment of property CSRepetitions-COL-02-LTLCardinality-15 finished in 7087 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1) U X((F(!p0)||X(!p2))))))'
[2023-03-07 19:51:24] [INFO ] Flatten gal took : 5 ms
[2023-03-07 19:51:24] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-07 19:51:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 18 places, 20 transitions and 60 arcs took 1 ms.
Total runtime 19586 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CSRepetitions-COL-02
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLCardinality

FORMULA CSRepetitions-COL-02-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678218685758

--------------------
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: LAUNCH task # 1 (type EXCL) for 0 CSRepetitions-COL-02-LTLCardinality-15
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for CSRepetitions-COL-02-LTLCardinality-15
lola: result : false
lola: markings : 57
lola: fired transitions : 66
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CSRepetitions-COL-02-LTLCardinality-15: LTL false LTL model checker


Time elapsed: 0 secs. Pages in use: 1

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-02"
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-02, 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-167814397400003"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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