Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r571-tall-171734910100027.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is CO4-PT-06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r571-tall-171734910100027
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 5.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 97K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717368606913

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=CO4-PT-06
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-02 22:50:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 22:50:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:50:08] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2024-06-02 22:50:08] [INFO ] Transformed 383 places.
[2024-06-02 22:50:08] [INFO ] Transformed 454 transitions.
[2024-06-02 22:50:08] [INFO ] Found NUPN structural information;
[2024-06-02 22:50:08] [INFO ] Parsed PT model containing 383 places and 454 transitions and 1016 arcs in 127 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 100 places in 5 ms
Reduce places removed 100 places and 120 transitions.
FORMULA CO4-PT-06-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 334/334 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 274 transition count 333
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 67 place count 217 transition count 274
Iterating global reduction 1 with 57 rules applied. Total rules applied 124 place count 217 transition count 274
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 127 place count 217 transition count 271
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 153 place count 191 transition count 245
Iterating global reduction 2 with 26 rules applied. Total rules applied 179 place count 191 transition count 245
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 180 place count 191 transition count 244
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 185 place count 186 transition count 236
Iterating global reduction 3 with 5 rules applied. Total rules applied 190 place count 186 transition count 236
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 193 place count 183 transition count 233
Iterating global reduction 3 with 3 rules applied. Total rules applied 196 place count 183 transition count 233
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 197 place count 182 transition count 232
Iterating global reduction 3 with 1 rules applied. Total rules applied 198 place count 182 transition count 232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 199 place count 182 transition count 231
Applied a total of 199 rules in 68 ms. Remains 182 /283 variables (removed 101) and now considering 231/334 (removed 103) transitions.
// Phase 1: matrix 231 rows 182 cols
[2024-06-02 22:50:08] [INFO ] Computed 4 invariants in 16 ms
[2024-06-02 22:50:09] [INFO ] Implicit Places using invariants in 534 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 559 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 181/283 places, 231/334 transitions.
Applied a total of 0 rules in 4 ms. Remains 181 /181 variables (removed 0) and now considering 231/231 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 632 ms. Remains : 181/283 places, 231/334 transitions.
Support contains 16 out of 181 places after structural reductions.
[2024-06-02 22:50:09] [INFO ] Flatten gal took : 42 ms
[2024-06-02 22:50:09] [INFO ] Flatten gal took : 16 ms
[2024-06-02 22:50:09] [INFO ] Input system was already deterministic with 231 transitions.
Support contains 14 out of 181 places (down from 16) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 12 resets, run finished after 382 ms. (steps per millisecond=26 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 64 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 231 rows 181 cols
[2024-06-02 22:50:11] [INFO ] Computed 3 invariants in 6 ms
[2024-06-02 22:50:11] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-06-02 22:50:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-02 22:50:11] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-06-02 22:50:11] [INFO ] After 242ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 68 ms.
[2024-06-02 22:50:11] [INFO ] After 402ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 6 different solutions.
Finished Parikh walk after 49 steps, including 1 resets, run visited all 3 properties in 2 ms. (steps per millisecond=24 )
Parikh walk visited 7 properties in 10 ms.
Computed a total of 10 stabilizing places and 12 stable transitions
Graph (complete) has 298 edges and 181 vertex of which 176 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 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 181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 181/181 places, 231/231 transitions.
Graph (trivial) has 190 edges and 181 vertex of which 2 / 181 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 297 edges and 180 vertex of which 175 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 175 transition count 163
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 127 place count 113 transition count 162
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 127 place count 113 transition count 141
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 169 place count 92 transition count 141
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 170 place count 91 transition count 140
Iterating global reduction 2 with 1 rules applied. Total rules applied 171 place count 91 transition count 140
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 172 place count 90 transition count 139
Iterating global reduction 2 with 1 rules applied. Total rules applied 173 place count 90 transition count 139
Performed 30 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 233 place count 60 transition count 100
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 236 place count 60 transition count 97
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 238 place count 58 transition count 95
Iterating global reduction 3 with 2 rules applied. Total rules applied 240 place count 58 transition count 95
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 3 with 4 rules applied. Total rules applied 244 place count 56 transition count 93
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 272 place count 42 transition count 94
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 280 place count 42 transition count 86
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 290 place count 32 transition count 66
Iterating global reduction 4 with 10 rules applied. Total rules applied 300 place count 32 transition count 66
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 307 place count 32 transition count 59
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 310 place count 29 transition count 50
Iterating global reduction 5 with 3 rules applied. Total rules applied 313 place count 29 transition count 50
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 315 place count 29 transition count 48
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 319 place count 29 transition count 44
Applied a total of 319 rules in 35 ms. Remains 29 /181 variables (removed 152) and now considering 44/231 (removed 187) transitions.
[2024-06-02 22:50:11] [INFO ] Flow matrix only has 40 transitions (discarded 4 similar events)
// Phase 1: matrix 40 rows 29 cols
[2024-06-02 22:50:11] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 22:50:11] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-02 22:50:11] [INFO ] Flow matrix only has 40 transitions (discarded 4 similar events)
[2024-06-02 22:50:11] [INFO ] Invariant cache hit.
[2024-06-02 22:50:11] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-02 22:50:11] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-06-02 22:50:12] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:50:12] [INFO ] Flow matrix only has 40 transitions (discarded 4 similar events)
[2024-06-02 22:50:12] [INFO ] Invariant cache hit.
[2024-06-02 22:50:12] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/181 places, 44/231 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 154 ms. Remains : 29/181 places, 44/231 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 132 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-06-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:(OR (EQ s23 0) (EQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7 reset in 156 ms.
Product exploration explored 100000 steps with 0 reset in 77 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 158 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Support contains 2 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 44/44 transitions.
Applied a total of 0 rules in 4 ms. Remains 29 /29 variables (removed 0) and now considering 44/44 (removed 0) transitions.
[2024-06-02 22:50:12] [INFO ] Flow matrix only has 40 transitions (discarded 4 similar events)
[2024-06-02 22:50:12] [INFO ] Invariant cache hit.
[2024-06-02 22:50:12] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-02 22:50:12] [INFO ] Flow matrix only has 40 transitions (discarded 4 similar events)
[2024-06-02 22:50:12] [INFO ] Invariant cache hit.
[2024-06-02 22:50:12] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-02 22:50:12] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-06-02 22:50:12] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 22:50:12] [INFO ] Flow matrix only has 40 transitions (discarded 4 similar events)
[2024-06-02 22:50:12] [INFO ] Invariant cache hit.
[2024-06-02 22:50:13] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 126 ms. Remains : 29/29 places, 44/44 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 133 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 140 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration explored 100000 steps with 14 reset in 79 ms.
Product exploration explored 100000 steps with 2 reset in 68 ms.
Built C files in :
/tmp/ltsmin5853829167137963722
[2024-06-02 22:50:13] [INFO ] Computing symmetric may disable matrix : 44 transitions.
[2024-06-02 22:50:13] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:50:13] [INFO ] Computing symmetric may enable matrix : 44 transitions.
[2024-06-02 22:50:13] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:50:13] [INFO ] Computing Do-Not-Accords matrix : 44 transitions.
[2024-06-02 22:50:13] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:50:13] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5853829167137963722
Running compilation step : cd /tmp/ltsmin5853829167137963722;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 220 ms.
Running link step : cd /tmp/ltsmin5853829167137963722;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin5853829167137963722;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5925873583512587802.hoa' '--buchi-type=spotba'
LTSmin run took 82 ms.
FORMULA CO4-PT-06-LTLCardinality-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-06-LTLCardinality-04 finished in 2178 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&&G(p1))))'
Support contains 2 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 231/231 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 175 transition count 225
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 175 transition count 225
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 170 transition count 220
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 170 transition count 220
Applied a total of 22 rules in 12 ms. Remains 170 /181 variables (removed 11) and now considering 220/231 (removed 11) transitions.
// Phase 1: matrix 220 rows 170 cols
[2024-06-02 22:50:14] [INFO ] Computed 3 invariants in 3 ms
[2024-06-02 22:50:14] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 22:50:14] [INFO ] Invariant cache hit.
[2024-06-02 22:50:14] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2024-06-02 22:50:14] [INFO ] Invariant cache hit.
[2024-06-02 22:50:14] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 170/181 places, 220/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 274 ms. Remains : 170/181 places, 220/231 transitions.
Stuttering acceptance computed with spot in 146 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-06-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(NEQ s55 0), p0:(NEQ s140 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CO4-PT-06-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-06-LTLCardinality-08 finished in 437 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||F(p1)))))'
Support contains 2 out of 181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 181/181 places, 231/231 transitions.
Graph (trivial) has 188 edges and 181 vertex of which 2 / 181 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 297 edges and 180 vertex of which 175 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 63 place count 174 transition count 163
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 113 transition count 162
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 125 place count 113 transition count 141
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 167 place count 92 transition count 141
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 168 place count 91 transition count 140
Iterating global reduction 2 with 1 rules applied. Total rules applied 169 place count 91 transition count 140
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 170 place count 90 transition count 139
Iterating global reduction 2 with 1 rules applied. Total rules applied 171 place count 90 transition count 139
Performed 29 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 229 place count 61 transition count 101
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 232 place count 61 transition count 98
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 234 place count 59 transition count 96
Iterating global reduction 3 with 2 rules applied. Total rules applied 236 place count 59 transition count 96
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 3 with 4 rules applied. Total rules applied 240 place count 57 transition count 94
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 266 place count 44 transition count 95
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 274 place count 44 transition count 87
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 283 place count 35 transition count 69
Iterating global reduction 4 with 9 rules applied. Total rules applied 292 place count 35 transition count 69
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 299 place count 35 transition count 62
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 301 place count 33 transition count 56
Iterating global reduction 5 with 2 rules applied. Total rules applied 303 place count 33 transition count 56
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 305 place count 33 transition count 54
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 309 place count 33 transition count 50
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 311 place count 31 transition count 48
Applied a total of 311 rules in 41 ms. Remains 31 /181 variables (removed 150) and now considering 48/231 (removed 183) transitions.
[2024-06-02 22:50:14] [INFO ] Flow matrix only has 43 transitions (discarded 5 similar events)
// Phase 1: matrix 43 rows 31 cols
[2024-06-02 22:50:14] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 22:50:14] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-02 22:50:14] [INFO ] Flow matrix only has 43 transitions (discarded 5 similar events)
[2024-06-02 22:50:14] [INFO ] Invariant cache hit.
[2024-06-02 22:50:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:50:14] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-06-02 22:50:14] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 22:50:14] [INFO ] Flow matrix only has 43 transitions (discarded 5 similar events)
[2024-06-02 22:50:14] [INFO ] Invariant cache hit.
[2024-06-02 22:50:14] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/181 places, 48/231 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 172 ms. Remains : 31/181 places, 48/231 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-06-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s3 0), p1:(AND (EQ s3 0) (EQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2 reset in 134 ms.
Product exploration explored 100000 steps with 4 reset in 102 ms.
Computed a total of 6 stabilizing places and 9 stable transitions
Computed a total of 6 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 95 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 266 steps, including 37 resets, run visited all 2 properties in 7 ms. (steps per millisecond=38 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 155 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 48/48 transitions.
Applied a total of 0 rules in 6 ms. Remains 31 /31 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2024-06-02 22:50:15] [INFO ] Flow matrix only has 43 transitions (discarded 5 similar events)
[2024-06-02 22:50:15] [INFO ] Invariant cache hit.
[2024-06-02 22:50:15] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-02 22:50:15] [INFO ] Flow matrix only has 43 transitions (discarded 5 similar events)
[2024-06-02 22:50:15] [INFO ] Invariant cache hit.
[2024-06-02 22:50:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:50:15] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-06-02 22:50:15] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 22:50:15] [INFO ] Flow matrix only has 43 transitions (discarded 5 similar events)
[2024-06-02 22:50:15] [INFO ] Invariant cache hit.
[2024-06-02 22:50:15] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 135 ms. Remains : 31/31 places, 48/48 transitions.
Computed a total of 6 stabilizing places and 9 stable transitions
Computed a total of 6 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 99 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 197 steps, including 28 resets, run visited all 2 properties in 2 ms. (steps per millisecond=98 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 254 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1 reset in 32 ms.
Product exploration explored 100000 steps with 6 reset in 50 ms.
Built C files in :
/tmp/ltsmin1907898712574851052
[2024-06-02 22:50:16] [INFO ] Computing symmetric may disable matrix : 48 transitions.
[2024-06-02 22:50:16] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:50:16] [INFO ] Computing symmetric may enable matrix : 48 transitions.
[2024-06-02 22:50:16] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:50:16] [INFO ] Computing Do-Not-Accords matrix : 48 transitions.
[2024-06-02 22:50:16] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:50:16] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1907898712574851052
Running compilation step : cd /tmp/ltsmin1907898712574851052;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 118 ms.
Running link step : cd /tmp/ltsmin1907898712574851052;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin1907898712574851052;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13838237238255781101.hoa' '--buchi-type=spotba'
LTSmin run took 120 ms.
FORMULA CO4-PT-06-LTLCardinality-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-06-LTLCardinality-09 finished in 2299 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 231/231 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 180 transition count 231
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 172 transition count 223
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 172 transition count 223
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 172 transition count 221
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 24 place count 167 transition count 216
Iterating global reduction 2 with 5 rules applied. Total rules applied 29 place count 167 transition count 216
Applied a total of 29 rules in 13 ms. Remains 167 /181 variables (removed 14) and now considering 216/231 (removed 15) transitions.
// Phase 1: matrix 216 rows 167 cols
[2024-06-02 22:50:16] [INFO ] Computed 3 invariants in 3 ms
[2024-06-02 22:50:16] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 22:50:16] [INFO ] Invariant cache hit.
[2024-06-02 22:50:16] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-06-02 22:50:16] [INFO ] Invariant cache hit.
[2024-06-02 22:50:17] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 167/181 places, 216/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 266 ms. Remains : 167/181 places, 216/231 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-06-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(NEQ s165 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 6 reset in 80 ms.
Product exploration explored 100000 steps with 5 reset in 69 ms.
Computed a total of 10 stabilizing places and 12 stable transitions
Graph (complete) has 281 edges and 167 vertex of which 164 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 10 stabilizing places and 12 stable transitions
Detected a total of 10/167 stabilizing places and 12/216 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Finished Best-First random walk after 6971 steps, including 6 resets, run visited all 1 properties in 9 ms. (steps per millisecond=774 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 167 /167 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-02 22:50:17] [INFO ] Invariant cache hit.
[2024-06-02 22:50:17] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-02 22:50:17] [INFO ] Invariant cache hit.
[2024-06-02 22:50:18] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2024-06-02 22:50:18] [INFO ] Invariant cache hit.
[2024-06-02 22:50:18] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 228 ms. Remains : 167/167 places, 216/216 transitions.
Computed a total of 10 stabilizing places and 12 stable transitions
Graph (complete) has 281 edges and 167 vertex of which 164 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 10 stabilizing places and 12 stable transitions
Detected a total of 10/167 stabilizing places and 12/216 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished Best-First random walk after 95 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=47 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6 reset in 61 ms.
Product exploration explored 100000 steps with 0 reset in 58 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 216/216 transitions.
Graph (trivial) has 177 edges and 167 vertex of which 2 / 167 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 280 edges and 166 vertex of which 163 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
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 163 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 57 place count 163 transition count 211
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 57 place count 163 transition count 232
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 79 place count 163 transition count 232
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 90 place count 152 transition count 221
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 101 place count 152 transition count 221
Performed 20 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 121 place count 152 transition count 241
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 125 place count 152 transition count 237
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 137 place count 140 transition count 223
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 149 place count 140 transition count 223
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 150 place count 140 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 151 place count 140 transition count 222
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 153 place count 138 transition count 220
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 155 place count 138 transition count 220
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 156 place count 138 transition count 220
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 157 place count 137 transition count 219
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 158 place count 137 transition count 219
Performed 23 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 97 places in 0 ms
Iterating global reduction 4 with 23 rules applied. Total rules applied 181 place count 137 transition count 319
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 202 place count 137 transition count 298
Discarding 44 places :
Symmetric choice reduction at 5 with 44 rule applications. Total rules 246 place count 93 transition count 196
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 5 with 44 rules applied. Total rules applied 290 place count 93 transition count 196
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 307 place count 93 transition count 179
Discarding 29 places :
Symmetric choice reduction at 6 with 29 rule applications. Total rules 336 place count 64 transition count 125
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 6 with 29 rules applied. Total rules applied 365 place count 64 transition count 125
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 368 place count 64 transition count 122
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 374 place count 58 transition count 110
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 7 with 6 rules applied. Total rules applied 380 place count 58 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 381 place count 58 transition count 135
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 388 place count 58 transition count 128
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 391 place count 55 transition count 110
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 394 place count 55 transition count 110
Deduced a syphon composed of 30 places in 0 ms
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 401 place count 55 transition count 103
Deduced a syphon composed of 30 places in 0 ms
Applied a total of 401 rules in 64 ms. Remains 55 /167 variables (removed 112) and now considering 103/216 (removed 113) transitions.
[2024-06-02 22:50:19] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 22:50:19] [INFO ] Flow matrix only has 100 transitions (discarded 3 similar events)
// Phase 1: matrix 100 rows 55 cols
[2024-06-02 22:50:19] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 22:50:19] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/167 places, 103/216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 122 ms. Remains : 55/167 places, 103/216 transitions.
Built C files in :
/tmp/ltsmin1652133654340317562
[2024-06-02 22:50:19] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1652133654340317562
Running compilation step : cd /tmp/ltsmin1652133654340317562;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 282 ms.
Running link step : cd /tmp/ltsmin1652133654340317562;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin1652133654340317562;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1318461157079786312.hoa' '--buchi-type=spotba'
LTSmin run took 146 ms.
FORMULA CO4-PT-06-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-06-LTLCardinality-10 finished in 3097 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 U p1)&&F(p2))))'
Support contains 6 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 231/231 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 180 transition count 231
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 175 transition count 226
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 175 transition count 226
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 13 place count 175 transition count 224
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 16 place count 172 transition count 221
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 place count 172 transition count 221
Applied a total of 19 rules in 12 ms. Remains 172 /181 variables (removed 9) and now considering 221/231 (removed 10) transitions.
// Phase 1: matrix 221 rows 172 cols
[2024-06-02 22:50:19] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 22:50:19] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 22:50:19] [INFO ] Invariant cache hit.
[2024-06-02 22:50:19] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2024-06-02 22:50:19] [INFO ] Invariant cache hit.
[2024-06-02 22:50:20] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 172/181 places, 221/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 233 ms. Remains : 172/181 places, 221/231 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p2), (NOT p1), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : CO4-PT-06-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p2:(OR (EQ s116 0) (EQ s100 1)), p1:(AND (OR (EQ s133 0) (EQ s83 1)) (OR (EQ s116 0) (EQ s100 1))), p0:(OR (EQ s77 0) (EQ s69 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 263 ms.
Product exploration explored 100000 steps with 50000 reset in 242 ms.
Computed a total of 10 stabilizing places and 12 stable transitions
Graph (complete) has 288 edges and 172 vertex of which 169 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 10 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) p0 p2))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 p2))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 419 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-06-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-06-LTLCardinality-12 finished in 1350 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 2 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 231/231 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 180 transition count 231
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 173 transition count 224
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 173 transition count 224
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 173 transition count 222
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 21 place count 169 transition count 218
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 169 transition count 218
Applied a total of 25 rules in 11 ms. Remains 169 /181 variables (removed 12) and now considering 218/231 (removed 13) transitions.
// Phase 1: matrix 218 rows 169 cols
[2024-06-02 22:50:21] [INFO ] Computed 3 invariants in 2 ms
[2024-06-02 22:50:21] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 22:50:21] [INFO ] Invariant cache hit.
[2024-06-02 22:50:21] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2024-06-02 22:50:21] [INFO ] Invariant cache hit.
[2024-06-02 22:50:21] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 169/181 places, 218/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 419 ms. Remains : 169/181 places, 218/231 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-06-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s147 0) (EQ s138 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA CO4-PT-06-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-06-LTLCardinality-14 finished in 511 ms.
All properties solved by simple procedures.
Total runtime 13336 ms.

BK_STOP 1717368622802

--------------------
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="CO4-PT-06"
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 CO4-PT-06, 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 r571-tall-171734910100027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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