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.r329-tall-171662362300462.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 RefineWMG-PT-050050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-171662362300462
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K 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 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Apr 13 05:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 13 05:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 13 05:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 13 05:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 110K May 18 16:43 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 RefineWMG-PT-050050-LTLCardinality-00
FORMULA_NAME RefineWMG-PT-050050-LTLCardinality-01
FORMULA_NAME RefineWMG-PT-050050-LTLCardinality-02
FORMULA_NAME RefineWMG-PT-050050-LTLCardinality-03
FORMULA_NAME RefineWMG-PT-050050-LTLCardinality-04
FORMULA_NAME RefineWMG-PT-050050-LTLCardinality-05
FORMULA_NAME RefineWMG-PT-050050-LTLCardinality-06
FORMULA_NAME RefineWMG-PT-050050-LTLCardinality-07
FORMULA_NAME RefineWMG-PT-050050-LTLCardinality-08
FORMULA_NAME RefineWMG-PT-050050-LTLCardinality-09
FORMULA_NAME RefineWMG-PT-050050-LTLCardinality-10
FORMULA_NAME RefineWMG-PT-050050-LTLCardinality-11
FORMULA_NAME RefineWMG-PT-050050-LTLCardinality-12
FORMULA_NAME RefineWMG-PT-050050-LTLCardinality-13
FORMULA_NAME RefineWMG-PT-050050-LTLCardinality-14
FORMULA_NAME RefineWMG-PT-050050-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716863459822

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RefineWMG-PT-050050
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-28 02:31:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 02:31:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 02:31:01] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2024-05-28 02:31:01] [INFO ] Transformed 254 places.
[2024-05-28 02:31:01] [INFO ] Transformed 203 transitions.
[2024-05-28 02:31:01] [INFO ] Parsed PT model containing 254 places and 203 transitions and 608 arcs in 116 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA RefineWMG-PT-050050-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050050-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 24 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2024-05-28 02:31:01] [INFO ] Computed 102 invariants in 11 ms
[2024-05-28 02:31:02] [INFO ] Dead Transitions using invariants and state equation in 484 ms found 0 transitions.
[2024-05-28 02:31:02] [INFO ] Invariant cache hit.
[2024-05-28 02:31:02] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-28 02:31:02] [INFO ] Invariant cache hit.
[2024-05-28 02:31:02] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2024-05-28 02:31:02] [INFO ] Invariant cache hit.
[2024-05-28 02:31:02] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 914 ms. Remains : 254/254 places, 203/203 transitions.
Support contains 43 out of 254 places after structural reductions.
[2024-05-28 02:31:02] [INFO ] Flatten gal took : 60 ms
[2024-05-28 02:31:02] [INFO ] Flatten gal took : 16 ms
[2024-05-28 02:31:02] [INFO ] Input system was already deterministic with 203 transitions.
Incomplete random walk after 10023 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 29) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2024-05-28 02:31:03] [INFO ] Invariant cache hit.
[2024-05-28 02:31:03] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2024-05-28 02:31:03] [INFO ] [Nat]Absence check using 102 positive place invariants in 13 ms returned sat
[2024-05-28 02:31:03] [INFO ] After 410ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2024-05-28 02:31:04] [INFO ] After 806ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 240 ms.
[2024-05-28 02:31:04] [INFO ] After 1266ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Finished Parikh walk after 5869 steps, including 1 resets, run visited all 11 properties in 133 ms. (steps per millisecond=44 )
Parikh walk visited 18 properties in 338 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
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(p0) U X(((p1 U (G(p1)||(p1&&G(p2)))) U (G(p1)||(!p0&&(p1 U (G(p1)||(p1&&G(p2))))))))))'
Support contains 6 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 15 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2024-05-28 02:31:05] [INFO ] Invariant cache hit.
[2024-05-28 02:31:05] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
[2024-05-28 02:31:05] [INFO ] Invariant cache hit.
[2024-05-28 02:31:05] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-28 02:31:05] [INFO ] Invariant cache hit.
[2024-05-28 02:31:05] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2024-05-28 02:31:05] [INFO ] Invariant cache hit.
[2024-05-28 02:31:05] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 468 ms. Remains : 254/254 places, 203/203 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 533 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : RefineWMG-PT-050050-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={1} source=2 dest: 2}, { cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=2 dest: 5}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 7}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=5 dest: 1}, { cond=(NOT p1), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={1} source=5 dest: 5}, { cond=(AND p1 p2), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={1} source=6 dest: 5}, { cond=(AND p1 p2), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) p2), acceptance={0} source=6 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=8 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=8 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=8 dest: 5}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=8 dest: 6}, { cond=(AND p0 p1 p2), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p1) p2), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p0:(LEQ s109 s127), p1:(GT s27 s144), p2:(GT s84 s2)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 814 ms.
Stack based approach found an accepted trace after 39879 steps with 1 reset with depth 21576 and stack size 3808 in 346 ms.
FORMULA RefineWMG-PT-050050-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-050050-LTLCardinality-00 finished in 2229 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)||X(X((p1||F(G(p1))))))))'
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 145 edges and 254 vertex of which 96 / 254 are part of one of the 48 SCC in 5 ms
Free SCC test removed 48 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 158 transition count 108
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 1 with 147 rules applied. Total rules applied 195 place count 60 transition count 59
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 1 with 43 rules applied. Total rules applied 238 place count 60 transition count 16
Reduce places removed 43 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 44 rules applied. Total rules applied 282 place count 17 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 283 place count 16 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 283 place count 16 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 287 place count 14 transition count 13
Applied a total of 287 rules in 26 ms. Remains 14 /254 variables (removed 240) and now considering 13/203 (removed 190) transitions.
// Phase 1: matrix 13 rows 14 cols
[2024-05-28 02:31:07] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 02:31:07] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
[2024-05-28 02:31:07] [INFO ] Invariant cache hit.
[2024-05-28 02:31:07] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-28 02:31:07] [INFO ] Invariant cache hit.
[2024-05-28 02:31:07] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-28 02:31:07] [INFO ] Redundant transitions in 16 ms returned []
[2024-05-28 02:31:07] [INFO ] Invariant cache hit.
[2024-05-28 02:31:07] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/254 places, 13/203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 164 ms. Remains : 14/254 places, 13/203 transitions.
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))]
Running random walk in product with property : RefineWMG-PT-050050-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s5 s7), p1:(LEQ s13 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 210 ms.
Product exploration explored 100000 steps with 0 reset in 138 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10048 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=669 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 804475 steps, run timeout after 3001 ms. (steps per millisecond=268 ) properties seen :{}
Probabilistic random walk after 804475 steps, saw 394284 distinct states, run finished after 3002 ms. (steps per millisecond=267 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-28 02:31:11] [INFO ] Invariant cache hit.
[2024-05-28 02:31:11] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 02:31:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-28 02:31:11] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-28 02:31:11] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-28 02:31:11] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 242 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=242 )
Parikh walk visited 2 properties in 4 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 3 factoid took 156 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 13/13 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2024-05-28 02:31:11] [INFO ] Invariant cache hit.
[2024-05-28 02:31:11] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2024-05-28 02:31:11] [INFO ] Invariant cache hit.
[2024-05-28 02:31:11] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-28 02:31:11] [INFO ] Invariant cache hit.
[2024-05-28 02:31:11] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-28 02:31:11] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-28 02:31:11] [INFO ] Invariant cache hit.
[2024-05-28 02:31:11] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 133 ms. Remains : 14/14 places, 13/13 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 75 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10006 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 733707 steps, run timeout after 3001 ms. (steps per millisecond=244 ) properties seen :{}
Probabilistic random walk after 733707 steps, saw 360152 distinct states, run finished after 3001 ms. (steps per millisecond=244 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-28 02:31:15] [INFO ] Invariant cache hit.
[2024-05-28 02:31:15] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 02:31:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-28 02:31:15] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-28 02:31:15] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-28 02:31:15] [INFO ] After 48ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 242 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=121 )
Parikh walk visited 2 properties in 4 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 135 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 112 ms.
Product exploration explored 100000 steps with 0 reset in 156 ms.
Built C files in :
/tmp/ltsmin11221697868348913928
[2024-05-28 02:31:15] [INFO ] Computing symmetric may disable matrix : 13 transitions.
[2024-05-28 02:31:15] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:31:15] [INFO ] Computing symmetric may enable matrix : 13 transitions.
[2024-05-28 02:31:15] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:31:15] [INFO ] Computing Do-Not-Accords matrix : 13 transitions.
[2024-05-28 02:31:15] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:31:15] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11221697868348913928
Running compilation step : cd /tmp/ltsmin11221697868348913928;'/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 242 ms.
Running link step : cd /tmp/ltsmin11221697868348913928;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin11221697868348913928;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11307485068932570090.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 13/13 transitions.
Applied a total of 0 rules in 3 ms. Remains 14 /14 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2024-05-28 02:31:31] [INFO ] Invariant cache hit.
[2024-05-28 02:31:31] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2024-05-28 02:31:31] [INFO ] Invariant cache hit.
[2024-05-28 02:31:31] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-28 02:31:31] [INFO ] Invariant cache hit.
[2024-05-28 02:31:31] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-05-28 02:31:31] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-28 02:31:31] [INFO ] Invariant cache hit.
[2024-05-28 02:31:31] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 146 ms. Remains : 14/14 places, 13/13 transitions.
Built C files in :
/tmp/ltsmin17101076858021494905
[2024-05-28 02:31:31] [INFO ] Computing symmetric may disable matrix : 13 transitions.
[2024-05-28 02:31:31] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:31:31] [INFO ] Computing symmetric may enable matrix : 13 transitions.
[2024-05-28 02:31:31] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:31:31] [INFO ] Computing Do-Not-Accords matrix : 13 transitions.
[2024-05-28 02:31:31] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:31:31] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17101076858021494905
Running compilation step : cd /tmp/ltsmin17101076858021494905;'/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 85 ms.
Running link step : cd /tmp/ltsmin17101076858021494905;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin17101076858021494905;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6734495538047566146.hoa' '--buchi-type=spotba'
LTSmin run took 1462 ms.
FORMULA RefineWMG-PT-050050-LTLCardinality-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property RefineWMG-PT-050050-LTLCardinality-01 finished in 25388 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)||X((p1 U G(!p1))))))'
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 143 edges and 254 vertex of which 94 / 254 are part of one of the 47 SCC in 0 ms
Free SCC test removed 47 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 160 transition count 110
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 1 with 147 rules applied. Total rules applied 194 place count 62 transition count 61
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 1 with 41 rules applied. Total rules applied 235 place count 62 transition count 20
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 276 place count 21 transition count 20
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 276 place count 21 transition count 16
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 284 place count 17 transition count 16
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 3 with 2 rules applied. Total rules applied 286 place count 16 transition count 15
Applied a total of 286 rules in 16 ms. Remains 16 /254 variables (removed 238) and now considering 15/203 (removed 188) transitions.
// Phase 1: matrix 15 rows 16 cols
[2024-05-28 02:31:32] [INFO ] Computed 6 invariants in 2 ms
[2024-05-28 02:31:32] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
[2024-05-28 02:31:32] [INFO ] Invariant cache hit.
[2024-05-28 02:31:32] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-28 02:31:32] [INFO ] Invariant cache hit.
[2024-05-28 02:31:32] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-28 02:31:32] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-28 02:31:32] [INFO ] Invariant cache hit.
[2024-05-28 02:31:32] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/254 places, 15/203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 153 ms. Remains : 16/254 places, 15/203 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND p1 (NOT p0))]
Running random walk in product with property : RefineWMG-PT-050050-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p1:(GT s9 s12), p0:(GT s15 s6)], nbAcceptance=2, 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 RefineWMG-PT-050050-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-LTLCardinality-02 finished in 207 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(p0)))||X(F(p1))||G(p2)||(p2&&F(p3))))'
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 8 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2024-05-28 02:31:33] [INFO ] Computed 102 invariants in 4 ms
[2024-05-28 02:31:33] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
[2024-05-28 02:31:33] [INFO ] Invariant cache hit.
[2024-05-28 02:31:33] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-28 02:31:33] [INFO ] Invariant cache hit.
[2024-05-28 02:31:33] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2024-05-28 02:31:33] [INFO ] Invariant cache hit.
[2024-05-28 02:31:33] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 469 ms. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 287 ms :[(NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-050050-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p3) (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p3) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p0 p2 (NOT p3) (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={} source=6 dest: 6}]], initial=2, aps=[p1:(LEQ 2 s179), p3:(GT 2 s24), p0:(LEQ 3 s38), p2:(GT 1 s196)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 30 reset in 708 ms.
Stack based approach found an accepted trace after 99 steps with 0 reset with depth 100 and stack size 100 in 1 ms.
FORMULA RefineWMG-PT-050050-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-050050-LTLCardinality-03 finished in 1495 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 U p1)||X(F(p2))))))'
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 144 edges and 254 vertex of which 96 / 254 are part of one of the 48 SCC in 0 ms
Free SCC test removed 48 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 158 transition count 108
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 1 with 144 rules applied. Total rules applied 192 place count 62 transition count 60
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 1 with 41 rules applied. Total rules applied 233 place count 62 transition count 19
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 274 place count 21 transition count 19
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 274 place count 21 transition count 15
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 282 place count 17 transition count 15
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 3 with 2 rules applied. Total rules applied 284 place count 16 transition count 14
Applied a total of 284 rules in 15 ms. Remains 16 /254 variables (removed 238) and now considering 14/203 (removed 189) transitions.
// Phase 1: matrix 14 rows 16 cols
[2024-05-28 02:31:34] [INFO ] Computed 6 invariants in 1 ms
[2024-05-28 02:31:34] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2024-05-28 02:31:34] [INFO ] Invariant cache hit.
[2024-05-28 02:31:34] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-28 02:31:34] [INFO ] Invariant cache hit.
[2024-05-28 02:31:34] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-28 02:31:34] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-28 02:31:34] [INFO ] Invariant cache hit.
[2024-05-28 02:31:34] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/254 places, 14/203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 150 ms. Remains : 16/254 places, 14/203 transitions.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : RefineWMG-PT-050050-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(GT 1 s11), p1:(LEQ s15 s5), p0:(AND (LEQ 1 s8) (LEQ s15 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-050050-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-LTLCardinality-04 finished in 292 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(G(p0))) U (p1&&X(X(G(p0)))))))'
Support contains 2 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 3 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2024-05-28 02:31:34] [INFO ] Computed 102 invariants in 4 ms
[2024-05-28 02:31:34] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
[2024-05-28 02:31:34] [INFO ] Invariant cache hit.
[2024-05-28 02:31:35] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-28 02:31:35] [INFO ] Invariant cache hit.
[2024-05-28 02:31:35] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2024-05-28 02:31:35] [INFO ] Invariant cache hit.
[2024-05-28 02:31:35] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 472 ms. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), true]
Running random walk in product with property : RefineWMG-PT-050050-LTLCardinality-05 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=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ 1 s234), p0:(LEQ 3 s215)], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-050050-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-LTLCardinality-05 finished in 727 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 1 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 148 edges and 254 vertex of which 98 / 254 are part of one of the 49 SCC in 0 ms
Free SCC test removed 49 places
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 156 transition count 106
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 1 with 150 rules applied. Total rules applied 199 place count 56 transition count 56
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 1 with 47 rules applied. Total rules applied 246 place count 56 transition count 9
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 2 with 47 rules applied. Total rules applied 293 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 293 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 295 place count 8 transition count 8
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 3 with 2 rules applied. Total rules applied 297 place count 7 transition count 7
Applied a total of 297 rules in 11 ms. Remains 7 /254 variables (removed 247) and now considering 7/203 (removed 196) transitions.
// Phase 1: matrix 7 rows 7 cols
[2024-05-28 02:31:35] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 02:31:35] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2024-05-28 02:31:35] [INFO ] Invariant cache hit.
[2024-05-28 02:31:35] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-28 02:31:35] [INFO ] Invariant cache hit.
[2024-05-28 02:31:35] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-28 02:31:35] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-28 02:31:35] [INFO ] Invariant cache hit.
[2024-05-28 02:31:35] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/254 places, 7/203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 142 ms. Remains : 7/254 places, 7/203 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-050050-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 s6)], 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 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-050050-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-LTLCardinality-06 finished in 225 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(p0)&&X(X((p1&&G(p2))))))'
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 5 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2024-05-28 02:31:35] [INFO ] Computed 102 invariants in 2 ms
[2024-05-28 02:31:35] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
[2024-05-28 02:31:35] [INFO ] Invariant cache hit.
[2024-05-28 02:31:35] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-28 02:31:35] [INFO ] Invariant cache hit.
[2024-05-28 02:31:36] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2024-05-28 02:31:36] [INFO ] Invariant cache hit.
[2024-05-28 02:31:36] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 475 ms. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : RefineWMG-PT-050050-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p1 p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s95 s9), p1:(GT 1 s61), p2:(GT 1 s100)], 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-050050-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-LTLCardinality-07 finished in 716 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 U p1)&&G(F(p2))))&&p0)))'
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 146 edges and 254 vertex of which 98 / 254 are part of one of the 49 SCC in 1 ms
Free SCC test removed 49 places
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 156 transition count 106
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 1 with 144 rules applied. Total rules applied 193 place count 60 transition count 58
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 1 with 43 rules applied. Total rules applied 236 place count 60 transition count 15
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 2 with 43 rules applied. Total rules applied 279 place count 17 transition count 15
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 279 place count 17 transition count 12
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 285 place count 14 transition count 12
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 3 with 2 rules applied. Total rules applied 287 place count 13 transition count 11
Applied a total of 287 rules in 10 ms. Remains 13 /254 variables (removed 241) and now considering 11/203 (removed 192) transitions.
// Phase 1: matrix 11 rows 13 cols
[2024-05-28 02:31:36] [INFO ] Computed 5 invariants in 0 ms
[2024-05-28 02:31:36] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
[2024-05-28 02:31:36] [INFO ] Invariant cache hit.
[2024-05-28 02:31:36] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-28 02:31:36] [INFO ] Invariant cache hit.
[2024-05-28 02:31:36] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-28 02:31:36] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-28 02:31:36] [INFO ] Invariant cache hit.
[2024-05-28 02:31:36] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/254 places, 11/203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 132 ms. Remains : 13/254 places, 11/203 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (NOT p2) p1), p1, (NOT p2), (OR (NOT p2) p1)]
Running random walk in product with property : RefineWMG-PT-050050-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) p1), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=p1, acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0, 1} source=2 dest: 2}], [{ cond=p1, acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 3 s11), p1:(LEQ 2 s8), p2:(LEQ 1 s6)], nbAcceptance=2, 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 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-050050-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-LTLCardinality-08 finished in 336 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 147 edges and 254 vertex of which 98 / 254 are part of one of the 49 SCC in 0 ms
Free SCC test removed 49 places
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 156 transition count 106
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 1 with 147 rules applied. Total rules applied 196 place count 58 transition count 57
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 1 with 45 rules applied. Total rules applied 241 place count 58 transition count 12
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 2 with 45 rules applied. Total rules applied 286 place count 13 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 286 place count 13 transition count 10
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 290 place count 11 transition count 10
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 3 with 2 rules applied. Total rules applied 292 place count 10 transition count 9
Applied a total of 292 rules in 9 ms. Remains 10 /254 variables (removed 244) and now considering 9/203 (removed 194) transitions.
// Phase 1: matrix 9 rows 10 cols
[2024-05-28 02:31:36] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 02:31:36] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
[2024-05-28 02:31:36] [INFO ] Invariant cache hit.
[2024-05-28 02:31:36] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-28 02:31:36] [INFO ] Invariant cache hit.
[2024-05-28 02:31:36] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-28 02:31:36] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-28 02:31:36] [INFO ] Invariant cache hit.
[2024-05-28 02:31:36] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/254 places, 9/203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117 ms. Remains : 10/254 places, 9/203 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-050050-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s5 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-050050-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-LTLCardinality-09 finished in 169 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 2 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2024-05-28 02:31:36] [INFO ] Computed 102 invariants in 1 ms
[2024-05-28 02:31:37] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
[2024-05-28 02:31:37] [INFO ] Invariant cache hit.
[2024-05-28 02:31:37] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-28 02:31:37] [INFO ] Invariant cache hit.
[2024-05-28 02:31:37] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2024-05-28 02:31:37] [INFO ] Invariant cache hit.
[2024-05-28 02:31:37] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 430 ms. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-050050-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s6 s21)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-050050-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-LTLCardinality-11 finished in 542 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)||X(G(p1)))))))'
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 2 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2024-05-28 02:31:37] [INFO ] Invariant cache hit.
[2024-05-28 02:31:37] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
[2024-05-28 02:31:37] [INFO ] Invariant cache hit.
[2024-05-28 02:31:37] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-28 02:31:37] [INFO ] Invariant cache hit.
[2024-05-28 02:31:37] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2024-05-28 02:31:37] [INFO ] Invariant cache hit.
[2024-05-28 02:31:37] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 455 ms. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-050050-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(GT 2 s58), p1:(GT s76 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 8580 reset in 606 ms.
Product exploration explored 100000 steps with 1757 reset in 804 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10023 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=527 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-28 02:31:39] [INFO ] Invariant cache hit.
[2024-05-28 02:31:39] [INFO ] [Real]Absence check using 102 positive place invariants in 11 ms returned sat
[2024-05-28 02:31:40] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 02:31:40] [INFO ] [Nat]Absence check using 102 positive place invariants in 10 ms returned sat
[2024-05-28 02:31:40] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 02:31:40] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-28 02:31:40] [INFO ] After 181ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 4863 steps, including 0 resets, run visited all 1 properties in 24 ms. (steps per millisecond=202 )
Parikh walk visited 1 properties in 24 ms.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 262 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (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 198 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (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 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 2 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2024-05-28 02:31:40] [INFO ] Invariant cache hit.
[2024-05-28 02:31:41] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
[2024-05-28 02:31:41] [INFO ] Invariant cache hit.
[2024-05-28 02:31:41] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-28 02:31:41] [INFO ] Invariant cache hit.
[2024-05-28 02:31:41] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2024-05-28 02:31:41] [INFO ] Invariant cache hit.
[2024-05-28 02:31:41] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 605 ms. Remains : 254/254 places, 203/203 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 60 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10044 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=558 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-28 02:31:41] [INFO ] Invariant cache hit.
[2024-05-28 02:31:42] [INFO ] [Real]Absence check using 102 positive place invariants in 128 ms returned sat
[2024-05-28 02:31:42] [INFO ] After 323ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 02:31:42] [INFO ] [Nat]Absence check using 102 positive place invariants in 11 ms returned sat
[2024-05-28 02:31:42] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 02:31:42] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-28 02:31:42] [INFO ] After 170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 4865 steps, including 0 resets, run visited all 1 properties in 25 ms. (steps per millisecond=194 )
Parikh walk visited 1 properties in 24 ms.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 160 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (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 185 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (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 180 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (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 21651 reset in 443 ms.
Product exploration explored 100000 steps with 19470 reset in 727 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (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 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 147 edges and 254 vertex of which 98 / 254 are part of one of the 49 SCC in 1 ms
Free SCC test removed 49 places
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 156 transition count 106
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 1 with 49 rules applied. Total rules applied 98 place count 156 transition count 106
Deduced a syphon composed of 49 places in 0 ms
Applied a total of 98 rules in 24 ms. Remains 156 /254 variables (removed 98) and now considering 106/203 (removed 97) transitions.
// Phase 1: matrix 106 rows 156 cols
[2024-05-28 02:31:44] [INFO ] Computed 53 invariants in 1 ms
[2024-05-28 02:31:44] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
[2024-05-28 02:31:44] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-28 02:31:44] [INFO ] Invariant cache hit.
[2024-05-28 02:31:44] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/254 places, 106/203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 206 ms. Remains : 156/254 places, 106/203 transitions.
Built C files in :
/tmp/ltsmin16578548859648865180
[2024-05-28 02:31:44] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16578548859648865180
Running compilation step : cd /tmp/ltsmin16578548859648865180;'/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 299 ms.
Running link step : cd /tmp/ltsmin16578548859648865180;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin16578548859648865180;'/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/stateBased6756813740706866766.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 6 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2024-05-28 02:32:00] [INFO ] Computed 102 invariants in 1 ms
[2024-05-28 02:32:00] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
[2024-05-28 02:32:00] [INFO ] Invariant cache hit.
[2024-05-28 02:32:00] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-28 02:32:00] [INFO ] Invariant cache hit.
[2024-05-28 02:32:00] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2024-05-28 02:32:00] [INFO ] Invariant cache hit.
[2024-05-28 02:32:00] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 613 ms. Remains : 254/254 places, 203/203 transitions.
Built C files in :
/tmp/ltsmin2745276123475037505
[2024-05-28 02:32:00] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2745276123475037505
Running compilation step : cd /tmp/ltsmin2745276123475037505;'/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 294 ms.
Running link step : cd /tmp/ltsmin2745276123475037505;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin2745276123475037505;'/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/stateBased12069717454234548973.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 02:32:15] [INFO ] Flatten gal took : 13 ms
[2024-05-28 02:32:15] [INFO ] Flatten gal took : 12 ms
[2024-05-28 02:32:15] [INFO ] Time to serialize gal into /tmp/LTL5844440686518634159.gal : 3 ms
[2024-05-28 02:32:15] [INFO ] Time to serialize properties into /tmp/LTL3480215809930751743.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5844440686518634159.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5113453984991755691.hoa' '-atoms' '/tmp/LTL3480215809930751743.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL3480215809930751743.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5113453984991755691.hoa
Detected timeout of ITS tools.
[2024-05-28 02:32:30] [INFO ] Flatten gal took : 11 ms
[2024-05-28 02:32:30] [INFO ] Flatten gal took : 10 ms
[2024-05-28 02:32:30] [INFO ] Time to serialize gal into /tmp/LTL415781790204110980.gal : 2 ms
[2024-05-28 02:32:30] [INFO ] Time to serialize properties into /tmp/LTL14623441368810043689.ltl : 22 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL415781790204110980.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14623441368810043689.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X((F("(p55<2)"))||(X(G("(p73>pterce)"))))))))
Formula 0 simplified : XXX(G!"(p55<2)" & XF!"(p73>pterce)")
Detected timeout of ITS tools.
[2024-05-28 02:32:46] [INFO ] Flatten gal took : 12 ms
[2024-05-28 02:32:46] [INFO ] Applying decomposition
[2024-05-28 02:32:46] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10534415499586242654.txt' '-o' '/tmp/graph10534415499586242654.bin' '-w' '/tmp/graph10534415499586242654.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10534415499586242654.bin' '-l' '-1' '-v' '-w' '/tmp/graph10534415499586242654.weights' '-q' '0' '-e' '0.001'
[2024-05-28 02:32:46] [INFO ] Decomposing Gal with order
[2024-05-28 02:32:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 02:32:46] [INFO ] Flatten gal took : 134 ms
[2024-05-28 02:32:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-28 02:32:46] [INFO ] Time to serialize gal into /tmp/LTL12219847375695537014.gal : 26 ms
[2024-05-28 02:32:46] [INFO ] Time to serialize properties into /tmp/LTL17990108851448519860.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12219847375695537014.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17990108851448519860.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(X((F("(gi1.gi1.gi1.gi0.gu27.p55<2)"))||(X(G("(gu36.p73>gu36.pterce)"))))))))
Formula 0 simplified : XXX(G!"(gi1.gi1.gi1.gi0.gu27.p55<2)" & XF!"(gu36.p73>gu36.pterce)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12164745386686434645
[2024-05-28 02:33:01] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12164745386686434645
Running compilation step : cd /tmp/ltsmin12164745386686434645;'/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 296 ms.
Running link step : cd /tmp/ltsmin12164745386686434645;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin12164745386686434645;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X((<>((LTLAPp0==true))||X([]((LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property RefineWMG-PT-050050-LTLCardinality-12 finished in 99264 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(X(F(p0))))))'
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 9 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2024-05-28 02:33:16] [INFO ] Invariant cache hit.
[2024-05-28 02:33:16] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
[2024-05-28 02:33:16] [INFO ] Invariant cache hit.
[2024-05-28 02:33:16] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-28 02:33:17] [INFO ] Invariant cache hit.
[2024-05-28 02:33:17] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2024-05-28 02:33:17] [INFO ] Invariant cache hit.
[2024-05-28 02:33:17] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 484 ms. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-050050-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (GT s18 s133) (GT 3 s191))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 167 reset in 684 ms.
Stack based approach found an accepted trace after 146 steps with 0 reset with depth 147 and stack size 147 in 2 ms.
FORMULA RefineWMG-PT-050050-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-050050-LTLCardinality-13 finished in 1367 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))))'
Support contains 1 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 2 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2024-05-28 02:33:18] [INFO ] Invariant cache hit.
[2024-05-28 02:33:18] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
[2024-05-28 02:33:18] [INFO ] Invariant cache hit.
[2024-05-28 02:33:18] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-28 02:33:18] [INFO ] Invariant cache hit.
[2024-05-28 02:33:18] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2024-05-28 02:33:18] [INFO ] Invariant cache hit.
[2024-05-28 02:33:18] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 446 ms. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-050050-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ 1 s51)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 429 ms.
Product exploration explored 100000 steps with 33333 reset in 453 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 22 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RefineWMG-PT-050050-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-050050-LTLCardinality-14 finished in 1490 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)||X(G(p1)))))))'
[2024-05-28 02:33:19] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11041619336638849297
[2024-05-28 02:33:19] [INFO ] Computing symmetric may disable matrix : 203 transitions.
[2024-05-28 02:33:19] [INFO ] Applying decomposition
[2024-05-28 02:33:19] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:33:19] [INFO ] Computing symmetric may enable matrix : 203 transitions.
[2024-05-28 02:33:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:33:19] [INFO ] Flatten gal took : 9 ms
[2024-05-28 02:33:19] [INFO ] Computing Do-Not-Accords matrix : 203 transitions.
[2024-05-28 02:33:19] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:33:19] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11041619336638849297
Running compilation step : cd /tmp/ltsmin11041619336638849297;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7778673078838412675.txt' '-o' '/tmp/graph7778673078838412675.bin' '-w' '/tmp/graph7778673078838412675.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7778673078838412675.bin' '-l' '-1' '-v' '-w' '/tmp/graph7778673078838412675.weights' '-q' '0' '-e' '0.001'
[2024-05-28 02:33:19] [INFO ] Decomposing Gal with order
[2024-05-28 02:33:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 02:33:19] [INFO ] Flatten gal took : 11 ms
[2024-05-28 02:33:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-28 02:33:19] [INFO ] Time to serialize gal into /tmp/LTLCardinality1774857842591240799.gal : 3 ms
[2024-05-28 02:33:19] [INFO ] Time to serialize properties into /tmp/LTLCardinality475243016424823279.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1774857842591240799.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality475243016424823279.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...296
Read 1 LTL properties
Checking formula 0 : !((X(X(X((F("(gi1.gi0.gi0.gi2.gu28.p55<2)"))||(X(G("(gu37.p73>gu37.pterce)"))))))))
Formula 0 simplified : XXX(G!"(gi1.gi0.gi0.gi2.gu28.p55<2)" & XF!"(gu37.p73>gu37.pterce)")
Compilation finished in 365 ms.
Running link step : cd /tmp/ltsmin11041619336638849297;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin11041619336638849297;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X((<>((LTLAPp0==true))||X([]((LTLAPp1==true)))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: LTL layer: formula: X(X(X((<>((LTLAPp0==true))||X([]((LTLAPp1==true)))))))
pins2lts-mc-linux64( 3/ 8), 0.003: "X(X(X((<>((LTLAPp0==true))||X([]((LTLAPp1==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.019: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.085: DFS-FIFO for weak LTL, using special progress label 206
pins2lts-mc-linux64( 0/ 8), 0.085: There are 207 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.085: State length is 255, there are 210 groups
pins2lts-mc-linux64( 0/ 8), 0.085: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.085: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.085: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.085: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.181: ~1 levels ~960 states ~9320 transitions
pins2lts-mc-linux64( 6/ 8), 0.183: ~1 levels ~1920 states ~9320 transitions
pins2lts-mc-linux64( 6/ 8), 0.187: ~1 levels ~3840 states ~9320 transitions
pins2lts-mc-linux64( 2/ 8), 0.226: ~1 levels ~7680 states ~12704 transitions
pins2lts-mc-linux64( 4/ 8), 0.384: ~1 levels ~15360 states ~39336 transitions
pins2lts-mc-linux64( 5/ 8), 0.532: ~1 levels ~30720 states ~68088 transitions
pins2lts-mc-linux64( 0/ 8), 2.399: ~1 levels ~61440 states ~1143920 transitions
pins2lts-mc-linux64( 0/ 8), 4.862: ~1 levels ~122880 states ~4534968 transitions
pins2lts-mc-linux64( 4/ 8), 8.739: ~1 levels ~245760 states ~11087512 transitions
pins2lts-mc-linux64( 4/ 8), 15.910: ~1 levels ~491520 states ~22937168 transitions
pins2lts-mc-linux64( 4/ 8), 31.228: ~1 levels ~983040 states ~47969248 transitions
pins2lts-mc-linux64( 6/ 8), 60.227: ~1 levels ~1966080 states ~93035096 transitions
pins2lts-mc-linux64( 4/ 8), 118.187: ~1 levels ~3932160 states ~188390344 transitions
pins2lts-mc-linux64( 4/ 8), 240.831: ~1 levels ~7864320 states ~388161648 transitions
pins2lts-mc-linux64( 0/ 8), 362.297: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 362.421:
pins2lts-mc-linux64( 0/ 8), 362.421: mean standard work distribution: 2.0% (states) 1.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 362.422:
pins2lts-mc-linux64( 0/ 8), 362.422: Explored 10941208 states 564595458 transitions, fanout: 51.603
pins2lts-mc-linux64( 0/ 8), 362.422: Total exploration time 362.320 sec (362.210 sec minimum, 362.258 sec on average)
pins2lts-mc-linux64( 0/ 8), 362.422: States per second: 30198, Transitions per second: 1558278
pins2lts-mc-linux64( 0/ 8), 362.422:
pins2lts-mc-linux64( 0/ 8), 362.422: Progress states detected: 134217137
pins2lts-mc-linux64( 0/ 8), 362.422: Redundant explorations: -91.8481
pins2lts-mc-linux64( 0/ 8), 362.422:
pins2lts-mc-linux64( 0/ 8), 362.422: Queue width: 8B, total height: 157139706, memory: 1198.88MB
pins2lts-mc-linux64( 0/ 8), 362.422: Tree memory: 1058.7MB, 8.3 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 362.422: Tree fill ratio (roots/leafs): 99.0%/13.0%
pins2lts-mc-linux64( 0/ 8), 362.422: Stored 203 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 362.422: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 362.422: Est. total memory use: 2257.6MB (~2222.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11041619336638849297;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X((<>((LTLAPp0==true))||X([]((LTLAPp1==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11041619336638849297;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X((<>((LTLAPp0==true))||X([]((LTLAPp1==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-28 02:54:06] [INFO ] Flatten gal took : 8 ms
[2024-05-28 02:54:06] [INFO ] Time to serialize gal into /tmp/LTLCardinality10791244595282612460.gal : 2 ms
[2024-05-28 02:54:06] [INFO ] Time to serialize properties into /tmp/LTLCardinality5675956352152724072.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10791244595282612460.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5675956352152724072.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((X(X(X((F("(p55<2)"))||(X(G("(p73>pterce)"))))))))
Formula 0 simplified : XXX(G!"(p55<2)" & XF!"(p73>pterce)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-28 03:14:52] [INFO ] Flatten gal took : 9 ms
[2024-05-28 03:14:52] [INFO ] Input system was already deterministic with 203 transitions.
[2024-05-28 03:14:52] [INFO ] Transformed 254 places.
[2024-05-28 03:14:52] [INFO ] Transformed 203 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 03:14:52] [INFO ] Time to serialize gal into /tmp/LTLCardinality11402939744903323419.gal : 3 ms
[2024-05-28 03:14:52] [INFO ] Time to serialize properties into /tmp/LTLCardinality17050232725480245233.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11402939744903323419.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17050232725480245233.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(X((F("(p55<2)"))||(X(G("(p73>pterce)"))))))))
Formula 0 simplified : XXX(G!"(p55<2)" & XF!"(p73>pterce)")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9223912 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16038508 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is RefineWMG-PT-050050, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r329-tall-171662362300462"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-050050.tgz
mv RefineWMG-PT-050050 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;