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.r219-smll-171649597800057.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 HirschbergSinclair-PT-25, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r219-smll-171649597800057
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 13 03:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 13 03:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 13 03:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 13 03:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 321K May 18 16:42 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 HirschbergSinclair-PT-25-LTLCardinality-00
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-01
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-02
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-03
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-04
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-05
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-06
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-07
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-08
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-09
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-10
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-11
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-12
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-13
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-14
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716641552017

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=HirschbergSinclair-PT-25
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-25 12:52:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 12:52:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 12:52:35] [INFO ] Load time of PNML (sax parser for PT used): 177 ms
[2024-05-25 12:52:35] [INFO ] Transformed 600 places.
[2024-05-25 12:52:35] [INFO ] Transformed 545 transitions.
[2024-05-25 12:52:35] [INFO ] Parsed PT model containing 600 places and 545 transitions and 1664 arcs in 339 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA HirschbergSinclair-PT-25-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 600/600 places, 545/545 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 575 transition count 545
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 43 place count 557 transition count 527
Iterating global reduction 1 with 18 rules applied. Total rules applied 61 place count 557 transition count 527
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 77 place count 541 transition count 511
Iterating global reduction 1 with 16 rules applied. Total rules applied 93 place count 541 transition count 511
Applied a total of 93 rules in 269 ms. Remains 541 /600 variables (removed 59) and now considering 511/545 (removed 34) transitions.
// Phase 1: matrix 511 rows 541 cols
[2024-05-25 12:52:36] [INFO ] Computed 30 invariants in 50 ms
[2024-05-25 12:52:37] [INFO ] Implicit Places using invariants in 894 ms returned []
[2024-05-25 12:52:37] [INFO ] Invariant cache hit.
[2024-05-25 12:52:39] [INFO ] Implicit Places using invariants and state equation in 2179 ms returned []
Implicit Place search using SMT with State Equation took 3144 ms to find 0 implicit places.
[2024-05-25 12:52:39] [INFO ] Invariant cache hit.
[2024-05-25 12:52:40] [INFO ] Dead Transitions using invariants and state equation in 689 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 541/600 places, 511/545 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4107 ms. Remains : 541/600 places, 511/545 transitions.
Support contains 53 out of 541 places after structural reductions.
[2024-05-25 12:52:40] [INFO ] Flatten gal took : 157 ms
[2024-05-25 12:52:40] [INFO ] Flatten gal took : 74 ms
[2024-05-25 12:52:40] [INFO ] Input system was already deterministic with 511 transitions.
Support contains 52 out of 541 places (down from 53) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 731 ms. (steps per millisecond=13 ) properties (out of 31) seen :18
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2024-05-25 12:52:42] [INFO ] Invariant cache hit.
[2024-05-25 12:52:42] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 125 ms returned sat
[2024-05-25 12:52:43] [INFO ] After 700ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-25 12:52:43] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 77 ms returned sat
[2024-05-25 12:52:44] [INFO ] After 424ms SMT Verify possible using state equation in natural domain returned unsat :11 sat :2
[2024-05-25 12:52:44] [INFO ] After 644ms SMT Verify possible using trap constraints in natural domain returned unsat :11 sat :2
Attempting to minimize the solution found.
Minimization took 78 ms.
[2024-05-25 12:52:44] [INFO ] After 1427ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :2
Fused 13 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 30 ms.
Support contains 8 out of 541 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 541/541 places, 511/511 transitions.
Graph (complete) has 1022 edges and 541 vertex of which 516 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.5 ms
Discarding 25 places :
Also discarding 0 output transitions
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 219 transitions
Trivial Post-agglo rules discarded 219 transitions
Performed 219 trivial Post agglomeration. Transition count delta: 219
Iterating post reduction 0 with 244 rules applied. Total rules applied 245 place count 516 transition count 267
Reduce places removed 219 places and 0 transitions.
Graph (complete) has 506 edges and 297 vertex of which 211 are kept as prefixes of interest. Removing 86 places using SCC suffix rule.0 ms
Discarding 86 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 222 rules applied. Total rules applied 467 place count 211 transition count 265
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 555 place count 209 transition count 179
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 555 place count 209 transition count 178
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 557 place count 208 transition count 178
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 558 place count 207 transition count 177
Iterating global reduction 3 with 1 rules applied. Total rules applied 559 place count 207 transition count 177
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 560 place count 207 transition count 176
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 335 edges and 206 vertex of which 204 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 562 place count 204 transition count 176
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 564 place count 204 transition count 174
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 566 place count 203 transition count 173
Graph (complete) has 327 edges and 203 vertex of which 201 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 1 rules applied. Total rules applied 567 place count 201 transition count 173
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 569 place count 201 transition count 171
Reduce places removed 21 places and 21 transitions.
Iterating global reduction 8 with 21 rules applied. Total rules applied 590 place count 180 transition count 150
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 8 with 82 rules applied. Total rules applied 672 place count 162 transition count 86
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 9 with 64 rules applied. Total rules applied 736 place count 98 transition count 86
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 32 Pre rules applied. Total rules applied 736 place count 98 transition count 54
Deduced a syphon composed of 32 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 10 with 65 rules applied. Total rules applied 801 place count 65 transition count 54
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 10 with 2 rules applied. Total rules applied 803 place count 63 transition count 54
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 2 Pre rules applied. Total rules applied 803 place count 63 transition count 52
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 807 place count 61 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 809 place count 60 transition count 51
Applied a total of 809 rules in 102 ms. Remains 60 /541 variables (removed 481) and now considering 51/511 (removed 460) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 60/541 places, 51/511 transitions.
Incomplete random walk after 10000 steps, including 192 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 58 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :1
Finished Best-First random walk after 212 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=106 )
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 11 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA HirschbergSinclair-PT-25-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-25-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-25-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-25-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 541 stabilizing places and 511 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 541 transition count 511
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA HirschbergSinclair-PT-25-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 511/511 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 532 transition count 502
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 532 transition count 502
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 525 transition count 495
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 525 transition count 495
Applied a total of 32 rules in 81 ms. Remains 525 /541 variables (removed 16) and now considering 495/511 (removed 16) transitions.
// Phase 1: matrix 495 rows 525 cols
[2024-05-25 12:52:45] [INFO ] Computed 30 invariants in 7 ms
[2024-05-25 12:52:45] [INFO ] Implicit Places using invariants in 387 ms returned []
[2024-05-25 12:52:45] [INFO ] Invariant cache hit.
[2024-05-25 12:52:48] [INFO ] Implicit Places using invariants and state equation in 2259 ms returned []
Implicit Place search using SMT with State Equation took 2652 ms to find 0 implicit places.
[2024-05-25 12:52:48] [INFO ] Invariant cache hit.
[2024-05-25 12:52:48] [INFO ] Dead Transitions using invariants and state equation in 664 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 525/541 places, 495/511 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3400 ms. Remains : 525/541 places, 495/511 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 261 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s154 s452)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-25-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-01 finished in 3738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 511/511 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 532 transition count 502
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 532 transition count 502
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 525 transition count 495
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 525 transition count 495
Applied a total of 32 rules in 54 ms. Remains 525 /541 variables (removed 16) and now considering 495/511 (removed 16) transitions.
[2024-05-25 12:52:49] [INFO ] Invariant cache hit.
[2024-05-25 12:52:49] [INFO ] Implicit Places using invariants in 475 ms returned []
[2024-05-25 12:52:49] [INFO ] Invariant cache hit.
[2024-05-25 12:52:51] [INFO ] Implicit Places using invariants and state equation in 2384 ms returned []
Implicit Place search using SMT with State Equation took 2875 ms to find 0 implicit places.
[2024-05-25 12:52:51] [INFO ] Invariant cache hit.
[2024-05-25 12:52:52] [INFO ] Dead Transitions using invariants and state equation in 522 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 525/541 places, 495/511 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3454 ms. Remains : 525/541 places, 495/511 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s123 s489)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-25-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-02 finished in 3575 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 541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 511/511 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 532 transition count 502
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 532 transition count 502
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 525 transition count 495
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 525 transition count 495
Applied a total of 32 rules in 50 ms. Remains 525 /541 variables (removed 16) and now considering 495/511 (removed 16) transitions.
[2024-05-25 12:52:52] [INFO ] Invariant cache hit.
[2024-05-25 12:52:53] [INFO ] Implicit Places using invariants in 489 ms returned []
[2024-05-25 12:52:53] [INFO ] Invariant cache hit.
[2024-05-25 12:52:55] [INFO ] Implicit Places using invariants and state equation in 2417 ms returned []
Implicit Place search using SMT with State Equation took 2919 ms to find 0 implicit places.
[2024-05-25 12:52:55] [INFO ] Invariant cache hit.
[2024-05-25 12:52:56] [INFO ] Dead Transitions using invariants and state equation in 634 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 525/541 places, 495/511 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3607 ms. Remains : 525/541 places, 495/511 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s282 s209)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1053 ms.
Product exploration explored 100000 steps with 50000 reset in 611 ms.
Computed a total of 525 stabilizing places and 495 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 525 transition count 495
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 24 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-25-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-03 finished in 5618 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (p1 U p2)))'
Support contains 6 out of 541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 541/541 places, 511/511 transitions.
Reduce places removed 22 places and 22 transitions.
Drop transitions removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 221 rules applied. Total rules applied 221 place count 519 transition count 268
Reduce places removed 221 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 222 rules applied. Total rules applied 443 place count 298 transition count 267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 444 place count 297 transition count 267
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 452 place count 289 transition count 259
Iterating global reduction 3 with 8 rules applied. Total rules applied 460 place count 289 transition count 259
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 461 place count 289 transition count 258
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 462 place count 288 transition count 258
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 464 place count 287 transition count 257
Applied a total of 464 rules in 72 ms. Remains 287 /541 variables (removed 254) and now considering 257/511 (removed 254) transitions.
// Phase 1: matrix 257 rows 287 cols
[2024-05-25 12:52:58] [INFO ] Computed 30 invariants in 2 ms
[2024-05-25 12:52:58] [INFO ] Implicit Places using invariants in 391 ms returned []
[2024-05-25 12:52:58] [INFO ] Invariant cache hit.
[2024-05-25 12:52:58] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-25 12:52:59] [INFO ] Implicit Places using invariants and state equation in 1166 ms returned []
Implicit Place search using SMT with State Equation took 1563 ms to find 0 implicit places.
[2024-05-25 12:52:59] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-25 12:52:59] [INFO ] Invariant cache hit.
[2024-05-25 12:53:00] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 287/541 places, 257/511 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1926 ms. Remains : 287/541 places, 257/511 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p2), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p2:(GT s46 s214), p1:(OR (LEQ s53 s17) (LEQ s175 s168)), p0:(LEQ s175 s168)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3624 reset in 468 ms.
Product exploration explored 100000 steps with 3589 reset in 564 ms.
Computed a total of 287 stabilizing places and 257 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 287 transition count 257
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 8 factoid took 853 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p2)]
Finished random walk after 26 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 8 factoid took 784 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p2)]
[2024-05-25 12:53:03] [INFO ] Invariant cache hit.
[2024-05-25 12:53:03] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 57 ms returned sat
[2024-05-25 12:53:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:53:05] [INFO ] [Real]Absence check using state equation in 1900 ms returned sat
[2024-05-25 12:53:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:53:05] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 109 ms returned sat
[2024-05-25 12:53:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:53:07] [INFO ] [Nat]Absence check using state equation in 1664 ms returned sat
[2024-05-25 12:53:07] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-25 12:53:07] [INFO ] [Nat]Added 23 Read/Feed constraints in 25 ms returned sat
[2024-05-25 12:53:07] [INFO ] Computed and/alt/rep : 217/245/217 causal constraints (skipped 0 transitions) in 21 ms.
[2024-05-25 12:53:08] [INFO ] Added : 94 causal constraints over 19 iterations in 562 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 2 out of 287 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 287/287 places, 257/257 transitions.
Applied a total of 0 rules in 31 ms. Remains 287 /287 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-05-25 12:53:08] [INFO ] Invariant cache hit.
[2024-05-25 12:53:08] [INFO ] Implicit Places using invariants in 429 ms returned []
[2024-05-25 12:53:08] [INFO ] Invariant cache hit.
[2024-05-25 12:53:08] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-25 12:53:09] [INFO ] Implicit Places using invariants and state equation in 1336 ms returned []
Implicit Place search using SMT with State Equation took 1769 ms to find 0 implicit places.
[2024-05-25 12:53:09] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-25 12:53:09] [INFO ] Invariant cache hit.
[2024-05-25 12:53:10] [INFO ] Dead Transitions using invariants and state equation in 388 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2207 ms. Remains : 287/287 places, 257/257 transitions.
Computed a total of 287 stabilizing places and 257 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 287 transition count 257
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 219 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p2)]
Finished random walk after 48 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=24 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 2 factoid took 282 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p2)]
[2024-05-25 12:53:11] [INFO ] Invariant cache hit.
[2024-05-25 12:53:11] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 89 ms returned sat
[2024-05-25 12:53:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 12:53:13] [INFO ] [Real]Absence check using state equation in 2123 ms returned sat
[2024-05-25 12:53:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 12:53:14] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 109 ms returned sat
[2024-05-25 12:53:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 12:53:15] [INFO ] [Nat]Absence check using state equation in 1729 ms returned sat
[2024-05-25 12:53:15] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-25 12:53:15] [INFO ] [Nat]Added 23 Read/Feed constraints in 25 ms returned sat
[2024-05-25 12:53:15] [INFO ] Computed and/alt/rep : 217/245/217 causal constraints (skipped 0 transitions) in 18 ms.
[2024-05-25 12:53:16] [INFO ] Added : 94 causal constraints over 19 iterations in 549 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 54 ms :[(NOT p2)]
Product exploration explored 100000 steps with 3617 reset in 733 ms.
Product exploration explored 100000 steps with 3608 reset in 568 ms.
Built C files in :
/tmp/ltsmin6760284072398066898
[2024-05-25 12:53:17] [INFO ] Computing symmetric may disable matrix : 257 transitions.
[2024-05-25 12:53:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:53:17] [INFO ] Computing symmetric may enable matrix : 257 transitions.
[2024-05-25 12:53:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:53:17] [INFO ] Computing Do-Not-Accords matrix : 257 transitions.
[2024-05-25 12:53:17] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 12:53:17] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6760284072398066898
Running compilation step : cd /tmp/ltsmin6760284072398066898;'/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 1394 ms.
Running link step : cd /tmp/ltsmin6760284072398066898;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 73 ms.
Running LTSmin : cd /tmp/ltsmin6760284072398066898;'/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/stateBased14426092216018265287.hoa' '--buchi-type=spotba'
LTSmin run took 1493 ms.
FORMULA HirschbergSinclair-PT-25-LTLCardinality-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-07 finished in 22698 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((p1&&(G(!p0)||(!p0&&F(p2))))))))'
Support contains 6 out of 541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 541/541 places, 511/511 transitions.
Reduce places removed 23 places and 23 transitions.
Drop transitions removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 518 transition count 278
Reduce places removed 210 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 212 rules applied. Total rules applied 422 place count 308 transition count 276
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 424 place count 306 transition count 276
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 430 place count 300 transition count 270
Iterating global reduction 3 with 6 rules applied. Total rules applied 436 place count 300 transition count 270
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 438 place count 300 transition count 268
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 440 place count 298 transition count 268
Applied a total of 440 rules in 85 ms. Remains 298 /541 variables (removed 243) and now considering 268/511 (removed 243) transitions.
// Phase 1: matrix 268 rows 298 cols
[2024-05-25 12:53:20] [INFO ] Computed 30 invariants in 6 ms
[2024-05-25 12:53:21] [INFO ] Implicit Places using invariants in 327 ms returned []
[2024-05-25 12:53:21] [INFO ] Invariant cache hit.
[2024-05-25 12:53:21] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-25 12:53:22] [INFO ] Implicit Places using invariants and state equation in 907 ms returned []
Implicit Place search using SMT with State Equation took 1239 ms to find 0 implicit places.
[2024-05-25 12:53:22] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-25 12:53:22] [INFO ] Invariant cache hit.
[2024-05-25 12:53:22] [INFO ] Dead Transitions using invariants and state equation in 420 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 298/541 places, 268/511 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1761 ms. Remains : 298/541 places, 268/511 transitions.
Stuttering acceptance computed with spot in 298 ms :[true, (OR (NOT p1) p0), (AND p0 (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s290 s65), p1:(GT s115 s39), p2:(LEQ s74 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 291 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-25-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-08 finished in 2100 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U X(X(G(!p1))))&&F(p0)))'
Support contains 5 out of 541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 511/511 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 533 transition count 503
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 533 transition count 503
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 526 transition count 496
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 526 transition count 496
Applied a total of 30 rules in 76 ms. Remains 526 /541 variables (removed 15) and now considering 496/511 (removed 15) transitions.
// Phase 1: matrix 496 rows 526 cols
[2024-05-25 12:53:23] [INFO ] Computed 30 invariants in 6 ms
[2024-05-25 12:53:23] [INFO ] Implicit Places using invariants in 593 ms returned []
[2024-05-25 12:53:23] [INFO ] Invariant cache hit.
[2024-05-25 12:53:25] [INFO ] Implicit Places using invariants and state equation in 2205 ms returned []
Implicit Place search using SMT with State Equation took 2801 ms to find 0 implicit places.
[2024-05-25 12:53:25] [INFO ] Invariant cache hit.
[2024-05-25 12:53:26] [INFO ] Dead Transitions using invariants and state equation in 407 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 526/541 places, 496/511 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3286 ms. Remains : 526/541 places, 496/511 transitions.
Stuttering acceptance computed with spot in 379 ms :[(OR (NOT p0) p1), p1, (NOT p0), p1, true, (AND (NOT p0) p1), p1, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={} source=5 dest: 7}], [{ cond=(NOT p0), acceptance={} source=6 dest: 3}, { cond=p0, acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}, { cond=(AND p0 p1), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(LEQ 1 s47), p1:(AND (LEQ s136 s416) (LEQ s300 s235))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 110 steps with 4 reset in 1 ms.
FORMULA HirschbergSinclair-PT-25-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-09 finished in 3698 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 541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 541/541 places, 511/511 transitions.
Reduce places removed 25 places and 25 transitions.
Drop transitions removed 223 transitions
Trivial Post-agglo rules discarded 223 transitions
Performed 223 trivial Post agglomeration. Transition count delta: 223
Iterating post reduction 0 with 223 rules applied. Total rules applied 223 place count 516 transition count 263
Reduce places removed 223 places and 0 transitions.
Iterating post reduction 1 with 223 rules applied. Total rules applied 446 place count 293 transition count 263
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 454 place count 285 transition count 255
Iterating global reduction 2 with 8 rules applied. Total rules applied 462 place count 285 transition count 255
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 464 place count 285 transition count 253
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 466 place count 283 transition count 253
Applied a total of 466 rules in 52 ms. Remains 283 /541 variables (removed 258) and now considering 253/511 (removed 258) transitions.
// Phase 1: matrix 253 rows 283 cols
[2024-05-25 12:53:26] [INFO ] Computed 30 invariants in 3 ms
[2024-05-25 12:53:27] [INFO ] Implicit Places using invariants in 515 ms returned []
[2024-05-25 12:53:27] [INFO ] Invariant cache hit.
[2024-05-25 12:53:28] [INFO ] Implicit Places using invariants and state equation in 1059 ms returned []
Implicit Place search using SMT with State Equation took 1584 ms to find 0 implicit places.
[2024-05-25 12:53:28] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-25 12:53:28] [INFO ] Invariant cache hit.
[2024-05-25 12:53:28] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 283/541 places, 253/511 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1855 ms. Remains : 283/541 places, 253/511 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s232 s35)], 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 361 reset in 294 ms.
Product exploration explored 100000 steps with 361 reset in 440 ms.
Computed a total of 283 stabilizing places and 253 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 283 transition count 253
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 14 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-25-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-11 finished in 2761 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||X(G(p1))))&&F(p2)))'
Support contains 6 out of 541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 511/511 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 533 transition count 503
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 533 transition count 503
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 528 transition count 498
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 528 transition count 498
Applied a total of 26 rules in 38 ms. Remains 528 /541 variables (removed 13) and now considering 498/511 (removed 13) transitions.
// Phase 1: matrix 498 rows 528 cols
[2024-05-25 12:53:29] [INFO ] Computed 30 invariants in 4 ms
[2024-05-25 12:53:29] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-05-25 12:53:29] [INFO ] Invariant cache hit.
[2024-05-25 12:53:31] [INFO ] Implicit Places using invariants and state equation in 2100 ms returned []
Implicit Place search using SMT with State Equation took 2438 ms to find 0 implicit places.
[2024-05-25 12:53:31] [INFO ] Invariant cache hit.
[2024-05-25 12:53:32] [INFO ] Dead Transitions using invariants and state equation in 571 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 528/541 places, 498/511 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3050 ms. Remains : 528/541 places, 498/511 transitions.
Stuttering acceptance computed with spot in 215 ms :[true, (OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 p2), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=4, aps=[p1:(GT s134 s177), p2:(OR (LEQ s422 s136) (LEQ s128 s121)), p0:(GT s422 s136)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-25-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-12 finished in 3288 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||F(p1))))'
Support contains 4 out of 541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 541/541 places, 511/511 transitions.
Reduce places removed 25 places and 25 transitions.
Drop transitions removed 219 transitions
Trivial Post-agglo rules discarded 219 transitions
Performed 219 trivial Post agglomeration. Transition count delta: 219
Iterating post reduction 0 with 219 rules applied. Total rules applied 219 place count 516 transition count 267
Reduce places removed 219 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 221 rules applied. Total rules applied 440 place count 297 transition count 265
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 442 place count 295 transition count 265
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 450 place count 287 transition count 257
Iterating global reduction 3 with 8 rules applied. Total rules applied 458 place count 287 transition count 257
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 460 place count 287 transition count 255
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 462 place count 285 transition count 255
Applied a total of 462 rules in 54 ms. Remains 285 /541 variables (removed 256) and now considering 255/511 (removed 256) transitions.
// Phase 1: matrix 255 rows 285 cols
[2024-05-25 12:53:32] [INFO ] Computed 30 invariants in 3 ms
[2024-05-25 12:53:33] [INFO ] Implicit Places using invariants in 392 ms returned []
[2024-05-25 12:53:33] [INFO ] Invariant cache hit.
[2024-05-25 12:53:34] [INFO ] Implicit Places using invariants and state equation in 997 ms returned []
Implicit Place search using SMT with State Equation took 1393 ms to find 0 implicit places.
[2024-05-25 12:53:34] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 12:53:34] [INFO ] Invariant cache hit.
[2024-05-25 12:53:34] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 285/541 places, 255/511 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1747 ms. Remains : 285/541 places, 255/511 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s196 s67), p1:(LEQ s229 s205)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 358 reset in 331 ms.
Product exploration explored 100000 steps with 358 reset in 366 ms.
Computed a total of 285 stabilizing places and 255 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 285 transition count 255
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 135 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 34 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 12:53:35] [INFO ] Invariant cache hit.
[2024-05-25 12:53:35] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 12:53:35] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 53 ms returned sat
[2024-05-25 12:53:35] [INFO ] After 278ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 15 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-25-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-13 finished in 3299 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 541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 541/541 places, 511/511 transitions.
Reduce places removed 25 places and 25 transitions.
Drop transitions removed 222 transitions
Trivial Post-agglo rules discarded 222 transitions
Performed 222 trivial Post agglomeration. Transition count delta: 222
Iterating post reduction 0 with 222 rules applied. Total rules applied 222 place count 516 transition count 264
Reduce places removed 222 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 223 rules applied. Total rules applied 445 place count 294 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 446 place count 293 transition count 263
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 455 place count 284 transition count 254
Iterating global reduction 3 with 9 rules applied. Total rules applied 464 place count 284 transition count 254
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 466 place count 284 transition count 252
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 468 place count 282 transition count 252
Applied a total of 468 rules in 51 ms. Remains 282 /541 variables (removed 259) and now considering 252/511 (removed 259) transitions.
// Phase 1: matrix 252 rows 282 cols
[2024-05-25 12:53:36] [INFO ] Computed 30 invariants in 2 ms
[2024-05-25 12:53:36] [INFO ] Implicit Places using invariants in 503 ms returned []
[2024-05-25 12:53:36] [INFO ] Invariant cache hit.
[2024-05-25 12:53:37] [INFO ] Implicit Places using invariants and state equation in 837 ms returned []
Implicit Place search using SMT with State Equation took 1349 ms to find 0 implicit places.
[2024-05-25 12:53:37] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 12:53:37] [INFO ] Invariant cache hit.
[2024-05-25 12:53:37] [INFO ] Dead Transitions using invariants and state equation in 440 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 282/541 places, 252/511 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1850 ms. Remains : 282/541 places, 252/511 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s184 s38)], 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 271 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-25-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-14 finished in 1923 ms.
All properties solved by simple procedures.
Total runtime 62559 ms.

BK_STOP 1716641619485

--------------------
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="HirschbergSinclair-PT-25"
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 HirschbergSinclair-PT-25, 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 r219-smll-171649597800057"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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