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.r521-tall-167987246100019.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 Anderson-PT-06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246100019
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 14K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Mar 23 15:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 302K Mar 31 16:48 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 Anderson-PT-06-LTLCardinality-00
FORMULA_NAME Anderson-PT-06-LTLCardinality-01
FORMULA_NAME Anderson-PT-06-LTLCardinality-02
FORMULA_NAME Anderson-PT-06-LTLCardinality-03
FORMULA_NAME Anderson-PT-06-LTLCardinality-04
FORMULA_NAME Anderson-PT-06-LTLCardinality-05
FORMULA_NAME Anderson-PT-06-LTLCardinality-06
FORMULA_NAME Anderson-PT-06-LTLCardinality-07
FORMULA_NAME Anderson-PT-06-LTLCardinality-08
FORMULA_NAME Anderson-PT-06-LTLCardinality-09
FORMULA_NAME Anderson-PT-06-LTLCardinality-10
FORMULA_NAME Anderson-PT-06-LTLCardinality-11
FORMULA_NAME Anderson-PT-06-LTLCardinality-12
FORMULA_NAME Anderson-PT-06-LTLCardinality-13
FORMULA_NAME Anderson-PT-06-LTLCardinality-14
FORMULA_NAME Anderson-PT-06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680856379204

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=Anderson-PT-06
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 08:33:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 08:33:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 08:33:05] [INFO ] Load time of PNML (sax parser for PT used): 278 ms
[2023-04-07 08:33:05] [INFO ] Transformed 229 places.
[2023-04-07 08:33:05] [INFO ] Transformed 600 transitions.
[2023-04-07 08:33:05] [INFO ] Found NUPN structural information;
[2023-04-07 08:33:05] [INFO ] Parsed PT model containing 229 places and 600 transitions and 2280 arcs in 761 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Anderson-PT-06-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-06-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-06-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-06-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-06-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-06-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-06-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-06-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 600/600 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 180 transition count 321
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 180 transition count 321
Applied a total of 98 rules in 149 ms. Remains 180 /229 variables (removed 49) and now considering 321/600 (removed 279) transitions.
// Phase 1: matrix 321 rows 180 cols
[2023-04-07 08:33:06] [INFO ] Computed 15 invariants in 56 ms
[2023-04-07 08:33:07] [INFO ] Implicit Places using invariants in 1018 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1056 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 179/229 places, 321/600 transitions.
Applied a total of 0 rules in 30 ms. Remains 179 /179 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1251 ms. Remains : 179/229 places, 321/600 transitions.
Support contains 19 out of 179 places after structural reductions.
[2023-04-07 08:33:07] [INFO ] Flatten gal took : 169 ms
[2023-04-07 08:33:07] [INFO ] Flatten gal took : 86 ms
[2023-04-07 08:33:08] [INFO ] Input system was already deterministic with 321 transitions.
Finished random walk after 3943 steps, including 1 resets, run visited all 12 properties in 269 ms. (steps per millisecond=14 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 321/321 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 170 transition count 252
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 170 transition count 252
Applied a total of 18 rules in 45 ms. Remains 170 /179 variables (removed 9) and now considering 252/321 (removed 69) transitions.
// Phase 1: matrix 252 rows 170 cols
[2023-04-07 08:33:08] [INFO ] Computed 14 invariants in 5 ms
[2023-04-07 08:33:09] [INFO ] Implicit Places using invariants in 574 ms returned []
[2023-04-07 08:33:09] [INFO ] Invariant cache hit.
[2023-04-07 08:33:09] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-04-07 08:33:10] [INFO ] Implicit Places using invariants and state equation in 636 ms returned []
Implicit Place search using SMT with State Equation took 1217 ms to find 0 implicit places.
[2023-04-07 08:33:10] [INFO ] Invariant cache hit.
[2023-04-07 08:33:10] [INFO ] Dead Transitions using invariants and state equation in 305 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 170/179 places, 252/321 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1577 ms. Remains : 170/179 places, 252/321 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 579 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-06-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s21 0) (EQ s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 410 ms.
Product exploration explored 100000 steps with 33333 reset in 405 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 151 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-06-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-06-LTLCardinality-00 finished in 3212 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 4 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 321/321 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 170 transition count 242
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 170 transition count 242
Applied a total of 18 rules in 24 ms. Remains 170 /179 variables (removed 9) and now considering 242/321 (removed 79) transitions.
// Phase 1: matrix 242 rows 170 cols
[2023-04-07 08:33:12] [INFO ] Computed 14 invariants in 4 ms
[2023-04-07 08:33:12] [INFO ] Implicit Places using invariants in 253 ms returned []
[2023-04-07 08:33:12] [INFO ] Invariant cache hit.
[2023-04-07 08:33:13] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-04-07 08:33:14] [INFO ] Implicit Places using invariants and state equation in 1840 ms returned []
Implicit Place search using SMT with State Equation took 2148 ms to find 0 implicit places.
[2023-04-07 08:33:14] [INFO ] Invariant cache hit.
[2023-04-07 08:33:21] [INFO ] Dead Transitions using invariants and state equation in 7382 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 170/179 places, 242/321 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9574 ms. Remains : 170/179 places, 242/321 transitions.
Stuttering acceptance computed with spot in 347 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-06-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (EQ s66 0) (EQ s116 1)), p0:(OR (EQ s45 0) (EQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 219 steps with 0 reset in 1 ms.
FORMULA Anderson-PT-06-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-06-LTLCardinality-01 finished in 9970 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(p1)&&p0))||G(p1)))'
Support contains 2 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 321/321 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 169 transition count 251
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 169 transition count 251
Applied a total of 20 rules in 4 ms. Remains 169 /179 variables (removed 10) and now considering 251/321 (removed 70) transitions.
// Phase 1: matrix 251 rows 169 cols
[2023-04-07 08:33:22] [INFO ] Computed 14 invariants in 18 ms
[2023-04-07 08:33:23] [INFO ] Implicit Places using invariants in 1307 ms returned []
[2023-04-07 08:33:23] [INFO ] Invariant cache hit.
[2023-04-07 08:33:23] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-04-07 08:33:23] [INFO ] Implicit Places using invariants and state equation in 615 ms returned []
Implicit Place search using SMT with State Equation took 1939 ms to find 0 implicit places.
[2023-04-07 08:33:23] [INFO ] Invariant cache hit.
[2023-04-07 08:33:24] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 169/179 places, 251/321 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2222 ms. Remains : 169/179 places, 251/321 transitions.
Stuttering acceptance computed with spot in 646 ms :[(NOT p1), (NOT p1), true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Anderson-PT-06-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=p1, acceptance={} source=4 dest: 1}, { cond=(NOT p1), acceptance={} source=4 dest: 3}], [{ cond=(NOT p1), acceptance={} source=5 dest: 2}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=4, aps=[p1:(OR (EQ s24 0) (EQ s138 1)), p0:(AND (EQ s138 0) (EQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7235 steps with 0 reset in 37 ms.
FORMULA Anderson-PT-06-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-06-LTLCardinality-02 finished in 2966 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 321/321 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 179 transition count 286
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 144 transition count 286
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 70 place count 144 transition count 256
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 130 place count 114 transition count 256
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 141 place count 103 transition count 175
Iterating global reduction 2 with 11 rules applied. Total rules applied 152 place count 103 transition count 175
Applied a total of 152 rules in 82 ms. Remains 103 /179 variables (removed 76) and now considering 175/321 (removed 146) transitions.
// Phase 1: matrix 175 rows 103 cols
[2023-04-07 08:33:25] [INFO ] Computed 14 invariants in 19 ms
[2023-04-07 08:33:25] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-04-07 08:33:25] [INFO ] Invariant cache hit.
[2023-04-07 08:33:25] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-04-07 08:33:25] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
[2023-04-07 08:33:25] [INFO ] Redundant transitions in 5 ms returned []
[2023-04-07 08:33:25] [INFO ] Invariant cache hit.
[2023-04-07 08:33:25] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/179 places, 175/321 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 959 ms. Remains : 103/179 places, 175/321 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-06-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s102 0) (EQ s64 1))], 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 318 reset in 165 ms.
Stack based approach found an accepted trace after 25 steps with 0 reset with depth 26 and stack size 26 in 1 ms.
FORMULA Anderson-PT-06-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-06-LTLCardinality-05 finished in 1237 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((!F(X(F(!(F(p1)||p0)))) U p2)))'
Support contains 4 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 321/321 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 171 transition count 263
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 171 transition count 263
Applied a total of 16 rules in 6 ms. Remains 171 /179 variables (removed 8) and now considering 263/321 (removed 58) transitions.
// Phase 1: matrix 263 rows 171 cols
[2023-04-07 08:33:26] [INFO ] Computed 14 invariants in 2 ms
[2023-04-07 08:33:26] [INFO ] Implicit Places using invariants in 194 ms returned []
[2023-04-07 08:33:26] [INFO ] Invariant cache hit.
[2023-04-07 08:33:26] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-04-07 08:33:30] [INFO ] Implicit Places using invariants and state equation in 3905 ms returned []
Implicit Place search using SMT with State Equation took 4151 ms to find 0 implicit places.
[2023-04-07 08:33:30] [INFO ] Invariant cache hit.
[2023-04-07 08:33:30] [INFO ] Dead Transitions using invariants and state equation in 319 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 171/179 places, 263/321 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4493 ms. Remains : 171/179 places, 263/321 transitions.
Stuttering acceptance computed with spot in 321 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Anderson-PT-06-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=p2, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(OR (EQ s25 0) (EQ s99 1)), p0:(OR (EQ s25 0) (EQ s99 1)), p1:(OR (EQ s48 0) (EQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 12 reset in 245 ms.
Product exploration explored 100000 steps with 15 reset in 453 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X (X p1)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 255 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 311 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0))]
Finished random walk after 2079 steps, including 0 resets, run visited all 3 properties in 30 ms. (steps per millisecond=69 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X (X p1)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 476 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 414 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 317 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 263/263 transitions.
Applied a total of 0 rules in 4 ms. Remains 171 /171 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2023-04-07 08:33:33] [INFO ] Invariant cache hit.
[2023-04-07 08:33:33] [INFO ] Implicit Places using invariants in 263 ms returned []
[2023-04-07 08:33:33] [INFO ] Invariant cache hit.
[2023-04-07 08:33:34] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-04-07 08:33:34] [INFO ] Implicit Places using invariants and state equation in 875 ms returned []
Implicit Place search using SMT with State Equation took 1146 ms to find 0 implicit places.
[2023-04-07 08:33:34] [INFO ] Invariant cache hit.
[2023-04-07 08:33:34] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1377 ms. Remains : 171/171 places, 263/263 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X (X p1)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 148 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 321 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0))]
Finished random walk after 429 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=214 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X (X p1)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 414 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 303 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 338 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 388 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 7 reset in 117 ms.
Product exploration explored 100000 steps with 6 reset in 116 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 447 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 263/263 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 171 transition count 263
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 29 Pre rules applied. Total rules applied 34 place count 171 transition count 263
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 63 place count 171 transition count 263
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 171 transition count 263
Deduced a syphon composed of 64 places in 0 ms
Applied a total of 64 rules in 67 ms. Remains 171 /171 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2023-04-07 08:33:37] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 263 rows 171 cols
[2023-04-07 08:33:37] [INFO ] Computed 14 invariants in 3 ms
[2023-04-07 08:33:38] [INFO ] Dead Transitions using invariants and state equation in 470 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 171/171 places, 263/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 606 ms. Remains : 171/171 places, 263/263 transitions.
Support contains 4 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 263/263 transitions.
Applied a total of 0 rules in 3 ms. Remains 171 /171 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 171 cols
[2023-04-07 08:33:38] [INFO ] Computed 14 invariants in 15 ms
[2023-04-07 08:33:42] [INFO ] Implicit Places using invariants in 4278 ms returned []
[2023-04-07 08:33:42] [INFO ] Invariant cache hit.
[2023-04-07 08:33:42] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-04-07 08:33:45] [INFO ] Implicit Places using invariants and state equation in 2551 ms returned []
Implicit Place search using SMT with State Equation took 6847 ms to find 0 implicit places.
[2023-04-07 08:33:45] [INFO ] Invariant cache hit.
[2023-04-07 08:33:45] [INFO ] Dead Transitions using invariants and state equation in 356 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7213 ms. Remains : 171/171 places, 263/263 transitions.
Treatment of property Anderson-PT-06-LTLCardinality-06 finished in 19687 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 321/321 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 170 transition count 262
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 170 transition count 262
Applied a total of 18 rules in 4 ms. Remains 170 /179 variables (removed 9) and now considering 262/321 (removed 59) transitions.
// Phase 1: matrix 262 rows 170 cols
[2023-04-07 08:33:45] [INFO ] Computed 14 invariants in 1 ms
[2023-04-07 08:33:47] [INFO ] Implicit Places using invariants in 1752 ms returned []
[2023-04-07 08:33:47] [INFO ] Invariant cache hit.
[2023-04-07 08:33:47] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-04-07 08:33:48] [INFO ] Implicit Places using invariants and state equation in 639 ms returned []
Implicit Place search using SMT with State Equation took 2443 ms to find 0 implicit places.
[2023-04-07 08:33:48] [INFO ] Invariant cache hit.
[2023-04-07 08:33:48] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 170/179 places, 262/321 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2699 ms. Remains : 170/179 places, 262/321 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-06-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s24 0) (EQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 189 ms.
Product exploration explored 100000 steps with 50000 reset in 212 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-06-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-06-LTLCardinality-07 finished in 3448 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 321/321 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 179 transition count 287
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 69 place count 145 transition count 286
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 144 transition count 286
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 70 place count 144 transition count 256
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 130 place count 114 transition count 256
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 140 place count 104 transition count 186
Iterating global reduction 3 with 10 rules applied. Total rules applied 150 place count 104 transition count 186
Applied a total of 150 rules in 19 ms. Remains 104 /179 variables (removed 75) and now considering 186/321 (removed 135) transitions.
// Phase 1: matrix 186 rows 104 cols
[2023-04-07 08:33:49] [INFO ] Computed 14 invariants in 1 ms
[2023-04-07 08:33:52] [INFO ] Implicit Places using invariants in 2926 ms returned []
[2023-04-07 08:33:52] [INFO ] Invariant cache hit.
[2023-04-07 08:33:52] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-04-07 08:33:53] [INFO ] Implicit Places using invariants and state equation in 1097 ms returned []
Implicit Place search using SMT with State Equation took 4027 ms to find 0 implicit places.
[2023-04-07 08:33:53] [INFO ] Redundant transitions in 2 ms returned []
[2023-04-07 08:33:53] [INFO ] Invariant cache hit.
[2023-04-07 08:33:53] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/179 places, 186/321 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4243 ms. Remains : 104/179 places, 186/321 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-06-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s70 0) (EQ s24 1))], 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 0 reset in 134 ms.
Stack based approach found an accepted trace after 915 steps with 0 reset with depth 916 and stack size 611 in 1 ms.
FORMULA Anderson-PT-06-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-06-LTLCardinality-09 finished in 4467 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 321/321 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 179 transition count 286
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 144 transition count 286
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 70 place count 144 transition count 256
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 130 place count 114 transition count 256
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 140 place count 104 transition count 186
Iterating global reduction 2 with 10 rules applied. Total rules applied 150 place count 104 transition count 186
Applied a total of 150 rules in 47 ms. Remains 104 /179 variables (removed 75) and now considering 186/321 (removed 135) transitions.
// Phase 1: matrix 186 rows 104 cols
[2023-04-07 08:33:53] [INFO ] Computed 14 invariants in 2 ms
[2023-04-07 08:33:54] [INFO ] Implicit Places using invariants in 200 ms returned []
[2023-04-07 08:33:54] [INFO ] Invariant cache hit.
[2023-04-07 08:33:54] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-04-07 08:33:54] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
[2023-04-07 08:33:54] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 08:33:54] [INFO ] Invariant cache hit.
[2023-04-07 08:33:59] [INFO ] Dead Transitions using invariants and state equation in 5403 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/179 places, 186/321 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5959 ms. Remains : 104/179 places, 186/321 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-06-LTLCardinality-12 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:(AND (EQ s30 0) (EQ s19 1))], 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 255 reset in 118 ms.
Stack based approach found an accepted trace after 71 steps with 0 reset with depth 72 and stack size 72 in 0 ms.
FORMULA Anderson-PT-06-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-06-LTLCardinality-12 finished in 6263 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((!F(X(F(!(F(p1)||p0)))) U p2)))'
Found a Lengthening insensitive property : Anderson-PT-06-LTLCardinality-06
Stuttering acceptance computed with spot in 268 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 179 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 179/179 places, 321/321 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 179 transition count 288
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 146 transition count 287
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 145 transition count 287
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 68 place count 145 transition count 258
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 126 place count 116 transition count 258
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 134 place count 108 transition count 200
Iterating global reduction 3 with 8 rules applied. Total rules applied 142 place count 108 transition count 200
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 144 place count 107 transition count 199
Applied a total of 144 rules in 18 ms. Remains 107 /179 variables (removed 72) and now considering 199/321 (removed 122) transitions.
// Phase 1: matrix 199 rows 107 cols
[2023-04-07 08:34:00] [INFO ] Computed 14 invariants in 2 ms
[2023-04-07 08:34:00] [INFO ] Implicit Places using invariants in 440 ms returned []
[2023-04-07 08:34:00] [INFO ] Invariant cache hit.
[2023-04-07 08:34:01] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-04-07 08:34:01] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 860 ms to find 0 implicit places.
[2023-04-07 08:34:01] [INFO ] Invariant cache hit.
[2023-04-07 08:34:01] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 107/179 places, 199/321 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1043 ms. Remains : 107/179 places, 199/321 transitions.
Running random walk in product with property : Anderson-PT-06-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=p2, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(OR (EQ s25 0) (EQ s69 1)), p0:(OR (EQ s25 0) (EQ s69 1)), p1:(OR (EQ s48 0) (EQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 29 reset in 163 ms.
Product exploration explored 100000 steps with 29 reset in 162 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X (X p1)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 236 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0))]
Finished random walk after 4326 steps, including 1 resets, run visited all 3 properties in 48 ms. (steps per millisecond=90 )
Parikh walk visited 0 properties in 1 ms.
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X (X p1)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 312 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 320 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 199/199 transitions.
Applied a total of 0 rules in 1 ms. Remains 107 /107 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2023-04-07 08:34:03] [INFO ] Invariant cache hit.
[2023-04-07 08:34:03] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-04-07 08:34:03] [INFO ] Invariant cache hit.
[2023-04-07 08:34:03] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-04-07 08:34:04] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 804 ms to find 0 implicit places.
[2023-04-07 08:34:04] [INFO ] Invariant cache hit.
[2023-04-07 08:34:04] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1032 ms. Remains : 107/107 places, 199/199 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X (X p1)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 227 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 529 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0))]
Finished random walk after 1024 steps, including 0 resets, run visited all 3 properties in 17 ms. (steps per millisecond=60 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X (X p1)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 517 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 333 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 335 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 396 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 28 reset in 130 ms.
Product exploration explored 100000 steps with 19 reset in 125 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 282 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 199/199 transitions.
Applied a total of 0 rules in 3 ms. Remains 107 /107 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2023-04-07 08:34:07] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 08:34:07] [INFO ] Invariant cache hit.
[2023-04-07 08:34:07] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 195 ms. Remains : 107/107 places, 199/199 transitions.
Support contains 4 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 199/199 transitions.
Applied a total of 0 rules in 1 ms. Remains 107 /107 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2023-04-07 08:34:07] [INFO ] Invariant cache hit.
[2023-04-07 08:34:07] [INFO ] Implicit Places using invariants in 172 ms returned []
[2023-04-07 08:34:07] [INFO ] Invariant cache hit.
[2023-04-07 08:34:08] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-04-07 08:34:08] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
[2023-04-07 08:34:08] [INFO ] Invariant cache hit.
[2023-04-07 08:34:08] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 715 ms. Remains : 107/107 places, 199/199 transitions.
Treatment of property Anderson-PT-06-LTLCardinality-06 finished in 8519 ms.
[2023-04-07 08:34:08] [INFO ] Flatten gal took : 52 ms
[2023-04-07 08:34:08] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 11 ms.
[2023-04-07 08:34:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 179 places, 321 transitions and 1144 arcs took 11 ms.
Total runtime 63983 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1118/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Anderson-PT-06-LTLCardinality-06

BK_STOP 1680856451266

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name Anderson-PT-06-LTLCardinality-06
ltl formula formula --ltl=/tmp/1118/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 179 places, 321 transitions and 1144 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1118/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1118/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1118/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1118/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size

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="Anderson-PT-06"
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 Anderson-PT-06, 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 r521-tall-167987246100019"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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