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.r487-tall-167912703000419.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is Szymanski-PT-a06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r487-tall-167912703000419
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.9K Feb 26 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 16:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 16:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 16:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 26 16:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 16:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 16:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 101K Mar 5 18:23 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 Szymanski-PT-a06-LTLCardinality-00
FORMULA_NAME Szymanski-PT-a06-LTLCardinality-01
FORMULA_NAME Szymanski-PT-a06-LTLCardinality-02
FORMULA_NAME Szymanski-PT-a06-LTLCardinality-03
FORMULA_NAME Szymanski-PT-a06-LTLCardinality-04
FORMULA_NAME Szymanski-PT-a06-LTLCardinality-05
FORMULA_NAME Szymanski-PT-a06-LTLCardinality-06
FORMULA_NAME Szymanski-PT-a06-LTLCardinality-07
FORMULA_NAME Szymanski-PT-a06-LTLCardinality-08
FORMULA_NAME Szymanski-PT-a06-LTLCardinality-09
FORMULA_NAME Szymanski-PT-a06-LTLCardinality-10
FORMULA_NAME Szymanski-PT-a06-LTLCardinality-11
FORMULA_NAME Szymanski-PT-a06-LTLCardinality-12
FORMULA_NAME Szymanski-PT-a06-LTLCardinality-13
FORMULA_NAME Szymanski-PT-a06-LTLCardinality-14
FORMULA_NAME Szymanski-PT-a06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679187329601

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-a06
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 00:55:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 00:55:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 00:55:31] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2023-03-19 00:55:31] [INFO ] Transformed 61 places.
[2023-03-19 00:55:31] [INFO ] Transformed 224 transitions.
[2023-03-19 00:55:31] [INFO ] Parsed PT model containing 61 places and 224 transitions and 900 arcs in 125 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 8 transitions.
FORMULA Szymanski-PT-a06-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a06-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a06-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 48 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 48 transition count 212
Applied a total of 2 rules in 14 ms. Remains 48 /49 variables (removed 1) and now considering 212/216 (removed 4) transitions.
[2023-03-19 00:55:31] [INFO ] Flow matrix only has 78 transitions (discarded 134 similar events)
// Phase 1: matrix 78 rows 48 cols
[2023-03-19 00:55:31] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-19 00:55:31] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-19 00:55:31] [INFO ] Flow matrix only has 78 transitions (discarded 134 similar events)
[2023-03-19 00:55:31] [INFO ] Invariant cache hit.
[2023-03-19 00:55:31] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 00:55:31] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2023-03-19 00:55:31] [INFO ] Flow matrix only has 78 transitions (discarded 134 similar events)
[2023-03-19 00:55:31] [INFO ] Invariant cache hit.
[2023-03-19 00:55:32] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 48/49 places, 212/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 446 ms. Remains : 48/49 places, 212/216 transitions.
Support contains 31 out of 48 places after structural reductions.
[2023-03-19 00:55:32] [INFO ] Flatten gal took : 47 ms
[2023-03-19 00:55:32] [INFO ] Flatten gal took : 44 ms
[2023-03-19 00:55:32] [INFO ] Input system was already deterministic with 212 transitions.
Support contains 29 out of 48 places (down from 31) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 30) seen :27
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-19 00:55:32] [INFO ] Flow matrix only has 78 transitions (discarded 134 similar events)
[2023-03-19 00:55:32] [INFO ] Invariant cache hit.
[2023-03-19 00:55:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 00:55:32] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-19 00:55:32] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA Szymanski-PT-a06-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 9 stabilizing places and 36 stable transitions
Graph (complete) has 375 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 212/212 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 212
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 43 transition count 200
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 43 transition count 200
Applied a total of 8 rules in 8 ms. Remains 43 /48 variables (removed 5) and now considering 200/212 (removed 12) transitions.
[2023-03-19 00:55:33] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
// Phase 1: matrix 75 rows 43 cols
[2023-03-19 00:55:33] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-19 00:55:33] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-19 00:55:33] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
[2023-03-19 00:55:33] [INFO ] Invariant cache hit.
[2023-03-19 00:55:33] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 00:55:33] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2023-03-19 00:55:33] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
[2023-03-19 00:55:33] [INFO ] Invariant cache hit.
[2023-03-19 00:55:33] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 43/48 places, 200/212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 297 ms. Remains : 43/48 places, 200/212 transitions.
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-a06-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s18 s42)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Szymanski-PT-a06-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-a06-LTLCardinality-01 finished in 522 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U (X((p2||X(p2)))&&p1)))'
Support contains 6 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 212/212 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 212
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 44 transition count 200
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 44 transition count 200
Applied a total of 7 rules in 21 ms. Remains 44 /48 variables (removed 4) and now considering 200/212 (removed 12) transitions.
[2023-03-19 00:55:33] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
// Phase 1: matrix 75 rows 44 cols
[2023-03-19 00:55:33] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-19 00:55:33] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-19 00:55:33] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
[2023-03-19 00:55:33] [INFO ] Invariant cache hit.
[2023-03-19 00:55:33] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 00:55:33] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2023-03-19 00:55:33] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
[2023-03-19 00:55:33] [INFO ] Invariant cache hit.
[2023-03-19 00:55:33] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 44/48 places, 200/212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 260 ms. Remains : 44/48 places, 200/212 transitions.
Stuttering acceptance computed with spot in 266 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : Szymanski-PT-a06-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}, { cond=p1, acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 2}]], initial=0, aps=[p1:(AND (LEQ s33 s37) (LEQ s20 s29)), p0:(LEQ s43 s28), p2:(LEQ s33 s37)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 259 ms.
Product exploration explored 100000 steps with 50000 reset in 194 ms.
Computed a total of 8 stabilizing places and 32 stable transitions
Graph (complete) has 347 edges and 44 vertex of which 43 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) (NOT p2)))), true, (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0 p2)
Knowledge based reduction with 15 factoid took 510 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Szymanski-PT-a06-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Szymanski-PT-a06-LTLCardinality-02 finished in 1512 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 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 212/212 transitions.
Graph (complete) has 375 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 42 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 42 transition count 196
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 25 place count 42 transition count 180
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 27 place count 40 transition count 172
Iterating global reduction 0 with 2 rules applied. Total rules applied 29 place count 40 transition count 172
Applied a total of 29 rules in 28 ms. Remains 40 /48 variables (removed 8) and now considering 172/212 (removed 40) transitions.
[2023-03-19 00:55:35] [INFO ] Flow matrix only has 68 transitions (discarded 104 similar events)
// Phase 1: matrix 68 rows 40 cols
[2023-03-19 00:55:35] [INFO ] Computed 1 place invariants in 4 ms
[2023-03-19 00:55:35] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-19 00:55:35] [INFO ] Flow matrix only has 68 transitions (discarded 104 similar events)
[2023-03-19 00:55:35] [INFO ] Invariant cache hit.
[2023-03-19 00:55:35] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 00:55:35] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2023-03-19 00:55:35] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-19 00:55:35] [INFO ] Flow matrix only has 68 transitions (discarded 104 similar events)
[2023-03-19 00:55:35] [INFO ] Invariant cache hit.
[2023-03-19 00:55:35] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/48 places, 172/212 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 252 ms. Remains : 40/48 places, 172/212 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : Szymanski-PT-a06-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s33)], 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]]
Stuttering criterion allowed to conclude after 131 steps with 0 reset in 4 ms.
FORMULA Szymanski-PT-a06-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-a06-LTLCardinality-03 finished in 297 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 212/212 transitions.
Graph (complete) has 375 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 42 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 42 transition count 196
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 25 place count 42 transition count 180
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 27 place count 40 transition count 172
Iterating global reduction 0 with 2 rules applied. Total rules applied 29 place count 40 transition count 172
Applied a total of 29 rules in 32 ms. Remains 40 /48 variables (removed 8) and now considering 172/212 (removed 40) transitions.
[2023-03-19 00:55:35] [INFO ] Flow matrix only has 68 transitions (discarded 104 similar events)
[2023-03-19 00:55:35] [INFO ] Invariant cache hit.
[2023-03-19 00:55:35] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-19 00:55:35] [INFO ] Flow matrix only has 68 transitions (discarded 104 similar events)
[2023-03-19 00:55:35] [INFO ] Invariant cache hit.
[2023-03-19 00:55:35] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 00:55:35] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2023-03-19 00:55:35] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-19 00:55:35] [INFO ] Flow matrix only has 68 transitions (discarded 104 similar events)
[2023-03-19 00:55:35] [INFO ] Invariant cache hit.
[2023-03-19 00:55:35] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/48 places, 172/212 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 232 ms. Remains : 40/48 places, 172/212 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : Szymanski-PT-a06-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s28)], 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]]
Stuttering criterion allowed to conclude after 337 steps with 6 reset in 1 ms.
FORMULA Szymanski-PT-a06-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-a06-LTLCardinality-04 finished in 278 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(p0)))&&F(p1)))'
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 212/212 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 212
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 43 transition count 200
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 43 transition count 200
Applied a total of 8 rules in 5 ms. Remains 43 /48 variables (removed 5) and now considering 200/212 (removed 12) transitions.
[2023-03-19 00:55:35] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
// Phase 1: matrix 75 rows 43 cols
[2023-03-19 00:55:35] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-19 00:55:35] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-19 00:55:35] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
[2023-03-19 00:55:35] [INFO ] Invariant cache hit.
[2023-03-19 00:55:35] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 00:55:35] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2023-03-19 00:55:35] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
[2023-03-19 00:55:35] [INFO ] Invariant cache hit.
[2023-03-19 00:55:35] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 43/48 places, 200/212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 165 ms. Remains : 43/48 places, 200/212 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Running random walk in product with property : Szymanski-PT-a06-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ 1 s5), p0:(GT 3 s12)], 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][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 213 steps with 3 reset in 0 ms.
FORMULA Szymanski-PT-a06-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-a06-LTLCardinality-05 finished in 342 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||G(p1))) U G(p2)))'
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 212/212 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 212
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 6 place count 42 transition count 196
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 42 transition count 196
Applied a total of 10 rules in 3 ms. Remains 42 /48 variables (removed 6) and now considering 196/212 (removed 16) transitions.
[2023-03-19 00:55:36] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
// Phase 1: matrix 74 rows 42 cols
[2023-03-19 00:55:36] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-19 00:55:36] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-19 00:55:36] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
[2023-03-19 00:55:36] [INFO ] Invariant cache hit.
[2023-03-19 00:55:36] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 00:55:36] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-19 00:55:36] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
[2023-03-19 00:55:36] [INFO ] Invariant cache hit.
[2023-03-19 00:55:36] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 42/48 places, 196/212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 154 ms. Remains : 42/48 places, 196/212 transitions.
Stuttering acceptance computed with spot in 227 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), true, (NOT p1), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : Szymanski-PT-a06-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={} source=5 dest: 3}, { cond=(OR (AND p2 p0) (AND p2 p1)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=6 dest: 4}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p2 p0 p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(LEQ 1 s25), p0:(LEQ 3 s22), p1:(LEQ 2 s30)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Szymanski-PT-a06-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-a06-LTLCardinality-06 finished in 397 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 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 212/212 transitions.
Graph (complete) has 375 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 42 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 42 transition count 196
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 25 place count 42 transition count 180
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 27 place count 40 transition count 172
Iterating global reduction 0 with 2 rules applied. Total rules applied 29 place count 40 transition count 172
Applied a total of 29 rules in 16 ms. Remains 40 /48 variables (removed 8) and now considering 172/212 (removed 40) transitions.
[2023-03-19 00:55:36] [INFO ] Flow matrix only has 68 transitions (discarded 104 similar events)
// Phase 1: matrix 68 rows 40 cols
[2023-03-19 00:55:36] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-19 00:55:36] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-19 00:55:36] [INFO ] Flow matrix only has 68 transitions (discarded 104 similar events)
[2023-03-19 00:55:36] [INFO ] Invariant cache hit.
[2023-03-19 00:55:36] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 00:55:36] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-19 00:55:36] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-19 00:55:36] [INFO ] Flow matrix only has 68 transitions (discarded 104 similar events)
[2023-03-19 00:55:36] [INFO ] Invariant cache hit.
[2023-03-19 00:55:36] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/48 places, 172/212 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 192 ms. Remains : 40/48 places, 172/212 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : Szymanski-PT-a06-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:(GT 1 s35)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 833 steps with 3 reset in 2 ms.
FORMULA Szymanski-PT-a06-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-a06-LTLCardinality-07 finished in 235 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0)) U (p1&&F((p2&&F(p3))))))))'
Support contains 5 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 212/212 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 212
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 43 transition count 200
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 43 transition count 200
Applied a total of 8 rules in 2 ms. Remains 43 /48 variables (removed 5) and now considering 200/212 (removed 12) transitions.
[2023-03-19 00:55:36] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
// Phase 1: matrix 75 rows 43 cols
[2023-03-19 00:55:36] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-19 00:55:36] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-19 00:55:36] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
[2023-03-19 00:55:36] [INFO ] Invariant cache hit.
[2023-03-19 00:55:36] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 00:55:36] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-03-19 00:55:36] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
[2023-03-19 00:55:36] [INFO ] Invariant cache hit.
[2023-03-19 00:55:36] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 43/48 places, 200/212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 182 ms. Remains : 43/48 places, 200/212 transitions.
Stuttering acceptance computed with spot in 311 ms :[(OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (OR (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : Szymanski-PT-a06-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(NOT p1), acceptance={0} source=2 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 5}, { cond=(AND p1 p2 (NOT p3)), acceptance={0} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}, { cond=(AND p2 (NOT p3)), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p3), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ 2 s37), p0:(LEQ s32 s10), p2:(LEQ 2 s30), p3:(LEQ 2 s20)], 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, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 6016 steps with 82 reset in 11 ms.
FORMULA Szymanski-PT-a06-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-a06-LTLCardinality-08 finished in 525 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))&&F(p1)) U (p0 U p2)))'
Support contains 6 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 212/212 transitions.
Graph (complete) has 375 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 43 transition count 200
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 43 transition count 200
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 23 place count 43 transition count 184
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 25 place count 41 transition count 176
Iterating global reduction 0 with 2 rules applied. Total rules applied 27 place count 41 transition count 176
Applied a total of 27 rules in 16 ms. Remains 41 /48 variables (removed 7) and now considering 176/212 (removed 36) transitions.
[2023-03-19 00:55:37] [INFO ] Flow matrix only has 69 transitions (discarded 107 similar events)
// Phase 1: matrix 69 rows 41 cols
[2023-03-19 00:55:37] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-19 00:55:37] [INFO ] Implicit Places using invariants in 405 ms returned []
[2023-03-19 00:55:37] [INFO ] Flow matrix only has 69 transitions (discarded 107 similar events)
[2023-03-19 00:55:37] [INFO ] Invariant cache hit.
[2023-03-19 00:55:37] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 00:55:37] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2023-03-19 00:55:37] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 00:55:37] [INFO ] Flow matrix only has 69 transitions (discarded 107 similar events)
[2023-03-19 00:55:37] [INFO ] Invariant cache hit.
[2023-03-19 00:55:37] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/48 places, 176/212 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 543 ms. Remains : 41/48 places, 176/212 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p2), (NOT p0), (NOT p1)]
Running random walk in product with property : Szymanski-PT-a06-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (LEQ s38 0) (LEQ s0 s28)), p0:(LEQ s5 s34), p1:(LEQ 3 s26)], 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 34195 reset in 139 ms.
Product exploration explored 100000 steps with 34149 reset in 149 ms.
Computed a total of 9 stabilizing places and 36 stable transitions
Computed a total of 9 stabilizing places and 36 stable transitions
Detected a total of 9/41 stabilizing places and 36/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 10 factoid took 446 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p2), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 00:55:38] [INFO ] Flow matrix only has 69 transitions (discarded 107 similar events)
[2023-03-19 00:55:38] [INFO ] Invariant cache hit.
[2023-03-19 00:55:38] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 00:55:38] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 5 ms returned sat
[2023-03-19 00:55:38] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 00:55:38] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 00:55:38] [INFO ] After 14ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 00:55:39] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-19 00:55:39] [INFO ] After 185ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 6 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 176/176 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 41 transition count 174
Applied a total of 2 rules in 4 ms. Remains 41 /41 variables (removed 0) and now considering 174/176 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 41/41 places, 174/176 transitions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1009444 steps, run timeout after 3001 ms. (steps per millisecond=336 ) properties seen :{}
Probabilistic random walk after 1009444 steps, saw 434403 distinct states, run finished after 3002 ms. (steps per millisecond=336 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 00:55:42] [INFO ] Flow matrix only has 67 transitions (discarded 107 similar events)
// Phase 1: matrix 67 rows 41 cols
[2023-03-19 00:55:42] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-19 00:55:42] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 00:55:42] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 00:55:42] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 00:55:42] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 00:55:42] [INFO ] After 9ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 00:55:42] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-19 00:55:42] [INFO ] After 89ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 174/174 transitions.
Applied a total of 0 rules in 4 ms. Remains 41 /41 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 41/41 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 174/174 transitions.
Applied a total of 0 rules in 3 ms. Remains 41 /41 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2023-03-19 00:55:42] [INFO ] Flow matrix only has 67 transitions (discarded 107 similar events)
[2023-03-19 00:55:42] [INFO ] Invariant cache hit.
[2023-03-19 00:55:42] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-19 00:55:42] [INFO ] Flow matrix only has 67 transitions (discarded 107 similar events)
[2023-03-19 00:55:42] [INFO ] Invariant cache hit.
[2023-03-19 00:55:42] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 00:55:42] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2023-03-19 00:55:42] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 00:55:42] [INFO ] Flow matrix only has 67 transitions (discarded 107 similar events)
[2023-03-19 00:55:42] [INFO ] Invariant cache hit.
[2023-03-19 00:55:42] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 382 ms. Remains : 41/41 places, 174/174 transitions.
Graph (trivial) has 118 edges and 41 vertex of which 18 / 41 are part of one of the 3 SCC in 2 ms
Free SCC test removed 15 places
Drop transitions removed 83 transitions
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 129 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 26 transition count 42
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 23 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 22 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 9 place count 22 transition count 40
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 11 place count 21 transition count 40
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 12 place count 21 transition count 40
Applied a total of 12 rules in 9 ms. Remains 21 /41 variables (removed 20) and now considering 40/174 (removed 134) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 40 rows 21 cols
[2023-03-19 00:55:42] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-19 00:55:42] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 00:55:42] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 00:55:42] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 00:55:42] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 00:55:42] [INFO ] After 6ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 00:55:42] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-19 00:55:42] [INFO ] After 71ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p1), (F (NOT p0)), (F p2)]
Knowledge based reduction with 10 factoid took 543 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p2), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p2), (NOT p0), (NOT p1)]
[2023-03-19 00:55:43] [INFO ] Flow matrix only has 69 transitions (discarded 107 similar events)
// Phase 1: matrix 69 rows 41 cols
[2023-03-19 00:55:43] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-19 00:55:43] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 00:55:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:55:43] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-19 00:55:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 00:55:43] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 00:55:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 00:55:43] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-19 00:55:43] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 00:55:43] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2023-03-19 00:55:43] [INFO ] Computed and/alt/rep : 21/107/21 causal constraints (skipped 46 transitions) in 6 ms.
[2023-03-19 00:55:43] [INFO ] Added : 11 causal constraints over 3 iterations in 48 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 6 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 41 /41 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-19 00:55:43] [INFO ] Flow matrix only has 69 transitions (discarded 107 similar events)
[2023-03-19 00:55:43] [INFO ] Invariant cache hit.
[2023-03-19 00:55:43] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-19 00:55:43] [INFO ] Flow matrix only has 69 transitions (discarded 107 similar events)
[2023-03-19 00:55:43] [INFO ] Invariant cache hit.
[2023-03-19 00:55:43] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 00:55:43] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2023-03-19 00:55:43] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 00:55:43] [INFO ] Flow matrix only has 69 transitions (discarded 107 similar events)
[2023-03-19 00:55:43] [INFO ] Invariant cache hit.
[2023-03-19 00:55:43] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 181 ms. Remains : 41/41 places, 176/176 transitions.
Computed a total of 9 stabilizing places and 36 stable transitions
Computed a total of 9 stabilizing places and 36 stable transitions
Detected a total of 9/41 stabilizing places and 36/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p0), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 10 factoid took 434 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p2), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 12 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 00:55:44] [INFO ] Flow matrix only has 69 transitions (discarded 107 similar events)
[2023-03-19 00:55:44] [INFO ] Invariant cache hit.
[2023-03-19 00:55:44] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 00:55:44] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 00:55:44] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 00:55:44] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 00:55:44] [INFO ] After 9ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 00:55:44] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-19 00:55:44] [INFO ] After 87ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 6 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 176/176 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 41 transition count 174
Applied a total of 2 rules in 4 ms. Remains 41 /41 variables (removed 0) and now considering 174/176 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 41/41 places, 174/176 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1046142 steps, run timeout after 3001 ms. (steps per millisecond=348 ) properties seen :{}
Probabilistic random walk after 1046142 steps, saw 451210 distinct states, run finished after 3001 ms. (steps per millisecond=348 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 00:55:47] [INFO ] Flow matrix only has 67 transitions (discarded 107 similar events)
// Phase 1: matrix 67 rows 41 cols
[2023-03-19 00:55:47] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-19 00:55:47] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 00:55:47] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 00:55:47] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 00:55:47] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 00:55:47] [INFO ] After 9ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 00:55:47] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-19 00:55:47] [INFO ] After 78ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 6 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 174/174 transitions.
Applied a total of 0 rules in 4 ms. Remains 41 /41 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 41/41 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 174/174 transitions.
Applied a total of 0 rules in 4 ms. Remains 41 /41 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2023-03-19 00:55:47] [INFO ] Flow matrix only has 67 transitions (discarded 107 similar events)
[2023-03-19 00:55:47] [INFO ] Invariant cache hit.
[2023-03-19 00:55:47] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-19 00:55:47] [INFO ] Flow matrix only has 67 transitions (discarded 107 similar events)
[2023-03-19 00:55:47] [INFO ] Invariant cache hit.
[2023-03-19 00:55:47] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 00:55:47] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2023-03-19 00:55:47] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 00:55:47] [INFO ] Flow matrix only has 67 transitions (discarded 107 similar events)
[2023-03-19 00:55:47] [INFO ] Invariant cache hit.
[2023-03-19 00:55:48] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 41/41 places, 174/174 transitions.
Graph (trivial) has 118 edges and 41 vertex of which 18 / 41 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions removed 83 transitions
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 129 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 26 transition count 42
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 23 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 22 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 9 place count 22 transition count 40
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 11 place count 21 transition count 40
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 12 place count 21 transition count 40
Applied a total of 12 rules in 20 ms. Remains 21 /41 variables (removed 20) and now considering 40/174 (removed 134) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 40 rows 21 cols
[2023-03-19 00:55:48] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-19 00:55:48] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 00:55:48] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 00:55:48] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 00:55:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 00:55:48] [INFO ] After 6ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 00:55:48] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-19 00:55:48] [INFO ] After 103ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p0), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p1), (F (NOT p0)), (F p2)]
Knowledge based reduction with 10 factoid took 624 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p2), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p2), (NOT p0), (NOT p1)]
[2023-03-19 00:55:49] [INFO ] Flow matrix only has 69 transitions (discarded 107 similar events)
// Phase 1: matrix 69 rows 41 cols
[2023-03-19 00:55:49] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-19 00:55:49] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 00:55:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:55:49] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-19 00:55:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 00:55:49] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 00:55:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 00:55:49] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-19 00:55:49] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 00:55:49] [INFO ] [Nat]Added 9 Read/Feed constraints in 3 ms returned sat
[2023-03-19 00:55:49] [INFO ] Computed and/alt/rep : 21/107/21 causal constraints (skipped 46 transitions) in 10 ms.
[2023-03-19 00:55:49] [INFO ] Added : 11 causal constraints over 3 iterations in 36 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 89 ms :[(NOT p2), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 34182 reset in 137 ms.
Product exploration explored 100000 steps with 34117 reset in 155 ms.
Support contains 6 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 41 /41 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-19 00:55:49] [INFO ] Flow matrix only has 69 transitions (discarded 107 similar events)
[2023-03-19 00:55:49] [INFO ] Invariant cache hit.
[2023-03-19 00:55:49] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-19 00:55:49] [INFO ] Flow matrix only has 69 transitions (discarded 107 similar events)
[2023-03-19 00:55:49] [INFO ] Invariant cache hit.
[2023-03-19 00:55:49] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 00:55:49] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2023-03-19 00:55:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 00:55:49] [INFO ] Flow matrix only has 69 transitions (discarded 107 similar events)
[2023-03-19 00:55:49] [INFO ] Invariant cache hit.
[2023-03-19 00:55:49] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 164 ms. Remains : 41/41 places, 176/176 transitions.
Treatment of property Szymanski-PT-a06-LTLCardinality-09 finished in 12617 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p0)&&(p1 U p2)))))'
Support contains 4 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 212/212 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 212
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 6 place count 42 transition count 196
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 42 transition count 196
Applied a total of 10 rules in 2 ms. Remains 42 /48 variables (removed 6) and now considering 196/212 (removed 16) transitions.
[2023-03-19 00:55:49] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
// Phase 1: matrix 74 rows 42 cols
[2023-03-19 00:55:49] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-19 00:55:49] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-19 00:55:49] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
[2023-03-19 00:55:49] [INFO ] Invariant cache hit.
[2023-03-19 00:55:49] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 00:55:49] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-03-19 00:55:49] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
[2023-03-19 00:55:49] [INFO ] Invariant cache hit.
[2023-03-19 00:55:49] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 42/48 places, 196/212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 154 ms. Remains : 42/48 places, 196/212 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (NOT p2)]
Running random walk in product with property : Szymanski-PT-a06-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR p2 p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ s38 s17), p1:(LEQ s33 0), p0:(LEQ 2 s41)], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA Szymanski-PT-a06-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-a06-LTLCardinality-10 finished in 313 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||(p0 U p1)))))'
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 212/212 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 212
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 43 transition count 200
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 43 transition count 200
Applied a total of 8 rules in 2 ms. Remains 43 /48 variables (removed 5) and now considering 200/212 (removed 12) transitions.
[2023-03-19 00:55:50] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
// Phase 1: matrix 75 rows 43 cols
[2023-03-19 00:55:50] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-19 00:55:50] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-19 00:55:50] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
[2023-03-19 00:55:50] [INFO ] Invariant cache hit.
[2023-03-19 00:55:50] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 00:55:50] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2023-03-19 00:55:50] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
[2023-03-19 00:55:50] [INFO ] Invariant cache hit.
[2023-03-19 00:55:50] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 43/48 places, 200/212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 176 ms. Remains : 43/48 places, 200/212 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Szymanski-PT-a06-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(OR p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 s8), p1:(LEQ s28 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 1 ms.
FORMULA Szymanski-PT-a06-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-a06-LTLCardinality-12 finished in 265 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||(p1&&X(p1)))))'
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 212/212 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 212
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 43 transition count 200
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 43 transition count 200
Applied a total of 8 rules in 3 ms. Remains 43 /48 variables (removed 5) and now considering 200/212 (removed 12) transitions.
[2023-03-19 00:55:50] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
// Phase 1: matrix 75 rows 43 cols
[2023-03-19 00:55:50] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-19 00:55:50] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-19 00:55:50] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
[2023-03-19 00:55:50] [INFO ] Invariant cache hit.
[2023-03-19 00:55:50] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 00:55:50] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2023-03-19 00:55:50] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
[2023-03-19 00:55:50] [INFO ] Invariant cache hit.
[2023-03-19 00:55:50] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 43/48 places, 200/212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 167 ms. Remains : 43/48 places, 200/212 transitions.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Szymanski-PT-a06-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}]], initial=0, aps=[p0:(LEQ s0 s25), p1:(LEQ s12 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 123 ms.
Product exploration explored 100000 steps with 50000 reset in 124 ms.
Computed a total of 8 stabilizing places and 32 stable transitions
Computed a total of 8 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) p1)
Knowledge based reduction with 3 factoid took 167 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Szymanski-PT-a06-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Szymanski-PT-a06-LTLCardinality-13 finished in 663 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))&&F(p1)) U (p0 U p2)))'
[2023-03-19 00:55:51] [INFO ] Flatten gal took : 17 ms
[2023-03-19 00:55:51] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-19 00:55:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 48 places, 212 transitions and 852 arcs took 2 ms.
Total runtime 19830 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Szymanski-PT-a06
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

FORMULA Szymanski-PT-a06-LTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679187352444

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 1 (type EXCL) for 0 Szymanski-PT-a06-LTLCardinality-09
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for Szymanski-PT-a06-LTLCardinality-09
lola: result : true
lola: markings : 271
lola: fired transitions : 521
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Szymanski-PT-a06-LTLCardinality-09: LTL true LTL model checker


Time elapsed: 0 secs. Pages in use: 1

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Szymanski-PT-a06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is Szymanski-PT-a06, 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 r487-tall-167912703000419"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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