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.r597-smll-171734926500102.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 MedleyA-PT-21, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r597-smll-171734926500102
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 5.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 70K Jun 2 16:33 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 MedleyA-PT-21-LTLCardinality-00
FORMULA_NAME MedleyA-PT-21-LTLCardinality-01
FORMULA_NAME MedleyA-PT-21-LTLCardinality-02
FORMULA_NAME MedleyA-PT-21-LTLCardinality-03
FORMULA_NAME MedleyA-PT-21-LTLCardinality-04
FORMULA_NAME MedleyA-PT-21-LTLCardinality-05
FORMULA_NAME MedleyA-PT-21-LTLCardinality-06
FORMULA_NAME MedleyA-PT-21-LTLCardinality-07
FORMULA_NAME MedleyA-PT-21-LTLCardinality-08
FORMULA_NAME MedleyA-PT-21-LTLCardinality-09
FORMULA_NAME MedleyA-PT-21-LTLCardinality-10
FORMULA_NAME MedleyA-PT-21-LTLCardinality-11
FORMULA_NAME MedleyA-PT-21-LTLCardinality-12
FORMULA_NAME MedleyA-PT-21-LTLCardinality-13
FORMULA_NAME MedleyA-PT-21-LTLCardinality-14
FORMULA_NAME MedleyA-PT-21-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717367391700

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=MedleyA-PT-21
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-02 22:29:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 22:29:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:29:54] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2024-06-02 22:29:54] [INFO ] Transformed 306 places.
[2024-06-02 22:29:54] [INFO ] Transformed 298 transitions.
[2024-06-02 22:29:54] [INFO ] Found NUPN structural information;
[2024-06-02 22:29:54] [INFO ] Parsed PT model containing 306 places and 298 transitions and 700 arcs in 250 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
FORMULA MedleyA-PT-21-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-21-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-21-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-21-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-21-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-21-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-21-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-21-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-21-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 298/298 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 267 transition count 259
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 267 transition count 259
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 111 place count 234 transition count 226
Iterating global reduction 0 with 33 rules applied. Total rules applied 144 place count 234 transition count 226
Applied a total of 144 rules in 99 ms. Remains 234 /306 variables (removed 72) and now considering 226/298 (removed 72) transitions.
// Phase 1: matrix 226 rows 234 cols
[2024-06-02 22:29:55] [INFO ] Computed 20 invariants in 13 ms
[2024-06-02 22:29:55] [INFO ] Implicit Places using invariants in 378 ms returned []
[2024-06-02 22:29:55] [INFO ] Invariant cache hit.
[2024-06-02 22:29:56] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 760 ms to find 0 implicit places.
[2024-06-02 22:29:56] [INFO ] Invariant cache hit.
[2024-06-02 22:29:56] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 234/306 places, 226/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1089 ms. Remains : 234/306 places, 226/298 transitions.
Support contains 29 out of 234 places after structural reductions.
[2024-06-02 22:29:56] [INFO ] Flatten gal took : 64 ms
[2024-06-02 22:29:56] [INFO ] Flatten gal took : 25 ms
[2024-06-02 22:29:56] [INFO ] Input system was already deterministic with 226 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 630 ms. (steps per millisecond=15 ) properties (out of 17) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-06-02 22:29:57] [INFO ] Invariant cache hit.
[2024-06-02 22:29:58] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2024-06-02 22:29:58] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-06-02 22:29:58] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2024-06-02 22:29:58] [INFO ] After 206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-06-02 22:29:58] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 9 ms to minimize.
[2024-06-02 22:29:58] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 1 ms to minimize.
[2024-06-02 22:29:58] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 1 ms to minimize.
[2024-06-02 22:29:58] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2024-06-02 22:29:58] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:29:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 560 ms
[2024-06-02 22:29:59] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:29:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2024-06-02 22:29:59] [INFO ] After 973ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 71 ms.
[2024-06-02 22:29:59] [INFO ] After 1186ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 3 properties in 54 ms.
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 226/226 transitions.
Graph (trivial) has 158 edges and 234 vertex of which 6 / 234 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 229 transition count 169
Reduce places removed 51 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 52 rules applied. Total rules applied 104 place count 178 transition count 168
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 105 place count 177 transition count 168
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 105 place count 177 transition count 138
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 165 place count 147 transition count 138
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 173 place count 139 transition count 130
Iterating global reduction 3 with 8 rules applied. Total rules applied 181 place count 139 transition count 130
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 181 place count 139 transition count 124
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 193 place count 133 transition count 124
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 265 place count 97 transition count 88
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -23
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 271 place count 94 transition count 111
Free-agglomeration rule applied 27 times.
Iterating global reduction 3 with 27 rules applied. Total rules applied 298 place count 94 transition count 84
Reduce places removed 27 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 327 place count 67 transition count 82
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 328 place count 67 transition count 82
Applied a total of 328 rules in 82 ms. Remains 67 /234 variables (removed 167) and now considering 82/226 (removed 144) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 67/234 places, 82/226 transitions.
Finished random walk after 503 steps, including 16 resets, run visited all 2 properties in 8 ms. (steps per millisecond=62 )
Parikh walk visited 0 properties in 0 ms.
FORMULA MedleyA-PT-21-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 37 stabilizing places and 37 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' '!(X((G(p0)&&X(p1))))'
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 226/226 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 225 transition count 217
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 225 transition count 217
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 220 transition count 212
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 220 transition count 212
Applied a total of 28 rules in 23 ms. Remains 220 /234 variables (removed 14) and now considering 212/226 (removed 14) transitions.
// Phase 1: matrix 212 rows 220 cols
[2024-06-02 22:29:59] [INFO ] Computed 20 invariants in 9 ms
[2024-06-02 22:29:59] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-06-02 22:29:59] [INFO ] Invariant cache hit.
[2024-06-02 22:30:00] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2024-06-02 22:30:00] [INFO ] Invariant cache hit.
[2024-06-02 22:30:00] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 220/234 places, 212/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 616 ms. Remains : 220/234 places, 212/226 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 413 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : MedleyA-PT-21-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (EQ s153 0) (EQ s66 1)), p1:(EQ s145 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA MedleyA-PT-21-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-21-LTLCardinality-00 finished in 1105 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(F(p0))))&&F(p1)))'
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 226/226 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 225 transition count 217
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 225 transition count 217
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 221 transition count 213
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 221 transition count 213
Applied a total of 26 rules in 15 ms. Remains 221 /234 variables (removed 13) and now considering 213/226 (removed 13) transitions.
// Phase 1: matrix 213 rows 221 cols
[2024-06-02 22:30:00] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 22:30:00] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-02 22:30:00] [INFO ] Invariant cache hit.
[2024-06-02 22:30:01] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2024-06-02 22:30:01] [INFO ] Invariant cache hit.
[2024-06-02 22:30:01] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 221/234 places, 213/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 564 ms. Remains : 221/234 places, 213/226 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-21-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s120 1), p0:(AND (EQ s211 0) (EQ s130 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 353 ms.
Stack based approach found an accepted trace after 203 steps with 0 reset with depth 204 and stack size 204 in 2 ms.
FORMULA MedleyA-PT-21-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-21-LTLCardinality-01 finished in 1149 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U p1)||G(p2))))'
Support contains 5 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 226/226 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 226 transition count 218
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 226 transition count 218
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 222 transition count 214
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 222 transition count 214
Applied a total of 24 rules in 13 ms. Remains 222 /234 variables (removed 12) and now considering 214/226 (removed 12) transitions.
// Phase 1: matrix 214 rows 222 cols
[2024-06-02 22:30:01] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 22:30:02] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-02 22:30:02] [INFO ] Invariant cache hit.
[2024-06-02 22:30:02] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
[2024-06-02 22:30:02] [INFO ] Invariant cache hit.
[2024-06-02 22:30:02] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 222/234 places, 214/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 591 ms. Remains : 222/234 places, 214/226 transitions.
Stuttering acceptance computed with spot in 290 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyA-PT-21-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s185 0) (EQ s67 1)), p2:(OR (EQ s67 0) (EQ s37 1)), p0:(OR (EQ s59 0) (EQ s69 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 409 ms.
Product exploration explored 100000 steps with 50000 reset in 390 ms.
Computed a total of 36 stabilizing places and 36 stable transitions
Computed a total of 36 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 24 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-21-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-21-LTLCardinality-05 finished in 1737 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((X(X(p1))&&p0))||(!p1 U (p2||G(!p1))))))'
Support contains 5 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 226/226 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 227 transition count 219
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 227 transition count 219
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 223 transition count 215
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 223 transition count 215
Applied a total of 22 rules in 13 ms. Remains 223 /234 variables (removed 11) and now considering 215/226 (removed 11) transitions.
// Phase 1: matrix 215 rows 223 cols
[2024-06-02 22:30:03] [INFO ] Computed 20 invariants in 9 ms
[2024-06-02 22:30:03] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-06-02 22:30:03] [INFO ] Invariant cache hit.
[2024-06-02 22:30:03] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2024-06-02 22:30:03] [INFO ] Invariant cache hit.
[2024-06-02 22:30:04] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 223/234 places, 215/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 567 ms. Remains : 223/234 places, 215/226 transitions.
Stuttering acceptance computed with spot in 404 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), false, (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), false, false]
Running random walk in product with property : MedleyA-PT-21-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 7}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 8}], [{ cond=p0, acceptance={0} source=3 dest: 5}, { cond=(NOT p0), acceptance={0} source=3 dest: 6}], [{ cond=p0, acceptance={0} source=4 dest: 3}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=7 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(AND (EQ s126 0) (EQ s11 1)), p2:(AND (NOT (OR (EQ s60 0) (EQ s155 1))) (NEQ s7 1)), p1:(EQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], 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 0 reset in 145 ms.
Stack based approach found an accepted trace after 230 steps with 0 reset with depth 231 and stack size 231 in 1 ms.
FORMULA MedleyA-PT-21-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-21-LTLCardinality-06 finished in 1143 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)&&(!p1 U (p2||G(!p1))))))'
Support contains 6 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 226/226 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 227 transition count 219
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 227 transition count 219
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 223 transition count 215
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 223 transition count 215
Applied a total of 22 rules in 10 ms. Remains 223 /234 variables (removed 11) and now considering 215/226 (removed 11) transitions.
// Phase 1: matrix 215 rows 223 cols
[2024-06-02 22:30:04] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 22:30:04] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-02 22:30:04] [INFO ] Invariant cache hit.
[2024-06-02 22:30:05] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2024-06-02 22:30:05] [INFO ] Invariant cache hit.
[2024-06-02 22:30:05] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 223/234 places, 215/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 542 ms. Remains : 223/234 places, 215/226 transitions.
Stuttering acceptance computed with spot in 220 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : MedleyA-PT-21-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p2) p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s191 0) (EQ s177 1)), p2:(AND (NOT (OR (EQ s168 0) (EQ s66 1))) (NOT (OR (EQ s23 0) (EQ s130 1)))), p1:(OR (EQ s23 0) (EQ s130 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-21-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-21-LTLCardinality-08 finished in 782 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 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 226/226 transitions.
Graph (trivial) has 160 edges and 234 vertex of which 6 / 234 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 228 transition count 169
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 177 transition count 169
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 103 place count 177 transition count 137
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 167 place count 145 transition count 137
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 174 place count 138 transition count 130
Iterating global reduction 2 with 7 rules applied. Total rules applied 181 place count 138 transition count 130
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 181 place count 138 transition count 124
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 193 place count 132 transition count 124
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 267 place count 95 transition count 87
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 273 place count 92 transition count 110
Applied a total of 273 rules in 39 ms. Remains 92 /234 variables (removed 142) and now considering 110/226 (removed 116) transitions.
// Phase 1: matrix 110 rows 92 cols
[2024-06-02 22:30:05] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 22:30:05] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 22:30:05] [INFO ] Invariant cache hit.
[2024-06-02 22:30:05] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-02 22:30:05] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
[2024-06-02 22:30:05] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 22:30:05] [INFO ] Invariant cache hit.
[2024-06-02 22:30:05] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/234 places, 110/226 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 404 ms. Remains : 92/234 places, 110/226 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-21-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s80 0) (EQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-21-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-21-LTLCardinality-11 finished in 459 ms.
All properties solved by simple procedures.
Total runtime 11305 ms.

BK_STOP 1717367407107

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="MedleyA-PT-21"
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 MedleyA-PT-21, 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 r597-smll-171734926500102"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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