fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r307-tajo-171654460300042
Last Updated
July 7, 2024

About the Execution of 2023-gold for Planning-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
357.228 12662.00 21845.00 917.80 FFFTFFFTFFFTTFFT normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r307-tajo-171654460300042.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Planning-PT-none, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tajo-171654460300042
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 14:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Apr 12 14:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 14:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 14:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 56K May 18 16:43 model.pnml
-rw-r--r-- 1 mcc users 1 May 18 16:43 unfinite

--------------------
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 Planning-PT-none-LTLCardinality-00
FORMULA_NAME Planning-PT-none-LTLCardinality-01
FORMULA_NAME Planning-PT-none-LTLCardinality-02
FORMULA_NAME Planning-PT-none-LTLCardinality-03
FORMULA_NAME Planning-PT-none-LTLCardinality-04
FORMULA_NAME Planning-PT-none-LTLCardinality-05
FORMULA_NAME Planning-PT-none-LTLCardinality-06
FORMULA_NAME Planning-PT-none-LTLCardinality-07
FORMULA_NAME Planning-PT-none-LTLCardinality-08
FORMULA_NAME Planning-PT-none-LTLCardinality-09
FORMULA_NAME Planning-PT-none-LTLCardinality-10
FORMULA_NAME Planning-PT-none-LTLCardinality-11
FORMULA_NAME Planning-PT-none-LTLCardinality-12
FORMULA_NAME Planning-PT-none-LTLCardinality-13
FORMULA_NAME Planning-PT-none-LTLCardinality-14
FORMULA_NAME Planning-PT-none-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717107338195

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=Planning-PT-none
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-30 22:15:40] [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-30 22:15:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 22:15:41] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2024-05-30 22:15:41] [INFO ] Transformed 126 places.
[2024-05-30 22:15:41] [INFO ] Transformed 128 transitions.
[2024-05-30 22:15:41] [INFO ] Parsed PT model containing 126 places and 128 transitions and 652 arcs in 139 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Reduce places removed 2 places and 0 transitions.
FORMULA Planning-PT-none-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Planning-PT-none-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Planning-PT-none-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 128/128 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 107 transition count 127
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 99 transition count 119
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 99 transition count 119
Applied a total of 34 rules in 46 ms. Remains 99 /124 variables (removed 25) and now considering 119/128 (removed 9) transitions.
[2024-05-30 22:15:41] [INFO ] Flow matrix only has 94 transitions (discarded 25 similar events)
// Phase 1: matrix 94 rows 99 cols
[2024-05-30 22:15:41] [INFO ] Computed 39 invariants in 6 ms
[2024-05-30 22:15:41] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-05-30 22:15:41] [INFO ] Flow matrix only has 94 transitions (discarded 25 similar events)
[2024-05-30 22:15:41] [INFO ] Invariant cache hit.
[2024-05-30 22:15:41] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-30 22:15:41] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
[2024-05-30 22:15:41] [INFO ] Flow matrix only has 94 transitions (discarded 25 similar events)
[2024-05-30 22:15:41] [INFO ] Invariant cache hit.
[2024-05-30 22:15:42] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 99/124 places, 119/128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 873 ms. Remains : 99/124 places, 119/128 transitions.
Support contains 41 out of 99 places after structural reductions.
[2024-05-30 22:15:42] [INFO ] Flatten gal took : 40 ms
[2024-05-30 22:15:42] [INFO ] Flatten gal took : 16 ms
[2024-05-30 22:15:42] [INFO ] Input system was already deterministic with 119 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 448 ms. (steps per millisecond=22 ) properties (out of 29) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) 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 9) seen :0
Running SMT prover for 9 properties.
[2024-05-30 22:15:43] [INFO ] Flow matrix only has 94 transitions (discarded 25 similar events)
[2024-05-30 22:15:43] [INFO ] Invariant cache hit.
[2024-05-30 22:15:43] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-30 22:15:43] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-30 22:15:43] [INFO ] [Nat]Absence check using 36 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-30 22:15:43] [INFO ] After 170ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :0
Fused 9 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 9 atomic propositions for a total of 13 simplifications.
FORMULA Planning-PT-none-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Planning-PT-none-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 476 edges and 99 vertex of which 82 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.2 ms
FORMULA Planning-PT-none-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Planning-PT-none-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0) U (p1 U p2)))))'
Support contains 6 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 119/119 transitions.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 91 transition count 116
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 19 place count 83 transition count 107
Iterating global reduction 1 with 8 rules applied. Total rules applied 27 place count 83 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 83 transition count 106
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 81 transition count 88
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 81 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 81 transition count 86
Applied a total of 34 rules in 6 ms. Remains 81 /99 variables (removed 18) and now considering 86/119 (removed 33) transitions.
[2024-05-30 22:15:43] [INFO ] Flow matrix only has 74 transitions (discarded 12 similar events)
// Phase 1: matrix 74 rows 81 cols
[2024-05-30 22:15:43] [INFO ] Computed 37 invariants in 2 ms
[2024-05-30 22:15:43] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-30 22:15:43] [INFO ] Flow matrix only has 74 transitions (discarded 12 similar events)
[2024-05-30 22:15:43] [INFO ] Invariant cache hit.
[2024-05-30 22:15:43] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-30 22:15:43] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2024-05-30 22:15:43] [INFO ] Flow matrix only has 74 transitions (discarded 12 similar events)
[2024-05-30 22:15:43] [INFO ] Invariant cache hit.
[2024-05-30 22:15:43] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 81/99 places, 86/119 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 345 ms. Remains : 81/99 places, 86/119 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 1044 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : Planning-PT-none-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(NOT p2), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ 1 s26), p1:(AND (LEQ 2 s76) (LEQ s30 s74)), p0:(LEQ s37 s78)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 3038 reset in 691 ms.
Stack based approach found an accepted trace after 1856 steps with 51 reset with depth 11 and stack size 11 in 17 ms.
FORMULA Planning-PT-none-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Planning-PT-none-LTLCardinality-00 finished in 2152 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)||(p0 U (p1 U p2)))))'
Support contains 4 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 119/119 transitions.
Graph (trivial) has 32 edges and 99 vertex of which 26 / 99 are part of one of the 13 SCC in 5 ms
Free SCC test removed 13 places
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 456 edges and 86 vertex of which 70 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.4 ms
Discarding 16 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 18 place count 57 transition count 83
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 55 transition count 79
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 55 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 55 transition count 77
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 39 place count 45 transition count 72
Applied a total of 39 rules in 40 ms. Remains 45 /99 variables (removed 54) and now considering 72/119 (removed 47) transitions.
[2024-05-30 22:15:45] [INFO ] Flow matrix only has 45 transitions (discarded 27 similar events)
// Phase 1: matrix 45 rows 45 cols
[2024-05-30 22:15:45] [INFO ] Computed 19 invariants in 1 ms
[2024-05-30 22:15:45] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-30 22:15:45] [INFO ] Flow matrix only has 45 transitions (discarded 27 similar events)
[2024-05-30 22:15:45] [INFO ] Invariant cache hit.
[2024-05-30 22:15:45] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-30 22:15:45] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2024-05-30 22:15:45] [INFO ] Redundant transitions in 93 ms returned []
[2024-05-30 22:15:46] [INFO ] Flow matrix only has 45 transitions (discarded 27 similar events)
[2024-05-30 22:15:46] [INFO ] Invariant cache hit.
[2024-05-30 22:15:46] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/99 places, 72/119 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 337 ms. Remains : 45/99 places, 72/119 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Planning-PT-none-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s34 s17), p2:(LEQ 3 s2), p1:(LEQ 2 s41)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 325 ms.
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA Planning-PT-none-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Planning-PT-none-LTLCardinality-01 finished in 798 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)))'
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 119/119 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 90 transition count 115
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 21 place count 82 transition count 105
Iterating global reduction 1 with 8 rules applied. Total rules applied 29 place count 82 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 31 place count 82 transition count 103
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 80 transition count 99
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 80 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 37 place count 80 transition count 97
Applied a total of 37 rules in 6 ms. Remains 80 /99 variables (removed 19) and now considering 97/119 (removed 22) transitions.
[2024-05-30 22:15:46] [INFO ] Flow matrix only has 74 transitions (discarded 23 similar events)
// Phase 1: matrix 74 rows 80 cols
[2024-05-30 22:15:46] [INFO ] Computed 37 invariants in 1 ms
[2024-05-30 22:15:46] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-05-30 22:15:46] [INFO ] Flow matrix only has 74 transitions (discarded 23 similar events)
[2024-05-30 22:15:46] [INFO ] Invariant cache hit.
[2024-05-30 22:15:46] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-30 22:15:46] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2024-05-30 22:15:46] [INFO ] Flow matrix only has 74 transitions (discarded 23 similar events)
[2024-05-30 22:15:46] [INFO ] Invariant cache hit.
[2024-05-30 22:15:46] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 80/99 places, 97/119 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 379 ms. Remains : 80/99 places, 97/119 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Planning-PT-none-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 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][false, false]]
Product exploration explored 100000 steps with 14 reset in 314 ms.
Stack based approach found an accepted trace after 34 steps with 0 reset with depth 35 and stack size 35 in 0 ms.
FORMULA Planning-PT-none-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Planning-PT-none-LTLCardinality-02 finished in 804 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 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 119/119 transitions.
Graph (trivial) has 32 edges and 99 vertex of which 26 / 99 are part of one of the 13 SCC in 1 ms
Free SCC test removed 13 places
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 455 edges and 86 vertex of which 70 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 17 place count 57 transition count 83
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 52 transition count 59
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 52 transition count 59
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 32 place count 52 transition count 54
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 44 place count 44 transition count 50
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 47 place count 42 transition count 49
Applied a total of 47 rules in 11 ms. Remains 42 /99 variables (removed 57) and now considering 49/119 (removed 70) transitions.
[2024-05-30 22:15:47] [INFO ] Flow matrix only has 41 transitions (discarded 8 similar events)
// Phase 1: matrix 41 rows 42 cols
[2024-05-30 22:15:47] [INFO ] Computed 19 invariants in 0 ms
[2024-05-30 22:15:47] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-30 22:15:47] [INFO ] Flow matrix only has 41 transitions (discarded 8 similar events)
[2024-05-30 22:15:47] [INFO ] Invariant cache hit.
[2024-05-30 22:15:47] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-30 22:15:47] [INFO ] Implicit Places using invariants and state equation in 73 ms returned [39]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 131 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/99 places, 48/119 transitions.
Graph (trivial) has 2 edges and 41 vertex of which 2 / 41 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 39 transition count 45
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 39 transition count 44
Applied a total of 3 rules in 5 ms. Remains 39 /41 variables (removed 2) and now considering 44/48 (removed 4) transitions.
[2024-05-30 22:15:47] [INFO ] Flow matrix only has 38 transitions (discarded 6 similar events)
// Phase 1: matrix 38 rows 39 cols
[2024-05-30 22:15:47] [INFO ] Computed 18 invariants in 1 ms
[2024-05-30 22:15:47] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-30 22:15:47] [INFO ] Flow matrix only has 38 transitions (discarded 6 similar events)
[2024-05-30 22:15:47] [INFO ] Invariant cache hit.
[2024-05-30 22:15:47] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-30 22:15:47] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/99 places, 44/119 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 278 ms. Remains : 39/99 places, 44/119 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Planning-PT-none-LTLCardinality-04 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 s35 s11)], 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 Planning-PT-none-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Planning-PT-none-LTLCardinality-04 finished in 337 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((p0||F(p1)))))'
Support contains 3 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 119/119 transitions.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 91 transition count 116
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 19 place count 83 transition count 106
Iterating global reduction 1 with 8 rules applied. Total rules applied 27 place count 83 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 83 transition count 104
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 31 place count 81 transition count 100
Iterating global reduction 2 with 2 rules applied. Total rules applied 33 place count 81 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 35 place count 81 transition count 98
Applied a total of 35 rules in 10 ms. Remains 81 /99 variables (removed 18) and now considering 98/119 (removed 21) transitions.
[2024-05-30 22:15:47] [INFO ] Flow matrix only has 75 transitions (discarded 23 similar events)
// Phase 1: matrix 75 rows 81 cols
[2024-05-30 22:15:47] [INFO ] Computed 37 invariants in 3 ms
[2024-05-30 22:15:47] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-30 22:15:47] [INFO ] Flow matrix only has 75 transitions (discarded 23 similar events)
[2024-05-30 22:15:47] [INFO ] Invariant cache hit.
[2024-05-30 22:15:47] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-30 22:15:47] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2024-05-30 22:15:47] [INFO ] Flow matrix only has 75 transitions (discarded 23 similar events)
[2024-05-30 22:15:47] [INFO ] Invariant cache hit.
[2024-05-30 22:15:47] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 81/99 places, 98/119 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 202 ms. Remains : 81/99 places, 98/119 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Planning-PT-none-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(LEQ 2 s76), p0:(LEQ s32 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][false, false, false, false]]
Product exploration explored 100000 steps with 1410 reset in 279 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA Planning-PT-none-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Planning-PT-none-LTLCardinality-05 finished in 631 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((F(G(p1))&&p0)))))'
Support contains 4 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 119/119 transitions.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 91 transition count 116
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 18 place count 84 transition count 107
Iterating global reduction 1 with 7 rules applied. Total rules applied 25 place count 84 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 27 place count 84 transition count 105
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 83 transition count 103
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 83 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 83 transition count 102
Applied a total of 30 rules in 15 ms. Remains 83 /99 variables (removed 16) and now considering 102/119 (removed 17) transitions.
[2024-05-30 22:15:48] [INFO ] Flow matrix only has 78 transitions (discarded 24 similar events)
// Phase 1: matrix 78 rows 83 cols
[2024-05-30 22:15:48] [INFO ] Computed 37 invariants in 5 ms
[2024-05-30 22:15:48] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-30 22:15:48] [INFO ] Flow matrix only has 78 transitions (discarded 24 similar events)
[2024-05-30 22:15:48] [INFO ] Invariant cache hit.
[2024-05-30 22:15:48] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-30 22:15:48] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2024-05-30 22:15:48] [INFO ] Flow matrix only has 78 transitions (discarded 24 similar events)
[2024-05-30 22:15:48] [INFO ] Invariant cache hit.
[2024-05-30 22:15:48] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 83/99 places, 102/119 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 223 ms. Remains : 83/99 places, 102/119 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Planning-PT-none-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GT s20 s82) (GT s3 s60)), p1:(GT s3 s60)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Planning-PT-none-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Planning-PT-none-LTLCardinality-06 finished in 425 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)||(F(!p0)&&(p1 U X(p1)))))'
Support contains 3 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 119/119 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 90 transition count 115
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 22 place count 81 transition count 104
Iterating global reduction 1 with 9 rules applied. Total rules applied 31 place count 81 transition count 104
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 81 transition count 102
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 36 place count 78 transition count 82
Iterating global reduction 2 with 3 rules applied. Total rules applied 39 place count 78 transition count 82
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 42 place count 78 transition count 79
Applied a total of 42 rules in 14 ms. Remains 78 /99 variables (removed 21) and now considering 79/119 (removed 40) transitions.
[2024-05-30 22:15:48] [INFO ] Flow matrix only has 71 transitions (discarded 8 similar events)
// Phase 1: matrix 71 rows 78 cols
[2024-05-30 22:15:48] [INFO ] Computed 37 invariants in 0 ms
[2024-05-30 22:15:48] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-30 22:15:48] [INFO ] Flow matrix only has 71 transitions (discarded 8 similar events)
[2024-05-30 22:15:48] [INFO ] Invariant cache hit.
[2024-05-30 22:15:48] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-30 22:15:48] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2024-05-30 22:15:48] [INFO ] Flow matrix only has 71 transitions (discarded 8 similar events)
[2024-05-30 22:15:48] [INFO ] Invariant cache hit.
[2024-05-30 22:15:48] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 78/99 places, 79/119 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 243 ms. Remains : 78/99 places, 79/119 transitions.
Stuttering acceptance computed with spot in 282 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : Planning-PT-none-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}]], initial=1, aps=[p0:(LEQ 1 s21), p1:(LEQ s31 s39)], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Planning-PT-none-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Planning-PT-none-LTLCardinality-08 finished in 543 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((G(p1)||p0))))'
Support contains 4 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 119/119 transitions.
Graph (trivial) has 32 edges and 99 vertex of which 26 / 99 are part of one of the 13 SCC in 1 ms
Free SCC test removed 13 places
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 456 edges and 86 vertex of which 69 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 18 place count 56 transition count 82
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 22 place count 52 transition count 60
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 52 transition count 60
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 30 place count 52 transition count 56
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 42 place count 44 transition count 52
Applied a total of 42 rules in 18 ms. Remains 44 /99 variables (removed 55) and now considering 52/119 (removed 67) transitions.
[2024-05-30 22:15:49] [INFO ] Flow matrix only has 42 transitions (discarded 10 similar events)
// Phase 1: matrix 42 rows 44 cols
[2024-05-30 22:15:49] [INFO ] Computed 20 invariants in 0 ms
[2024-05-30 22:15:49] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-30 22:15:49] [INFO ] Flow matrix only has 42 transitions (discarded 10 similar events)
[2024-05-30 22:15:49] [INFO ] Invariant cache hit.
[2024-05-30 22:15:49] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-30 22:15:49] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2024-05-30 22:15:49] [INFO ] Redundant transitions in 35 ms returned []
[2024-05-30 22:15:49] [INFO ] Flow matrix only has 42 transitions (discarded 10 similar events)
[2024-05-30 22:15:49] [INFO ] Invariant cache hit.
[2024-05-30 22:15:49] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/99 places, 52/119 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 251 ms. Remains : 44/99 places, 52/119 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Planning-PT-none-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 1 s3), p0:(OR (LEQ 2 s42) (LEQ s23 s16))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Planning-PT-none-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Planning-PT-none-LTLCardinality-09 finished in 350 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(p1&&F(p2)))))'
Support contains 5 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 119/119 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 90 transition count 115
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 19 place count 84 transition count 108
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 84 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 84 transition count 107
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 28 place count 82 transition count 103
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 82 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 82 transition count 101
Applied a total of 32 rules in 4 ms. Remains 82 /99 variables (removed 17) and now considering 101/119 (removed 18) transitions.
[2024-05-30 22:15:49] [INFO ] Flow matrix only has 77 transitions (discarded 24 similar events)
// Phase 1: matrix 77 rows 82 cols
[2024-05-30 22:15:49] [INFO ] Computed 37 invariants in 0 ms
[2024-05-30 22:15:49] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-30 22:15:49] [INFO ] Flow matrix only has 77 transitions (discarded 24 similar events)
[2024-05-30 22:15:49] [INFO ] Invariant cache hit.
[2024-05-30 22:15:49] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-30 22:15:49] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2024-05-30 22:15:49] [INFO ] Flow matrix only has 77 transitions (discarded 24 similar events)
[2024-05-30 22:15:49] [INFO ] Invariant cache hit.
[2024-05-30 22:15:49] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 82/99 places, 101/119 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 213 ms. Remains : 82/99 places, 101/119 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true]
Running random walk in product with property : Planning-PT-none-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(LEQ 2 s81), p0:(LEQ s79 s37), p1:(LEQ s3 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 214 reset in 348 ms.
Stack based approach found an accepted trace after 54 steps with 16 reset with depth 23 and stack size 23 in 2 ms.
FORMULA Planning-PT-none-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Planning-PT-none-LTLCardinality-13 finished in 720 ms.
All properties solved by simple procedures.
Total runtime 9470 ms.

BK_STOP 1717107350857

--------------------
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="Planning-PT-none"
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 Planning-PT-none, 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 r307-tajo-171654460300042"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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