Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r114-smll-165264477500340.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is HirschbergSinclair-PT-50, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-165264477500340
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 952K
-rw-r--r-- 1 mcc users 15K Apr 29 16:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 29 16:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 29 16:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 29 16:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K May 9 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 9 08:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 9 08:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 652K May 10 09:34 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-50-LTLFireability-00
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-01
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-02
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-03
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-04
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-05
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-06
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-07
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-08
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-09
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-10
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-11
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-12
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-13
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-14
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652778515187

Running Version 202205111006
[2022-05-17 09:08:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 09:08:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 09:08:38] [INFO ] Load time of PNML (sax parser for PT used): 276 ms
[2022-05-17 09:08:38] [INFO ] Transformed 1208 places.
[2022-05-17 09:08:38] [INFO ] Transformed 1102 transitions.
[2022-05-17 09:08:38] [INFO ] Parsed PT model containing 1208 places and 1102 transitions in 474 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA HirschbergSinclair-PT-50-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-50-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 1208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1208/1208 places, 1102/1102 transitions.
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 1158 transition count 1102
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 96 place count 1112 transition count 1056
Iterating global reduction 1 with 46 rules applied. Total rules applied 142 place count 1112 transition count 1056
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 186 place count 1068 transition count 1012
Iterating global reduction 1 with 44 rules applied. Total rules applied 230 place count 1068 transition count 1012
Applied a total of 230 rules in 785 ms. Remains 1068 /1208 variables (removed 140) and now considering 1012/1102 (removed 90) transitions.
// Phase 1: matrix 1012 rows 1068 cols
[2022-05-17 09:08:39] [INFO ] Computed 56 place invariants in 50 ms
[2022-05-17 09:08:39] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 09:08:40] [INFO ] Implicit Places using invariants in 1145 ms returned []
// Phase 1: matrix 1012 rows 1068 cols
[2022-05-17 09:08:40] [INFO ] Computed 56 place invariants in 11 ms
[2022-05-17 09:08:44] [INFO ] Implicit Places using invariants and state equation in 3892 ms returned []
Implicit Place search using SMT with State Equation took 5093 ms to find 0 implicit places.
// Phase 1: matrix 1012 rows 1068 cols
[2022-05-17 09:08:44] [INFO ] Computed 56 place invariants in 16 ms
[2022-05-17 09:08:44] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 09:08:45] [INFO ] Dead Transitions using invariants and state equation in 1083 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1068/1208 places, 1012/1102 transitions.
Finished structural reductions, in 1 iterations. Remains : 1068/1208 places, 1012/1102 transitions.
Support contains 47 out of 1068 places after structural reductions.
[2022-05-17 09:08:45] [INFO ] Flatten gal took : 259 ms
[2022-05-17 09:08:46] [INFO ] Flatten gal took : 144 ms
[2022-05-17 09:08:46] [INFO ] Input system was already deterministic with 1012 transitions.
Support contains 46 out of 1068 places (down from 47) after GAL structural reductions.
Finished random walk after 1020 steps, including 0 resets, run visited all 31 properties in 234 ms. (steps per millisecond=4 )
FORMULA HirschbergSinclair-PT-50-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA HirschbergSinclair-PT-50-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1068 stabilizing places and 1012 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1068 transition count 1012
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 : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G((X(p1)||F(X(p2))))))'
Support contains 5 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1068/1068 places, 1012/1012 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1063 transition count 1007
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1063 transition count 1007
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 1060 transition count 1004
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 1060 transition count 1004
Applied a total of 16 rules in 170 ms. Remains 1060 /1068 variables (removed 8) and now considering 1004/1012 (removed 8) transitions.
// Phase 1: matrix 1004 rows 1060 cols
[2022-05-17 09:08:47] [INFO ] Computed 56 place invariants in 13 ms
[2022-05-17 09:08:48] [INFO ] Implicit Places using invariants in 787 ms returned []
// Phase 1: matrix 1004 rows 1060 cols
[2022-05-17 09:08:48] [INFO ] Computed 56 place invariants in 7 ms
[2022-05-17 09:08:52] [INFO ] Implicit Places using invariants and state equation in 4599 ms returned []
Implicit Place search using SMT with State Equation took 5390 ms to find 0 implicit places.
// Phase 1: matrix 1004 rows 1060 cols
[2022-05-17 09:08:52] [INFO ] Computed 56 place invariants in 8 ms
[2022-05-17 09:08:53] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 09:08:54] [INFO ] Dead Transitions using invariants and state equation in 1325 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1060/1068 places, 1004/1012 transitions.
Finished structural reductions, in 1 iterations. Remains : 1060/1068 places, 1004/1012 transitions.
Stuttering acceptance computed with spot in 456 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s49 1) (LT s860 1)), p1:(LT s107 1), p2:(OR (LT s97 1) (LT s310 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 90 reset in 653 ms.
Product exploration explored 100000 steps with 90 reset in 579 ms.
Computed a total of 1060 stabilizing places and 1004 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1060 transition count 1004
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 p2), (X p0), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p0)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p2)), (F (G p0)), (F (G p1)), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p2))
Knowledge based reduction with 16 factoid took 505 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA HirschbergSinclair-PT-50-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-50-LTLFireability-00 finished in 9721 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(X((F(p0)||G(p1)))))||G(p2)))'
Support contains 5 out of 1068 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1068/1068 places, 1012/1012 transitions.
Reduce places removed 48 places and 48 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 429 place count 1020 transition count 535
Reduce places removed 429 places and 0 transitions.
Iterating post reduction 1 with 429 rules applied. Total rules applied 858 place count 591 transition count 535
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 863 place count 586 transition count 530
Iterating global reduction 2 with 5 rules applied. Total rules applied 868 place count 586 transition count 530
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 869 place count 586 transition count 529
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 870 place count 585 transition count 529
Applied a total of 870 rules in 218 ms. Remains 585 /1068 variables (removed 483) and now considering 529/1012 (removed 483) transitions.
// Phase 1: matrix 529 rows 585 cols
[2022-05-17 09:08:57] [INFO ] Computed 56 place invariants in 7 ms
[2022-05-17 09:08:58] [INFO ] Implicit Places using invariants in 1025 ms returned []
// Phase 1: matrix 529 rows 585 cols
[2022-05-17 09:08:58] [INFO ] Computed 56 place invariants in 7 ms
[2022-05-17 09:09:01] [INFO ] Implicit Places using invariants and state equation in 3134 ms returned []
Implicit Place search using SMT with State Equation took 4178 ms to find 0 implicit places.
[2022-05-17 09:09:01] [INFO ] Redundant transitions in 46 ms returned []
// Phase 1: matrix 529 rows 585 cols
[2022-05-17 09:09:01] [INFO ] Computed 56 place invariants in 4 ms
[2022-05-17 09:09:01] [INFO ] Dead Transitions using invariants and state equation in 626 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 585/1068 places, 529/1012 transitions.
Finished structural reductions, in 1 iterations. Remains : 585/1068 places, 529/1012 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(GEQ s122 1), p1:(OR (LT s50 1) (LT s229 1)), p0:(AND (GEQ s33 1) (GEQ s346 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 220 reset in 520 ms.
Product exploration explored 100000 steps with 224 reset in 698 ms.
Computed a total of 585 stabilizing places and 529 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 585 transition count 529
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 (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G (NOT p2))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 13 factoid took 319 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA HirschbergSinclair-PT-50-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-50-LTLFireability-03 finished in 7034 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))||G(p1)))'
Support contains 3 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1068/1068 places, 1012/1012 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1062 transition count 1006
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1062 transition count 1006
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 1058 transition count 1002
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 1058 transition count 1002
Applied a total of 20 rules in 155 ms. Remains 1058 /1068 variables (removed 10) and now considering 1002/1012 (removed 10) transitions.
// Phase 1: matrix 1002 rows 1058 cols
[2022-05-17 09:09:04] [INFO ] Computed 56 place invariants in 9 ms
[2022-05-17 09:09:04] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 09:09:05] [INFO ] Implicit Places using invariants in 1032 ms returned []
// Phase 1: matrix 1002 rows 1058 cols
[2022-05-17 09:09:05] [INFO ] Computed 56 place invariants in 9 ms
[2022-05-17 09:09:09] [INFO ] Implicit Places using invariants and state equation in 4753 ms returned []
Implicit Place search using SMT with State Equation took 5789 ms to find 0 implicit places.
// Phase 1: matrix 1002 rows 1058 cols
[2022-05-17 09:09:09] [INFO ] Computed 56 place invariants in 11 ms
[2022-05-17 09:09:11] [INFO ] Dead Transitions using invariants and state equation in 1293 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1058/1068 places, 1002/1012 transitions.
Finished structural reductions, in 1 iterations. Remains : 1058/1068 places, 1002/1012 transitions.
Stuttering acceptance computed with spot in 196 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(GEQ s802 1), p0:(AND (OR (LT s11 1) (LT s537 1)) (GEQ s802 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, 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-50-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-50-LTLFireability-04 finished in 7469 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(p0))))'
Support contains 2 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1068/1068 places, 1012/1012 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1062 transition count 1006
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1062 transition count 1006
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 1058 transition count 1002
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 1058 transition count 1002
Applied a total of 20 rules in 167 ms. Remains 1058 /1068 variables (removed 10) and now considering 1002/1012 (removed 10) transitions.
// Phase 1: matrix 1002 rows 1058 cols
[2022-05-17 09:09:11] [INFO ] Computed 56 place invariants in 9 ms
[2022-05-17 09:09:11] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 09:09:12] [INFO ] Implicit Places using invariants in 953 ms returned []
// Phase 1: matrix 1002 rows 1058 cols
[2022-05-17 09:09:12] [INFO ] Computed 56 place invariants in 6 ms
[2022-05-17 09:09:13] [INFO ] Implicit Places using invariants and state equation in 949 ms returned []
Implicit Place search using SMT with State Equation took 1908 ms to find 0 implicit places.
// Phase 1: matrix 1002 rows 1058 cols
[2022-05-17 09:09:13] [INFO ] Computed 56 place invariants in 6 ms
[2022-05-17 09:09:13] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 09:09:14] [INFO ] Dead Transitions using invariants and state equation in 1275 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1058/1068 places, 1002/1012 transitions.
Finished structural reductions, in 1 iterations. Remains : 1058/1068 places, 1002/1012 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s7 1) (GEQ s116 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-50-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-50-LTLFireability-05 finished in 3509 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1068/1068 places, 1012/1012 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1062 transition count 1006
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1062 transition count 1006
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 1058 transition count 1002
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 1058 transition count 1002
Applied a total of 20 rules in 148 ms. Remains 1058 /1068 variables (removed 10) and now considering 1002/1012 (removed 10) transitions.
// Phase 1: matrix 1002 rows 1058 cols
[2022-05-17 09:09:15] [INFO ] Computed 56 place invariants in 7 ms
[2022-05-17 09:09:15] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 09:09:15] [INFO ] Implicit Places using invariants in 929 ms returned []
// Phase 1: matrix 1002 rows 1058 cols
[2022-05-17 09:09:15] [INFO ] Computed 56 place invariants in 7 ms
[2022-05-17 09:09:16] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 09:09:16] [INFO ] Implicit Places using invariants and state equation in 939 ms returned []
Implicit Place search using SMT with State Equation took 1871 ms to find 0 implicit places.
// Phase 1: matrix 1002 rows 1058 cols
[2022-05-17 09:09:16] [INFO ] Computed 56 place invariants in 9 ms
[2022-05-17 09:09:17] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 09:09:18] [INFO ] Dead Transitions using invariants and state equation in 1233 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1058/1068 places, 1002/1012 transitions.
Finished structural reductions, in 1 iterations. Remains : 1058/1068 places, 1002/1012 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s87 1) (GEQ s472 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 176 reset in 594 ms.
Product exploration explored 100000 steps with 176 reset in 902 ms.
Computed a total of 1058 stabilizing places and 1002 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1058 transition count 1002
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 p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 213 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 562 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=112 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 170 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
// Phase 1: matrix 1002 rows 1058 cols
[2022-05-17 09:09:20] [INFO ] Computed 56 place invariants in 6 ms
[2022-05-17 09:09:21] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 325 ms returned sat
[2022-05-17 09:09:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:09:35] [INFO ] [Real]Absence check using state equation in 13706 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 1058 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1058/1058 places, 1002/1002 transitions.
Reduce places removed 49 places and 49 transitions.
Drop transitions removed 437 transitions
Trivial Post-agglo rules discarded 437 transitions
Performed 437 trivial Post agglomeration. Transition count delta: 437
Iterating post reduction 0 with 437 rules applied. Total rules applied 437 place count 1009 transition count 516
Reduce places removed 437 places and 0 transitions.
Iterating post reduction 1 with 437 rules applied. Total rules applied 874 place count 572 transition count 516
Applied a total of 874 rules in 76 ms. Remains 572 /1058 variables (removed 486) and now considering 516/1002 (removed 486) transitions.
// Phase 1: matrix 516 rows 572 cols
[2022-05-17 09:09:35] [INFO ] Computed 56 place invariants in 2 ms
[2022-05-17 09:09:36] [INFO ] Implicit Places using invariants in 1065 ms returned []
// Phase 1: matrix 516 rows 572 cols
[2022-05-17 09:09:36] [INFO ] Computed 56 place invariants in 4 ms
[2022-05-17 09:09:39] [INFO ] Implicit Places using invariants and state equation in 3114 ms returned []
Implicit Place search using SMT with State Equation took 4185 ms to find 0 implicit places.
[2022-05-17 09:09:40] [INFO ] Redundant transitions in 22 ms returned []
// Phase 1: matrix 516 rows 572 cols
[2022-05-17 09:09:40] [INFO ] Computed 56 place invariants in 3 ms
[2022-05-17 09:09:40] [INFO ] Dead Transitions using invariants and state equation in 890 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 572/1058 places, 516/1002 transitions.
Finished structural reductions, in 1 iterations. Remains : 572/1058 places, 516/1002 transitions.
Computed a total of 572 stabilizing places and 516 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 572 transition count 516
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 p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 300 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=60 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 209 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
// Phase 1: matrix 516 rows 572 cols
[2022-05-17 09:09:41] [INFO ] Computed 56 place invariants in 4 ms
[2022-05-17 09:09:42] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 588 ms returned sat
[2022-05-17 09:09:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:09:46] [INFO ] [Real]Absence check using state equation in 3580 ms returned sat
[2022-05-17 09:09:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:09:48] [INFO ] [Nat]Absence check using 0 positive and 56 generalized place invariants in 641 ms returned sat
[2022-05-17 09:09:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:09:52] [INFO ] [Nat]Absence check using state equation in 4444 ms returned sat
[2022-05-17 09:09:52] [INFO ] Computed and/alt/rep : 409/417/409 causal constraints (skipped 11 transitions) in 35 ms.
[2022-05-17 09:09:54] [INFO ] Added : 123 causal constraints over 25 iterations in 1929 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 370 reset in 884 ms.
Product exploration explored 100000 steps with 370 reset in 633 ms.
Built C files in :
/tmp/ltsmin10700138090701192391
[2022-05-17 09:09:56] [INFO ] Computing symmetric may disable matrix : 516 transitions.
[2022-05-17 09:09:56] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:09:56] [INFO ] Computing symmetric may enable matrix : 516 transitions.
[2022-05-17 09:09:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:09:56] [INFO ] Computing Do-Not-Accords matrix : 516 transitions.
[2022-05-17 09:09:56] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:09:56] [INFO ] Built C files in 118ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10700138090701192391
Running compilation step : cd /tmp/ltsmin10700138090701192391;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1914 ms.
Running link step : cd /tmp/ltsmin10700138090701192391;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin10700138090701192391;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1929585391267329023.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 572 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 572/572 places, 516/516 transitions.
Applied a total of 0 rules in 33 ms. Remains 572 /572 variables (removed 0) and now considering 516/516 (removed 0) transitions.
// Phase 1: matrix 516 rows 572 cols
[2022-05-17 09:10:11] [INFO ] Computed 56 place invariants in 4 ms
[2022-05-17 09:10:12] [INFO ] Implicit Places using invariants in 989 ms returned []
// Phase 1: matrix 516 rows 572 cols
[2022-05-17 09:10:12] [INFO ] Computed 56 place invariants in 4 ms
[2022-05-17 09:10:15] [INFO ] Implicit Places using invariants and state equation in 3149 ms returned []
Implicit Place search using SMT with State Equation took 4140 ms to find 0 implicit places.
[2022-05-17 09:10:15] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 516 rows 572 cols
[2022-05-17 09:10:15] [INFO ] Computed 56 place invariants in 3 ms
[2022-05-17 09:10:16] [INFO ] Dead Transitions using invariants and state equation in 813 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 572/572 places, 516/516 transitions.
Built C files in :
/tmp/ltsmin8730749608405361768
[2022-05-17 09:10:16] [INFO ] Computing symmetric may disable matrix : 516 transitions.
[2022-05-17 09:10:16] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:10:16] [INFO ] Computing symmetric may enable matrix : 516 transitions.
[2022-05-17 09:10:16] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:10:16] [INFO ] Computing Do-Not-Accords matrix : 516 transitions.
[2022-05-17 09:10:16] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:10:16] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8730749608405361768
Running compilation step : cd /tmp/ltsmin8730749608405361768;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1891 ms.
Running link step : cd /tmp/ltsmin8730749608405361768;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin8730749608405361768;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15728754681129290855.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 09:10:31] [INFO ] Flatten gal took : 34 ms
[2022-05-17 09:10:31] [INFO ] Flatten gal took : 33 ms
[2022-05-17 09:10:31] [INFO ] Time to serialize gal into /tmp/LTL2382015687140237992.gal : 9 ms
[2022-05-17 09:10:31] [INFO ] Time to serialize properties into /tmp/LTL15080816338978378136.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2382015687140237992.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15080816338978378136.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2382015...267
Read 1 LTL properties
Checking formula 0 : !((X(F("((newmsg44>=1)&&(reply_50_4_to_right_43>=1))"))))
Formula 0 simplified : !XF"((newmsg44>=1)&&(reply_50_4_to_right_43>=1))"
Detected timeout of ITS tools.
[2022-05-17 09:10:46] [INFO ] Flatten gal took : 34 ms
[2022-05-17 09:10:46] [INFO ] Applying decomposition
[2022-05-17 09:10:46] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8264750989614447506.txt' '-o' '/tmp/graph8264750989614447506.bin' '-w' '/tmp/graph8264750989614447506.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8264750989614447506.bin' '-l' '-1' '-v' '-w' '/tmp/graph8264750989614447506.weights' '-q' '0' '-e' '0.001'
[2022-05-17 09:10:46] [INFO ] Decomposing Gal with order
[2022-05-17 09:10:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 09:10:47] [INFO ] Removed a total of 338 redundant transitions.
[2022-05-17 09:10:47] [INFO ] Flatten gal took : 299 ms
[2022-05-17 09:10:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 45 ms.
[2022-05-17 09:10:47] [INFO ] Time to serialize gal into /tmp/LTL6211397303503840658.gal : 20 ms
[2022-05-17 09:10:47] [INFO ] Time to serialize properties into /tmp/LTL14341741540108893157.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6211397303503840658.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14341741540108893157.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6211397...246
Read 1 LTL properties
Checking formula 0 : !((X(F("((i4.u0.newmsg44>=1)&&(i4.u88.reply_50_4_to_right_43>=1))"))))
Formula 0 simplified : !XF"((i4.u0.newmsg44>=1)&&(i4.u88.reply_50_4_to_right_43>=1))"
Reverse transition relation is NOT exact ! Due to transitions t70_t71, t94_t95, t110_t111, t132_t133, t156_t157, t184_t185, t211_t212, t233_t234, t860_t861...852
Computing Next relation with stutter on 1.06581e+36 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7377297921176760132
[2022-05-17 09:11:02] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7377297921176760132
Running compilation step : cd /tmp/ltsmin7377297921176760132;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1354 ms.
Running link step : cd /tmp/ltsmin7377297921176760132;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin7377297921176760132;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HirschbergSinclair-PT-50-LTLFireability-07 finished in 122781 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1)&&X((X(p2)||p3))))'
Support contains 6 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1068/1068 places, 1012/1012 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1063 transition count 1007
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1063 transition count 1007
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 1059 transition count 1003
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 1059 transition count 1003
Applied a total of 18 rules in 142 ms. Remains 1059 /1068 variables (removed 9) and now considering 1003/1012 (removed 9) transitions.
// Phase 1: matrix 1003 rows 1059 cols
[2022-05-17 09:11:17] [INFO ] Computed 56 place invariants in 5 ms
[2022-05-17 09:11:18] [INFO ] Implicit Places using invariants in 1073 ms returned []
// Phase 1: matrix 1003 rows 1059 cols
[2022-05-17 09:11:18] [INFO ] Computed 56 place invariants in 11 ms
[2022-05-17 09:11:19] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 09:11:19] [INFO ] Implicit Places using invariants and state equation in 1014 ms returned []
Implicit Place search using SMT with State Equation took 2089 ms to find 0 implicit places.
// Phase 1: matrix 1003 rows 1059 cols
[2022-05-17 09:11:19] [INFO ] Computed 56 place invariants in 7 ms
[2022-05-17 09:11:21] [INFO ] Dead Transitions using invariants and state equation in 1498 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1059/1068 places, 1003/1012 transitions.
Finished structural reductions, in 1 iterations. Remains : 1059/1068 places, 1003/1012 transitions.
Stuttering acceptance computed with spot in 297 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (NOT p1), (AND (NOT p3) (NOT p2)), (NOT p2), true]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (AND (GEQ s61 1) (GEQ s589 1)) (AND (GEQ s73 1) (GEQ s242 1))), p0:(AND (GEQ s61 1) (GEQ s589 1)), p3:(GEQ s523 1), p2:(LT s832 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 224 reset in 866 ms.
Product exploration explored 100000 steps with 240 reset in 1109 ms.
Computed a total of 1059 stabilizing places and 1003 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1059 transition count 1003
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 p1) (NOT p0) (NOT p3) p2), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT p3)), (X (X (NOT p0))), (X (X p2)), (F (G (NOT p1))), (F (G (NOT p0))), (F (G (NOT p3))), (F (G p2))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 11 factoid took 713 ms. Reduced automaton from 6 states, 9 edges and 4 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 655 steps, including 0 resets, run visited all 3 properties in 13 ms. (steps per millisecond=50 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p3) p2), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT p3)), (X (X (NOT p0))), (X (X p2)), (F (G (NOT p1))), (F (G (NOT p0))), (F (G (NOT p3))), (F (G p2))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 809 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
// Phase 1: matrix 1003 rows 1059 cols
[2022-05-17 09:11:26] [INFO ] Computed 56 place invariants in 10 ms
[2022-05-17 09:11:27] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 400 ms returned sat
[2022-05-17 09:11:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:11:41] [INFO ] [Real]Absence check using state equation in 13373 ms returned unknown
Could not prove EG (NOT p0)
// Phase 1: matrix 1003 rows 1059 cols
[2022-05-17 09:11:41] [INFO ] Computed 56 place invariants in 16 ms
[2022-05-17 09:11:43] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 444 ms returned sat
[2022-05-17 09:11:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:11:49] [INFO ] [Real]Absence check using state equation in 6420 ms returned sat
[2022-05-17 09:11:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:11:51] [INFO ] [Nat]Absence check using 0 positive and 56 generalized place invariants in 603 ms returned sat
[2022-05-17 09:11:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:12:04] [INFO ] [Nat]Absence check using state equation in 13113 ms returned unknown
Could not prove EG (NOT p1)
Support contains 4 out of 1059 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1059/1059 places, 1003/1003 transitions.
Applied a total of 0 rules in 54 ms. Remains 1059 /1059 variables (removed 0) and now considering 1003/1003 (removed 0) transitions.
// Phase 1: matrix 1003 rows 1059 cols
[2022-05-17 09:12:04] [INFO ] Computed 56 place invariants in 8 ms
[2022-05-17 09:12:05] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 09:12:05] [INFO ] Implicit Places using invariants in 946 ms returned []
// Phase 1: matrix 1003 rows 1059 cols
[2022-05-17 09:12:05] [INFO ] Computed 56 place invariants in 8 ms
[2022-05-17 09:12:07] [INFO ] Implicit Places using invariants and state equation in 1218 ms returned []
Implicit Place search using SMT with State Equation took 2166 ms to find 0 implicit places.
// Phase 1: matrix 1003 rows 1059 cols
[2022-05-17 09:12:07] [INFO ] Computed 56 place invariants in 7 ms
[2022-05-17 09:12:08] [INFO ] Dead Transitions using invariants and state equation in 1483 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1059/1059 places, 1003/1003 transitions.
Computed a total of 1059 stabilizing places and 1003 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1059 transition count 1003
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) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 7 factoid took 327 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 654 steps, including 0 resets, run visited all 3 properties in 8 ms. (steps per millisecond=81 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 533 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
// Phase 1: matrix 1003 rows 1059 cols
[2022-05-17 09:12:10] [INFO ] Computed 56 place invariants in 5 ms
[2022-05-17 09:12:12] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 608 ms returned sat
[2022-05-17 09:12:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:12:25] [INFO ] [Real]Absence check using state equation in 12971 ms returned unknown
Could not prove EG (NOT p0)
// Phase 1: matrix 1003 rows 1059 cols
[2022-05-17 09:12:25] [INFO ] Computed 56 place invariants in 5 ms
[2022-05-17 09:12:27] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 492 ms returned sat
[2022-05-17 09:12:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:12:32] [INFO ] [Real]Absence check using state equation in 5733 ms returned sat
[2022-05-17 09:12:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:12:34] [INFO ] [Nat]Absence check using 0 positive and 56 generalized place invariants in 375 ms returned sat
[2022-05-17 09:12:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:12:48] [INFO ] [Nat]Absence check using state equation in 13510 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 150 reset in 566 ms.
Product exploration explored 100000 steps with 149 reset in 920 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 1059 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1059/1059 places, 1003/1003 transitions.
Performed 431 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 431 rules applied. Total rules applied 431 place count 1059 transition count 1003
Deduced a syphon composed of 431 places in 5 ms
Applied a total of 431 rules in 909 ms. Remains 1059 /1059 variables (removed 0) and now considering 1003/1003 (removed 0) transitions.
[2022-05-17 09:12:51] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 1003 rows 1059 cols
[2022-05-17 09:12:51] [INFO ] Computed 56 place invariants in 5 ms
[2022-05-17 09:12:52] [INFO ] Dead Transitions using invariants and state equation in 1337 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1059/1059 places, 1003/1003 transitions.
Finished structural reductions, in 1 iterations. Remains : 1059/1059 places, 1003/1003 transitions.
Product exploration explored 100000 steps with 267 reset in 794 ms.
Product exploration explored 100000 steps with 267 reset in 656 ms.
Built C files in :
/tmp/ltsmin2916127651603123895
[2022-05-17 09:12:53] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2916127651603123895
Running compilation step : cd /tmp/ltsmin2916127651603123895;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2916127651603123895;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2916127651603123895;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 1059 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1059/1059 places, 1003/1003 transitions.
Applied a total of 0 rules in 140 ms. Remains 1059 /1059 variables (removed 0) and now considering 1003/1003 (removed 0) transitions.
// Phase 1: matrix 1003 rows 1059 cols
[2022-05-17 09:12:57] [INFO ] Computed 56 place invariants in 5 ms
[2022-05-17 09:12:58] [INFO ] Implicit Places using invariants in 938 ms returned []
// Phase 1: matrix 1003 rows 1059 cols
[2022-05-17 09:12:58] [INFO ] Computed 56 place invariants in 11 ms
[2022-05-17 09:13:02] [INFO ] Implicit Places using invariants and state equation in 4715 ms returned []
Implicit Place search using SMT with State Equation took 5655 ms to find 0 implicit places.
// Phase 1: matrix 1003 rows 1059 cols
[2022-05-17 09:13:02] [INFO ] Computed 56 place invariants in 9 ms
[2022-05-17 09:13:03] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 09:13:04] [INFO ] Dead Transitions using invariants and state equation in 1411 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1059/1059 places, 1003/1003 transitions.
Built C files in :
/tmp/ltsmin9846847609743727585
[2022-05-17 09:13:04] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9846847609743727585
Running compilation step : cd /tmp/ltsmin9846847609743727585;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2943 ms.
Running link step : cd /tmp/ltsmin9846847609743727585;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin9846847609743727585;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11340219998401341606.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 09:13:19] [INFO ] Flatten gal took : 80 ms
[2022-05-17 09:13:19] [INFO ] Flatten gal took : 74 ms
[2022-05-17 09:13:19] [INFO ] Time to serialize gal into /tmp/LTL10828038250565149228.gal : 7 ms
[2022-05-17 09:13:19] [INFO ] Time to serialize properties into /tmp/LTL11563146956835310503.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10828038250565149228.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11563146956835310503.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1082803...268
Read 1 LTL properties
Checking formula 0 : !((((F("((newmsg31>=1)&&(election_50_5_19_to_left_32>=1))"))U("(((newmsg31>=1)&&(election_50_5_19_to_left_32>=1))||((newmsg37>=1)&&(el...272
Formula 0 simplified : !((F"((newmsg31>=1)&&(election_50_5_19_to_left_32>=1))" U "(((newmsg31>=1)&&(election_50_5_19_to_left_32>=1))||((newmsg37>=1)&&(elec...262
Detected timeout of ITS tools.
[2022-05-17 09:13:34] [INFO ] Flatten gal took : 70 ms
[2022-05-17 09:13:34] [INFO ] Applying decomposition
[2022-05-17 09:13:34] [INFO ] Flatten gal took : 58 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3329930187691608341.txt' '-o' '/tmp/graph3329930187691608341.bin' '-w' '/tmp/graph3329930187691608341.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3329930187691608341.bin' '-l' '-1' '-v' '-w' '/tmp/graph3329930187691608341.weights' '-q' '0' '-e' '0.001'
[2022-05-17 09:13:35] [INFO ] Decomposing Gal with order
[2022-05-17 09:13:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 09:13:35] [INFO ] Removed a total of 137 redundant transitions.
[2022-05-17 09:13:35] [INFO ] Flatten gal took : 150 ms
[2022-05-17 09:13:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2022-05-17 09:13:35] [INFO ] Time to serialize gal into /tmp/LTL13380676358480120184.gal : 17 ms
[2022-05-17 09:13:35] [INFO ] Time to serialize properties into /tmp/LTL18017554121926398091.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13380676358480120184.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18017554121926398091.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1338067...247
Read 1 LTL properties
Checking formula 0 : !((((F("((i7.u24.newmsg31>=1)&&(i7.u52.election_50_5_19_to_left_32>=1))"))U("(((i7.u24.newmsg31>=1)&&(i7.u52.election_50_5_19_to_left_...339
Formula 0 simplified : !((F"((i7.u24.newmsg31>=1)&&(i7.u52.election_50_5_19_to_left_32>=1))" U "(((i7.u24.newmsg31>=1)&&(i7.u52.election_50_5_19_to_left_32...329
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16317665852700062428
[2022-05-17 09:13:50] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16317665852700062428
Running compilation step : cd /tmp/ltsmin16317665852700062428;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2779 ms.
Running link step : cd /tmp/ltsmin16317665852700062428;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin16317665852700062428;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((<>((LTLAPp0==true)) U (LTLAPp1==true))&&X((X((LTLAPp2==true))||(LTLAPp3==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HirschbergSinclair-PT-50-LTLFireability-09 finished in 167872 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(X(F(p0))))&&X((F(!p0)||p1))))'
Support contains 4 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1068/1068 places, 1012/1012 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1062 transition count 1006
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1062 transition count 1006
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 1058 transition count 1002
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 1058 transition count 1002
Applied a total of 20 rules in 184 ms. Remains 1058 /1068 variables (removed 10) and now considering 1002/1012 (removed 10) transitions.
// Phase 1: matrix 1002 rows 1058 cols
[2022-05-17 09:14:05] [INFO ] Computed 56 place invariants in 5 ms
[2022-05-17 09:14:06] [INFO ] Implicit Places using invariants in 850 ms returned []
// Phase 1: matrix 1002 rows 1058 cols
[2022-05-17 09:14:06] [INFO ] Computed 56 place invariants in 6 ms
[2022-05-17 09:14:06] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 09:14:07] [INFO ] Implicit Places using invariants and state equation in 871 ms returned []
Implicit Place search using SMT with State Equation took 1724 ms to find 0 implicit places.
// Phase 1: matrix 1002 rows 1058 cols
[2022-05-17 09:14:07] [INFO ] Computed 56 place invariants in 8 ms
[2022-05-17 09:14:08] [INFO ] Dead Transitions using invariants and state equation in 1223 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1058/1068 places, 1002/1012 transitions.
Finished structural reductions, in 1 iterations. Remains : 1058/1068 places, 1002/1012 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), p0]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s13 1) (GEQ s922 1)), p0:(AND (GEQ s37 1) (GEQ s946 1))], 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 108 reset in 449 ms.
Product exploration explored 100000 steps with 108 reset in 500 ms.
Computed a total of 1058 stabilizing places and 1002 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1058 transition count 1002
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 p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 251 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 934 steps, including 0 resets, run visited all 1 properties in 14 ms. (steps per millisecond=66 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 285 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 1002 rows 1058 cols
[2022-05-17 09:14:11] [INFO ] Computed 56 place invariants in 8 ms
[2022-05-17 09:14:12] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 611 ms returned sat
[2022-05-17 09:14:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:14:26] [INFO ] [Real]Absence check using state equation in 13379 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 1058 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1058/1058 places, 1002/1002 transitions.
Applied a total of 0 rules in 78 ms. Remains 1058 /1058 variables (removed 0) and now considering 1002/1002 (removed 0) transitions.
// Phase 1: matrix 1002 rows 1058 cols
[2022-05-17 09:14:26] [INFO ] Computed 56 place invariants in 5 ms
[2022-05-17 09:14:27] [INFO ] Implicit Places using invariants in 901 ms returned []
// Phase 1: matrix 1002 rows 1058 cols
[2022-05-17 09:14:27] [INFO ] Computed 56 place invariants in 5 ms
[2022-05-17 09:14:32] [INFO ] Implicit Places using invariants and state equation in 4799 ms returned []
Implicit Place search using SMT with State Equation took 5726 ms to find 0 implicit places.
// Phase 1: matrix 1002 rows 1058 cols
[2022-05-17 09:14:32] [INFO ] Computed 56 place invariants in 6 ms
[2022-05-17 09:14:33] [INFO ] Dead Transitions using invariants and state equation in 1432 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1058/1058 places, 1002/1002 transitions.
Computed a total of 1058 stabilizing places and 1002 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1058 transition count 1002
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 p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 910 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=75 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 1002 rows 1058 cols
[2022-05-17 09:14:34] [INFO ] Computed 56 place invariants in 4 ms
[2022-05-17 09:14:36] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 554 ms returned sat
[2022-05-17 09:14:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:14:49] [INFO ] [Real]Absence check using state equation in 13331 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 108 reset in 444 ms.
Product exploration explored 100000 steps with 108 reset in 485 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1058 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1058/1058 places, 1002/1002 transitions.
Performed 439 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 439 rules applied. Total rules applied 439 place count 1058 transition count 1002
Deduced a syphon composed of 439 places in 10 ms
Applied a total of 439 rules in 204 ms. Remains 1058 /1058 variables (removed 0) and now considering 1002/1002 (removed 0) transitions.
[2022-05-17 09:14:51] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 1002 rows 1058 cols
[2022-05-17 09:14:51] [INFO ] Computed 56 place invariants in 5 ms
[2022-05-17 09:14:52] [INFO ] Dead Transitions using invariants and state equation in 1465 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1058/1058 places, 1002/1002 transitions.
Finished structural reductions, in 1 iterations. Remains : 1058/1058 places, 1002/1002 transitions.
Product exploration explored 100000 steps with 200 reset in 728 ms.
Product exploration explored 100000 steps with 200 reset in 697 ms.
Built C files in :
/tmp/ltsmin12485101991621634173
[2022-05-17 09:14:54] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12485101991621634173
Running compilation step : cd /tmp/ltsmin12485101991621634173;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2919 ms.
Running link step : cd /tmp/ltsmin12485101991621634173;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin12485101991621634173;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15762776704810563544.hoa' '--buchi-type=spotba'
LTSmin run took 2485 ms.
FORMULA HirschbergSinclair-PT-50-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-50-LTLFireability-10 finished in 54217 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U F((G(p0)&&G(p1))))))'
Support contains 3 out of 1068 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1068/1068 places, 1012/1012 transitions.
Reduce places removed 49 places and 49 transitions.
Drop transitions removed 441 transitions
Trivial Post-agglo rules discarded 441 transitions
Performed 441 trivial Post agglomeration. Transition count delta: 441
Iterating post reduction 0 with 441 rules applied. Total rules applied 441 place count 1019 transition count 522
Reduce places removed 441 places and 0 transitions.
Iterating post reduction 1 with 441 rules applied. Total rules applied 882 place count 578 transition count 522
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 887 place count 573 transition count 517
Iterating global reduction 2 with 5 rules applied. Total rules applied 892 place count 573 transition count 517
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 894 place count 573 transition count 515
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 896 place count 571 transition count 515
Applied a total of 896 rules in 57 ms. Remains 571 /1068 variables (removed 497) and now considering 515/1012 (removed 497) transitions.
// Phase 1: matrix 515 rows 571 cols
[2022-05-17 09:14:59] [INFO ] Computed 56 place invariants in 2 ms
[2022-05-17 09:15:00] [INFO ] Implicit Places using invariants in 906 ms returned []
// Phase 1: matrix 515 rows 571 cols
[2022-05-17 09:15:00] [INFO ] Computed 56 place invariants in 7 ms
[2022-05-17 09:15:03] [INFO ] Implicit Places using invariants and state equation in 3079 ms returned []
Implicit Place search using SMT with State Equation took 3989 ms to find 0 implicit places.
[2022-05-17 09:15:03] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 515 rows 571 cols
[2022-05-17 09:15:03] [INFO ] Computed 56 place invariants in 2 ms
[2022-05-17 09:15:04] [INFO ] Dead Transitions using invariants and state equation in 804 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 571/1068 places, 515/1012 transitions.
Finished structural reductions, in 1 iterations. Remains : 571/1068 places, 515/1012 transitions.
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s16 1) (GEQ s486 1)), p1:(GEQ s93 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 553 steps with 0 reset in 4 ms.
FORMULA HirschbergSinclair-PT-50-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-50-LTLFireability-11 finished in 4973 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(!X(!X((!(G(p0)||!p0) U p1)))) U !p0))'
Support contains 3 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1068/1068 places, 1012/1012 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1062 transition count 1006
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1062 transition count 1006
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 1058 transition count 1002
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 1058 transition count 1002
Applied a total of 20 rules in 156 ms. Remains 1058 /1068 variables (removed 10) and now considering 1002/1012 (removed 10) transitions.
// Phase 1: matrix 1002 rows 1058 cols
[2022-05-17 09:15:04] [INFO ] Computed 56 place invariants in 6 ms
[2022-05-17 09:15:05] [INFO ] Implicit Places using invariants in 802 ms returned []
// Phase 1: matrix 1002 rows 1058 cols
[2022-05-17 09:15:05] [INFO ] Computed 56 place invariants in 6 ms
[2022-05-17 09:15:10] [INFO ] Implicit Places using invariants and state equation in 4978 ms returned []
Implicit Place search using SMT with State Equation took 5785 ms to find 0 implicit places.
// Phase 1: matrix 1002 rows 1058 cols
[2022-05-17 09:15:10] [INFO ] Computed 56 place invariants in 6 ms
[2022-05-17 09:15:11] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 09:15:11] [INFO ] Dead Transitions using invariants and state equation in 1110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1058/1068 places, 1002/1012 transitions.
Finished structural reductions, in 1 iterations. Remains : 1058/1068 places, 1002/1012 transitions.
Stuttering acceptance computed with spot in 203 ms :[p0, (OR (NOT p1) p0), (NOT p1), true, p0, (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=(OR p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LT s520 1), p1:(AND (GEQ s97 1) (GEQ s422 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 201 reset in 644 ms.
Product exploration explored 100000 steps with 200 reset in 653 ms.
Computed a total of 1058 stabilizing places and 1002 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1058 transition count 1002
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 (NOT p1)), (X p0), true, (X (X (OR p0 p1))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 456 ms. Reduced automaton from 6 states, 11 edges and 2 AP to 6 states, 12 edges and 2 AP.
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), true, p0, (NOT p1)]
Incomplete random walk after 10000 steps, including 9 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1002 rows 1058 cols
[2022-05-17 09:15:14] [INFO ] Computed 56 place invariants in 8 ms
[2022-05-17 09:15:15] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 294 ms returned sat
[2022-05-17 09:15:16] [INFO ] After 1354ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 09:15:16] [INFO ] [Nat]Absence check using 0 positive and 56 generalized place invariants in 272 ms returned sat
[2022-05-17 09:15:17] [INFO ] After 695ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 09:15:17] [INFO ] After 963ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 86 ms.
[2022-05-17 09:15:17] [INFO ] After 1533ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 1058 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1058/1058 places, 1002/1002 transitions.
Graph (complete) has 2015 edges and 1058 vertex of which 1009 are kept as prefixes of interest. Removing 49 places using SCC suffix rule.3 ms
Discarding 49 places :
Also discarding 0 output transitions
Drop transitions removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions removed 433 transitions
Trivial Post-agglo rules discarded 433 transitions
Performed 433 trivial Post agglomeration. Transition count delta: 433
Iterating post reduction 0 with 482 rules applied. Total rules applied 483 place count 1009 transition count 520
Reduce places removed 433 places and 0 transitions.
Graph (complete) has 1003 edges and 576 vertex of which 481 are kept as prefixes of interest. Removing 95 places using SCC suffix rule.0 ms
Discarding 95 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 434 rules applied. Total rules applied 917 place count 481 transition count 520
Drop transitions removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Iterating post reduction 2 with 95 rules applied. Total rules applied 1012 place count 481 transition count 425
Reduce places removed 49 places and 49 transitions.
Iterating global reduction 3 with 49 rules applied. Total rules applied 1061 place count 432 transition count 376
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 306 transitions
Trivial Post-agglo rules discarded 306 transitions
Performed 306 trivial Post agglomeration. Transition count delta: 306
Iterating post reduction 3 with 354 rules applied. Total rules applied 1415 place count 384 transition count 70
Reduce places removed 306 places and 0 transitions.
Iterating post reduction 4 with 306 rules applied. Total rules applied 1721 place count 78 transition count 70
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 25 Pre rules applied. Total rules applied 1721 place count 78 transition count 45
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 1771 place count 53 transition count 45
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 1774 place count 50 transition count 45
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 1774 place count 50 transition count 42
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1780 place count 47 transition count 42
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1784 place count 45 transition count 40
Applied a total of 1784 rules in 75 ms. Remains 45 /1058 variables (removed 1013) and now considering 40/1002 (removed 962) transitions.
Finished structural reductions, in 1 iterations. Remains : 45/1058 places, 40/1002 transitions.
Finished random walk after 108 steps, including 2 resets, run visited all 1 properties in 3 ms. (steps per millisecond=36 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X (OR p0 p1))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 9 factoid took 496 ms. Reduced automaton from 6 states, 12 edges and 2 AP to 6 states, 12 edges and 2 AP.
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), true, p0, (NOT p1)]
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), true, p0, (NOT p1)]
// Phase 1: matrix 1002 rows 1058 cols
[2022-05-17 09:15:18] [INFO ] Computed 56 place invariants in 8 ms
[2022-05-17 09:15:20] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 324 ms returned sat
[2022-05-17 09:15:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:15:32] [INFO ] [Real]Absence check using state equation in 12783 ms returned sat
[2022-05-17 09:15:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:15:34] [INFO ] [Nat]Absence check using 0 positive and 56 generalized place invariants in 370 ms returned sat
[2022-05-17 09:15:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:15:38] [INFO ] [Nat]Absence check using state equation in 4190 ms returned sat
[2022-05-17 09:15:38] [INFO ] Computed and/alt/rep : 496/826/496 causal constraints (skipped 456 transitions) in 85 ms.
[2022-05-17 09:15:46] [INFO ] Added : 200 causal constraints over 40 iterations in 7627 ms. Result :sat
Could not prove EG (NOT p1)
// Phase 1: matrix 1002 rows 1058 cols
[2022-05-17 09:15:46] [INFO ] Computed 56 place invariants in 9 ms
[2022-05-17 09:15:47] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 288 ms returned sat
[2022-05-17 09:15:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:15:51] [INFO ] [Real]Absence check using state equation in 3768 ms returned sat
[2022-05-17 09:15:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:15:53] [INFO ] [Nat]Absence check using 0 positive and 56 generalized place invariants in 522 ms returned sat
[2022-05-17 09:15:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:15:53] [INFO ] [Nat]Absence check using state equation in 729 ms returned sat
[2022-05-17 09:15:54] [INFO ] Computed and/alt/rep : 496/826/496 causal constraints (skipped 456 transitions) in 84 ms.
[2022-05-17 09:15:58] [INFO ] Added : 219 causal constraints over 44 iterations in 4844 ms. Result :sat
Could not prove EG p0
Support contains 3 out of 1058 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1058/1058 places, 1002/1002 transitions.
Applied a total of 0 rules in 81 ms. Remains 1058 /1058 variables (removed 0) and now considering 1002/1002 (removed 0) transitions.
// Phase 1: matrix 1002 rows 1058 cols
[2022-05-17 09:15:58] [INFO ] Computed 56 place invariants in 8 ms
[2022-05-17 09:16:00] [INFO ] Implicit Places using invariants in 1125 ms returned []
// Phase 1: matrix 1002 rows 1058 cols
[2022-05-17 09:16:00] [INFO ] Computed 56 place invariants in 6 ms
[2022-05-17 09:16:00] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 09:16:01] [INFO ] Implicit Places using invariants and state equation in 1119 ms returned []
Implicit Place search using SMT with State Equation took 2254 ms to find 0 implicit places.
// Phase 1: matrix 1002 rows 1058 cols
[2022-05-17 09:16:01] [INFO ] Computed 56 place invariants in 5 ms
[2022-05-17 09:16:02] [INFO ] Dead Transitions using invariants and state equation in 1288 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1058/1058 places, 1002/1002 transitions.
Computed a total of 1058 stabilizing places and 1002 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1058 transition count 1002
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 (NOT p1)), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (OR p0 p1))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 646 ms. Reduced automaton from 6 states, 12 edges and 2 AP to 6 states, 12 edges and 2 AP.
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), true, p0, (NOT p1)]
Incomplete random walk after 10000 steps, including 9 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1002 rows 1058 cols
[2022-05-17 09:16:04] [INFO ] Computed 56 place invariants in 6 ms
[2022-05-17 09:16:04] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 461 ms returned sat
[2022-05-17 09:16:05] [INFO ] After 1631ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 09:16:06] [INFO ] [Nat]Absence check using 0 positive and 56 generalized place invariants in 264 ms returned sat
[2022-05-17 09:16:07] [INFO ] After 830ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 09:16:07] [INFO ] After 1184ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 97 ms.
[2022-05-17 09:16:07] [INFO ] After 1753ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 1058 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1058/1058 places, 1002/1002 transitions.
Graph (complete) has 2015 edges and 1058 vertex of which 1009 are kept as prefixes of interest. Removing 49 places using SCC suffix rule.2 ms
Discarding 49 places :
Also discarding 0 output transitions
Drop transitions removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions removed 433 transitions
Trivial Post-agglo rules discarded 433 transitions
Performed 433 trivial Post agglomeration. Transition count delta: 433
Iterating post reduction 0 with 482 rules applied. Total rules applied 483 place count 1009 transition count 520
Reduce places removed 433 places and 0 transitions.
Graph (complete) has 1003 edges and 576 vertex of which 481 are kept as prefixes of interest. Removing 95 places using SCC suffix rule.1 ms
Discarding 95 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 434 rules applied. Total rules applied 917 place count 481 transition count 520
Drop transitions removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Iterating post reduction 2 with 95 rules applied. Total rules applied 1012 place count 481 transition count 425
Reduce places removed 49 places and 49 transitions.
Iterating global reduction 3 with 49 rules applied. Total rules applied 1061 place count 432 transition count 376
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 306 transitions
Trivial Post-agglo rules discarded 306 transitions
Performed 306 trivial Post agglomeration. Transition count delta: 306
Iterating post reduction 3 with 354 rules applied. Total rules applied 1415 place count 384 transition count 70
Reduce places removed 306 places and 0 transitions.
Iterating post reduction 4 with 306 rules applied. Total rules applied 1721 place count 78 transition count 70
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 25 Pre rules applied. Total rules applied 1721 place count 78 transition count 45
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 1771 place count 53 transition count 45
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 1774 place count 50 transition count 45
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 1774 place count 50 transition count 42
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1780 place count 47 transition count 42
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1784 place count 45 transition count 40
Applied a total of 1784 rules in 75 ms. Remains 45 /1058 variables (removed 1013) and now considering 40/1002 (removed 962) transitions.
Finished structural reductions, in 1 iterations. Remains : 45/1058 places, 40/1002 transitions.
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (OR p0 p1))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 12 factoid took 634 ms. Reduced automaton from 6 states, 12 edges and 2 AP to 6 states, 12 edges and 2 AP.
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), true, p0, (NOT p1)]
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), true, p0, (NOT p1)]
// Phase 1: matrix 1002 rows 1058 cols
[2022-05-17 09:16:08] [INFO ] Computed 56 place invariants in 5 ms
[2022-05-17 09:16:10] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 343 ms returned sat
[2022-05-17 09:16:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:16:22] [INFO ] [Real]Absence check using state equation in 12202 ms returned sat
[2022-05-17 09:16:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:16:24] [INFO ] [Nat]Absence check using 0 positive and 56 generalized place invariants in 381 ms returned sat
[2022-05-17 09:16:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:16:28] [INFO ] [Nat]Absence check using state equation in 4233 ms returned sat
[2022-05-17 09:16:28] [INFO ] Computed and/alt/rep : 496/826/496 causal constraints (skipped 456 transitions) in 75 ms.
[2022-05-17 09:16:37] [INFO ] Added : 200 causal constraints over 40 iterations in 9253 ms. Result :unknown
Could not prove EG (NOT p1)
// Phase 1: matrix 1002 rows 1058 cols
[2022-05-17 09:16:37] [INFO ] Computed 56 place invariants in 8 ms
[2022-05-17 09:16:39] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 283 ms returned sat
[2022-05-17 09:16:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:16:42] [INFO ] [Real]Absence check using state equation in 3715 ms returned sat
[2022-05-17 09:16:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:16:44] [INFO ] [Nat]Absence check using 0 positive and 56 generalized place invariants in 377 ms returned sat
[2022-05-17 09:16:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:16:45] [INFO ] [Nat]Absence check using state equation in 688 ms returned sat
[2022-05-17 09:16:45] [INFO ] Computed and/alt/rep : 496/826/496 causal constraints (skipped 456 transitions) in 109 ms.
[2022-05-17 09:16:49] [INFO ] Added : 219 causal constraints over 44 iterations in 4023 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), true, p0, (NOT p1)]
Entered a terminal (fully accepting) state of product in 530 steps with 0 reset in 4 ms.
FORMULA HirschbergSinclair-PT-50-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-50-LTLFireability-12 finished in 104808 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U !((p0 U p1)&&F(p0)))))'
Support contains 2 out of 1068 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1068/1068 places, 1012/1012 transitions.
Reduce places removed 50 places and 50 transitions.
Drop transitions removed 448 transitions
Trivial Post-agglo rules discarded 448 transitions
Performed 448 trivial Post agglomeration. Transition count delta: 448
Iterating post reduction 0 with 448 rules applied. Total rules applied 448 place count 1018 transition count 514
Reduce places removed 448 places and 0 transitions.
Iterating post reduction 1 with 448 rules applied. Total rules applied 896 place count 570 transition count 514
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 902 place count 564 transition count 508
Iterating global reduction 2 with 6 rules applied. Total rules applied 908 place count 564 transition count 508
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 910 place count 564 transition count 506
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 912 place count 562 transition count 506
Applied a total of 912 rules in 83 ms. Remains 562 /1068 variables (removed 506) and now considering 506/1012 (removed 506) transitions.
// Phase 1: matrix 506 rows 562 cols
[2022-05-17 09:16:49] [INFO ] Computed 56 place invariants in 4 ms
[2022-05-17 09:16:50] [INFO ] Implicit Places using invariants in 1087 ms returned []
// Phase 1: matrix 506 rows 562 cols
[2022-05-17 09:16:50] [INFO ] Computed 56 place invariants in 4 ms
[2022-05-17 09:16:53] [INFO ] Implicit Places using invariants and state equation in 3279 ms returned []
Implicit Place search using SMT with State Equation took 4368 ms to find 0 implicit places.
[2022-05-17 09:16:53] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 506 rows 562 cols
[2022-05-17 09:16:53] [INFO ] Computed 56 place invariants in 2 ms
[2022-05-17 09:16:54] [INFO ] Dead Transitions using invariants and state equation in 753 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 562/1068 places, 506/1012 transitions.
Finished structural reductions, in 1 iterations. Remains : 562/1068 places, 506/1012 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND p0 p1), p0, (AND p0 p1), true]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s499 1), p1:(GEQ s449 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 480 steps with 0 reset in 4 ms.
FORMULA HirschbergSinclair-PT-50-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-50-LTLFireability-13 finished in 5373 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((F(G(!p0)) U p1)||X(G(p2)))))'
Support contains 5 out of 1068 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 : 1068/1068 places, 1012/1012 transitions.
Reduce places removed 45 places and 45 transitions.
Drop transitions removed 417 transitions
Trivial Post-agglo rules discarded 417 transitions
Performed 417 trivial Post agglomeration. Transition count delta: 417
Iterating post reduction 0 with 417 rules applied. Total rules applied 417 place count 1023 transition count 550
Reduce places removed 417 places and 0 transitions.
Iterating post reduction 1 with 417 rules applied. Total rules applied 834 place count 606 transition count 550
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 839 place count 601 transition count 545
Iterating global reduction 2 with 5 rules applied. Total rules applied 844 place count 601 transition count 545
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 845 place count 601 transition count 544
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 846 place count 600 transition count 544
Applied a total of 846 rules in 94 ms. Remains 600 /1068 variables (removed 468) and now considering 544/1012 (removed 468) transitions.
// Phase 1: matrix 544 rows 600 cols
[2022-05-17 09:16:55] [INFO ] Computed 56 place invariants in 3 ms
[2022-05-17 09:16:55] [INFO ] Implicit Places using invariants in 906 ms returned []
// Phase 1: matrix 544 rows 600 cols
[2022-05-17 09:16:55] [INFO ] Computed 56 place invariants in 7 ms
[2022-05-17 09:16:56] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-05-17 09:16:59] [INFO ] Implicit Places using invariants and state equation in 3521 ms returned []
Implicit Place search using SMT with State Equation took 4429 ms to find 0 implicit places.
[2022-05-17 09:16:59] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 544 rows 600 cols
[2022-05-17 09:16:59] [INFO ] Computed 56 place invariants in 4 ms
[2022-05-17 09:17:00] [INFO ] Dead Transitions using invariants and state equation in 803 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 600/1068 places, 544/1012 transitions.
Finished structural reductions, in 1 iterations. Remains : 600/1068 places, 544/1012 transitions.
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p2) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p2:(OR (GEQ s26 1) (AND (GEQ s31 1) (GEQ s466 1)) (AND (GEQ s53 1) (GEQ s154 1))), p1:(AND (GEQ s31 1) (GEQ s466 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 206 reset in 764 ms.
Product exploration explored 100000 steps with 206 reset in 551 ms.
Computed a total of 600 stabilizing places and 544 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 600 transition count 544
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 p2 (NOT p1)), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 282 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p2) (NOT p1))]
Finished random walk after 22 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND p2 (NOT p1)), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (NOT (AND p2 (NOT p1)))), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 3 factoid took 377 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p2) (NOT p1))]
Support contains 5 out of 600 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 : 600/600 places, 544/544 transitions.
Applied a total of 0 rules in 37 ms. Remains 600 /600 variables (removed 0) and now considering 544/544 (removed 0) transitions.
// Phase 1: matrix 544 rows 600 cols
[2022-05-17 09:17:02] [INFO ] Computed 56 place invariants in 2 ms
[2022-05-17 09:17:03] [INFO ] Implicit Places using invariants in 1159 ms returned []
// Phase 1: matrix 544 rows 600 cols
[2022-05-17 09:17:04] [INFO ] Computed 56 place invariants in 3 ms
[2022-05-17 09:17:04] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-05-17 09:17:07] [INFO ] Implicit Places using invariants and state equation in 3488 ms returned []
Implicit Place search using SMT with State Equation took 4657 ms to find 0 implicit places.
[2022-05-17 09:17:07] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 544 rows 600 cols
[2022-05-17 09:17:07] [INFO ] Computed 56 place invariants in 4 ms
[2022-05-17 09:17:08] [INFO ] Dead Transitions using invariants and state equation in 692 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 600/600 places, 544/544 transitions.
Computed a total of 600 stabilizing places and 544 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 600 transition count 544
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 p2 (NOT p1)), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 271 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p2) (NOT p1))]
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p2 (NOT p1)), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (NOT (AND p2 (NOT p1)))), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 3 factoid took 431 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 206 reset in 466 ms.
Product exploration explored 100000 steps with 206 reset in 529 ms.
Built C files in :
/tmp/ltsmin74205095374819141
[2022-05-17 09:17:10] [INFO ] Computing symmetric may disable matrix : 544 transitions.
[2022-05-17 09:17:10] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:17:10] [INFO ] Computing symmetric may enable matrix : 544 transitions.
[2022-05-17 09:17:10] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:17:10] [INFO ] Computing Do-Not-Accords matrix : 544 transitions.
[2022-05-17 09:17:10] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:17:10] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin74205095374819141
Running compilation step : cd /tmp/ltsmin74205095374819141;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1939 ms.
Running link step : cd /tmp/ltsmin74205095374819141;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin74205095374819141;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13140382782326576981.hoa' '--buchi-type=spotba'
LTSmin run took 2958 ms.
FORMULA HirschbergSinclair-PT-50-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-50-LTLFireability-14 finished in 20604 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((((F(p0)&&p1) U !p1)&&F(X((p1 U G(p2)))))))'
Support contains 2 out of 1068 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 : 1068/1068 places, 1012/1012 transitions.
Reduce places removed 48 places and 48 transitions.
Drop transitions removed 437 transitions
Trivial Post-agglo rules discarded 437 transitions
Performed 437 trivial Post agglomeration. Transition count delta: 437
Iterating post reduction 0 with 437 rules applied. Total rules applied 437 place count 1020 transition count 527
Reduce places removed 437 places and 0 transitions.
Iterating post reduction 1 with 437 rules applied. Total rules applied 874 place count 583 transition count 527
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 880 place count 577 transition count 521
Iterating global reduction 2 with 6 rules applied. Total rules applied 886 place count 577 transition count 521
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 888 place count 577 transition count 519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 890 place count 575 transition count 519
Applied a total of 890 rules in 50 ms. Remains 575 /1068 variables (removed 493) and now considering 519/1012 (removed 493) transitions.
// Phase 1: matrix 519 rows 575 cols
[2022-05-17 09:17:15] [INFO ] Computed 56 place invariants in 3 ms
[2022-05-17 09:17:16] [INFO ] Implicit Places using invariants in 877 ms returned []
// Phase 1: matrix 519 rows 575 cols
[2022-05-17 09:17:16] [INFO ] Computed 56 place invariants in 4 ms
[2022-05-17 09:17:17] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-17 09:17:20] [INFO ] Implicit Places using invariants and state equation in 3777 ms returned []
Implicit Place search using SMT with State Equation took 4659 ms to find 0 implicit places.
[2022-05-17 09:17:20] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 519 rows 575 cols
[2022-05-17 09:17:20] [INFO ] Computed 56 place invariants in 2 ms
[2022-05-17 09:17:21] [INFO ] Dead Transitions using invariants and state equation in 947 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 575/1068 places, 519/1012 transitions.
Finished structural reductions, in 1 iterations. Remains : 575/1068 places, 519/1012 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p2) p1), (NOT p2), p1]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s463 1), p2:(GEQ s40 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 570 steps with 0 reset in 3 ms.
FORMULA HirschbergSinclair-PT-50-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-50-LTLFireability-15 finished in 5908 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a CL insensitive property : HirschbergSinclair-PT-50-LTLFireability-07
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1068 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1068/1068 places, 1012/1012 transitions.
Reduce places removed 49 places and 49 transitions.
Drop transitions removed 439 transitions
Trivial Post-agglo rules discarded 439 transitions
Performed 439 trivial Post agglomeration. Transition count delta: 439
Iterating post reduction 0 with 439 rules applied. Total rules applied 439 place count 1019 transition count 524
Reduce places removed 439 places and 0 transitions.
Iterating post reduction 1 with 439 rules applied. Total rules applied 878 place count 580 transition count 524
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 884 place count 574 transition count 518
Iterating global reduction 2 with 6 rules applied. Total rules applied 890 place count 574 transition count 518
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 892 place count 574 transition count 516
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 894 place count 572 transition count 516
Applied a total of 894 rules in 54 ms. Remains 572 /1068 variables (removed 496) and now considering 516/1012 (removed 496) transitions.
// Phase 1: matrix 516 rows 572 cols
[2022-05-17 09:17:21] [INFO ] Computed 56 place invariants in 2 ms
[2022-05-17 09:17:22] [INFO ] Implicit Places using invariants in 748 ms returned []
// Phase 1: matrix 516 rows 572 cols
[2022-05-17 09:17:22] [INFO ] Computed 56 place invariants in 4 ms
[2022-05-17 09:17:25] [INFO ] Implicit Places using invariants and state equation in 3019 ms returned []
Implicit Place search using SMT with State Equation took 3785 ms to find 0 implicit places.
// Phase 1: matrix 516 rows 572 cols
[2022-05-17 09:17:25] [INFO ] Computed 56 place invariants in 4 ms
[2022-05-17 09:17:26] [INFO ] Dead Transitions using invariants and state equation in 1084 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 572/1068 places, 516/1012 transitions.
Finished structural reductions, in 1 iterations. Remains : 572/1068 places, 516/1012 transitions.
Running random walk in product with property : HirschbergSinclair-PT-50-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s44 1) (GEQ s247 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 370 reset in 836 ms.
Product exploration explored 100000 steps with 370 reset in 937 ms.
Computed a total of 572 stabilizing places and 516 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 572 transition count 516
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 p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 145 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 294 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=98 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 160 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
// Phase 1: matrix 516 rows 572 cols
[2022-05-17 09:17:29] [INFO ] Computed 56 place invariants in 2 ms
[2022-05-17 09:17:30] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 585 ms returned sat
[2022-05-17 09:17:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:17:33] [INFO ] [Real]Absence check using state equation in 3631 ms returned sat
[2022-05-17 09:17:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:17:35] [INFO ] [Nat]Absence check using 0 positive and 56 generalized place invariants in 598 ms returned sat
[2022-05-17 09:17:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:17:38] [INFO ] [Nat]Absence check using state equation in 3896 ms returned sat
[2022-05-17 09:17:39] [INFO ] Computed and/alt/rep : 409/417/409 causal constraints (skipped 11 transitions) in 46 ms.
[2022-05-17 09:17:41] [INFO ] Added : 123 causal constraints over 25 iterations in 2074 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 572 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 572/572 places, 516/516 transitions.
Applied a total of 0 rules in 27 ms. Remains 572 /572 variables (removed 0) and now considering 516/516 (removed 0) transitions.
// Phase 1: matrix 516 rows 572 cols
[2022-05-17 09:17:41] [INFO ] Computed 56 place invariants in 2 ms
[2022-05-17 09:17:42] [INFO ] Implicit Places using invariants in 889 ms returned []
// Phase 1: matrix 516 rows 572 cols
[2022-05-17 09:17:42] [INFO ] Computed 56 place invariants in 4 ms
[2022-05-17 09:17:44] [INFO ] Implicit Places using invariants and state equation in 2909 ms returned []
Implicit Place search using SMT with State Equation took 3800 ms to find 0 implicit places.
[2022-05-17 09:17:44] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 516 rows 572 cols
[2022-05-17 09:17:44] [INFO ] Computed 56 place invariants in 2 ms
[2022-05-17 09:17:45] [INFO ] Dead Transitions using invariants and state equation in 855 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 572/572 places, 516/516 transitions.
Computed a total of 572 stabilizing places and 516 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 572 transition count 516
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 p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 180 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Finished random walk after 287 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=95 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 190 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
// Phase 1: matrix 516 rows 572 cols
[2022-05-17 09:17:46] [INFO ] Computed 56 place invariants in 4 ms
[2022-05-17 09:17:47] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 589 ms returned sat
[2022-05-17 09:17:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 09:17:52] [INFO ] [Real]Absence check using state equation in 4075 ms returned sat
[2022-05-17 09:17:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 09:17:53] [INFO ] [Nat]Absence check using 0 positive and 56 generalized place invariants in 668 ms returned sat
[2022-05-17 09:17:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 09:17:57] [INFO ] [Nat]Absence check using state equation in 4287 ms returned sat
[2022-05-17 09:17:57] [INFO ] Computed and/alt/rep : 409/417/409 causal constraints (skipped 11 transitions) in 34 ms.
[2022-05-17 09:17:59] [INFO ] Added : 123 causal constraints over 25 iterations in 1807 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 370 reset in 907 ms.
Product exploration explored 100000 steps with 371 reset in 612 ms.
Built C files in :
/tmp/ltsmin2388894789775257960
[2022-05-17 09:18:01] [INFO ] Computing symmetric may disable matrix : 516 transitions.
[2022-05-17 09:18:01] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:18:01] [INFO ] Computing symmetric may enable matrix : 516 transitions.
[2022-05-17 09:18:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:18:01] [INFO ] Computing Do-Not-Accords matrix : 516 transitions.
[2022-05-17 09:18:01] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:18:01] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2388894789775257960
Running compilation step : cd /tmp/ltsmin2388894789775257960;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2012 ms.
Running link step : cd /tmp/ltsmin2388894789775257960;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin2388894789775257960;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13527214418390247369.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 572 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 572/572 places, 516/516 transitions.
Applied a total of 0 rules in 22 ms. Remains 572 /572 variables (removed 0) and now considering 516/516 (removed 0) transitions.
// Phase 1: matrix 516 rows 572 cols
[2022-05-17 09:18:16] [INFO ] Computed 56 place invariants in 2 ms
[2022-05-17 09:18:17] [INFO ] Implicit Places using invariants in 842 ms returned []
// Phase 1: matrix 516 rows 572 cols
[2022-05-17 09:18:17] [INFO ] Computed 56 place invariants in 5 ms
[2022-05-17 09:18:20] [INFO ] Implicit Places using invariants and state equation in 3166 ms returned []
Implicit Place search using SMT with State Equation took 4013 ms to find 0 implicit places.
[2022-05-17 09:18:20] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 516 rows 572 cols
[2022-05-17 09:18:20] [INFO ] Computed 56 place invariants in 2 ms
[2022-05-17 09:18:21] [INFO ] Dead Transitions using invariants and state equation in 819 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 572/572 places, 516/516 transitions.
Built C files in :
/tmp/ltsmin9548758324759874172
[2022-05-17 09:18:21] [INFO ] Computing symmetric may disable matrix : 516 transitions.
[2022-05-17 09:18:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:18:21] [INFO ] Computing symmetric may enable matrix : 516 transitions.
[2022-05-17 09:18:21] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:18:21] [INFO ] Computing Do-Not-Accords matrix : 516 transitions.
[2022-05-17 09:18:21] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:18:21] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9548758324759874172
Running compilation step : cd /tmp/ltsmin9548758324759874172;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2033 ms.
Running link step : cd /tmp/ltsmin9548758324759874172;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin9548758324759874172;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17089163711006455980.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 09:18:36] [INFO ] Flatten gal took : 20 ms
[2022-05-17 09:18:36] [INFO ] Flatten gal took : 20 ms
[2022-05-17 09:18:36] [INFO ] Time to serialize gal into /tmp/LTL4575721272567335352.gal : 7 ms
[2022-05-17 09:18:36] [INFO ] Time to serialize properties into /tmp/LTL2629749966891605938.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4575721272567335352.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2629749966891605938.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4575721...266
Read 1 LTL properties
Checking formula 0 : !((X(F("((newmsg44>=1)&&(reply_50_4_to_right_43>=1))"))))
Formula 0 simplified : !XF"((newmsg44>=1)&&(reply_50_4_to_right_43>=1))"
Detected timeout of ITS tools.
[2022-05-17 09:18:51] [INFO ] Flatten gal took : 33 ms
[2022-05-17 09:18:51] [INFO ] Applying decomposition
[2022-05-17 09:18:51] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13464226205437561401.txt' '-o' '/tmp/graph13464226205437561401.bin' '-w' '/tmp/graph13464226205437561401.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13464226205437561401.bin' '-l' '-1' '-v' '-w' '/tmp/graph13464226205437561401.weights' '-q' '0' '-e' '0.001'
[2022-05-17 09:18:51] [INFO ] Decomposing Gal with order
[2022-05-17 09:18:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 09:18:51] [INFO ] Removed a total of 341 redundant transitions.
[2022-05-17 09:18:51] [INFO ] Flatten gal took : 79 ms
[2022-05-17 09:18:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 29 ms.
[2022-05-17 09:18:51] [INFO ] Time to serialize gal into /tmp/LTL17889090604978542720.gal : 12 ms
[2022-05-17 09:18:51] [INFO ] Time to serialize properties into /tmp/LTL7710291206598199597.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17889090604978542720.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7710291206598199597.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1788909...246
Read 1 LTL properties
Checking formula 0 : !((X(F("((i3.u1.newmsg44>=1)&&(i8.u91.reply_50_4_to_right_43>=1))"))))
Formula 0 simplified : !XF"((i3.u1.newmsg44>=1)&&(i8.u91.reply_50_4_to_right_43>=1))"
Reverse transition relation is NOT exact ! Due to transitions t114_t115, t160_t161, t180_t181, t231_t232, t241_t242, t651_t652, t860_t861, t938_t939, i1.t6...894
Computing Next relation with stutter on 1.06581e+36 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4244015419791688428
[2022-05-17 09:19:06] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4244015419791688428
Running compilation step : cd /tmp/ltsmin4244015419791688428;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1376 ms.
Running link step : cd /tmp/ltsmin4244015419791688428;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin4244015419791688428;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property HirschbergSinclair-PT-50-LTLFireability-07 finished in 120372 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1)&&X((X(p2)||p3))))'
[2022-05-17 09:19:21] [INFO ] Flatten gal took : 38 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8006649897940216182
[2022-05-17 09:19:21] [INFO ] Computing symmetric may disable matrix : 1012 transitions.
[2022-05-17 09:19:21] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:19:21] [INFO ] Computing symmetric may enable matrix : 1012 transitions.
[2022-05-17 09:19:21] [INFO ] Applying decomposition
[2022-05-17 09:19:21] [INFO ] Computation of Complete enable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 09:19:22] [INFO ] Flatten gal took : 65 ms
[2022-05-17 09:19:22] [INFO ] Computing Do-Not-Accords matrix : 1012 transitions.
[2022-05-17 09:19:22] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16825265761569021068.txt' '-o' '/tmp/graph16825265761569021068.bin' '-w' '/tmp/graph16825265761569021068.weights'
[2022-05-17 09:19:22] [INFO ] Built C files in 194ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8006649897940216182
Running compilation step : cd /tmp/ltsmin8006649897940216182;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16825265761569021068.bin' '-l' '-1' '-v' '-w' '/tmp/graph16825265761569021068.weights' '-q' '0' '-e' '0.001'
[2022-05-17 09:19:22] [INFO ] Decomposing Gal with order
[2022-05-17 09:19:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 09:19:22] [INFO ] Removed a total of 120 redundant transitions.
[2022-05-17 09:19:22] [INFO ] Flatten gal took : 133 ms
[2022-05-17 09:19:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 11 ms.
[2022-05-17 09:19:22] [INFO ] Time to serialize gal into /tmp/LTLFireability6928454866661504513.gal : 18 ms
[2022-05-17 09:19:22] [INFO ] Time to serialize properties into /tmp/LTLFireability12507313978153718579.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6928454866661504513.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12507313978153718579.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 2 LTL properties
Checking formula 0 : !((X(F("((i11.i0.u39.newmsg44>=1)&&(i11.i0.u38.reply_50_4_to_right_43>=1))"))))
Formula 0 simplified : !XF"((i11.i0.u39.newmsg44>=1)&&(i11.i0.u38.reply_50_4_to_right_43>=1))"
Compilation finished in 4864 ms.
Running link step : cd /tmp/ltsmin8006649897940216182;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin8006649897940216182;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t9, t13, t16, t21, t23, t27, t29, t34, t38, t42, t46, t48, t49, t961, i0.t1011, i0.t5...1908
Computing Next relation with stutter on 3.1825e+36 deadlock states
Detected timeout of ITS tools.
[2022-05-17 09:42:56] [INFO ] Flatten gal took : 120 ms
[2022-05-17 09:42:56] [INFO ] Time to serialize gal into /tmp/LTLFireability11660317721288812750.gal : 6 ms
[2022-05-17 09:42:57] [INFO ] Time to serialize properties into /tmp/LTLFireability13186794026086574819.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11660317721288812750.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13186794026086574819.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...290
Read 2 LTL properties
Checking formula 0 : !((X(F("((newmsg44>=1)&&(reply_50_4_to_right_43>=1))"))))
Formula 0 simplified : !XF"((newmsg44>=1)&&(reply_50_4_to_right_43>=1))"
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin8006649897940216182;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8006649897940216182;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((<>((LTLAPp1==true)) U (LTLAPp2==true))&&X((X((LTLAPp3==true))||(LTLAPp4==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-17 10:06:32] [INFO ] Flatten gal took : 124 ms
[2022-05-17 10:06:32] [INFO ] Input system was already deterministic with 1012 transitions.
[2022-05-17 10:06:32] [INFO ] Transformed 1068 places.
[2022-05-17 10:06:32] [INFO ] Transformed 1012 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/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//..//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
[2022-05-17 10:06:32] [INFO ] Time to serialize gal into /tmp/LTLFireability9384763063636500015.gal : 5 ms
[2022-05-17 10:06:32] [INFO ] Time to serialize properties into /tmp/LTLFireability10511184381696361967.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9384763063636500015.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10511184381696361967.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F("((newmsg44>=1)&&(reply_50_4_to_right_43>=1))"))))
Formula 0 simplified : !XF"((newmsg44>=1)&&(reply_50_4_to_right_43>=1))"

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-50"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is HirschbergSinclair-PT-50, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-smll-165264477500340"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-50.tgz
mv HirschbergSinclair-PT-50 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;