fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r133-smll-167819410600299
Last Updated
May 14, 2023

About the Execution of ITS-Tools for DiscoveryGPU-PT-07a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
225.688 6932.00 13360.00 334.60 FFFFFFFTFTFTFTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r133-smll-167819410600299.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is DiscoveryGPU-PT-07a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r133-smll-167819410600299
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.5K Feb 25 13:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 13:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 13:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 13:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 13:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Feb 25 13:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 13:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 13:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 25K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678414501382

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-07a
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-10 02:15:04] [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]
[2023-03-10 02:15:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 02:15:04] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2023-03-10 02:15:04] [INFO ] Transformed 73 places.
[2023-03-10 02:15:04] [INFO ] Transformed 99 transitions.
[2023-03-10 02:15:04] [INFO ] Found NUPN structural information;
[2023-03-10 02:15:04] [INFO ] Parsed PT model containing 73 places and 99 transitions and 318 arcs in 221 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 13 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 99/99 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 69 transition count 95
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 69 transition count 95
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 65 transition count 91
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 65 transition count 91
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 62 transition count 85
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 62 transition count 85
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 62 transition count 81
Applied a total of 26 rules in 45 ms. Remains 62 /73 variables (removed 11) and now considering 81/99 (removed 18) transitions.
// Phase 1: matrix 81 rows 62 cols
[2023-03-10 02:15:04] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-10 02:15:04] [INFO ] Implicit Places using invariants in 279 ms returned []
[2023-03-10 02:15:04] [INFO ] Invariant cache hit.
[2023-03-10 02:15:05] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-10 02:15:05] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
[2023-03-10 02:15:05] [INFO ] Invariant cache hit.
[2023-03-10 02:15:05] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/73 places, 81/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 685 ms. Remains : 62/73 places, 81/99 transitions.
Support contains 13 out of 62 places after structural reductions.
[2023-03-10 02:15:05] [INFO ] Flatten gal took : 54 ms
[2023-03-10 02:15:05] [INFO ] Flatten gal took : 23 ms
[2023-03-10 02:15:05] [INFO ] Input system was already deterministic with 81 transitions.
Incomplete random walk after 10000 steps, including 132 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-10 02:15:05] [INFO ] Invariant cache hit.
[2023-03-10 02:15:06] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 02:15:06] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 3 simplifications.
Computed a total of 10 stabilizing places and 8 stable transitions
Graph (complete) has 182 edges and 62 vertex of which 59 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 81/81 transitions.
Graph (complete) has 182 edges and 62 vertex of which 59 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 67 edges and 56 vertex of which 49 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Graph (trivial) has 52 edges and 49 vertex of which 28 / 49 are part of one of the 14 SCC in 4 ms
Free SCC test removed 14 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 35 transition count 65
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 29 place count 30 transition count 51
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 35 place count 24 transition count 39
Iterating global reduction 2 with 6 rules applied. Total rules applied 41 place count 24 transition count 39
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 46 place count 19 transition count 29
Iterating global reduction 2 with 5 rules applied. Total rules applied 51 place count 19 transition count 29
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 55 place count 15 transition count 21
Iterating global reduction 2 with 4 rules applied. Total rules applied 59 place count 15 transition count 21
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 63 place count 11 transition count 17
Iterating global reduction 2 with 4 rules applied. Total rules applied 67 place count 11 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 10 transition count 17
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 72 place count 10 transition count 14
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 75 place count 7 transition count 11
Applied a total of 75 rules in 36 ms. Remains 7 /62 variables (removed 55) and now considering 11/81 (removed 70) transitions.
[2023-03-10 02:15:06] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 7 cols
[2023-03-10 02:15:06] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 02:15:06] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-10 02:15:06] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2023-03-10 02:15:06] [INFO ] Invariant cache hit.
[2023-03-10 02:15:06] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-10 02:15:06] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 02:15:06] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2023-03-10 02:15:06] [INFO ] Invariant cache hit.
[2023-03-10 02:15:06] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/62 places, 11/81 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 127 ms. Remains : 7/62 places, 11/81 transitions.
Stuttering acceptance computed with spot in 218 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s5 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 43 steps with 1 reset in 4 ms.
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLCardinality-03 finished in 435 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((G(!p0)||(!p0&&F(!p1))) U p1))))'
Support contains 6 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 81/81 transitions.
Graph (complete) has 182 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 61 transition count 78
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 59 transition count 78
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 58 transition count 77
Applied a total of 7 rules in 14 ms. Remains 58 /62 variables (removed 4) and now considering 77/81 (removed 4) transitions.
// Phase 1: matrix 77 rows 58 cols
[2023-03-10 02:15:06] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-10 02:15:06] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-10 02:15:06] [INFO ] Invariant cache hit.
[2023-03-10 02:15:06] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-10 02:15:06] [INFO ] Implicit Places using invariants and state equation in 190 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 261 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/62 places, 77/81 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 46 transition count 66
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 44 transition count 62
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 44 transition count 62
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 42 transition count 58
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 42 transition count 58
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 40 transition count 56
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 40 transition count 56
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 38 transition count 52
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 38 transition count 52
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 37 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 37 transition count 51
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 43 place count 37 transition count 51
Applied a total of 43 rules in 18 ms. Remains 37 /57 variables (removed 20) and now considering 51/77 (removed 26) transitions.
[2023-03-10 02:15:06] [INFO ] Flow matrix only has 43 transitions (discarded 8 similar events)
// Phase 1: matrix 43 rows 37 cols
[2023-03-10 02:15:06] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-10 02:15:07] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-10 02:15:07] [INFO ] Flow matrix only has 43 transitions (discarded 8 similar events)
[2023-03-10 02:15:07] [INFO ] Invariant cache hit.
[2023-03-10 02:15:07] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-10 02:15:07] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 37/62 places, 51/81 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 455 ms. Remains : 37/62 places, 51/81 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(OR p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s14 0) (EQ s6 1)), p0:(AND (OR (EQ s8 0) (EQ s29 1)) (OR (EQ s25 0) (EQ s21 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLCardinality-08 finished in 606 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 81/81 transitions.
Graph (complete) has 182 edges and 62 vertex of which 59 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 67 edges and 56 vertex of which 49 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Graph (trivial) has 52 edges and 49 vertex of which 26 / 49 are part of one of the 13 SCC in 0 ms
Free SCC test removed 13 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 36 transition count 64
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 30 place count 30 transition count 51
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 35 place count 25 transition count 41
Iterating global reduction 2 with 5 rules applied. Total rules applied 40 place count 25 transition count 41
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 44 place count 21 transition count 33
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 21 transition count 33
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 52 place count 17 transition count 25
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 17 transition count 25
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 60 place count 13 transition count 21
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 13 transition count 21
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 68 place count 11 transition count 19
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 11 transition count 17
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 73 place count 8 transition count 14
Applied a total of 73 rules in 11 ms. Remains 8 /62 variables (removed 54) and now considering 14/81 (removed 67) transitions.
[2023-03-10 02:15:07] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
// Phase 1: matrix 11 rows 8 cols
[2023-03-10 02:15:07] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 02:15:07] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-10 02:15:07] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
[2023-03-10 02:15:07] [INFO ] Invariant cache hit.
[2023-03-10 02:15:07] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-10 02:15:07] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 02:15:07] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
[2023-03-10 02:15:07] [INFO ] Invariant cache hit.
[2023-03-10 02:15:07] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/62 places, 14/81 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106 ms. Remains : 8/62 places, 14/81 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLCardinality-12 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 (NEQ s2 0) (NEQ s5 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 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLCardinality-12 finished in 171 ms.
All properties solved by simple procedures.
Total runtime 3354 ms.

BK_STOP 1678414508314

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-07a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-5348"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-07a, 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 r133-smll-167819410600299"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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