Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r073-smll-167814399000003.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is CSRepetitions-COL-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r073-smll-167814399000003
=====================================================================

--------------------
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 1678218673544

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CSRepetitions-COL-02
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-07 19:51:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-07 19:51:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 19:51:17] [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:18] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-07 19:51:18] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 960 ms
[2023-03-07 19:51:18] [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 27 ms.
Working with output stream class java.io.PrintStream
[2023-03-07 19:51:18] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 15 arcs in 7 ms.
[2023-03-07 19:51:18] [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 468 resets, run finished after 354 ms. (steps per millisecond=28 ) properties (out of 21) seen :19
Incomplete Best-First random walk after 10001 steps, including 186 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 5 rows 6 cols
[2023-03-07 19:51:19] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-07 19:51:19] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-07 19:51:19] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-07 19:51:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-07 19:51:19] [INFO ] After 50ms 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 0 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:20] [INFO ] Flatten gal took : 18 ms
[2023-03-07 19:51:20] [INFO ] Flatten gal took : 3 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:20] [INFO ] Unfolded HLPN to a Petri net with 18 places and 20 transitions 60 arcs in 9 ms.
[2023-03-07 19:51:20] [INFO ] Unfolded 12 HLPN properties in 1 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 8 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:20] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-07 19:51:20] [INFO ] Implicit Places using invariants in 37 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 53 ms returned []
Implicit Place search using SMT with State Equation took 92 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 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 163 ms. Remains : 18/18 places, 20/20 transitions.
Support contains 14 out of 18 places after structural reductions.
[2023-03-07 19:51:20] [INFO ] Flatten gal took : 15 ms
[2023-03-07 19:51:20] [INFO ] Flatten gal took : 6 ms
[2023-03-07 19:51:20] [INFO ] Input system was already deterministic with 20 transitions.
Incomplete random walk after 10000 steps, including 572 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 20) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-07 19:51:20] [INFO ] Invariant cache hit.
[2023-03-07 19:51:20] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 19:51:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 9 ms returned sat
[2023-03-07 19:51:20] [INFO ] After 76ms 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 7 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 42 ms returned []
[2023-03-07 19:51:20] [INFO ] Invariant cache hit.
[2023-03-07 19:51:21] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 19:51:21] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-03-07 19:51:21] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-07 19:51:21] [INFO ] Invariant cache hit.
[2023-03-07 19:51:21] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 165 ms. Remains : 18/18 places, 20/20 transitions.
Stuttering acceptance computed with spot in 356 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 6208 reset in 490 ms.
Stack based approach found an accepted trace after 27 steps with 1 reset with depth 11 and stack size 11 in 1 ms.
FORMULA CSRepetitions-COL-02-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-02-LTLCardinality-00 finished in 1094 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 2 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-07 19:51:21] [INFO ] Invariant cache hit.
[2023-03-07 19:51:22] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-07 19:51:22] [INFO ] Invariant cache hit.
[2023-03-07 19:51:22] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 19:51:22] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2023-03-07 19:51:22] [INFO ] Invariant cache hit.
[2023-03-07 19:51:22] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 175 ms. Remains : 18/18 places, 20/20 transitions.
Stuttering acceptance computed with spot in 298 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 30 steps with 3 reset in 1 ms.
FORMULA CSRepetitions-COL-02-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-02-LTLCardinality-01 finished in 505 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:22] [INFO ] Invariant cache hit.
[2023-03-07 19:51:22] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-07 19:51:22] [INFO ] Invariant cache hit.
[2023-03-07 19:51:22] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 19:51:22] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2023-03-07 19:51:22] [INFO ] Invariant cache hit.
[2023-03-07 19:51:22] [INFO ] Dead Transitions using invariants and state equation in 52 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 208 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 9994 reset in 279 ms.
Stack based approach found an accepted trace after 580 steps with 60 reset with depth 10 and stack size 10 in 3 ms.
FORMULA CSRepetitions-COL-02-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-02-LTLCardinality-03 finished in 692 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:23] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-07 19:51:23] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-07 19:51:23] [INFO ] Invariant cache hit.
[2023-03-07 19:51:23] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2023-03-07 19:51:23] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-07 19:51:23] [INFO ] Invariant cache hit.
[2023-03-07 19:51:23] [INFO ] Dead Transitions using invariants and state equation in 45 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 153 ms. Remains : 10/18 places, 16/20 transitions.
Stuttering acceptance computed with spot in 105 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 11556 reset in 245 ms.
Stack based approach found an accepted trace after 1853 steps with 215 reset with depth 8 and stack size 8 in 8 ms.
FORMULA CSRepetitions-COL-02-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-02-LTLCardinality-05 finished in 531 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 3 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:23] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-07 19:51:23] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-07 19:51:23] [INFO ] Invariant cache hit.
[2023-03-07 19:51:23] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 19:51:23] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[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:23] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 156 ms. Remains : 18/18 places, 20/20 transitions.
Stuttering acceptance computed with spot in 39 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 6225 reset in 343 ms.
Stack based approach found an accepted trace after 42 steps with 3 reset with depth 4 and stack size 4 in 0 ms.
FORMULA CSRepetitions-COL-02-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-02-LTLCardinality-07 finished in 567 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:24] [INFO ] Invariant cache hit.
[2023-03-07 19:51:24] [INFO ] Implicit Places using invariants in 49 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 42 ms returned []
Implicit Place search using SMT with State Equation took 97 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 51 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 209 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 192 ms.
Product exploration explored 100000 steps with 50000 reset in 136 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 (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 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))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2)))))]
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 341 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 1055 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 3 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:25] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-07 19:51:25] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-07 19:51:25] [INFO ] Invariant cache hit.
[2023-03-07 19:51:25] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-07 19:51:25] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-07 19:51:25] [INFO ] Invariant cache hit.
[2023-03-07 19:51:25] [INFO ] Dead Transitions using invariants and state equation in 31 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 97 ms. Remains : 10/18 places, 16/20 transitions.
Stuttering acceptance computed with spot in 38 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 29323 reset in 76 ms.
Stack based approach found an accepted trace after 119 steps with 36 reset with depth 3 and stack size 3 in 0 ms.
FORMULA CSRepetitions-COL-02-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-02-LTLCardinality-11 finished in 226 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:25] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-07 19:51:25] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-07 19:51:25] [INFO ] Invariant cache hit.
[2023-03-07 19:51:25] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 19:51:25] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-03-07 19:51:25] [INFO ] Invariant cache hit.
[2023-03-07 19:51:25] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135 ms. Remains : 18/18 places, 20/20 transitions.
Stuttering acceptance computed with spot in 303 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 18 steps with 1 reset in 0 ms.
FORMULA CSRepetitions-COL-02-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-02-LTLCardinality-12 finished in 456 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:26] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-07 19:51:26] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-07 19:51:26] [INFO ] Invariant cache hit.
[2023-03-07 19:51:26] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-07 19:51:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-07 19:51:26] [INFO ] Invariant cache hit.
[2023-03-07 19:51:26] [INFO ] Dead Transitions using invariants and state equation in 51 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 142 ms. Remains : 10/18 places, 16/20 transitions.
Stuttering acceptance computed with spot in 109 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 16 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 275 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:26] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-07 19:51:26] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-07 19:51:26] [INFO ] Invariant cache hit.
[2023-03-07 19:51:26] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 19:51:26] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2023-03-07 19:51:26] [INFO ] Invariant cache hit.
[2023-03-07 19:51:26] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 143 ms. Remains : 18/18 places, 20/20 transitions.
Stuttering acceptance computed with spot in 234 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 17026 reset in 237 ms.
Product exploration explored 100000 steps with 17169 reset in 250 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 (AND p0 p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 464 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 168 ms :[true, false, false, (NOT p0)]
Incomplete random walk after 10000 steps, including 573 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 139 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-07 19:51:27] [INFO ] Invariant cache hit.
[2023-03-07 19:51:27] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 19:51:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-07 19:51:27] [INFO ] After 40ms 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 (AND p0 p1))), (X (X p0)), (G (NOT (AND (NOT p1) p0)))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (NOT p0))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p1) p0)))
Knowledge based reduction with 8 factoid took 358 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 2075 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 0 ms. Remains 18 /18 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-07 19:51:28] [INFO ] Invariant cache hit.
[2023-03-07 19:51:28] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-07 19:51:28] [INFO ] Invariant cache hit.
[2023-03-07 19:51:28] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 19:51:28] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-03-07 19:51:28] [INFO ] Invariant cache hit.
[2023-03-07 19:51:28] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 132 ms. Remains : 18/18 places, 20/20 transitions.
Stuttering acceptance computed with spot in 625 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 24880 reset in 400 ms.
Product exploration explored 100000 steps with 24898 reset in 307 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 (AND (NOT p1) p0)), (X (OR 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 322 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 278 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 3 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (AND (NOT p1) p0)), (X (OR 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 414 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 420 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 420 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:31] [INFO ] Invariant cache hit.
[2023-03-07 19:51:31] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-07 19:51:31] [INFO ] Invariant cache hit.
[2023-03-07 19:51:31] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 19:51:31] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2023-03-07 19:51:31] [INFO ] Invariant cache hit.
[2023-03-07 19:51:31] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 136 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 179 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 487 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 2 ms. (steps per millisecond=1 )
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 256 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 408 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 395 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 404 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 24758 reset in 163 ms.
Product exploration explored 100000 steps with 24767 reset in 180 ms.
Applying partial POR strategy [false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 401 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:35] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-07 19:51:35] [INFO ] Invariant cache hit.
[2023-03-07 19:51:35] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64 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:35] [INFO ] Invariant cache hit.
[2023-03-07 19:51:35] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-07 19:51:35] [INFO ] Invariant cache hit.
[2023-03-07 19:51:35] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-07 19:51:35] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-03-07 19:51:35] [INFO ] Invariant cache hit.
[2023-03-07 19:51:35] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 137 ms. Remains : 18/18 places, 20/20 transitions.
Treatment of property CSRepetitions-COL-02-LTLCardinality-15 finished in 6993 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:35] [INFO ] Flatten gal took : 6 ms
[2023-03-07 19:51:35] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2023-03-07 19:51:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 18 places, 20 transitions and 60 arcs took 0 ms.
Total runtime 18018 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1241/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CSRepetitions-COL-02-LTLCardinality-15

BK_STOP 1678218697131

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name CSRepetitions-COL-02-LTLCardinality-15
ltl formula formula --ltl=/tmp/1241/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 18 places, 20 transitions and 60 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1241/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1241/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1241/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1241/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 12 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2

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="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is CSRepetitions-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 r073-smll-167814399000003"
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 ;