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.r133-smll-167819410700331.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 DiscoveryGPU-PT-09a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r133-smll-167819410700331
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 6.6K Feb 25 13:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 13:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 13:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 13:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 13:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 199K Feb 25 13:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 13:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 35K Feb 25 13:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:59 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 32K 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 DiscoveryGPU-PT-09a-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-09a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678424245905

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=DiscoveryGPU-PT-09a
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-10 04:57:29] [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-10 04:57:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 04:57:29] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2023-03-10 04:57:29] [INFO ] Transformed 93 places.
[2023-03-10 04:57:29] [INFO ] Transformed 127 transitions.
[2023-03-10 04:57:29] [INFO ] Found NUPN structural information;
[2023-03-10 04:57:29] [INFO ] Parsed PT model containing 93 places and 127 transitions and 408 arcs in 170 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 5 formulas.
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 127/127 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 88 transition count 122
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 88 transition count 122
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 84 transition count 118
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 84 transition count 118
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 82 transition count 114
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 82 transition count 114
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 29 place count 82 transition count 107
Applied a total of 29 rules in 62 ms. Remains 82 /93 variables (removed 11) and now considering 107/127 (removed 20) transitions.
// Phase 1: matrix 107 rows 82 cols
[2023-03-10 04:57:29] [INFO ] Computed 2 place invariants in 10 ms
[2023-03-10 04:57:30] [INFO ] Implicit Places using invariants in 340 ms returned []
[2023-03-10 04:57:30] [INFO ] Invariant cache hit.
[2023-03-10 04:57:30] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-10 04:57:30] [INFO ] Implicit Places using invariants and state equation in 309 ms returned [81]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 716 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/93 places, 107/127 transitions.
Applied a total of 0 rules in 5 ms. Remains 81 /81 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 783 ms. Remains : 81/93 places, 107/127 transitions.
Support contains 21 out of 81 places after structural reductions.
[2023-03-10 04:57:30] [INFO ] Flatten gal took : 60 ms
[2023-03-10 04:57:30] [INFO ] Flatten gal took : 28 ms
[2023-03-10 04:57:30] [INFO ] Input system was already deterministic with 107 transitions.
Incomplete random walk after 10000 steps, including 101 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 18) seen :17
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 107 rows 81 cols
[2023-03-10 04:57:31] [INFO ] Computed 1 place invariants in 6 ms
[2023-03-10 04:57:31] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 04:57:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-10 04:57:31] [INFO ] After 117ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
Computed a total of 11 stabilizing places and 10 stable transitions
Graph (complete) has 203 edges and 81 vertex of which 77 are kept as prefixes of interest. Removing 4 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' '!(F(G(p0)))'
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 107/107 transitions.
Graph (complete) has 203 edges and 81 vertex of which 77 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 88 edges and 75 vertex of which 64 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Graph (trivial) has 70 edges and 64 vertex of which 34 / 64 are part of one of the 17 SCC in 3 ms
Free SCC test removed 17 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 47 transition count 82
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 39 place count 38 transition count 65
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 46 place count 31 transition count 51
Iterating global reduction 2 with 7 rules applied. Total rules applied 53 place count 31 transition count 51
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 60 place count 24 transition count 37
Iterating global reduction 2 with 7 rules applied. Total rules applied 67 place count 24 transition count 37
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 74 place count 17 transition count 23
Iterating global reduction 2 with 7 rules applied. Total rules applied 81 place count 17 transition count 23
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 88 place count 10 transition count 16
Iterating global reduction 2 with 7 rules applied. Total rules applied 95 place count 10 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 99 place count 8 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 8 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 6 transition count 11
Applied a total of 102 rules in 37 ms. Remains 6 /81 variables (removed 75) and now considering 11/107 (removed 96) transitions.
[2023-03-10 04:57:31] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 6 cols
[2023-03-10 04:57:31] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 04:57:31] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-10 04:57:31] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2023-03-10 04:57:31] [INFO ] Invariant cache hit.
[2023-03-10 04:57:31] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-10 04:57:31] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 04:57:31] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2023-03-10 04:57:32] [INFO ] Invariant cache hit.
[2023-03-10 04:57:32] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/81 places, 11/107 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 163 ms. Remains : 6/81 places, 11/107 transitions.
Stuttering acceptance computed with spot in 273 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s3 0) (EQ s2 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 2 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLCardinality-02 finished in 534 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)&&G(F(p1))))'
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 107/107 transitions.
Graph (complete) has 203 edges and 81 vertex of which 77 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 77 transition count 98
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 72 transition count 98
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 14 place count 69 transition count 95
Iterating global reduction 2 with 3 rules applied. Total rules applied 17 place count 69 transition count 95
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 53 place count 51 transition count 77
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 60 place count 44 transition count 63
Iterating global reduction 2 with 7 rules applied. Total rules applied 67 place count 44 transition count 63
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 74 place count 37 transition count 49
Iterating global reduction 2 with 7 rules applied. Total rules applied 81 place count 37 transition count 49
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 88 place count 30 transition count 42
Iterating global reduction 2 with 7 rules applied. Total rules applied 95 place count 30 transition count 42
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 101 place count 24 transition count 30
Iterating global reduction 2 with 6 rules applied. Total rules applied 107 place count 24 transition count 30
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 113 place count 18 transition count 24
Iterating global reduction 2 with 6 rules applied. Total rules applied 119 place count 18 transition count 24
Applied a total of 119 rules in 38 ms. Remains 18 /81 variables (removed 63) and now considering 24/107 (removed 83) transitions.
[2023-03-10 04:57:32] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
// Phase 1: matrix 21 rows 18 cols
[2023-03-10 04:57:32] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-10 04:57:32] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-10 04:57:32] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
[2023-03-10 04:57:32] [INFO ] Invariant cache hit.
[2023-03-10 04:57:32] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-10 04:57:32] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2023-03-10 04:57:32] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 04:57:32] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
[2023-03-10 04:57:32] [INFO ] Invariant cache hit.
[2023-03-10 04:57:32] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/81 places, 24/107 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 240 ms. Remains : 18/81 places, 24/107 transitions.
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s7 1), p1:(OR (EQ s14 0) (EQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLCardinality-03 finished in 515 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||(G(p1)&&F(p2))))'
Support contains 5 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 107/107 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 76 transition count 102
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 76 transition count 102
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 73 transition count 99
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 73 transition count 99
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 70 transition count 96
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 70 transition count 96
Applied a total of 22 rules in 19 ms. Remains 70 /81 variables (removed 11) and now considering 96/107 (removed 11) transitions.
// Phase 1: matrix 96 rows 70 cols
[2023-03-10 04:57:32] [INFO ] Computed 1 place invariants in 10 ms
[2023-03-10 04:57:32] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-10 04:57:32] [INFO ] Invariant cache hit.
[2023-03-10 04:57:33] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-10 04:57:33] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2023-03-10 04:57:33] [INFO ] Invariant cache hit.
[2023-03-10 04:57:33] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70/81 places, 96/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 449 ms. Remains : 70/81 places, 96/107 transitions.
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s0 0) (EQ s27 1)), p0:(AND (NEQ s18 0) (NEQ s67 1)), p2:(EQ s46 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, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 85 steps with 0 reset in 3 ms.
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLCardinality-04 finished in 714 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 p1)||(X(X(p2))&&(p3 U G(p1)))) U X(p1)))'
Support contains 6 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 107/107 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 76 transition count 102
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 76 transition count 102
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 73 transition count 99
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 73 transition count 99
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 71 transition count 97
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 71 transition count 97
Applied a total of 20 rules in 18 ms. Remains 71 /81 variables (removed 10) and now considering 97/107 (removed 10) transitions.
// Phase 1: matrix 97 rows 71 cols
[2023-03-10 04:57:33] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-10 04:57:33] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-10 04:57:33] [INFO ] Invariant cache hit.
[2023-03-10 04:57:33] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-10 04:57:33] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2023-03-10 04:57:33] [INFO ] Invariant cache hit.
[2023-03-10 04:57:34] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 71/81 places, 97/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 428 ms. Remains : 71/81 places, 97/107 transitions.
Stuttering acceptance computed with spot in 665 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), true, (OR (AND p1 (NOT p2)) (AND (NOT p2) p3)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=0 dest: 2}, { cond=(OR p1 p3), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p1) p3), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p1) p3), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p3), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 10}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(OR (AND p1 (NOT p2)) (AND p3 (NOT p2))), acceptance={} source=7 dest: 6}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=8 dest: 6}, { cond=(AND p1 p3), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p1) p3), acceptance={0} source=8 dest: 8}, { cond=(AND p1 (NOT p3)), acceptance={} source=8 dest: 9}], [{ cond=(NOT p1), acceptance={} source=9 dest: 6}, { cond=p1, acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=10 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=10 dest: 6}]], initial=0, aps=[p1:(OR (EQ s3 0) (EQ s20 1)), p0:(OR (EQ s19 0) (EQ s10 1)), p3:(OR (EQ s0 0) (EQ s19 1)), p2:(EQ s60 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 688 ms.
Product exploration explored 100000 steps with 50000 reset in 466 ms.
Computed a total of 11 stabilizing places and 10 stable transitions
Graph (complete) has 190 edges and 71 vertex of which 70 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 11 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (NOT (AND (NOT p1) p0 p3))), (X p1), (X (NOT (AND (NOT p1) (NOT p0) p3))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND p1 p3))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) p3)))), true, (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (OR (AND p1 (NOT p2)) (AND p3 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 25 factoid took 620 ms. Reduced automaton from 11 states, 30 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-09a-LTLCardinality-07 finished in 2930 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((p0||X(G(!p1))))))'
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 107/107 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 76 transition count 102
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 76 transition count 102
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 73 transition count 99
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 73 transition count 99
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 71 transition count 97
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 71 transition count 97
Applied a total of 20 rules in 16 ms. Remains 71 /81 variables (removed 10) and now considering 97/107 (removed 10) transitions.
// Phase 1: matrix 97 rows 71 cols
[2023-03-10 04:57:36] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-10 04:57:36] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-10 04:57:36] [INFO ] Invariant cache hit.
[2023-03-10 04:57:36] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-10 04:57:36] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2023-03-10 04:57:36] [INFO ] Invariant cache hit.
[2023-03-10 04:57:36] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 71/81 places, 97/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 399 ms. Remains : 71/81 places, 97/107 transitions.
Stuttering acceptance computed with spot in 226 ms :[true, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(AND (EQ s10 0) (EQ s32 1)), p1:(OR (EQ s32 0) (EQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLCardinality-08 finished in 648 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((G((X(X(X((p0||X(p1)))))||F(p0))) U p0)))'
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 107/107 transitions.
Graph (complete) has 203 edges and 81 vertex of which 78 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 78 transition count 98
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 72 transition count 98
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 16 place count 69 transition count 95
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 place count 69 transition count 95
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 57 place count 50 transition count 76
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 64 place count 43 transition count 62
Iterating global reduction 2 with 7 rules applied. Total rules applied 71 place count 43 transition count 62
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 78 place count 36 transition count 48
Iterating global reduction 2 with 7 rules applied. Total rules applied 85 place count 36 transition count 48
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 92 place count 29 transition count 41
Iterating global reduction 2 with 7 rules applied. Total rules applied 99 place count 29 transition count 41
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 106 place count 22 transition count 27
Iterating global reduction 2 with 7 rules applied. Total rules applied 113 place count 22 transition count 27
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 119 place count 16 transition count 21
Iterating global reduction 2 with 6 rules applied. Total rules applied 125 place count 16 transition count 21
Applied a total of 125 rules in 34 ms. Remains 16 /81 variables (removed 65) and now considering 21/107 (removed 86) transitions.
[2023-03-10 04:57:37] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
// Phase 1: matrix 18 rows 16 cols
[2023-03-10 04:57:37] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-10 04:57:37] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-10 04:57:37] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
[2023-03-10 04:57:37] [INFO ] Invariant cache hit.
[2023-03-10 04:57:37] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-10 04:57:37] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-10 04:57:37] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 04:57:37] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
[2023-03-10 04:57:37] [INFO ] Invariant cache hit.
[2023-03-10 04:57:37] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/81 places, 21/107 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 139 ms. Remains : 16/81 places, 21/107 transitions.
Stuttering acceptance computed with spot in 286 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(EQ s14 1), p1:(OR (EQ s0 0) (EQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 2 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLCardinality-10 finished in 460 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 107/107 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 76 transition count 102
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 76 transition count 102
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 74 transition count 100
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 74 transition count 100
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 73 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 73 transition count 99
Applied a total of 16 rules in 7 ms. Remains 73 /81 variables (removed 8) and now considering 99/107 (removed 8) transitions.
// Phase 1: matrix 99 rows 73 cols
[2023-03-10 04:57:37] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-10 04:57:37] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-10 04:57:37] [INFO ] Invariant cache hit.
[2023-03-10 04:57:37] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-10 04:57:37] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2023-03-10 04:57:37] [INFO ] Invariant cache hit.
[2023-03-10 04:57:37] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 73/81 places, 99/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 322 ms. Remains : 73/81 places, 99/107 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s2 0) (EQ s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 314 ms.
Product exploration explored 100000 steps with 50000 reset in 267 ms.
Computed a total of 11 stabilizing places and 10 stable transitions
Graph (complete) has 193 edges and 73 vertex of which 71 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 11 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 60 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-09a-LTLCardinality-13 finished in 1087 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 U (p1||G(!p0))))))'
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 107/107 transitions.
Graph (complete) has 203 edges and 81 vertex of which 77 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 88 edges and 75 vertex of which 63 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Graph (trivial) has 65 edges and 63 vertex of which 30 / 63 are part of one of the 15 SCC in 0 ms
Free SCC test removed 15 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 48 transition count 82
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 36 place count 40 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 39 transition count 66
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 43 place count 33 transition count 54
Iterating global reduction 3 with 6 rules applied. Total rules applied 49 place count 33 transition count 54
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 55 place count 27 transition count 42
Iterating global reduction 3 with 6 rules applied. Total rules applied 61 place count 27 transition count 42
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 66 place count 22 transition count 32
Iterating global reduction 3 with 5 rules applied. Total rules applied 71 place count 22 transition count 32
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 76 place count 17 transition count 27
Iterating global reduction 3 with 5 rules applied. Total rules applied 81 place count 17 transition count 27
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 85 place count 15 transition count 25
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 87 place count 14 transition count 25
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 89 place count 14 transition count 23
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 93 place count 10 transition count 19
Applied a total of 93 rules in 10 ms. Remains 10 /81 variables (removed 71) and now considering 19/107 (removed 88) transitions.
[2023-03-10 04:57:38] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
// Phase 1: matrix 16 rows 10 cols
[2023-03-10 04:57:38] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 04:57:38] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-10 04:57:38] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
[2023-03-10 04:57:38] [INFO ] Invariant cache hit.
[2023-03-10 04:57:38] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-10 04:57:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 04:57:38] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
[2023-03-10 04:57:38] [INFO ] Invariant cache hit.
[2023-03-10 04:57:38] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/81 places, 19/107 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 94 ms. Remains : 10/81 places, 19/107 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NEQ s2 1) (NOT (OR (EQ s5 0) (EQ s7 1)))), p0:(OR (EQ s5 0) (EQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLCardinality-14 finished in 234 ms.
All properties solved by simple procedures.
Total runtime 9606 ms.

BK_STOP 1678424259814

--------------------
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="DiscoveryGPU-PT-09a"
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 DiscoveryGPU-PT-09a, 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 r133-smll-167819410700331"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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