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.r101-tall-167814475700651.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 itstools
Input is DLCround-PT-05a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r101-tall-167814475700651
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 792K
-rw-r--r-- 1 mcc users 8.0K Feb 25 18:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 18:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 18:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 18:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 18:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Feb 25 18:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 18:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Feb 25 18:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 259K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DLCround-PT-05a-LTLCardinality-00
FORMULA_NAME DLCround-PT-05a-LTLCardinality-01
FORMULA_NAME DLCround-PT-05a-LTLCardinality-02
FORMULA_NAME DLCround-PT-05a-LTLCardinality-03
FORMULA_NAME DLCround-PT-05a-LTLCardinality-04
FORMULA_NAME DLCround-PT-05a-LTLCardinality-05
FORMULA_NAME DLCround-PT-05a-LTLCardinality-06
FORMULA_NAME DLCround-PT-05a-LTLCardinality-07
FORMULA_NAME DLCround-PT-05a-LTLCardinality-08
FORMULA_NAME DLCround-PT-05a-LTLCardinality-09
FORMULA_NAME DLCround-PT-05a-LTLCardinality-10
FORMULA_NAME DLCround-PT-05a-LTLCardinality-11
FORMULA_NAME DLCround-PT-05a-LTLCardinality-12
FORMULA_NAME DLCround-PT-05a-LTLCardinality-13
FORMULA_NAME DLCround-PT-05a-LTLCardinality-14
FORMULA_NAME DLCround-PT-05a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678302758096

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-05a
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-08 19:12:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-08 19:12:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 19:12:39] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2023-03-08 19:12:39] [INFO ] Transformed 167 places.
[2023-03-08 19:12:39] [INFO ] Transformed 1055 transitions.
[2023-03-08 19:12:39] [INFO ] Found NUPN structural information;
[2023-03-08 19:12:39] [INFO ] Parsed PT model containing 167 places and 1055 transitions and 3985 arcs in 145 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 112 transitions
Reduce redundant transitions removed 112 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA DLCround-PT-05a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-05a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-05a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-05a-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-05a-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-05a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 943/943 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 153 transition count 813
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 153 transition count 813
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 32 place count 153 transition count 809
Drop transitions removed 246 transitions
Redundant transition composition rules discarded 246 transitions
Iterating global reduction 1 with 246 rules applied. Total rules applied 278 place count 153 transition count 563
Applied a total of 278 rules in 50 ms. Remains 153 /167 variables (removed 14) and now considering 563/943 (removed 380) transitions.
[2023-03-08 19:12:39] [INFO ] Flow matrix only has 120 transitions (discarded 443 similar events)
// Phase 1: matrix 120 rows 153 cols
[2023-03-08 19:12:39] [INFO ] Computed 88 place invariants in 15 ms
[2023-03-08 19:12:40] [INFO ] Implicit Places using invariants in 389 ms returned [76, 77, 78, 79, 80, 81, 82, 83, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 96, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 128, 129, 130, 131, 134, 135, 136, 137, 138, 140, 141, 142, 143, 144, 146, 147, 148, 149, 150, 151]
Discarding 66 places :
Ensure Unique test removed 333 transitions
Reduce isomorphic transitions removed 333 transitions.
Implicit Place search using SMT only with invariants took 414 ms to find 66 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 87/167 places, 230/943 transitions.
Drop transitions removed 73 transitions
Redundant transition composition rules discarded 73 transitions
Iterating global reduction 0 with 73 rules applied. Total rules applied 73 place count 87 transition count 157
Applied a total of 73 rules in 3 ms. Remains 87 /87 variables (removed 0) and now considering 157/230 (removed 73) transitions.
[2023-03-08 19:12:40] [INFO ] Flow matrix only has 120 transitions (discarded 37 similar events)
// Phase 1: matrix 120 rows 87 cols
[2023-03-08 19:12:40] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-08 19:12:40] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-08 19:12:40] [INFO ] Flow matrix only has 120 transitions (discarded 37 similar events)
[2023-03-08 19:12:40] [INFO ] Invariant cache hit.
[2023-03-08 19:12:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 19:12:40] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 87/167 places, 157/943 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 570 ms. Remains : 87/167 places, 157/943 transitions.
Support contains 28 out of 87 places after structural reductions.
[2023-03-08 19:12:40] [INFO ] Flatten gal took : 25 ms
[2023-03-08 19:12:40] [INFO ] Flatten gal took : 10 ms
[2023-03-08 19:12:40] [INFO ] Input system was already deterministic with 157 transitions.
Support contains 27 out of 87 places (down from 28) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 19) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 19:12:40] [INFO ] Flow matrix only has 120 transitions (discarded 37 similar events)
[2023-03-08 19:12:40] [INFO ] Invariant cache hit.
[2023-03-08 19:12:40] [INFO ] [Real]Absence check using 22 positive place invariants in 6 ms returned sat
[2023-03-08 19:12:40] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-08 19:12:40] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-08 19:12:40] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
FORMULA DLCround-PT-05a-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 13 stabilizing places and 1 stable transitions
Graph (complete) has 178 edges and 87 vertex of which 75 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.3 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 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 157/157 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 157
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 17 place count 70 transition count 147
Iterating global reduction 1 with 5 rules applied. Total rules applied 22 place count 70 transition count 147
Applied a total of 22 rules in 4 ms. Remains 70 /87 variables (removed 17) and now considering 147/157 (removed 10) transitions.
[2023-03-08 19:12:41] [INFO ] Flow matrix only has 115 transitions (discarded 32 similar events)
// Phase 1: matrix 115 rows 70 cols
[2023-03-08 19:12:41] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-08 19:12:41] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-08 19:12:41] [INFO ] Flow matrix only has 115 transitions (discarded 32 similar events)
[2023-03-08 19:12:41] [INFO ] Invariant cache hit.
[2023-03-08 19:12:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 19:12:41] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-08 19:12:41] [INFO ] Flow matrix only has 115 transitions (discarded 32 similar events)
[2023-03-08 19:12:41] [INFO ] Invariant cache hit.
[2023-03-08 19:12:41] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70/87 places, 147/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 154 ms. Remains : 70/87 places, 147/157 transitions.
Stuttering acceptance computed with spot in 1908 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-05a-LTLCardinality-00 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:(NEQ s8 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 38 steps with 0 reset in 2 ms.
FORMULA DLCround-PT-05a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05a-LTLCardinality-00 finished in 2110 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))'
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 157/157 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 76 transition count 157
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 17 place count 70 transition count 145
Iterating global reduction 1 with 6 rules applied. Total rules applied 23 place count 70 transition count 145
Applied a total of 23 rules in 2 ms. Remains 70 /87 variables (removed 17) and now considering 145/157 (removed 12) transitions.
[2023-03-08 19:12:43] [INFO ] Flow matrix only has 114 transitions (discarded 31 similar events)
// Phase 1: matrix 114 rows 70 cols
[2023-03-08 19:12:43] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-08 19:12:43] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-08 19:12:43] [INFO ] Flow matrix only has 114 transitions (discarded 31 similar events)
[2023-03-08 19:12:43] [INFO ] Invariant cache hit.
[2023-03-08 19:12:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 19:12:43] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-08 19:12:43] [INFO ] Flow matrix only has 114 transitions (discarded 31 similar events)
[2023-03-08 19:12:43] [INFO ] Invariant cache hit.
[2023-03-08 19:12:43] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70/87 places, 145/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140 ms. Remains : 70/87 places, 145/157 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DLCround-PT-05a-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s69 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-05a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05a-LTLCardinality-01 finished in 237 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(F(p0))))'
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 157/157 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 157
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 17 place count 70 transition count 147
Iterating global reduction 1 with 5 rules applied. Total rules applied 22 place count 70 transition count 147
Applied a total of 22 rules in 9 ms. Remains 70 /87 variables (removed 17) and now considering 147/157 (removed 10) transitions.
[2023-03-08 19:12:43] [INFO ] Flow matrix only has 115 transitions (discarded 32 similar events)
// Phase 1: matrix 115 rows 70 cols
[2023-03-08 19:12:43] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-08 19:12:43] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-08 19:12:43] [INFO ] Flow matrix only has 115 transitions (discarded 32 similar events)
[2023-03-08 19:12:43] [INFO ] Invariant cache hit.
[2023-03-08 19:12:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 19:12:43] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-08 19:12:43] [INFO ] Flow matrix only has 115 transitions (discarded 32 similar events)
[2023-03-08 19:12:43] [INFO ] Invariant cache hit.
[2023-03-08 19:12:43] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70/87 places, 147/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140 ms. Remains : 70/87 places, 147/157 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-05a-LTLCardinality-02 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 s55 0) (EQ s31 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 318 ms.
Product exploration explored 100000 steps with 33333 reset in 187 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 873 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-05a-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-05a-LTLCardinality-02 finished in 1626 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F((G((p1||F(p2)))||G(p3)))))'
Support contains 5 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 157/157 transitions.
Graph (trivial) has 149 edges and 87 vertex of which 70 / 87 are part of one of the 10 SCC in 6 ms
Free SCC test removed 60 places
Ensure Unique test removed 137 transitions
Reduce isomorphic transitions removed 137 transitions.
Graph (complete) has 41 edges and 27 vertex of which 17 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 0 output transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 8 place count 11 transition count 14
Iterating global reduction 0 with 6 rules applied. Total rules applied 14 place count 11 transition count 14
Applied a total of 14 rules in 12 ms. Remains 11 /87 variables (removed 76) and now considering 14/157 (removed 143) transitions.
[2023-03-08 19:12:45] [INFO ] Flow matrix only has 9 transitions (discarded 5 similar events)
// Phase 1: matrix 9 rows 11 cols
[2023-03-08 19:12:45] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-08 19:12:45] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-08 19:12:45] [INFO ] Flow matrix only has 9 transitions (discarded 5 similar events)
[2023-03-08 19:12:45] [INFO ] Invariant cache hit.
[2023-03-08 19:12:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 19:12:45] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-08 19:12:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 19:12:45] [INFO ] Flow matrix only has 9 transitions (discarded 5 similar events)
[2023-03-08 19:12:45] [INFO ] Invariant cache hit.
[2023-03-08 19:12:45] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/87 places, 14/157 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73 ms. Remains : 11/87 places, 14/157 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : DLCround-PT-05a-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p2) p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s9 0) (EQ s5 1)), p1:(AND (EQ s2 0) (EQ s10 1)), p2:(OR (EQ s7 0) (EQ s2 1)), p3:(OR (EQ s10 0) (EQ s2 1))], nbAcceptance=2, 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 0 reset in 187 ms.
Product exploration explored 100000 steps with 0 reset in 112 ms.
Computed a total of 4 stabilizing places and 1 stable transitions
Graph (complete) has 19 edges and 11 vertex of which 9 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Computed a total of 4 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2 p3), (X (NOT (AND p1 (NOT p2) p3))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) p3))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) p3)))), true, (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X (AND p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3)))))]
Knowledge based reduction with 14 factoid took 629 ms. Reduced automaton from 3 states, 9 edges and 4 AP (stutter insensitive) to 3 states, 9 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 814 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-08 19:12:47] [INFO ] Flow matrix only has 9 transitions (discarded 5 similar events)
[2023-03-08 19:12:47] [INFO ] Invariant cache hit.
[2023-03-08 19:12:47] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2023-03-08 19:12:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-08 19:12:47] [INFO ] After 20ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2 p3), (X (NOT (AND p1 (NOT p2) p3))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) p3))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) p3)))), true, (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (G (NOT (AND (NOT p1) (NOT p2) p3))), (G (NOT (AND p1 (NOT p2) p3))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (G (NOT (AND (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X (AND p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (F (AND p1 (NOT p2) (NOT p3))), (F (NOT p0))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p1) (NOT p2) (NOT p3))))
Knowledge based reduction with 19 factoid took 608 ms. Reduced automaton from 3 states, 9 edges and 4 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-05a-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-05a-LTLCardinality-05 finished in 2960 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 157/157 transitions.
Graph (trivial) has 150 edges and 87 vertex of which 69 / 87 are part of one of the 11 SCC in 1 ms
Free SCC test removed 58 places
Ensure Unique test removed 134 transitions
Reduce isomorphic transitions removed 134 transitions.
Graph (complete) has 44 edges and 29 vertex of which 17 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 17 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 16 transition count 22
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 11 place count 9 transition count 15
Iterating global reduction 2 with 7 rules applied. Total rules applied 18 place count 9 transition count 15
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 9 transition count 14
Applied a total of 19 rules in 9 ms. Remains 9 /87 variables (removed 78) and now considering 14/157 (removed 143) transitions.
[2023-03-08 19:12:48] [INFO ] Flow matrix only has 9 transitions (discarded 5 similar events)
// Phase 1: matrix 9 rows 9 cols
[2023-03-08 19:12:48] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-08 19:12:48] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-08 19:12:48] [INFO ] Flow matrix only has 9 transitions (discarded 5 similar events)
[2023-03-08 19:12:48] [INFO ] Invariant cache hit.
[2023-03-08 19:12:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 19:12:48] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2023-03-08 19:12:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 19:12:48] [INFO ] Flow matrix only has 9 transitions (discarded 5 similar events)
[2023-03-08 19:12:48] [INFO ] Invariant cache hit.
[2023-03-08 19:12:48] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/87 places, 14/157 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 74 ms. Remains : 9/87 places, 14/157 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-05a-LTLCardinality-06 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 (NEQ s8 0) (NEQ s2 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]]
Stuttering criterion allowed to conclude after 8 steps with 3 reset in 0 ms.
FORMULA DLCround-PT-05a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05a-LTLCardinality-06 finished in 158 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 (!p0||X(!p1)))))'
Support contains 4 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 157/157 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 77 transition count 157
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 16 place count 71 transition count 145
Iterating global reduction 1 with 6 rules applied. Total rules applied 22 place count 71 transition count 145
Applied a total of 22 rules in 4 ms. Remains 71 /87 variables (removed 16) and now considering 145/157 (removed 12) transitions.
[2023-03-08 19:12:48] [INFO ] Flow matrix only has 114 transitions (discarded 31 similar events)
// Phase 1: matrix 114 rows 71 cols
[2023-03-08 19:12:48] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-08 19:12:48] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-08 19:12:48] [INFO ] Flow matrix only has 114 transitions (discarded 31 similar events)
[2023-03-08 19:12:48] [INFO ] Invariant cache hit.
[2023-03-08 19:12:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 19:12:48] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-08 19:12:48] [INFO ] Flow matrix only has 114 transitions (discarded 31 similar events)
[2023-03-08 19:12:48] [INFO ] Invariant cache hit.
[2023-03-08 19:12:48] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 71/87 places, 145/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131 ms. Remains : 71/87 places, 145/157 transitions.
Stuttering acceptance computed with spot in 167 ms :[(AND p0 p1), (AND p0 p1), p1, true, (NOT p0)]
Running random walk in product with property : DLCround-PT-05a-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s70 0) (EQ s22 1)), p1:(OR (EQ s69 0) (EQ s43 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 171 ms.
Product exploration explored 100000 steps with 50000 reset in 180 ms.
Computed a total of 3 stabilizing places and 1 stable transitions
Graph (complete) has 156 edges and 71 vertex of which 69 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 3 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT p0)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-05a-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-05a-LTLCardinality-09 finished in 779 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||X(F(p1))))))'
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 157/157 transitions.
Graph (trivial) has 156 edges and 87 vertex of which 74 / 87 are part of one of the 10 SCC in 1 ms
Free SCC test removed 64 places
Ensure Unique test removed 146 transitions
Reduce isomorphic transitions removed 146 transitions.
Graph (complete) has 32 edges and 23 vertex of which 13 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 0 output transitions
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 11 place count 4 transition count 2
Iterating global reduction 0 with 9 rules applied. Total rules applied 20 place count 4 transition count 2
Applied a total of 20 rules in 4 ms. Remains 4 /87 variables (removed 83) and now considering 2/157 (removed 155) transitions.
// Phase 1: matrix 2 rows 4 cols
[2023-03-08 19:12:49] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 19:12:49] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-08 19:12:49] [INFO ] Invariant cache hit.
[2023-03-08 19:12:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 19:12:49] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2023-03-08 19:12:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 19:12:49] [INFO ] Invariant cache hit.
[2023-03-08 19:12:49] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/87 places, 2/157 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59 ms. Remains : 4/87 places, 2/157 transitions.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCround-PT-05a-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s3 1), p1:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2 reset in 47 ms.
Product exploration explored 100000 steps with 0 reset in 140 ms.
Computed a total of 4 stabilizing places and 1 stable transitions
Graph (complete) has 4 edges and 4 vertex of which 2 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Computed a total of 4 stabilizing places and 1 stable transitions
Detected a total of 4/4 stabilizing places and 1/2 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 230 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 5000 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 19:12:49] [INFO ] Invariant cache hit.
[2023-03-08 19:12:49] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 19:12:49] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 8 factoid took 316 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
[2023-03-08 19:12:50] [INFO ] Invariant cache hit.
[2023-03-08 19:12:50] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 19:12:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:12:50] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-08 19:12:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 19:12:50] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-08 19:12:50] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-08 19:12:50] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 4 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-08 19:12:50] [INFO ] Invariant cache hit.
[2023-03-08 19:12:50] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-08 19:12:50] [INFO ] Invariant cache hit.
[2023-03-08 19:12:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 19:12:50] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-08 19:12:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 19:12:50] [INFO ] Invariant cache hit.
[2023-03-08 19:12:50] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67 ms. Remains : 4/4 places, 2/2 transitions.
Computed a total of 4 stabilizing places and 1 stable transitions
Graph (complete) has 4 edges and 4 vertex of which 2 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Computed a total of 4 stabilizing places and 1 stable transitions
Detected a total of 4/4 stabilizing places and 1/2 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p1), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p1), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
[2023-03-08 19:12:50] [INFO ] Invariant cache hit.
[2023-03-08 19:12:50] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 19:12:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 19:12:50] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-08 19:12:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 19:12:50] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-08 19:12:50] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-08 19:12:50] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 42 ms.
Product exploration explored 100000 steps with 2 reset in 30 ms.
Built C files in :
/tmp/ltsmin6811580540322272096
[2023-03-08 19:12:50] [INFO ] Computing symmetric may disable matrix : 2 transitions.
[2023-03-08 19:12:50] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 19:12:50] [INFO ] Computing symmetric may enable matrix : 2 transitions.
[2023-03-08 19:12:50] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 19:12:50] [INFO ] Computing Do-Not-Accords matrix : 2 transitions.
[2023-03-08 19:12:50] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 19:12:50] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6811580540322272096
Running compilation step : cd /tmp/ltsmin6811580540322272096;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 156 ms.
Running link step : cd /tmp/ltsmin6811580540322272096;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin6811580540322272096;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18336088319072394059.hoa' '--buchi-type=spotba'
LTSmin run took 62 ms.
FORMULA DLCround-PT-05a-LTLCardinality-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DLCround-PT-05a-LTLCardinality-10 finished in 2203 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 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 157/157 transitions.
Graph (trivial) has 150 edges and 87 vertex of which 72 / 87 are part of one of the 10 SCC in 1 ms
Free SCC test removed 62 places
Ensure Unique test removed 140 transitions
Reduce isomorphic transitions removed 140 transitions.
Graph (complete) has 38 edges and 25 vertex of which 13 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 17 place count 4 transition count 9
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 4 transition count 5
Applied a total of 21 rules in 5 ms. Remains 4 /87 variables (removed 83) and now considering 5/157 (removed 152) transitions.
// Phase 1: matrix 5 rows 4 cols
[2023-03-08 19:12:51] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 19:12:51] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-08 19:12:51] [INFO ] Invariant cache hit.
[2023-03-08 19:12:51] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-03-08 19:12:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 19:12:51] [INFO ] Invariant cache hit.
[2023-03-08 19:12:51] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/87 places, 5/157 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67 ms. Remains : 4/87 places, 5/157 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-05a-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s2 0) (EQ s0 1))], 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 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-05a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05a-LTLCardinality-11 finished in 113 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(p1))||G(p2)))'
Support contains 4 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 157/157 transitions.
Graph (trivial) has 143 edges and 87 vertex of which 64 / 87 are part of one of the 9 SCC in 0 ms
Free SCC test removed 55 places
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Graph (complete) has 50 edges and 32 vertex of which 20 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 20 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 19 transition count 28
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 11 place count 12 transition count 20
Iterating global reduction 2 with 7 rules applied. Total rules applied 18 place count 12 transition count 20
Applied a total of 18 rules in 6 ms. Remains 12 /87 variables (removed 75) and now considering 20/157 (removed 137) transitions.
[2023-03-08 19:12:51] [INFO ] Flow matrix only has 14 transitions (discarded 6 similar events)
// Phase 1: matrix 14 rows 12 cols
[2023-03-08 19:12:51] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 19:12:51] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-08 19:12:51] [INFO ] Flow matrix only has 14 transitions (discarded 6 similar events)
[2023-03-08 19:12:51] [INFO ] Invariant cache hit.
[2023-03-08 19:12:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 19:12:51] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-08 19:12:51] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 19:12:51] [INFO ] Flow matrix only has 14 transitions (discarded 6 similar events)
[2023-03-08 19:12:51] [INFO ] Invariant cache hit.
[2023-03-08 19:12:51] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/87 places, 20/157 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 86 ms. Remains : 12/87 places, 20/157 transitions.
Stuttering acceptance computed with spot in 2707 ms :[(AND (NOT p1) (NOT p2)), true, (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DLCround-PT-05a-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 4}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=(AND p1 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s6 1), p2:(OR (EQ s4 0) (EQ s9 1)), p1:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-05a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05a-LTLCardinality-15 finished in 2806 ms.
All properties solved by simple procedures.
Total runtime 14685 ms.

BK_STOP 1678302787607

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="DLCround-PT-05a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is DLCround-PT-05a, 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 r101-tall-167814475700651"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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