Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r153-tall-171631151500312.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is DiscoveryGPU-PT-14b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-171631151500312
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 02:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 12 02:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 02:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 12 02:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 104K May 18 16:42 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-14b-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-14b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716421552942

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-14b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-22 23:45:54] [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]
[2024-05-22 23:45:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:45:54] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2024-05-22 23:45:54] [INFO ] Transformed 408 places.
[2024-05-22 23:45:54] [INFO ] Transformed 434 transitions.
[2024-05-22 23:45:54] [INFO ] Found NUPN structural information;
[2024-05-22 23:45:54] [INFO ] Parsed PT model containing 408 places and 434 transitions and 1135 arcs in 134 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 408 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 408/408 places, 434/434 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 383 transition count 434
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 85 place count 323 transition count 374
Iterating global reduction 1 with 60 rules applied. Total rules applied 145 place count 323 transition count 374
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 156 place count 312 transition count 363
Iterating global reduction 1 with 11 rules applied. Total rules applied 167 place count 312 transition count 363
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 175 place count 304 transition count 355
Iterating global reduction 1 with 8 rules applied. Total rules applied 183 place count 304 transition count 355
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 190 place count 297 transition count 348
Iterating global reduction 1 with 7 rules applied. Total rules applied 197 place count 297 transition count 348
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 204 place count 290 transition count 334
Iterating global reduction 1 with 7 rules applied. Total rules applied 211 place count 290 transition count 334
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 218 place count 283 transition count 327
Iterating global reduction 1 with 7 rules applied. Total rules applied 225 place count 283 transition count 327
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 229 place count 279 transition count 323
Iterating global reduction 1 with 4 rules applied. Total rules applied 233 place count 279 transition count 323
Applied a total of 233 rules in 219 ms. Remains 279 /408 variables (removed 129) and now considering 323/434 (removed 111) transitions.
// Phase 1: matrix 323 rows 279 cols
[2024-05-22 23:45:55] [INFO ] Computed 2 invariants in 9 ms
[2024-05-22 23:45:55] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-22 23:45:55] [INFO ] Invariant cache hit.
[2024-05-22 23:45:55] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
[2024-05-22 23:45:55] [INFO ] Invariant cache hit.
[2024-05-22 23:45:55] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 279/408 places, 323/434 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 821 ms. Remains : 279/408 places, 323/434 transitions.
Support contains 39 out of 279 places after structural reductions.
[2024-05-22 23:45:55] [INFO ] Flatten gal took : 53 ms
[2024-05-22 23:45:55] [INFO ] Flatten gal took : 26 ms
[2024-05-22 23:45:55] [INFO ] Input system was already deterministic with 323 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 18) seen :17
Finished Best-First random walk after 1908 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=190 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 46 stabilizing places and 46 stable transitions
Graph (complete) has 543 edges and 279 vertex of which 268 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.9 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0) U G(p1))))'
Support contains 5 out of 279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 323/323 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 276 transition count 323
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 18 place count 261 transition count 308
Iterating global reduction 1 with 15 rules applied. Total rules applied 33 place count 261 transition count 308
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 37 place count 257 transition count 304
Iterating global reduction 1 with 4 rules applied. Total rules applied 41 place count 257 transition count 304
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 45 place count 253 transition count 300
Iterating global reduction 1 with 4 rules applied. Total rules applied 49 place count 253 transition count 300
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 53 place count 249 transition count 295
Iterating global reduction 1 with 4 rules applied. Total rules applied 57 place count 249 transition count 295
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 61 place count 245 transition count 288
Iterating global reduction 1 with 4 rules applied. Total rules applied 65 place count 245 transition count 288
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 69 place count 241 transition count 284
Iterating global reduction 1 with 4 rules applied. Total rules applied 73 place count 241 transition count 284
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 76 place count 238 transition count 281
Iterating global reduction 1 with 3 rules applied. Total rules applied 79 place count 238 transition count 281
Applied a total of 79 rules in 42 ms. Remains 238 /279 variables (removed 41) and now considering 281/323 (removed 42) transitions.
// Phase 1: matrix 281 rows 238 cols
[2024-05-22 23:45:56] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 23:45:56] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-22 23:45:56] [INFO ] Invariant cache hit.
[2024-05-22 23:45:56] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2024-05-22 23:45:56] [INFO ] Invariant cache hit.
[2024-05-22 23:45:56] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 238/279 places, 281/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 472 ms. Remains : 238/279 places, 281/323 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 397 ms :[(NOT p1), (NOT p1), true, (AND p1 p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s128 1) (OR (EQ s23 0) (EQ s53 1))), p0:(OR (EQ s158 0) (EQ s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLCardinality-00 finished in 930 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p1)||p0)))'
Support contains 6 out of 279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 323/323 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 277 transition count 323
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 17 place count 262 transition count 308
Iterating global reduction 1 with 15 rules applied. Total rules applied 32 place count 262 transition count 308
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 258 transition count 304
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 258 transition count 304
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 254 transition count 299
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 254 transition count 299
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 250 transition count 293
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 250 transition count 293
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 60 place count 246 transition count 288
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 246 transition count 288
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 67 place count 243 transition count 285
Iterating global reduction 1 with 3 rules applied. Total rules applied 70 place count 243 transition count 285
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 242 transition count 284
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 242 transition count 284
Applied a total of 72 rules in 24 ms. Remains 242 /279 variables (removed 37) and now considering 284/323 (removed 39) transitions.
// Phase 1: matrix 284 rows 242 cols
[2024-05-22 23:45:57] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 23:45:57] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-22 23:45:57] [INFO ] Invariant cache hit.
[2024-05-22 23:45:57] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2024-05-22 23:45:57] [INFO ] Invariant cache hit.
[2024-05-22 23:45:57] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 242/279 places, 284/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 379 ms. Remains : 242/279 places, 284/323 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s138 0) (EQ s201 1) (EQ s161 0) (EQ s224 1)), p1:(OR (EQ s119 0) (EQ s137 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 220 reset in 359 ms.
Product exploration explored 100000 steps with 223 reset in 237 ms.
Computed a total of 44 stabilizing places and 44 stable transitions
Graph (complete) has 486 edges and 242 vertex of which 237 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Computed a total of 44 stabilizing places and 44 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p0), (X (X p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 121 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 22 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 4) seen :2
Finished Best-First random walk after 1722 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=430 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p0), (X (X p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 233 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 6 out of 242 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 284/284 transitions.
Applied a total of 0 rules in 4 ms. Remains 242 /242 variables (removed 0) and now considering 284/284 (removed 0) transitions.
[2024-05-22 23:45:59] [INFO ] Invariant cache hit.
[2024-05-22 23:45:59] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-22 23:45:59] [INFO ] Invariant cache hit.
[2024-05-22 23:45:59] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2024-05-22 23:45:59] [INFO ] Invariant cache hit.
[2024-05-22 23:45:59] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 365 ms. Remains : 242/242 places, 284/284 transitions.
Computed a total of 44 stabilizing places and 44 stable transitions
Graph (complete) has 486 edges and 242 vertex of which 237 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 44 stabilizing places and 44 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p0), (X (X p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 101 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 22 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 4) seen :2
Finished Best-First random walk after 5065 steps, including 1 resets, run visited all 2 properties in 10 ms. (steps per millisecond=506 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p0), (X (X p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 213 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 75 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 104 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 223 reset in 203 ms.
Product exploration explored 100000 steps with 221 reset in 225 ms.
Built C files in :
/tmp/ltsmin2876858239972263066
[2024-05-22 23:46:00] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2876858239972263066
Running compilation step : cd /tmp/ltsmin2876858239972263066;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 487 ms.
Running link step : cd /tmp/ltsmin2876858239972263066;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin2876858239972263066;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3924049049957479547.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 242 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 284/284 transitions.
Applied a total of 0 rules in 4 ms. Remains 242 /242 variables (removed 0) and now considering 284/284 (removed 0) transitions.
[2024-05-22 23:46:16] [INFO ] Invariant cache hit.
[2024-05-22 23:46:16] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-22 23:46:16] [INFO ] Invariant cache hit.
[2024-05-22 23:46:16] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2024-05-22 23:46:16] [INFO ] Invariant cache hit.
[2024-05-22 23:46:16] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 374 ms. Remains : 242/242 places, 284/284 transitions.
Built C files in :
/tmp/ltsmin10386136996647185904
[2024-05-22 23:46:16] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10386136996647185904
Running compilation step : cd /tmp/ltsmin10386136996647185904;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 395 ms.
Running link step : cd /tmp/ltsmin10386136996647185904;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin10386136996647185904;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11893412822661896145.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 23:46:31] [INFO ] Flatten gal took : 16 ms
[2024-05-22 23:46:31] [INFO ] Flatten gal took : 14 ms
[2024-05-22 23:46:31] [INFO ] Time to serialize gal into /tmp/LTL17181320516319234953.gal : 4 ms
[2024-05-22 23:46:31] [INFO ] Time to serialize properties into /tmp/LTL12852827763168665273.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17181320516319234953.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13900363260288881951.hoa' '-atoms' '/tmp/LTL12852827763168665273.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL12852827763168665273.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13900363260288881951.hoa
Detected timeout of ITS tools.
[2024-05-22 23:46:46] [INFO ] Flatten gal took : 14 ms
[2024-05-22 23:46:46] [INFO ] Flatten gal took : 14 ms
[2024-05-22 23:46:46] [INFO ] Time to serialize gal into /tmp/LTL7595137545115126863.gal : 2 ms
[2024-05-22 23:46:46] [INFO ] Time to serialize properties into /tmp/LTL3950014580991418615.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7595137545115126863.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3950014580991418615.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(("(((p236==0)||(p342==1))||((p275==0)||(p379==1)))")||(X("((p203==0)||(p235==1))")))))
Formula 0 simplified : F(!"(((p236==0)||(p342==1))||((p275==0)||(p379==1)))" & X!"((p203==0)||(p235==1))")
Detected timeout of ITS tools.
[2024-05-22 23:47:01] [INFO ] Flatten gal took : 13 ms
[2024-05-22 23:47:01] [INFO ] Applying decomposition
[2024-05-22 23:47:01] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5127069976195639644.txt' '-o' '/tmp/graph5127069976195639644.bin' '-w' '/tmp/graph5127069976195639644.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5127069976195639644.bin' '-l' '-1' '-v' '-w' '/tmp/graph5127069976195639644.weights' '-q' '0' '-e' '0.001'
[2024-05-22 23:47:02] [INFO ] Decomposing Gal with order
[2024-05-22 23:47:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 23:47:02] [INFO ] Removed a total of 112 redundant transitions.
[2024-05-22 23:47:02] [INFO ] Flatten gal took : 48 ms
[2024-05-22 23:47:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 8 ms.
[2024-05-22 23:47:02] [INFO ] Time to serialize gal into /tmp/LTL7603951587812183720.gal : 5 ms
[2024-05-22 23:47:02] [INFO ] Time to serialize properties into /tmp/LTL9198124254940158678.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7603951587812183720.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9198124254940158678.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(("(((i22.u51.p236==0)||(i22.u73.p342==1))||((i15.u60.p275==0)||(i20.u81.p379==1)))")||(X("((i2.i1.u48.p203==0)||(i22.u51.p235==1)...162
Formula 0 simplified : F(!"(((i22.u51.p236==0)||(i22.u73.p342==1))||((i15.u60.p275==0)||(i20.u81.p379==1)))" & X!"((i2.i1.u48.p203==0)||(i22.u51.p235==1))"...156
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13838342572341506549
[2024-05-22 23:47:17] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13838342572341506549
Running compilation step : cd /tmp/ltsmin13838342572341506549;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 394 ms.
Running link step : cd /tmp/ltsmin13838342572341506549;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin13838342572341506549;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((LTLAPp1==true))||(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DiscoveryGPU-PT-14b-LTLCardinality-01 finished in 94961 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 6 out of 279 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 279/279 places, 323/323 transitions.
Graph (complete) has 543 edges and 279 vertex of which 268 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 267 transition count 275
Reduce places removed 39 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 42 rules applied. Total rules applied 82 place count 228 transition count 272
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 85 place count 225 transition count 272
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 85 place count 225 transition count 230
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 169 place count 183 transition count 230
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 174 place count 178 transition count 225
Iterating global reduction 3 with 5 rules applied. Total rules applied 179 place count 178 transition count 225
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 183 place count 174 transition count 221
Iterating global reduction 3 with 4 rules applied. Total rules applied 187 place count 174 transition count 221
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 191 place count 170 transition count 213
Iterating global reduction 3 with 4 rules applied. Total rules applied 195 place count 170 transition count 213
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 199 place count 166 transition count 209
Iterating global reduction 3 with 4 rules applied. Total rules applied 203 place count 166 transition count 209
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 327 place count 104 transition count 147
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 336 place count 95 transition count 129
Iterating global reduction 3 with 9 rules applied. Total rules applied 345 place count 95 transition count 129
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 354 place count 86 transition count 120
Iterating global reduction 3 with 9 rules applied. Total rules applied 363 place count 86 transition count 120
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 372 place count 77 transition count 102
Iterating global reduction 3 with 9 rules applied. Total rules applied 381 place count 77 transition count 102
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 390 place count 68 transition count 93
Iterating global reduction 3 with 9 rules applied. Total rules applied 399 place count 68 transition count 93
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 407 place count 60 transition count 77
Iterating global reduction 3 with 8 rules applied. Total rules applied 415 place count 60 transition count 77
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 423 place count 52 transition count 69
Iterating global reduction 3 with 8 rules applied. Total rules applied 431 place count 52 transition count 69
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 434 place count 52 transition count 66
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 436 place count 50 transition count 64
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 60 edges and 48 vertex of which 45 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 3 with 16 rules applied. Total rules applied 452 place count 45 transition count 48
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 465 place count 32 transition count 48
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 465 place count 32 transition count 47
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 467 place count 31 transition count 47
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 483 place count 23 transition count 39
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 487 place count 21 transition count 38
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 489 place count 21 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 490 place count 20 transition count 35
Applied a total of 490 rules in 85 ms. Remains 20 /279 variables (removed 259) and now considering 35/323 (removed 288) transitions.
[2024-05-22 23:47:32] [INFO ] Flow matrix only has 28 transitions (discarded 7 similar events)
// Phase 1: matrix 28 rows 20 cols
[2024-05-22 23:47:32] [INFO ] Computed 0 invariants in 1 ms
[2024-05-22 23:47:32] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-22 23:47:32] [INFO ] Flow matrix only has 28 transitions (discarded 7 similar events)
[2024-05-22 23:47:32] [INFO ] Invariant cache hit.
[2024-05-22 23:47:32] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-22 23:47:32] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:47:32] [INFO ] Flow matrix only has 28 transitions (discarded 7 similar events)
[2024-05-22 23:47:32] [INFO ] Invariant cache hit.
[2024-05-22 23:47:32] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/279 places, 35/323 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 179 ms. Remains : 20/279 places, 35/323 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s19 0) (EQ s15 1)), p1:(AND (OR (EQ s8 0) (EQ s4 1)) (OR (EQ s1 0) (EQ s11 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLCardinality-03 finished in 304 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 279 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 279/279 places, 323/323 transitions.
Graph (complete) has 543 edges and 279 vertex of which 268 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 267 transition count 272
Reduce places removed 42 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 86 place count 225 transition count 271
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 224 transition count 271
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 87 place count 224 transition count 227
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 175 place count 180 transition count 227
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 181 place count 174 transition count 221
Iterating global reduction 3 with 6 rules applied. Total rules applied 187 place count 174 transition count 221
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 192 place count 169 transition count 216
Iterating global reduction 3 with 5 rules applied. Total rules applied 197 place count 169 transition count 216
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 202 place count 164 transition count 206
Iterating global reduction 3 with 5 rules applied. Total rules applied 207 place count 164 transition count 206
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 212 place count 159 transition count 201
Iterating global reduction 3 with 5 rules applied. Total rules applied 217 place count 159 transition count 201
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 347 place count 94 transition count 136
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 360 place count 81 transition count 111
Iterating global reduction 3 with 13 rules applied. Total rules applied 373 place count 81 transition count 111
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 386 place count 68 transition count 97
Iterating global reduction 3 with 13 rules applied. Total rules applied 399 place count 68 transition count 97
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 410 place count 57 transition count 75
Iterating global reduction 3 with 11 rules applied. Total rules applied 421 place count 57 transition count 75
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 432 place count 46 transition count 64
Iterating global reduction 3 with 11 rules applied. Total rules applied 443 place count 46 transition count 64
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 454 place count 35 transition count 42
Iterating global reduction 3 with 11 rules applied. Total rules applied 465 place count 35 transition count 42
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 476 place count 24 transition count 31
Iterating global reduction 3 with 11 rules applied. Total rules applied 487 place count 24 transition count 31
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 488 place count 24 transition count 30
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 490 place count 22 transition count 28
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 24 edges and 20 vertex of which 17 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 6 rules applied. Total rules applied 496 place count 17 transition count 22
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 499 place count 14 transition count 22
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 505 place count 11 transition count 19
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 507 place count 11 transition count 17
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 510 place count 8 transition count 14
Applied a total of 510 rules in 55 ms. Remains 8 /279 variables (removed 271) and now considering 14/323 (removed 309) transitions.
[2024-05-22 23:47:32] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
// Phase 1: matrix 11 rows 8 cols
[2024-05-22 23:47:32] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 23:47:32] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-22 23:47:32] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
[2024-05-22 23:47:32] [INFO ] Invariant cache hit.
[2024-05-22 23:47:32] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-22 23:47:32] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:47:32] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
[2024-05-22 23:47:32] [INFO ] Invariant cache hit.
[2024-05-22 23:47:32] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/279 places, 14/323 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118 ms. Remains : 8/279 places, 14/323 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLCardinality-04 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:(OR (EQ s6 0) (EQ s3 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 4 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLCardinality-04 finished in 199 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(p0)))'
Support contains 2 out of 279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 323/323 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 276 transition count 323
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 21 place count 258 transition count 305
Iterating global reduction 1 with 18 rules applied. Total rules applied 39 place count 258 transition count 305
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 45 place count 252 transition count 299
Iterating global reduction 1 with 6 rules applied. Total rules applied 51 place count 252 transition count 299
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 57 place count 246 transition count 292
Iterating global reduction 1 with 6 rules applied. Total rules applied 63 place count 246 transition count 292
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 69 place count 240 transition count 284
Iterating global reduction 1 with 6 rules applied. Total rules applied 75 place count 240 transition count 284
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 81 place count 234 transition count 275
Iterating global reduction 1 with 6 rules applied. Total rules applied 87 place count 234 transition count 275
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 92 place count 229 transition count 270
Iterating global reduction 1 with 5 rules applied. Total rules applied 97 place count 229 transition count 270
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 100 place count 226 transition count 267
Iterating global reduction 1 with 3 rules applied. Total rules applied 103 place count 226 transition count 267
Applied a total of 103 rules in 35 ms. Remains 226 /279 variables (removed 53) and now considering 267/323 (removed 56) transitions.
// Phase 1: matrix 267 rows 226 cols
[2024-05-22 23:47:32] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:47:32] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-22 23:47:32] [INFO ] Invariant cache hit.
[2024-05-22 23:47:33] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2024-05-22 23:47:33] [INFO ] Invariant cache hit.
[2024-05-22 23:47:33] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 226/279 places, 267/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 368 ms. Remains : 226/279 places, 267/323 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(OR (EQ s68 0) (EQ s196 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]]
Product exploration explored 100000 steps with 50000 reset in 219 ms.
Product exploration explored 100000 steps with 50000 reset in 190 ms.
Computed a total of 44 stabilizing places and 44 stable transitions
Graph (complete) has 459 edges and 226 vertex of which 225 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 44 stabilizing places and 44 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 20 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-14b-LTLCardinality-06 finished in 945 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 279 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 279/279 places, 323/323 transitions.
Graph (complete) has 543 edges and 279 vertex of which 268 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 267 transition count 273
Reduce places removed 41 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 226 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 225 transition count 272
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 85 place count 225 transition count 228
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 173 place count 181 transition count 228
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 179 place count 175 transition count 222
Iterating global reduction 3 with 6 rules applied. Total rules applied 185 place count 175 transition count 222
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 190 place count 170 transition count 217
Iterating global reduction 3 with 5 rules applied. Total rules applied 195 place count 170 transition count 217
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 200 place count 165 transition count 207
Iterating global reduction 3 with 5 rules applied. Total rules applied 205 place count 165 transition count 207
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 210 place count 160 transition count 202
Iterating global reduction 3 with 5 rules applied. Total rules applied 215 place count 160 transition count 202
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 343 place count 96 transition count 138
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 356 place count 83 transition count 113
Iterating global reduction 3 with 13 rules applied. Total rules applied 369 place count 83 transition count 113
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 382 place count 70 transition count 99
Iterating global reduction 3 with 13 rules applied. Total rules applied 395 place count 70 transition count 99
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 407 place count 58 transition count 75
Iterating global reduction 3 with 12 rules applied. Total rules applied 419 place count 58 transition count 75
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 431 place count 46 transition count 63
Iterating global reduction 3 with 12 rules applied. Total rules applied 443 place count 46 transition count 63
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 454 place count 35 transition count 41
Iterating global reduction 3 with 11 rules applied. Total rules applied 465 place count 35 transition count 41
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 476 place count 24 transition count 30
Iterating global reduction 3 with 11 rules applied. Total rules applied 487 place count 24 transition count 30
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 488 place count 23 transition count 28
Iterating global reduction 3 with 1 rules applied. Total rules applied 489 place count 23 transition count 28
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 490 place count 22 transition count 27
Iterating global reduction 3 with 1 rules applied. Total rules applied 491 place count 22 transition count 27
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 492 place count 22 transition count 26
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 493 place count 22 transition count 26
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 495 place count 20 transition count 24
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 21 edges and 18 vertex of which 15 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 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 3 with 4 rules applied. Total rules applied 499 place count 15 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 500 place count 14 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 500 place count 14 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 502 place count 13 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 504 place count 12 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 508 place count 10 transition count 19
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 512 place count 10 transition count 15
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 514 place count 8 transition count 13
Applied a total of 514 rules in 45 ms. Remains 8 /279 variables (removed 271) and now considering 13/323 (removed 310) transitions.
[2024-05-22 23:47:33] [INFO ] Flow matrix only has 11 transitions (discarded 2 similar events)
// Phase 1: matrix 11 rows 8 cols
[2024-05-22 23:47:33] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 23:47:33] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-22 23:47:33] [INFO ] Flow matrix only has 11 transitions (discarded 2 similar events)
[2024-05-22 23:47:33] [INFO ] Invariant cache hit.
[2024-05-22 23:47:33] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-22 23:47:33] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:47:33] [INFO ] Flow matrix only has 11 transitions (discarded 2 similar events)
[2024-05-22 23:47:33] [INFO ] Invariant cache hit.
[2024-05-22 23:47:33] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/279 places, 13/323 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 108 ms. Remains : 8/279 places, 13/323 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s6 0) (EQ s3 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 0 ms.
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLCardinality-09 finished in 152 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X((p0 U (!p1||G(p0))))))))'
Support contains 4 out of 279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 323/323 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 276 transition count 323
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 20 place count 259 transition count 306
Iterating global reduction 1 with 17 rules applied. Total rules applied 37 place count 259 transition count 306
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 43 place count 253 transition count 300
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 253 transition count 300
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 55 place count 247 transition count 293
Iterating global reduction 1 with 6 rules applied. Total rules applied 61 place count 247 transition count 293
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 67 place count 241 transition count 285
Iterating global reduction 1 with 6 rules applied. Total rules applied 73 place count 241 transition count 285
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 78 place count 236 transition count 278
Iterating global reduction 1 with 5 rules applied. Total rules applied 83 place count 236 transition count 278
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 87 place count 232 transition count 274
Iterating global reduction 1 with 4 rules applied. Total rules applied 91 place count 232 transition count 274
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 93 place count 230 transition count 272
Iterating global reduction 1 with 2 rules applied. Total rules applied 95 place count 230 transition count 272
Applied a total of 95 rules in 33 ms. Remains 230 /279 variables (removed 49) and now considering 272/323 (removed 51) transitions.
// Phase 1: matrix 272 rows 230 cols
[2024-05-22 23:47:33] [INFO ] Computed 2 invariants in 4 ms
[2024-05-22 23:47:34] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-22 23:47:34] [INFO ] Invariant cache hit.
[2024-05-22 23:47:34] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2024-05-22 23:47:34] [INFO ] Invariant cache hit.
[2024-05-22 23:47:34] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 230/279 places, 272/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 376 ms. Remains : 230/279 places, 272/323 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s136 0) (EQ s198 1)), p1:(OR (EQ s137 0) (EQ s187 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 251 reset in 181 ms.
Product exploration explored 100000 steps with 243 reset in 306 ms.
Computed a total of 44 stabilizing places and 44 stable transitions
Graph (complete) has 466 edges and 230 vertex of which 229 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 44 stabilizing places and 44 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 164 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Finished random walk after 1265 steps, including 2 resets, run visited all 3 properties in 37 ms. (steps per millisecond=34 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (AND p0 p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p1 p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 5 factoid took 181 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Support contains 4 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 272/272 transitions.
Applied a total of 0 rules in 5 ms. Remains 230 /230 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-22 23:47:35] [INFO ] Invariant cache hit.
[2024-05-22 23:47:35] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-22 23:47:35] [INFO ] Invariant cache hit.
[2024-05-22 23:47:35] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2024-05-22 23:47:35] [INFO ] Invariant cache hit.
[2024-05-22 23:47:35] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 326 ms. Remains : 230/230 places, 272/272 transitions.
Computed a total of 44 stabilizing places and 44 stable transitions
Graph (complete) has 466 edges and 230 vertex of which 229 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 44 stabilizing places and 44 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 75 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Finished random walk after 2904 steps, including 6 resets, run visited all 3 properties in 54 ms. (steps per millisecond=53 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p1 p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 5 factoid took 149 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 242 reset in 179 ms.
Product exploration explored 100000 steps with 248 reset in 195 ms.
Built C files in :
/tmp/ltsmin846497793955091116
[2024-05-22 23:47:37] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin846497793955091116
Running compilation step : cd /tmp/ltsmin846497793955091116;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 383 ms.
Running link step : cd /tmp/ltsmin846497793955091116;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin846497793955091116;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15754692941674692786.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 272/272 transitions.
Applied a total of 0 rules in 6 ms. Remains 230 /230 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-22 23:47:52] [INFO ] Invariant cache hit.
[2024-05-22 23:47:52] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-22 23:47:52] [INFO ] Invariant cache hit.
[2024-05-22 23:47:52] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2024-05-22 23:47:52] [INFO ] Invariant cache hit.
[2024-05-22 23:47:52] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 324 ms. Remains : 230/230 places, 272/272 transitions.
Built C files in :
/tmp/ltsmin13241688533594615679
[2024-05-22 23:47:52] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13241688533594615679
Running compilation step : cd /tmp/ltsmin13241688533594615679;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 373 ms.
Running link step : cd /tmp/ltsmin13241688533594615679;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin13241688533594615679;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased811103860212224633.hoa' '--buchi-type=spotba'
LTSmin run took 524 ms.
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-14b-LTLCardinality-10 finished in 19806 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 5 out of 279 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 279/279 places, 323/323 transitions.
Graph (complete) has 543 edges and 279 vertex of which 268 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 267 transition count 273
Reduce places removed 41 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 226 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 225 transition count 272
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 85 place count 225 transition count 229
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 171 place count 182 transition count 229
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 177 place count 176 transition count 223
Iterating global reduction 3 with 6 rules applied. Total rules applied 183 place count 176 transition count 223
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 188 place count 171 transition count 218
Iterating global reduction 3 with 5 rules applied. Total rules applied 193 place count 171 transition count 218
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 198 place count 166 transition count 208
Iterating global reduction 3 with 5 rules applied. Total rules applied 203 place count 166 transition count 208
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 208 place count 161 transition count 203
Iterating global reduction 3 with 5 rules applied. Total rules applied 213 place count 161 transition count 203
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 341 place count 97 transition count 139
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 353 place count 85 transition count 116
Iterating global reduction 3 with 12 rules applied. Total rules applied 365 place count 85 transition count 116
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 377 place count 73 transition count 103
Iterating global reduction 3 with 12 rules applied. Total rules applied 389 place count 73 transition count 103
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 400 place count 62 transition count 81
Iterating global reduction 3 with 11 rules applied. Total rules applied 411 place count 62 transition count 81
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 421 place count 52 transition count 71
Iterating global reduction 3 with 10 rules applied. Total rules applied 431 place count 52 transition count 71
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 440 place count 43 transition count 53
Iterating global reduction 3 with 9 rules applied. Total rules applied 449 place count 43 transition count 53
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 458 place count 34 transition count 44
Iterating global reduction 3 with 9 rules applied. Total rules applied 467 place count 34 transition count 44
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 468 place count 33 transition count 42
Iterating global reduction 3 with 1 rules applied. Total rules applied 469 place count 33 transition count 42
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 470 place count 33 transition count 41
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 472 place count 31 transition count 39
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 35 edges and 29 vertex of which 26 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 5 rules applied. Total rules applied 477 place count 26 transition count 34
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 479 place count 24 transition count 34
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 485 place count 21 transition count 31
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 487 place count 20 transition count 32
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 491 place count 20 transition count 28
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 496 place count 15 transition count 23
Applied a total of 496 rules in 35 ms. Remains 15 /279 variables (removed 264) and now considering 23/323 (removed 300) transitions.
[2024-05-22 23:47:53] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
// Phase 1: matrix 19 rows 15 cols
[2024-05-22 23:47:53] [INFO ] Computed 0 invariants in 1 ms
[2024-05-22 23:47:53] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-22 23:47:53] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
[2024-05-22 23:47:53] [INFO ] Invariant cache hit.
[2024-05-22 23:47:53] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-22 23:47:53] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:47:53] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
[2024-05-22 23:47:53] [INFO ] Invariant cache hit.
[2024-05-22 23:47:53] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/279 places, 23/323 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 110 ms. Remains : 15/279 places, 23/323 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLCardinality-11 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:(OR (EQ s13 0) (EQ s3 1)), p1:(AND (OR (EQ s9 0) (EQ s7 1)) (EQ s11 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 3 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLCardinality-11 finished in 198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 323/323 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 276 transition count 323
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 21 place count 258 transition count 305
Iterating global reduction 1 with 18 rules applied. Total rules applied 39 place count 258 transition count 305
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 44 place count 253 transition count 300
Iterating global reduction 1 with 5 rules applied. Total rules applied 49 place count 253 transition count 300
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 54 place count 248 transition count 294
Iterating global reduction 1 with 5 rules applied. Total rules applied 59 place count 248 transition count 294
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 64 place count 243 transition count 287
Iterating global reduction 1 with 5 rules applied. Total rules applied 69 place count 243 transition count 287
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 74 place count 238 transition count 280
Iterating global reduction 1 with 5 rules applied. Total rules applied 79 place count 238 transition count 280
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 83 place count 234 transition count 276
Iterating global reduction 1 with 4 rules applied. Total rules applied 87 place count 234 transition count 276
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 89 place count 232 transition count 274
Iterating global reduction 1 with 2 rules applied. Total rules applied 91 place count 232 transition count 274
Applied a total of 91 rules in 23 ms. Remains 232 /279 variables (removed 47) and now considering 274/323 (removed 49) transitions.
// Phase 1: matrix 274 rows 232 cols
[2024-05-22 23:47:53] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 23:47:54] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-22 23:47:54] [INFO ] Invariant cache hit.
[2024-05-22 23:47:54] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2024-05-22 23:47:54] [INFO ] Invariant cache hit.
[2024-05-22 23:47:54] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 232/279 places, 274/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 350 ms. Remains : 232/279 places, 274/323 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLCardinality-12 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:(OR (EQ s115 0) (EQ s165 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]]
Product exploration explored 100000 steps with 50000 reset in 163 ms.
Product exploration explored 100000 steps with 50000 reset in 171 ms.
Computed a total of 44 stabilizing places and 44 stable transitions
Graph (complete) has 471 edges and 232 vertex of which 230 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 44 stabilizing places and 44 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-14b-LTLCardinality-12 finished in 812 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0&&F(p1)))))))'
Support contains 3 out of 279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 323/323 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 276 transition count 323
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 20 place count 259 transition count 306
Iterating global reduction 1 with 17 rules applied. Total rules applied 37 place count 259 transition count 306
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 42 place count 254 transition count 301
Iterating global reduction 1 with 5 rules applied. Total rules applied 47 place count 254 transition count 301
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 52 place count 249 transition count 295
Iterating global reduction 1 with 5 rules applied. Total rules applied 57 place count 249 transition count 295
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 62 place count 244 transition count 289
Iterating global reduction 1 with 5 rules applied. Total rules applied 67 place count 244 transition count 289
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 72 place count 239 transition count 281
Iterating global reduction 1 with 5 rules applied. Total rules applied 77 place count 239 transition count 281
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 81 place count 235 transition count 277
Iterating global reduction 1 with 4 rules applied. Total rules applied 85 place count 235 transition count 277
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 88 place count 232 transition count 274
Iterating global reduction 1 with 3 rules applied. Total rules applied 91 place count 232 transition count 274
Applied a total of 91 rules in 20 ms. Remains 232 /279 variables (removed 47) and now considering 274/323 (removed 49) transitions.
// Phase 1: matrix 274 rows 232 cols
[2024-05-22 23:47:54] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 23:47:54] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-22 23:47:54] [INFO ] Invariant cache hit.
[2024-05-22 23:47:54] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2024-05-22 23:47:54] [INFO ] Invariant cache hit.
[2024-05-22 23:47:55] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 232/279 places, 274/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 344 ms. Remains : 232/279 places, 274/323 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p1:(EQ s84 1), p0:(OR (EQ s84 1) (EQ s208 0) (EQ s71 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, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 653 steps with 1 reset in 4 ms.
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLCardinality-13 finished in 569 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(p1))))'
Support contains 3 out of 279 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 279/279 places, 323/323 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 278 transition count 323
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 262 transition count 307
Iterating global reduction 1 with 16 rules applied. Total rules applied 33 place count 262 transition count 307
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 39 place count 256 transition count 301
Iterating global reduction 1 with 6 rules applied. Total rules applied 45 place count 256 transition count 301
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 51 place count 250 transition count 294
Iterating global reduction 1 with 6 rules applied. Total rules applied 57 place count 250 transition count 294
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 63 place count 244 transition count 286
Iterating global reduction 1 with 6 rules applied. Total rules applied 69 place count 244 transition count 286
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 75 place count 238 transition count 277
Iterating global reduction 1 with 6 rules applied. Total rules applied 81 place count 238 transition count 277
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 86 place count 233 transition count 272
Iterating global reduction 1 with 5 rules applied. Total rules applied 91 place count 233 transition count 272
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 94 place count 230 transition count 269
Iterating global reduction 1 with 3 rules applied. Total rules applied 97 place count 230 transition count 269
Applied a total of 97 rules in 20 ms. Remains 230 /279 variables (removed 49) and now considering 269/323 (removed 54) transitions.
// Phase 1: matrix 269 rows 230 cols
[2024-05-22 23:47:55] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 23:47:55] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-22 23:47:55] [INFO ] Invariant cache hit.
[2024-05-22 23:47:55] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2024-05-22 23:47:55] [INFO ] Invariant cache hit.
[2024-05-22 23:47:55] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 230/279 places, 269/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 341 ms. Remains : 230/279 places, 269/323 transitions.
Stuttering acceptance computed with spot in 248 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 1}, { cond=(NOT p0), acceptance={} source=5 dest: 3}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=5, aps=[p1:(AND (EQ s56 0) (EQ s171 1)), p0:(EQ s110 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 242 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14b-LTLCardinality-15 finished in 612 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p1)||p0)))'
Found a Lengthening insensitive property : DiscoveryGPU-PT-14b-LTLCardinality-01
Stuttering acceptance computed with spot in 96 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 6 out of 279 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 279/279 places, 323/323 transitions.
Graph (complete) has 543 edges and 279 vertex of which 272 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 271 transition count 275
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 85 place count 229 transition count 275
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 85 place count 229 transition count 232
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 171 place count 186 transition count 232
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 176 place count 181 transition count 227
Iterating global reduction 2 with 5 rules applied. Total rules applied 181 place count 181 transition count 227
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 185 place count 177 transition count 223
Iterating global reduction 2 with 4 rules applied. Total rules applied 189 place count 177 transition count 223
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 193 place count 173 transition count 215
Iterating global reduction 2 with 4 rules applied. Total rules applied 197 place count 173 transition count 215
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 201 place count 169 transition count 211
Iterating global reduction 2 with 4 rules applied. Total rules applied 205 place count 169 transition count 211
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 331 place count 106 transition count 148
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 342 place count 95 transition count 126
Iterating global reduction 2 with 11 rules applied. Total rules applied 353 place count 95 transition count 126
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 363 place count 85 transition count 116
Iterating global reduction 2 with 10 rules applied. Total rules applied 373 place count 85 transition count 116
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 382 place count 76 transition count 98
Iterating global reduction 2 with 9 rules applied. Total rules applied 391 place count 76 transition count 98
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 400 place count 67 transition count 89
Iterating global reduction 2 with 9 rules applied. Total rules applied 409 place count 67 transition count 89
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 418 place count 58 transition count 71
Iterating global reduction 2 with 9 rules applied. Total rules applied 427 place count 58 transition count 71
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 436 place count 49 transition count 62
Iterating global reduction 2 with 9 rules applied. Total rules applied 445 place count 49 transition count 62
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 446 place count 49 transition count 62
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 448 place count 47 transition count 60
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 54 edges and 45 vertex of which 42 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 12 rules applied. Total rules applied 460 place count 42 transition count 47
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 14 rules applied. Total rules applied 474 place count 33 transition count 42
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 477 place count 30 transition count 42
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 489 place count 24 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 491 place count 23 transition count 35
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 495 place count 19 transition count 31
Applied a total of 495 rules in 28 ms. Remains 19 /279 variables (removed 260) and now considering 31/323 (removed 292) transitions.
[2024-05-22 23:47:56] [INFO ] Flow matrix only has 24 transitions (discarded 7 similar events)
// Phase 1: matrix 24 rows 19 cols
[2024-05-22 23:47:56] [INFO ] Computed 0 invariants in 1 ms
[2024-05-22 23:47:56] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-22 23:47:56] [INFO ] Flow matrix only has 24 transitions (discarded 7 similar events)
[2024-05-22 23:47:56] [INFO ] Invariant cache hit.
[2024-05-22 23:47:56] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-05-22 23:47:56] [INFO ] Flow matrix only has 24 transitions (discarded 7 similar events)
[2024-05-22 23:47:56] [INFO ] Invariant cache hit.
[2024-05-22 23:47:56] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 19/279 places, 31/323 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 116 ms. Remains : 19/279 places, 31/323 transitions.
Running random walk in product with property : DiscoveryGPU-PT-14b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s7 0) (EQ s13 1) (EQ s10 0) (EQ s17 1)), p1:(OR (EQ s3 0) (EQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 92 steps with 3 reset in 0 ms.
Treatment of property DiscoveryGPU-PT-14b-LTLCardinality-01 finished in 362 ms.
FORMULA DiscoveryGPU-PT-14b-LTLCardinality-01 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-22 23:47:56] [INFO ] Flatten gal took : 11 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 121834 ms.

BK_STOP 1716421677645

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-14b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is DiscoveryGPU-PT-14b, 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 r153-tall-171631151500312"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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