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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Apr 13 02:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K Apr 13 02:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 13 02:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 13 02:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:49 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 616K 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-45-LTLCardinality-00
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-01
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-02
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-03
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-04
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-05
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-06
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-07
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-08
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-09
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-10
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-11
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-12
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-13
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-14
FORMULA_NAME HirschbergSinclair-PT-45-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716651818548

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-45
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-25 15:43:41] [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 15:43:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:43:41] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2024-05-25 15:43:41] [INFO ] Transformed 1138 places.
[2024-05-25 15:43:41] [INFO ] Transformed 1042 transitions.
[2024-05-25 15:43:41] [INFO ] Parsed PT model containing 1138 places and 1042 transitions and 3176 arcs in 278 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA HirschbergSinclair-PT-45-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-45-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-45-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-45-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-45-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 1138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1138/1138 places, 1042/1042 transitions.
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 1096 transition count 1042
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 81 place count 1057 transition count 1003
Iterating global reduction 1 with 39 rules applied. Total rules applied 120 place count 1057 transition count 1003
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 159 place count 1018 transition count 964
Iterating global reduction 1 with 39 rules applied. Total rules applied 198 place count 1018 transition count 964
Applied a total of 198 rules in 459 ms. Remains 1018 /1138 variables (removed 120) and now considering 964/1042 (removed 78) transitions.
// Phase 1: matrix 964 rows 1018 cols
[2024-05-25 15:43:42] [INFO ] Computed 54 invariants in 43 ms
[2024-05-25 15:43:43] [INFO ] Implicit Places using invariants in 1149 ms returned []
[2024-05-25 15:43:43] [INFO ] Invariant cache hit.
[2024-05-25 15:43:47] [INFO ] Implicit Places using invariants and state equation in 4174 ms returned []
Implicit Place search using SMT with State Equation took 5414 ms to find 0 implicit places.
[2024-05-25 15:43:47] [INFO ] Invariant cache hit.
[2024-05-25 15:43:48] [INFO ] Dead Transitions using invariants and state equation in 1205 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1018/1138 places, 964/1042 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7081 ms. Remains : 1018/1138 places, 964/1042 transitions.
Support contains 38 out of 1018 places after structural reductions.
[2024-05-25 15:43:49] [INFO ] Flatten gal took : 158 ms
[2024-05-25 15:43:49] [INFO ] Flatten gal took : 92 ms
[2024-05-25 15:43:49] [INFO ] Input system was already deterministic with 964 transitions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 737 ms. (steps per millisecond=13 ) properties (out of 24) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) 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 7) seen :0
Running SMT prover for 7 properties.
[2024-05-25 15:43:50] [INFO ] Invariant cache hit.
[2024-05-25 15:43:50] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2024-05-25 15:43:51] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 265 ms returned sat
[2024-05-25 15:43:52] [INFO ] After 1960ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :0 real:1
[2024-05-25 15:43:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 16 ms returned sat
[2024-05-25 15:43:53] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 244 ms returned sat
[2024-05-25 15:43:54] [INFO ] After 932ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :1
[2024-05-25 15:43:54] [INFO ] After 1167ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :1
Attempting to minimize the solution found.
Minimization took 163 ms.
[2024-05-25 15:43:54] [INFO ] After 1918ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :1
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 3 out of 1018 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1018/1018 places, 964/964 transitions.
Graph (complete) has 1936 edges and 1018 vertex of which 984 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.4 ms
Discarding 34 places :
Also discarding 0 output transitions
Drop transitions removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 421 transitions
Trivial Post-agglo rules discarded 421 transitions
Performed 421 trivial Post agglomeration. Transition count delta: 421
Iterating post reduction 0 with 452 rules applied. Total rules applied 453 place count 984 transition count 512
Reduce places removed 421 places and 0 transitions.
Graph (complete) has 980 edges and 563 vertex of which 473 are kept as prefixes of interest. Removing 90 places using SCC suffix rule.2 ms
Discarding 90 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 423 rules applied. Total rules applied 876 place count 473 transition count 511
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 91 rules applied. Total rules applied 967 place count 472 transition count 421
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 968 place count 471 transition count 420
Iterating global reduction 3 with 1 rules applied. Total rules applied 969 place count 471 transition count 420
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 970 place count 470 transition count 419
Iterating global reduction 3 with 1 rules applied. Total rules applied 971 place count 470 transition count 419
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 3 with 14 rules applied. Total rules applied 985 place count 470 transition count 405
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 999 place count 456 transition count 405
Reduce places removed 44 places and 44 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 1043 place count 412 transition count 361
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 207 transitions
Trivial Post-agglo rules discarded 207 transitions
Performed 207 trivial Post agglomeration. Transition count delta: 207
Iterating post reduction 4 with 238 rules applied. Total rules applied 1281 place count 381 transition count 154
Reduce places removed 207 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 208 rules applied. Total rules applied 1489 place count 174 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1490 place count 173 transition count 153
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 17 Pre rules applied. Total rules applied 1490 place count 173 transition count 136
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 1524 place count 156 transition count 136
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 1525 place count 155 transition count 136
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1525 place count 155 transition count 135
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1527 place count 154 transition count 135
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1533 place count 151 transition count 132
Applied a total of 1533 rules in 215 ms. Remains 151 /1018 variables (removed 867) and now considering 132/964 (removed 832) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 215 ms. Remains : 151/1018 places, 132/964 transitions.
Finished random walk after 263 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=87 )
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 6 atomic propositions for a total of 11 simplifications.
FORMULA HirschbergSinclair-PT-45-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-45-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-45-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1018 stabilizing places and 964 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1018 transition count 964
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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((F(G(p0))||(p1&&G(p2))))))'
Support contains 5 out of 1018 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1018/1018 places, 964/964 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1016 transition count 964
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 1011 transition count 959
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 1011 transition count 959
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 17 place count 1006 transition count 954
Iterating global reduction 1 with 5 rules applied. Total rules applied 22 place count 1006 transition count 954
Applied a total of 22 rules in 429 ms. Remains 1006 /1018 variables (removed 12) and now considering 954/964 (removed 10) transitions.
// Phase 1: matrix 954 rows 1006 cols
[2024-05-25 15:43:55] [INFO ] Computed 52 invariants in 12 ms
[2024-05-25 15:43:56] [INFO ] Implicit Places using invariants in 817 ms returned []
[2024-05-25 15:43:56] [INFO ] Invariant cache hit.
[2024-05-25 15:44:00] [INFO ] Implicit Places using invariants and state equation in 4227 ms returned []
Implicit Place search using SMT with State Equation took 5062 ms to find 0 implicit places.
[2024-05-25 15:44:00] [INFO ] Invariant cache hit.
[2024-05-25 15:44:01] [INFO ] Dead Transitions using invariants and state equation in 1208 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1006/1018 places, 954/964 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6702 ms. Remains : 1006/1018 places, 954/964 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 417 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(LEQ 1 s337), p2:(AND (LEQ 1 s258) (LEQ s377 s323)), p0:(LEQ 1 s680)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1034 steps with 0 reset in 16 ms.
FORMULA HirschbergSinclair-PT-45-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-45-LTLCardinality-00 finished in 7228 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 2 out of 1018 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1018/1018 places, 964/964 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1015 transition count 964
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 8 place count 1010 transition count 959
Iterating global reduction 1 with 5 rules applied. Total rules applied 13 place count 1010 transition count 959
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 18 place count 1005 transition count 954
Iterating global reduction 1 with 5 rules applied. Total rules applied 23 place count 1005 transition count 954
Applied a total of 23 rules in 172 ms. Remains 1005 /1018 variables (removed 13) and now considering 954/964 (removed 10) transitions.
// Phase 1: matrix 954 rows 1005 cols
[2024-05-25 15:44:02] [INFO ] Computed 51 invariants in 11 ms
[2024-05-25 15:44:03] [INFO ] Implicit Places using invariants in 928 ms returned []
[2024-05-25 15:44:03] [INFO ] Invariant cache hit.
[2024-05-25 15:44:07] [INFO ] Implicit Places using invariants and state equation in 4133 ms returned []
Implicit Place search using SMT with State Equation took 5064 ms to find 0 implicit places.
[2024-05-25 15:44:07] [INFO ] Invariant cache hit.
[2024-05-25 15:44:08] [INFO ] Dead Transitions using invariants and state equation in 1250 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1005/1018 places, 954/964 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6490 ms. Remains : 1005/1018 places, 954/964 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(GT s371 s265)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 2 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-45-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-45-LTLCardinality-02 finished in 6666 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X(p1)))))'
Support contains 3 out of 1018 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1018/1018 places, 964/964 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1015 transition count 964
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 8 place count 1010 transition count 959
Iterating global reduction 1 with 5 rules applied. Total rules applied 13 place count 1010 transition count 959
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 18 place count 1005 transition count 954
Iterating global reduction 1 with 5 rules applied. Total rules applied 23 place count 1005 transition count 954
Applied a total of 23 rules in 167 ms. Remains 1005 /1018 variables (removed 13) and now considering 954/964 (removed 10) transitions.
// Phase 1: matrix 954 rows 1005 cols
[2024-05-25 15:44:09] [INFO ] Computed 51 invariants in 8 ms
[2024-05-25 15:44:09] [INFO ] Implicit Places using invariants in 783 ms returned []
[2024-05-25 15:44:09] [INFO ] Invariant cache hit.
[2024-05-25 15:44:14] [INFO ] Implicit Places using invariants and state equation in 4261 ms returned []
Implicit Place search using SMT with State Equation took 5051 ms to find 0 implicit places.
[2024-05-25 15:44:14] [INFO ] Invariant cache hit.
[2024-05-25 15:44:15] [INFO ] Dead Transitions using invariants and state equation in 1245 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1005/1018 places, 954/964 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6468 ms. Remains : 1005/1018 places, 954/964 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 s406), p1:(LEQ s177 s526)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 218 reset in 707 ms.
Product exploration explored 100000 steps with 218 reset in 694 ms.
Computed a total of 1005 stabilizing places and 954 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1005 transition count 954
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 p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 210 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
Incomplete random walk after 10000 steps, including 9 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 15:44:17] [INFO ] Invariant cache hit.
[2024-05-25 15:44:18] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:44:18] [INFO ] [Nat]Absence check using 0 positive and 51 generalized place invariants in 244 ms returned sat
[2024-05-25 15:44:19] [INFO ] After 591ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:44:19] [INFO ] After 751ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 85 ms.
[2024-05-25 15:44:19] [INFO ] After 1281ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 1005 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1005/1005 places, 954/954 transitions.
Graph (complete) has 1918 edges and 1005 vertex of which 960 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.3 ms
Discarding 45 places :
Also discarding 0 output transitions
Drop transitions removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Drop transitions removed 424 transitions
Trivial Post-agglo rules discarded 424 transitions
Performed 424 trivial Post agglomeration. Transition count delta: 424
Iterating post reduction 0 with 469 rules applied. Total rules applied 470 place count 960 transition count 485
Reduce places removed 424 places and 0 transitions.
Graph (complete) has 936 edges and 536 vertex of which 211 are kept as prefixes of interest. Removing 325 places using SCC suffix rule.1 ms
Discarding 325 places :
Also discarding 99 output transitions
Drop transitions removed 99 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 427 rules applied. Total rules applied 897 place count 211 transition count 384
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 214 transitions
Reduce isomorphic transitions removed 214 transitions.
Iterating post reduction 2 with 216 rules applied. Total rules applied 1113 place count 209 transition count 170
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1113 place count 209 transition count 168
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 1117 place count 207 transition count 168
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1119 place count 207 transition count 166
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1121 place count 205 transition count 166
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1122 place count 205 transition count 166
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1123 place count 204 transition count 165
Iterating global reduction 4 with 1 rules applied. Total rules applied 1124 place count 204 transition count 165
Reduce places removed 33 places and 33 transitions.
Iterating global reduction 4 with 33 rules applied. Total rules applied 1157 place count 171 transition count 132
Reduce places removed 33 places and 0 transitions.
Drop transitions removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 4 with 144 rules applied. Total rules applied 1301 place count 138 transition count 21
Reduce places removed 111 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 112 rules applied. Total rules applied 1413 place count 27 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1414 place count 26 transition count 20
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 10 Pre rules applied. Total rules applied 1414 place count 26 transition count 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 1438 place count 12 transition count 10
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 7 with 4 rules applied. Total rules applied 1442 place count 11 transition count 7
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1445 place count 8 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 1445 place count 8 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1447 place count 7 transition count 6
Applied a total of 1447 rules in 64 ms. Remains 7 /1005 variables (removed 998) and now considering 6/954 (removed 948) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 7/1005 places, 6/954 transitions.
Finished random walk after 16 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F p0), (F (AND p1 p0)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 9 factoid took 516 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
[2024-05-25 15:44:20] [INFO ] Invariant cache hit.
[2024-05-25 15:44:21] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 255 ms returned sat
[2024-05-25 15:44:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:44:25] [INFO ] [Real]Absence check using state equation in 4383 ms returned sat
[2024-05-25 15:44:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:44:27] [INFO ] [Nat]Absence check using 0 positive and 51 generalized place invariants in 287 ms returned sat
[2024-05-25 15:44:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:44:31] [INFO ] [Nat]Absence check using state equation in 4498 ms returned sat
[2024-05-25 15:44:31] [INFO ] Computed and/alt/rep : 435/441/435 causal constraints (skipped 474 transitions) in 81 ms.
[2024-05-25 15:44:35] [INFO ] Added : 188 causal constraints over 38 iterations in 3529 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 1005 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1005/1005 places, 954/954 transitions.
Reduce places removed 45 places and 45 transitions.
Drop transitions removed 424 transitions
Trivial Post-agglo rules discarded 424 transitions
Performed 424 trivial Post agglomeration. Transition count delta: 424
Iterating post reduction 0 with 424 rules applied. Total rules applied 424 place count 960 transition count 485
Reduce places removed 424 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 426 rules applied. Total rules applied 850 place count 536 transition count 483
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 852 place count 534 transition count 483
Applied a total of 852 rules in 58 ms. Remains 534 /1005 variables (removed 471) and now considering 483/954 (removed 471) transitions.
// Phase 1: matrix 483 rows 534 cols
[2024-05-25 15:44:35] [INFO ] Computed 51 invariants in 4 ms
[2024-05-25 15:44:36] [INFO ] Implicit Places using invariants in 637 ms returned []
[2024-05-25 15:44:36] [INFO ] Invariant cache hit.
[2024-05-25 15:44:38] [INFO ] Implicit Places using invariants and state equation in 2704 ms returned []
Implicit Place search using SMT with State Equation took 3361 ms to find 0 implicit places.
[2024-05-25 15:44:38] [INFO ] Redundant transitions in 36 ms returned []
[2024-05-25 15:44:38] [INFO ] Invariant cache hit.
[2024-05-25 15:44:39] [INFO ] Dead Transitions using invariants and state equation in 746 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 534/1005 places, 483/954 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4211 ms. Remains : 534/1005 places, 483/954 transitions.
Computed a total of 534 stabilizing places and 483 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 534 transition count 483
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 p0) p1), (X (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 9 factoid took 415 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 15:44:40] [INFO ] Invariant cache hit.
[2024-05-25 15:44:40] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:44:40] [INFO ] [Nat]Absence check using 0 positive and 51 generalized place invariants in 130 ms returned sat
[2024-05-25 15:44:41] [INFO ] After 271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:44:41] [INFO ] After 325ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2024-05-25 15:44:41] [INFO ] After 600ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 100 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=50 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p1) (NOT p0))), (F p0), (F (AND p1 p0)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 9 factoid took 670 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
[2024-05-25 15:44:42] [INFO ] Invariant cache hit.
[2024-05-25 15:44:43] [INFO ] [Real]Absence check using 0 positive and 51 generalized place invariants in 195 ms returned sat
[2024-05-25 15:44:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:44:56] [INFO ] [Real]Absence check using state equation in 13347 ms returned sat
[2024-05-25 15:44:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:44:57] [INFO ] [Nat]Absence check using 0 positive and 51 generalized place invariants in 381 ms returned sat
[2024-05-25 15:44:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:44:57] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2024-05-25 15:44:57] [INFO ] Computed and/alt/rep : 394/401/394 causal constraints (skipped 0 transitions) in 34 ms.
[2024-05-25 15:44:58] [INFO ] Added : 102 causal constraints over 21 iterations in 749 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), false, false]
Product exploration explored 100000 steps with 470 reset in 614 ms.
Product exploration explored 100000 steps with 471 reset in 670 ms.
Built C files in :
/tmp/ltsmin11820523498749756964
[2024-05-25 15:44:59] [INFO ] Computing symmetric may disable matrix : 483 transitions.
[2024-05-25 15:44:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:44:59] [INFO ] Computing symmetric may enable matrix : 483 transitions.
[2024-05-25 15:44:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:44:59] [INFO ] Computing Do-Not-Accords matrix : 483 transitions.
[2024-05-25 15:45:00] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:45:00] [INFO ] Built C files in 93ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11820523498749756964
Running compilation step : cd /tmp/ltsmin11820523498749756964;'/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 1829 ms.
Running link step : cd /tmp/ltsmin11820523498749756964;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin11820523498749756964;'/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/stateBased1834009012106150263.hoa' '--buchi-type=spotba'
LTSmin run took 9776 ms.
FORMULA HirschbergSinclair-PT-45-LTLCardinality-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-45-LTLCardinality-05 finished in 62811 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))'
Support contains 3 out of 1018 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1018/1018 places, 964/964 transitions.
Graph (complete) has 1936 edges and 1018 vertex of which 1015 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 44 places and 44 transitions.
Drop transitions removed 421 transitions
Trivial Post-agglo rules discarded 421 transitions
Performed 421 trivial Post agglomeration. Transition count delta: 421
Iterating post reduction 0 with 421 rules applied. Total rules applied 422 place count 971 transition count 499
Reduce places removed 421 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 422 rules applied. Total rules applied 844 place count 550 transition count 498
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 845 place count 549 transition count 498
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 851 place count 543 transition count 492
Iterating global reduction 3 with 6 rules applied. Total rules applied 857 place count 543 transition count 492
Applied a total of 857 rules in 86 ms. Remains 543 /1018 variables (removed 475) and now considering 492/964 (removed 472) transitions.
// Phase 1: matrix 492 rows 543 cols
[2024-05-25 15:45:11] [INFO ] Computed 51 invariants in 4 ms
[2024-05-25 15:45:12] [INFO ] Implicit Places using invariants in 756 ms returned []
[2024-05-25 15:45:12] [INFO ] Invariant cache hit.
[2024-05-25 15:45:15] [INFO ] Implicit Places using invariants and state equation in 2761 ms returned []
Implicit Place search using SMT with State Equation took 3534 ms to find 0 implicit places.
[2024-05-25 15:45:15] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-25 15:45:15] [INFO ] Invariant cache hit.
[2024-05-25 15:45:16] [INFO ] Dead Transitions using invariants and state equation in 684 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 543/1018 places, 492/964 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4324 ms. Remains : 543/1018 places, 492/964 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 1 s491), p0:(AND (LEQ s31 s293) (LEQ 1 s491))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 531 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-45-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-45-LTLCardinality-06 finished in 4425 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1018 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1018/1018 places, 964/964 transitions.
Graph (complete) has 1936 edges and 1018 vertex of which 1015 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 44 places and 44 transitions.
Drop transitions removed 432 transitions
Trivial Post-agglo rules discarded 432 transitions
Performed 432 trivial Post agglomeration. Transition count delta: 432
Iterating post reduction 0 with 432 rules applied. Total rules applied 433 place count 971 transition count 488
Reduce places removed 432 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 433 rules applied. Total rules applied 866 place count 539 transition count 487
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 867 place count 538 transition count 487
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 873 place count 532 transition count 481
Iterating global reduction 3 with 6 rules applied. Total rules applied 879 place count 532 transition count 481
Applied a total of 879 rules in 69 ms. Remains 532 /1018 variables (removed 486) and now considering 481/964 (removed 483) transitions.
// Phase 1: matrix 481 rows 532 cols
[2024-05-25 15:45:16] [INFO ] Computed 51 invariants in 3 ms
[2024-05-25 15:45:17] [INFO ] Implicit Places using invariants in 819 ms returned []
[2024-05-25 15:45:17] [INFO ] Invariant cache hit.
[2024-05-25 15:45:17] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-25 15:45:19] [INFO ] Implicit Places using invariants and state equation in 2405 ms returned []
Implicit Place search using SMT with State Equation took 3226 ms to find 0 implicit places.
[2024-05-25 15:45:19] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-25 15:45:19] [INFO ] Invariant cache hit.
[2024-05-25 15:45:20] [INFO ] Dead Transitions using invariants and state equation in 742 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 532/1018 places, 481/964 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4050 ms. Remains : 532/1018 places, 481/964 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s153 s15)], 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 337 reset in 499 ms.
Product exploration explored 100000 steps with 344 reset in 558 ms.
Computed a total of 532 stabilizing places and 481 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 532 transition count 481
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 : []
Knowledge based reduction with 4 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Finished random walk after 169 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=56 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 532 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 532/532 places, 481/481 transitions.
Applied a total of 0 rules in 25 ms. Remains 532 /532 variables (removed 0) and now considering 481/481 (removed 0) transitions.
[2024-05-25 15:45:22] [INFO ] Invariant cache hit.
[2024-05-25 15:45:22] [INFO ] Implicit Places using invariants in 824 ms returned []
[2024-05-25 15:45:22] [INFO ] Invariant cache hit.
[2024-05-25 15:45:23] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-25 15:45:25] [INFO ] Implicit Places using invariants and state equation in 2578 ms returned []
Implicit Place search using SMT with State Equation took 3406 ms to find 0 implicit places.
[2024-05-25 15:45:25] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-25 15:45:25] [INFO ] Invariant cache hit.
[2024-05-25 15:45:26] [INFO ] Dead Transitions using invariants and state equation in 733 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4176 ms. Remains : 532/532 places, 481/481 transitions.
Computed a total of 532 stabilizing places and 481 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 532 transition count 481
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 : []
Knowledge based reduction with 4 factoid took 191 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Finished random walk after 179 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=89 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 340 reset in 448 ms.
Product exploration explored 100000 steps with 369 reset in 532 ms.
Built C files in :
/tmp/ltsmin15281486103297235570
[2024-05-25 15:45:28] [INFO ] Computing symmetric may disable matrix : 481 transitions.
[2024-05-25 15:45:28] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:45:28] [INFO ] Computing symmetric may enable matrix : 481 transitions.
[2024-05-25 15:45:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:45:28] [INFO ] Computing Do-Not-Accords matrix : 481 transitions.
[2024-05-25 15:45:28] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:45:28] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15281486103297235570
Running compilation step : cd /tmp/ltsmin15281486103297235570;'/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 1743 ms.
Running link step : cd /tmp/ltsmin15281486103297235570;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin15281486103297235570;'/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/stateBased896151780890223123.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 532 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 532/532 places, 481/481 transitions.
Applied a total of 0 rules in 26 ms. Remains 532 /532 variables (removed 0) and now considering 481/481 (removed 0) transitions.
[2024-05-25 15:45:43] [INFO ] Invariant cache hit.
[2024-05-25 15:45:44] [INFO ] Implicit Places using invariants in 822 ms returned []
[2024-05-25 15:45:44] [INFO ] Invariant cache hit.
[2024-05-25 15:45:44] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-25 15:45:46] [INFO ] Implicit Places using invariants and state equation in 2430 ms returned []
Implicit Place search using SMT with State Equation took 3259 ms to find 0 implicit places.
[2024-05-25 15:45:46] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-25 15:45:46] [INFO ] Invariant cache hit.
[2024-05-25 15:45:47] [INFO ] Dead Transitions using invariants and state equation in 630 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3927 ms. Remains : 532/532 places, 481/481 transitions.
Built C files in :
/tmp/ltsmin8920820185068296209
[2024-05-25 15:45:47] [INFO ] Computing symmetric may disable matrix : 481 transitions.
[2024-05-25 15:45:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:45:47] [INFO ] Computing symmetric may enable matrix : 481 transitions.
[2024-05-25 15:45:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:45:47] [INFO ] Computing Do-Not-Accords matrix : 481 transitions.
[2024-05-25 15:45:47] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:45:47] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8920820185068296209
Running compilation step : cd /tmp/ltsmin8920820185068296209;'/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 1619 ms.
Running link step : cd /tmp/ltsmin8920820185068296209;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin8920820185068296209;'/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/stateBased14475335533195701707.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 15:46:02] [INFO ] Flatten gal took : 28 ms
[2024-05-25 15:46:02] [INFO ] Flatten gal took : 27 ms
[2024-05-25 15:46:02] [INFO ] Time to serialize gal into /tmp/LTL11913613590677088616.gal : 7 ms
[2024-05-25 15:46:02] [INFO ] Time to serialize properties into /tmp/LTL9690442604747311723.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11913613590677088616.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7409813500599258767.hoa' '-atoms' '/tmp/LTL9690442604747311723.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9690442604747311723.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7409813500599258767.hoa
Detected timeout of ITS tools.
[2024-05-25 15:46:17] [INFO ] Flatten gal took : 26 ms
[2024-05-25 15:46:17] [INFO ] Flatten gal took : 24 ms
[2024-05-25 15:46:17] [INFO ] Time to serialize gal into /tmp/LTL2303992506976669027.gal : 5 ms
[2024-05-25 15:46:17] [INFO ] Time to serialize properties into /tmp/LTL9688246304681358652.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2303992506976669027.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9688246304681358652.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("(election_45_2_4_to_left_42<=init16)"))))
Formula 0 simplified : FG!"(election_45_2_4_to_left_42<=init16)"
Detected timeout of ITS tools.
[2024-05-25 15:46:32] [INFO ] Flatten gal took : 21 ms
[2024-05-25 15:46:32] [INFO ] Applying decomposition
[2024-05-25 15:46:32] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12116679603269192083.txt' '-o' '/tmp/graph12116679603269192083.bin' '-w' '/tmp/graph12116679603269192083.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12116679603269192083.bin' '-l' '-1' '-v' '-w' '/tmp/graph12116679603269192083.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:46:32] [INFO ] Decomposing Gal with order
[2024-05-25 15:46:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:46:33] [INFO ] Removed a total of 337 redundant transitions.
[2024-05-25 15:46:33] [INFO ] Flatten gal took : 150 ms
[2024-05-25 15:46:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 20 ms.
[2024-05-25 15:46:33] [INFO ] Time to serialize gal into /tmp/LTL4424554575681697901.gal : 13 ms
[2024-05-25 15:46:33] [INFO ] Time to serialize properties into /tmp/LTL17868103478432775713.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4424554575681697901.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17868103478432775713.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(gu51.election_45_2_4_to_left_42<=gu51.init16)"))))
Formula 0 simplified : FG!"(gu51.election_45_2_4_to_left_42<=gu51.init16)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9412226802207640809
[2024-05-25 15:46:48] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9412226802207640809
Running compilation step : cd /tmp/ltsmin9412226802207640809;'/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 1252 ms.
Running link step : cd /tmp/ltsmin9412226802207640809;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin9412226802207640809;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HirschbergSinclair-PT-45-LTLCardinality-08 finished in 107443 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)||G(p1)))'
Support contains 4 out of 1018 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1018/1018 places, 964/964 transitions.
Graph (complete) has 1936 edges and 1018 vertex of which 1015 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 44 places and 44 transitions.
Drop transitions removed 429 transitions
Trivial Post-agglo rules discarded 429 transitions
Performed 429 trivial Post agglomeration. Transition count delta: 429
Iterating post reduction 0 with 429 rules applied. Total rules applied 430 place count 971 transition count 491
Reduce places removed 429 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 432 rules applied. Total rules applied 862 place count 542 transition count 488
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 865 place count 539 transition count 488
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 870 place count 534 transition count 483
Iterating global reduction 3 with 5 rules applied. Total rules applied 875 place count 534 transition count 483
Applied a total of 875 rules in 71 ms. Remains 534 /1018 variables (removed 484) and now considering 483/964 (removed 481) transitions.
// Phase 1: matrix 483 rows 534 cols
[2024-05-25 15:47:03] [INFO ] Computed 51 invariants in 4 ms
[2024-05-25 15:47:04] [INFO ] Implicit Places using invariants in 850 ms returned []
[2024-05-25 15:47:04] [INFO ] Invariant cache hit.
[2024-05-25 15:47:05] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 15:47:07] [INFO ] Implicit Places using invariants and state equation in 2838 ms returned []
Implicit Place search using SMT with State Equation took 3690 ms to find 0 implicit places.
[2024-05-25 15:47:07] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-25 15:47:07] [INFO ] Invariant cache hit.
[2024-05-25 15:47:08] [INFO ] Dead Transitions using invariants and state equation in 735 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 534/1018 places, 483/964 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4508 ms. Remains : 534/1018 places, 483/964 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(LEQ s72 s151), p0:(LEQ s206 s92)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 201 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-45-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-45-LTLCardinality-09 finished in 4700 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 1018 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1018/1018 places, 964/964 transitions.
Graph (complete) has 1936 edges and 1018 vertex of which 1015 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 45 places and 45 transitions.
Drop transitions removed 428 transitions
Trivial Post-agglo rules discarded 428 transitions
Performed 428 trivial Post agglomeration. Transition count delta: 428
Iterating post reduction 0 with 428 rules applied. Total rules applied 429 place count 970 transition count 491
Reduce places removed 428 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 430 rules applied. Total rules applied 859 place count 542 transition count 489
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 861 place count 540 transition count 489
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 867 place count 534 transition count 483
Iterating global reduction 3 with 6 rules applied. Total rules applied 873 place count 534 transition count 483
Applied a total of 873 rules in 63 ms. Remains 534 /1018 variables (removed 484) and now considering 483/964 (removed 481) transitions.
// Phase 1: matrix 483 rows 534 cols
[2024-05-25 15:47:08] [INFO ] Computed 51 invariants in 4 ms
[2024-05-25 15:47:09] [INFO ] Implicit Places using invariants in 732 ms returned []
[2024-05-25 15:47:09] [INFO ] Invariant cache hit.
[2024-05-25 15:47:11] [INFO ] Implicit Places using invariants and state equation in 2223 ms returned []
Implicit Place search using SMT with State Equation took 2975 ms to find 0 implicit places.
[2024-05-25 15:47:11] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-25 15:47:11] [INFO ] Invariant cache hit.
[2024-05-25 15:47:12] [INFO ] Dead Transitions using invariants and state equation in 743 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 534/1018 places, 483/964 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3796 ms. Remains : 534/1018 places, 483/964 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLCardinality-12 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 s200 s148), p1:(LEQ s137 s335)], 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 189 reset in 413 ms.
Product exploration explored 100000 steps with 189 reset in 467 ms.
Computed a total of 534 stabilizing places and 483 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 534 transition count 483
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), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 322 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 83 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 15:47:13] [INFO ] Invariant cache hit.
[2024-05-25 15:47:13] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:47:14] [INFO ] [Nat]Absence check using 0 positive and 51 generalized place invariants in 137 ms returned sat
[2024-05-25 15:47:14] [INFO ] After 491ms 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 4 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (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 : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 16 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-45-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-45-LTLCardinality-12 finished in 6165 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)&&F(p1)))'
Support contains 3 out of 1018 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1018/1018 places, 964/964 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1016 transition count 964
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 6 place count 1012 transition count 960
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 1012 transition count 960
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 14 place count 1008 transition count 956
Iterating global reduction 1 with 4 rules applied. Total rules applied 18 place count 1008 transition count 956
Applied a total of 18 rules in 165 ms. Remains 1008 /1018 variables (removed 10) and now considering 956/964 (removed 8) transitions.
// Phase 1: matrix 956 rows 1008 cols
[2024-05-25 15:47:14] [INFO ] Computed 52 invariants in 7 ms
[2024-05-25 15:47:15] [INFO ] Implicit Places using invariants in 905 ms returned []
[2024-05-25 15:47:15] [INFO ] Invariant cache hit.
[2024-05-25 15:47:19] [INFO ] Implicit Places using invariants and state equation in 4337 ms returned []
Implicit Place search using SMT with State Equation took 5244 ms to find 0 implicit places.
[2024-05-25 15:47:19] [INFO ] Invariant cache hit.
[2024-05-25 15:47:21] [INFO ] Dead Transitions using invariants and state equation in 1263 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1008/1018 places, 956/964 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6677 ms. Remains : 1008/1018 places, 956/964 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : HirschbergSinclair-PT-45-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GT 1 s106), p0:(LEQ s264 s770)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1468 ms.
Product exploration explored 100000 steps with 50000 reset in 1366 ms.
Computed a total of 1008 stabilizing places and 956 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1008 transition count 956
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 p1 p0), (X p1), (X p0), (X (X p1)), true, (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 17 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-45-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-45-LTLCardinality-14 finished in 10075 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-05-25 15:47:24] [INFO ] Flatten gal took : 53 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3822652341174242030
[2024-05-25 15:47:24] [INFO ] Computing symmetric may disable matrix : 964 transitions.
[2024-05-25 15:47:24] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:47:24] [INFO ] Computing symmetric may enable matrix : 964 transitions.
[2024-05-25 15:47:24] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:47:24] [INFO ] Applying decomposition
[2024-05-25 15:47:24] [INFO ] Flatten gal took : 51 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1076861177512740186.txt' '-o' '/tmp/graph1076861177512740186.bin' '-w' '/tmp/graph1076861177512740186.weights'
[2024-05-25 15:47:24] [INFO ] Computing Do-Not-Accords matrix : 964 transitions.
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1076861177512740186.bin' '-l' '-1' '-v' '-w' '/tmp/graph1076861177512740186.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:47:24] [INFO ] Decomposing Gal with order
[2024-05-25 15:47:25] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:47:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:47:25] [INFO ] Built C files in 198ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3822652341174242030
Running compilation step : cd /tmp/ltsmin3822652341174242030;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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'
[2024-05-25 15:47:25] [INFO ] Removed a total of 107 redundant transitions.
[2024-05-25 15:47:25] [INFO ] Flatten gal took : 103 ms
[2024-05-25 15:47:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-25 15:47:25] [INFO ] Time to serialize gal into /tmp/LTLCardinality10775121803664544704.gal : 10 ms
[2024-05-25 15:47:25] [INFO ] Time to serialize properties into /tmp/LTLCardinality15488793094126449358.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10775121803664544704.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15488793094126449358.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !((G(F("(gu65.election_45_2_4_to_left_42<=gu65.init16)"))))
Formula 0 simplified : FG!"(gu65.election_45_2_4_to_left_42<=gu65.init16)"
Compilation finished in 4541 ms.
Running link step : cd /tmp/ltsmin3822652341174242030;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin3822652341174242030;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-25 16:08:40] [INFO ] Flatten gal took : 129 ms
[2024-05-25 16:08:40] [INFO ] Time to serialize gal into /tmp/LTLCardinality11883395590508490271.gal : 24 ms
[2024-05-25 16:08:40] [INFO ] Time to serialize properties into /tmp/LTLCardinality14426364463744754036.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11883395590508490271.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14426364463744754036.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !((G(F("(election_45_2_4_to_left_42<=init16)"))))
Formula 0 simplified : FG!"(election_45_2_4_to_left_42<=init16)"
Detected timeout of ITS tools.
[2024-05-25 16:29:55] [INFO ] Flatten gal took : 141 ms
[2024-05-25 16:29:56] [INFO ] Input system was already deterministic with 964 transitions.
[2024-05-25 16:29:56] [INFO ] Transformed 1018 places.
[2024-05-25 16:29:56] [INFO ] Transformed 964 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-25 16:29:56] [INFO ] Time to serialize gal into /tmp/LTLCardinality4790523506172103048.gal : 24 ms
[2024-05-25 16:29:56] [INFO ] Time to serialize properties into /tmp/LTLCardinality14226831780729585310.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality4790523506172103048.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14226831780729585310.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("(election_45_2_4_to_left_42<=init16)"))))
Formula 0 simplified : FG!"(election_45_2_4_to_left_42<=init16)"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 7609120 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16039596 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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-45"
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-45, 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-171649597800077"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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