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-171631151500278.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-11a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-171631151500278
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K 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.6K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 02:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 12 02:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 02:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 125K Apr 12 02:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 39K 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-11a-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716421277048

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-11a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-22 23:41:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 23:41:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:41:18] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2024-05-22 23:41:18] [INFO ] Transformed 113 places.
[2024-05-22 23:41:18] [INFO ] Transformed 155 transitions.
[2024-05-22 23:41:18] [INFO ] Found NUPN structural information;
[2024-05-22 23:41:18] [INFO ] Parsed PT model containing 113 places and 155 transitions and 498 arcs in 113 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Support contains 37 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 155/155 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 108 transition count 150
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 108 transition count 150
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 105 transition count 147
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 105 transition count 147
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 104 transition count 145
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 104 transition count 145
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 28 place count 104 transition count 135
Applied a total of 28 rules in 25 ms. Remains 104 /113 variables (removed 9) and now considering 135/155 (removed 20) transitions.
// Phase 1: matrix 135 rows 104 cols
[2024-05-22 23:41:19] [INFO ] Computed 2 invariants in 6 ms
[2024-05-22 23:41:19] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-22 23:41:19] [INFO ] Invariant cache hit.
[2024-05-22 23:41:19] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-22 23:41:19] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2024-05-22 23:41:19] [INFO ] Invariant cache hit.
[2024-05-22 23:41:19] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 104/113 places, 135/155 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 402 ms. Remains : 104/113 places, 135/155 transitions.
Support contains 37 out of 104 places after structural reductions.
[2024-05-22 23:41:19] [INFO ] Flatten gal took : 30 ms
[2024-05-22 23:41:19] [INFO ] Flatten gal took : 11 ms
[2024-05-22 23:41:19] [INFO ] Input system was already deterministic with 135 transitions.
Support contains 35 out of 104 places (down from 37) after GAL structural reductions.
Finished random walk after 498 steps, including 4 resets, run visited all 33 properties in 70 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 14 stabilizing places and 12 stable transitions
Graph (complete) has 299 edges and 104 vertex of which 98 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 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 U (p1||G(p0))))))))'
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 135/135 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 95 transition count 126
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 95 transition count 126
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 88 transition count 119
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 88 transition count 119
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 83 transition count 114
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 83 transition count 114
Applied a total of 42 rules in 12 ms. Remains 83 /104 variables (removed 21) and now considering 114/135 (removed 21) transitions.
// Phase 1: matrix 114 rows 83 cols
[2024-05-22 23:41:20] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 23:41:20] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-22 23:41:20] [INFO ] Invariant cache hit.
[2024-05-22 23:41:20] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 23:41:20] [INFO ] Implicit Places using invariants and state equation in 113 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 180 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/104 places, 114/135 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 195 ms. Remains : 82/104 places, 114/135 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 392 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (NOT (OR (EQ s74 1) (EQ s48 1))) (NEQ s0 1)), p0:(NEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 378 ms.
Product exploration explored 100000 steps with 25000 reset in 200 ms.
Computed a total of 13 stabilizing places and 12 stable transitions
Graph (complete) has 226 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 12 stable transitions
Detected a total of 13/82 stabilizing places and 12/114 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 70 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=23 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 169 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 114 rows 82 cols
[2024-05-22 23:41:22] [INFO ] Computed 1 invariants in 4 ms
[2024-05-22 23:41:22] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-22 23:41:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:41:22] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-22 23:41:22] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-22 23:41:22] [INFO ] [Real]Added 56 Read/Feed constraints in 18 ms returned sat
[2024-05-22 23:41:22] [INFO ] Computed and/alt/rep : 112/190/112 causal constraints (skipped 1 transitions) in 10 ms.
[2024-05-22 23:41:22] [INFO ] Added : 0 causal constraints over 0 iterations in 24 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 114/114 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-05-22 23:41:22] [INFO ] Invariant cache hit.
[2024-05-22 23:41:22] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-22 23:41:22] [INFO ] Invariant cache hit.
[2024-05-22 23:41:22] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-22 23:41:22] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2024-05-22 23:41:22] [INFO ] Invariant cache hit.
[2024-05-22 23:41:22] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 196 ms. Remains : 82/82 places, 114/114 transitions.
Computed a total of 13 stabilizing places and 12 stable transitions
Graph (complete) has 226 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 12 stable transitions
Detected a total of 13/82 stabilizing places and 12/114 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 57 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=28 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 199 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-22 23:41:23] [INFO ] Invariant cache hit.
[2024-05-22 23:41:23] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 23:41:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:41:23] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-22 23:41:23] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-22 23:41:23] [INFO ] [Real]Added 56 Read/Feed constraints in 22 ms returned sat
[2024-05-22 23:41:23] [INFO ] Computed and/alt/rep : 112/190/112 causal constraints (skipped 1 transitions) in 11 ms.
[2024-05-22 23:41:23] [INFO ] Added : 0 causal constraints over 0 iterations in 25 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 177 ms.
Product exploration explored 100000 steps with 25000 reset in 207 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 114/114 transitions.
Graph (complete) has 226 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 81 transition count 113
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 81 transition count 113
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 0 with 21 rules applied. Total rules applied 23 place count 81 transition count 134
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 32 place count 72 transition count 116
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 0 with 9 rules applied. Total rules applied 41 place count 72 transition count 116
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 58 place count 55 transition count 82
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 0 with 17 rules applied. Total rules applied 75 place count 55 transition count 82
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 83 place count 47 transition count 74
Deduced a syphon composed of 13 places in 1 ms
Iterating global reduction 0 with 8 rules applied. Total rules applied 91 place count 47 transition count 74
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 99 place count 39 transition count 58
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 0 with 8 rules applied. Total rules applied 107 place count 39 transition count 58
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 123 place count 23 transition count 34
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 0 with 16 rules applied. Total rules applied 139 place count 23 transition count 34
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 139 rules in 39 ms. Remains 23 /82 variables (removed 59) and now considering 34/114 (removed 80) transitions.
[2024-05-22 23:41:24] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 23:41:24] [INFO ] Flow matrix only has 31 transitions (discarded 3 similar events)
// Phase 1: matrix 31 rows 23 cols
[2024-05-22 23:41:24] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 23:41:24] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/82 places, 34/114 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 84 ms. Remains : 23/82 places, 34/114 transitions.
Built C files in :
/tmp/ltsmin16142507362435688598
[2024-05-22 23:41:24] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16142507362435688598
Running compilation step : cd /tmp/ltsmin16142507362435688598;'/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 338 ms.
Running link step : cd /tmp/ltsmin16142507362435688598;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin16142507362435688598;'/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/stateBased2270721915407360331.hoa' '--buchi-type=spotba'
LTSmin run took 261 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-00 finished in 5066 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(F(p0)))||(F(p1) U p2)))'
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 135/135 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 95 transition count 126
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 95 transition count 126
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 88 transition count 119
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 88 transition count 119
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 83 transition count 114
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 83 transition count 114
Applied a total of 42 rules in 11 ms. Remains 83 /104 variables (removed 21) and now considering 114/135 (removed 21) transitions.
// Phase 1: matrix 114 rows 83 cols
[2024-05-22 23:41:25] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 23:41:25] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-22 23:41:25] [INFO ] Invariant cache hit.
[2024-05-22 23:41:25] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 23:41:25] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2024-05-22 23:41:25] [INFO ] Invariant cache hit.
[2024-05-22 23:41:25] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 83/104 places, 114/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 221 ms. Remains : 83/104 places, 114/135 transitions.
Stuttering acceptance computed with spot in 308 ms :[(AND (NOT p0) (NOT p2)), (AND p2 (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s11 1) (EQ s82 1)), p1:(AND (EQ s39 1) (EQ s82 1)), p0:(OR (EQ s11 0) (EQ s82 0))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 39983 reset in 178 ms.
Product exploration explored 100000 steps with 39994 reset in 192 ms.
Computed a total of 14 stabilizing places and 12 stable transitions
Graph (complete) has 262 edges and 83 vertex of which 82 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 14 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT p2)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 18 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-11a-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-01 finished in 944 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&&F(p1)))&&(!p2 U (p3||G(!p2)))))'
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 135/135 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 97 transition count 128
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 97 transition count 128
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 92 transition count 123
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 92 transition count 123
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 89 transition count 120
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 89 transition count 120
Applied a total of 30 rules in 10 ms. Remains 89 /104 variables (removed 15) and now considering 120/135 (removed 15) transitions.
// Phase 1: matrix 120 rows 89 cols
[2024-05-22 23:41:26] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 23:41:26] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-22 23:41:26] [INFO ] Invariant cache hit.
[2024-05-22 23:41:26] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-22 23:41:26] [INFO ] Implicit Places using invariants and state equation in 85 ms returned [88]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 133 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 88/104 places, 120/135 transitions.
Applied a total of 0 rules in 1 ms. Remains 88 /88 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 146 ms. Remains : 88/104 places, 120/135 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p1) (NOT p0) (AND p2 (NOT p3))), true, (OR (NOT p0) (NOT p1)), (AND (NOT p3) p2), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 1}, { cond=(OR p3 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(AND (NEQ s11 1) (NOT (AND (EQ s36 1) (EQ s87 1)))), p2:(AND (EQ s36 1) (EQ s87 1)), p0:(EQ s77 0), p1:(AND (EQ s59 1) (EQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2061 reset in 151 ms.
Stack based approach found an accepted trace after 24 steps with 1 reset with depth 11 and stack size 11 in 1 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-02 finished in 513 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)))))'
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 135/135 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 95 transition count 126
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 95 transition count 126
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 88 transition count 119
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 88 transition count 119
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 83 transition count 114
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 83 transition count 114
Applied a total of 42 rules in 10 ms. Remains 83 /104 variables (removed 21) and now considering 114/135 (removed 21) transitions.
// Phase 1: matrix 114 rows 83 cols
[2024-05-22 23:41:26] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:41:26] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-22 23:41:26] [INFO ] Invariant cache hit.
[2024-05-22 23:41:26] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 23:41:26] [INFO ] Implicit Places using invariants and state equation in 97 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 154 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/104 places, 114/135 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 165 ms. Remains : 82/104 places, 114/135 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s42 0) (EQ s81 0))], 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 25000 reset in 151 ms.
Product exploration explored 100000 steps with 25000 reset in 145 ms.
Computed a total of 13 stabilizing places and 12 stable transitions
Graph (complete) has 226 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 26 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 114/114 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 114/114 (removed 0) transitions.
// Phase 1: matrix 114 rows 82 cols
[2024-05-22 23:41:28] [INFO ] Computed 1 invariants in 3 ms
[2024-05-22 23:41:28] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-22 23:41:28] [INFO ] Invariant cache hit.
[2024-05-22 23:41:28] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-22 23:41:28] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-05-22 23:41:28] [INFO ] Invariant cache hit.
[2024-05-22 23:41:28] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 170 ms. Remains : 82/82 places, 114/114 transitions.
Computed a total of 13 stabilizing places and 12 stable transitions
Graph (complete) has 226 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 53 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=26 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 136 ms.
Product exploration explored 100000 steps with 25000 reset in 144 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 114/114 transitions.
Graph (complete) has 226 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 81 transition count 113
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 81 transition count 113
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 0 with 21 rules applied. Total rules applied 23 place count 81 transition count 134
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 33 place count 71 transition count 114
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 0 with 10 rules applied. Total rules applied 43 place count 71 transition count 114
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 63 place count 51 transition count 74
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 0 with 20 rules applied. Total rules applied 83 place count 51 transition count 74
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 92 place count 42 transition count 65
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 0 with 9 rules applied. Total rules applied 101 place count 42 transition count 65
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 110 place count 33 transition count 47
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 0 with 9 rules applied. Total rules applied 119 place count 33 transition count 47
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 137 place count 15 transition count 20
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 18 rules applied. Total rules applied 155 place count 15 transition count 20
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 155 rules in 18 ms. Remains 15 /82 variables (removed 67) and now considering 20/114 (removed 94) transitions.
[2024-05-22 23:41:29] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:41:29] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
// Phase 1: matrix 19 rows 15 cols
[2024-05-22 23:41:29] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 23:41:29] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/82 places, 20/114 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57 ms. Remains : 15/82 places, 20/114 transitions.
Built C files in :
/tmp/ltsmin12528948090785085936
[2024-05-22 23:41:29] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12528948090785085936
Running compilation step : cd /tmp/ltsmin12528948090785085936;'/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 184 ms.
Running link step : cd /tmp/ltsmin12528948090785085936;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin12528948090785085936;'/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/stateBased7964021905709965918.hoa' '--buchi-type=spotba'
LTSmin run took 247 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-03 finished in 3416 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))&&F(p2))))'
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 135/135 transitions.
Graph (complete) has 299 edges and 104 vertex of which 98 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 1 place count 98 transition count 121
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 17 place count 90 transition count 121
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 26 place count 81 transition count 112
Iterating global reduction 0 with 9 rules applied. Total rules applied 35 place count 81 transition count 112
Applied a total of 35 rules in 12 ms. Remains 81 /104 variables (removed 23) and now considering 112/135 (removed 23) transitions.
// Phase 1: matrix 112 rows 81 cols
[2024-05-22 23:41:30] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 23:41:30] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-22 23:41:30] [INFO ] Invariant cache hit.
[2024-05-22 23:41:30] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 23:41:30] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2024-05-22 23:41:30] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 23:41:30] [INFO ] Invariant cache hit.
[2024-05-22 23:41:30] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/104 places, 112/135 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 177 ms. Remains : 81/104 places, 112/135 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-04 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 p2), acceptance={} source=0 dest: 3}], [{ 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}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s55 1) (EQ s80 1) (EQ s14 1) (EQ s79 1)), p1:(AND (EQ s14 1) (EQ s79 1)), p2:(AND (EQ s4 1) (EQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 182 steps with 2 reset in 1 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-04 finished in 361 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&&(F(G(!p1)) U p2)&&X(p0)))))'
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 135/135 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 96 transition count 127
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 96 transition count 127
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 90 transition count 121
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 90 transition count 121
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 85 transition count 116
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 85 transition count 116
Applied a total of 38 rules in 5 ms. Remains 85 /104 variables (removed 19) and now considering 116/135 (removed 19) transitions.
// Phase 1: matrix 116 rows 85 cols
[2024-05-22 23:41:30] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 23:41:30] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-22 23:41:30] [INFO ] Invariant cache hit.
[2024-05-22 23:41:30] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-22 23:41:30] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2024-05-22 23:41:30] [INFO ] Invariant cache hit.
[2024-05-22 23:41:30] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/104 places, 116/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 205 ms. Remains : 85/104 places, 116/135 transitions.
Stuttering acceptance computed with spot in 288 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (NOT p2), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={0} source=1 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p2) p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND p0 p2 p1), acceptance={0} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 2}]], initial=0, aps=[p0:(EQ s27 1), p2:(AND (EQ s67 1) (EQ s83 1)), p1:(AND (EQ s39 1) (EQ s84 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1873 steps with 18 reset in 6 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-05 finished in 528 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(((F(p0) U p1)&&X(X(p2))))))'
Support contains 4 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 135/135 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 95 transition count 126
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 95 transition count 126
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 88 transition count 119
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 88 transition count 119
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 83 transition count 114
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 83 transition count 114
Applied a total of 42 rules in 6 ms. Remains 83 /104 variables (removed 21) and now considering 114/135 (removed 21) transitions.
// Phase 1: matrix 114 rows 83 cols
[2024-05-22 23:41:31] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:41:31] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-22 23:41:31] [INFO ] Invariant cache hit.
[2024-05-22 23:41:31] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 23:41:31] [INFO ] Implicit Places using invariants and state equation in 88 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 131 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/104 places, 114/135 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 139 ms. Remains : 82/104 places, 114/135 transitions.
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (NOT p2), true]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s7 1) (EQ s81 1)), p0:(AND (EQ s70 1) (EQ s81 1)), p2:(OR (EQ s33 0) (EQ s81 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 79139 steps with 2412 reset in 106 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-06 finished in 538 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))||G(p1)))'
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 135/135 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 96 transition count 127
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 96 transition count 127
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 89 transition count 120
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 89 transition count 120
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 84 transition count 115
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 84 transition count 115
Applied a total of 40 rules in 7 ms. Remains 84 /104 variables (removed 20) and now considering 115/135 (removed 20) transitions.
// Phase 1: matrix 115 rows 84 cols
[2024-05-22 23:41:31] [INFO ] Computed 2 invariants in 5 ms
[2024-05-22 23:41:31] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-22 23:41:31] [INFO ] Invariant cache hit.
[2024-05-22 23:41:31] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 23:41:31] [INFO ] Implicit Places using invariants and state equation in 83 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 135 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 83/104 places, 115/135 transitions.
Applied a total of 0 rules in 0 ms. Remains 83 /83 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 144 ms. Remains : 83/104 places, 115/135 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s3 0), p1:(AND (EQ s64 1) (EQ s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 190 ms.
Product exploration explored 100000 steps with 50000 reset in 205 ms.
Computed a total of 13 stabilizing places and 12 stable transitions
Graph (complete) has 227 edges and 83 vertex of which 82 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 17 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-11a-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-07 finished in 719 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((X((p0||F(G(p0))))||(p1 U p2)))))'
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 135/135 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 96 transition count 127
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 96 transition count 127
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 90 transition count 121
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 90 transition count 121
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 85 transition count 116
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 85 transition count 116
Applied a total of 38 rules in 5 ms. Remains 85 /104 variables (removed 19) and now considering 116/135 (removed 19) transitions.
// Phase 1: matrix 116 rows 85 cols
[2024-05-22 23:41:32] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:41:32] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-22 23:41:32] [INFO ] Invariant cache hit.
[2024-05-22 23:41:32] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-22 23:41:32] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-05-22 23:41:32] [INFO ] Invariant cache hit.
[2024-05-22 23:41:32] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/104 places, 116/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 185 ms. Remains : 85/104 places, 116/135 transitions.
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=1 dest: 2}, { cond=(NOT p0), acceptance={1} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={1} source=2 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={1} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s25 1) (EQ s84 1)), p1:(AND (EQ s53 1) (EQ s83 1)), p0:(AND (EQ s57 1) (EQ s83 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 476 steps with 6 reset in 3 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-08 finished in 427 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(G(p1))))'
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 135/135 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 95 transition count 126
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 95 transition count 126
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 88 transition count 119
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 88 transition count 119
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 83 transition count 114
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 83 transition count 114
Applied a total of 42 rules in 3 ms. Remains 83 /104 variables (removed 21) and now considering 114/135 (removed 21) transitions.
// Phase 1: matrix 114 rows 83 cols
[2024-05-22 23:41:32] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:41:32] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-22 23:41:32] [INFO ] Invariant cache hit.
[2024-05-22 23:41:32] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 23:41:32] [INFO ] Implicit Places using invariants and state equation in 87 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 136 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/104 places, 114/135 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 140 ms. Remains : 82/104 places, 114/135 transitions.
Stuttering acceptance computed with spot in 188 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(EQ s32 1), p1:(AND (EQ s5 1) (EQ s81 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-09 finished in 349 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 (G(!p0)||(X(G(p2))&&p1))))'
Support contains 4 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 135/135 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 96 transition count 127
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 96 transition count 127
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 90 transition count 121
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 90 transition count 121
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 86 transition count 117
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 86 transition count 117
Applied a total of 36 rules in 6 ms. Remains 86 /104 variables (removed 18) and now considering 117/135 (removed 18) transitions.
// Phase 1: matrix 117 rows 86 cols
[2024-05-22 23:41:33] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 23:41:33] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-22 23:41:33] [INFO ] Invariant cache hit.
[2024-05-22 23:41:33] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-22 23:41:33] [INFO ] Implicit Places using invariants and state equation in 87 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 132 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 85/104 places, 117/135 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 117/117 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 140 ms. Remains : 85/104 places, 117/135 transitions.
Stuttering acceptance computed with spot in 159 ms :[true, (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (NOT p2), (AND p0 (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(OR (AND p1 p0) (AND p0 p2)), acceptance={} source=3 dest: 2}, { cond=(OR (AND p1 (NOT p0)) (AND (NOT p0) p2)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (NOT (AND (EQ s55 1) (EQ s84 1))) (EQ s60 1)), p0:(AND (EQ s55 1) (EQ s84 1)), p2:(NEQ s0 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 35 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-10 finished in 322 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((F(p1)&&p0))))'
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 135/135 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 96 transition count 127
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 96 transition count 127
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 90 transition count 121
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 90 transition count 121
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 86 transition count 117
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 86 transition count 117
Applied a total of 36 rules in 5 ms. Remains 86 /104 variables (removed 18) and now considering 117/135 (removed 18) transitions.
// Phase 1: matrix 117 rows 86 cols
[2024-05-22 23:41:33] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:41:33] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-22 23:41:33] [INFO ] Invariant cache hit.
[2024-05-22 23:41:33] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-22 23:41:33] [INFO ] Implicit Places using invariants and state equation in 91 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 141 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 85/104 places, 117/135 transitions.
Applied a total of 0 rules in 0 ms. Remains 85 /85 variables (removed 0) and now considering 117/117 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 149 ms. Remains : 85/104 places, 117/135 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s43 1) (EQ s84 1) (EQ s6 1)), p1:(OR (EQ s39 1) (AND (EQ s43 1) (EQ s84 1)) (AND (EQ s51 1) (EQ s84 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-11 finished in 321 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 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 135/135 transitions.
Graph (complete) has 299 edges and 104 vertex of which 98 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 109 edges and 95 vertex of which 78 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 17 output transitions
Drop transitions removed 17 transitions
Graph (trivial) has 86 edges and 78 vertex of which 42 / 78 are part of one of the 21 SCC in 3 ms
Free SCC test removed 21 places
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 57 transition count 100
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 48 place count 46 transition count 79
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 56 place count 38 transition count 63
Iterating global reduction 2 with 8 rules applied. Total rules applied 64 place count 38 transition count 63
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 72 place count 30 transition count 47
Iterating global reduction 2 with 8 rules applied. Total rules applied 80 place count 30 transition count 47
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 88 place count 22 transition count 31
Iterating global reduction 2 with 8 rules applied. Total rules applied 96 place count 22 transition count 31
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 104 place count 14 transition count 23
Iterating global reduction 2 with 8 rules applied. Total rules applied 112 place count 14 transition count 23
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 2 with 6 rules applied. Total rules applied 118 place count 11 transition count 20
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 11 transition count 19
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 122 place count 8 transition count 16
Applied a total of 122 rules in 20 ms. Remains 8 /104 variables (removed 96) and now considering 16/135 (removed 119) transitions.
[2024-05-22 23:41:33] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
// Phase 1: matrix 12 rows 8 cols
[2024-05-22 23:41:33] [INFO ] Computed 0 invariants in 1 ms
[2024-05-22 23:41:33] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-22 23:41:33] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
[2024-05-22 23:41:33] [INFO ] Invariant cache hit.
[2024-05-22 23:41:33] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-22 23:41:33] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:41:33] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
[2024-05-22 23:41:33] [INFO ] Invariant cache hit.
[2024-05-22 23:41:33] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/104 places, 16/135 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 97 ms. Remains : 8/104 places, 16/135 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s5 0) (EQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-12 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' '!(X((X(G(p0)) U (p1&&X(G(p0))))))'
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 135/135 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 96 transition count 127
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 96 transition count 127
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 90 transition count 121
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 90 transition count 121
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 87 transition count 118
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 87 transition count 118
Applied a total of 34 rules in 6 ms. Remains 87 /104 variables (removed 17) and now considering 118/135 (removed 17) transitions.
// Phase 1: matrix 118 rows 87 cols
[2024-05-22 23:41:33] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:41:33] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 23:41:33] [INFO ] Invariant cache hit.
[2024-05-22 23:41:33] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-22 23:41:34] [INFO ] Implicit Places using invariants and state equation in 100 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 144 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 86/104 places, 118/135 transitions.
Applied a total of 0 rules in 1 ms. Remains 86 /86 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 153 ms. Remains : 86/104 places, 118/135 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s77 1), p0:(EQ s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-13 finished in 300 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 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 135/135 transitions.
Graph (complete) has 299 edges and 104 vertex of which 98 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 109 edges and 95 vertex of which 77 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 18 output transitions
Drop transitions removed 18 transitions
Graph (trivial) has 86 edges and 77 vertex of which 44 / 77 are part of one of the 22 SCC in 0 ms
Free SCC test removed 22 places
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 55 transition count 100
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 47 place count 45 transition count 78
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 57 place count 35 transition count 58
Iterating global reduction 2 with 10 rules applied. Total rules applied 67 place count 35 transition count 58
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 76 place count 26 transition count 40
Iterating global reduction 2 with 9 rules applied. Total rules applied 85 place count 26 transition count 40
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 94 place count 17 transition count 22
Iterating global reduction 2 with 9 rules applied. Total rules applied 103 place count 17 transition count 22
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 112 place count 8 transition count 13
Iterating global reduction 2 with 9 rules applied. Total rules applied 121 place count 8 transition count 13
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 2 with 2 rules applied. Total rules applied 123 place count 7 transition count 12
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 125 place count 7 transition count 10
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 127 place count 5 transition count 8
Applied a total of 127 rules in 20 ms. Remains 5 /104 variables (removed 99) and now considering 8/135 (removed 127) transitions.
[2024-05-22 23:41:34] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
// Phase 1: matrix 6 rows 5 cols
[2024-05-22 23:41:34] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 23:41:34] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-22 23:41:34] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2024-05-22 23:41:34] [INFO ] Invariant cache hit.
[2024-05-22 23:41:34] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-05-22 23:41:34] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:41:34] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2024-05-22 23:41:34] [INFO ] Invariant cache hit.
[2024-05-22 23:41:34] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/104 places, 8/135 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91 ms. Remains : 5/104 places, 8/135 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s2 0)], 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 3 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-14 finished in 164 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)))))'
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 135/135 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 95 transition count 126
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 95 transition count 126
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 88 transition count 119
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 88 transition count 119
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 84 transition count 115
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 84 transition count 115
Applied a total of 40 rules in 6 ms. Remains 84 /104 variables (removed 20) and now considering 115/135 (removed 20) transitions.
// Phase 1: matrix 115 rows 84 cols
[2024-05-22 23:41:34] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:41:34] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-22 23:41:34] [INFO ] Invariant cache hit.
[2024-05-22 23:41:34] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 23:41:34] [INFO ] Implicit Places using invariants and state equation in 98 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 145 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 83/104 places, 115/135 transitions.
Applied a total of 0 rules in 0 ms. Remains 83 /83 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 154 ms. Remains : 83/104 places, 115/135 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s39 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 408 steps with 3 reset in 6 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-15 finished in 333 ms.
All properties solved by simple procedures.
Total runtime 16112 ms.

BK_STOP 1716421295828

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-11a"
export BK_EXAMINATION="LTLFireability"
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-11a, examination is LTLFireability"
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-171631151500278"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-11a.tgz
mv DiscoveryGPU-PT-11a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;