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-165264477400268.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-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-165264477400268
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 388K
-rw-r--r-- 1 mcc users 9.9K Apr 29 16:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 29 16:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 29 16:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 29 16:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K May 9 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 9 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 9 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 9 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 08:01 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 157K 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-05-LTLFireability-00
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-01
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-02
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-03
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-04
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-05
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-06
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-07
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-08
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-09
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-10
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-11
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-12
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-13
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-14
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652734582187

Running Version 202205111006
[2022-05-16 20:56:23] [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-16 20:56:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 20:56:24] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2022-05-16 20:56:24] [INFO ] Transformed 124 places.
[2022-05-16 20:56:24] [INFO ] Transformed 111 transitions.
[2022-05-16 20:56:24] [INFO ] Parsed PT model containing 124 places and 111 transitions in 323 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA HirschbergSinclair-PT-05-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-05-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-05-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 111/111 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 119 transition count 111
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 9 place count 115 transition count 107
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 115 transition count 107
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 112 transition count 104
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 112 transition count 104
Applied a total of 19 rules in 42 ms. Remains 112 /124 variables (removed 12) and now considering 104/111 (removed 7) transitions.
// Phase 1: matrix 104 rows 112 cols
[2022-05-16 20:56:24] [INFO ] Computed 8 place invariants in 24 ms
[2022-05-16 20:56:24] [INFO ] Implicit Places using invariants in 293 ms returned []
// Phase 1: matrix 104 rows 112 cols
[2022-05-16 20:56:24] [INFO ] Computed 8 place invariants in 5 ms
[2022-05-16 20:56:25] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
// Phase 1: matrix 104 rows 112 cols
[2022-05-16 20:56:25] [INFO ] Computed 8 place invariants in 3 ms
[2022-05-16 20:56:25] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 112/124 places, 104/111 transitions.
Finished structural reductions, in 1 iterations. Remains : 112/124 places, 104/111 transitions.
Support contains 30 out of 112 places after structural reductions.
[2022-05-16 20:56:25] [INFO ] Flatten gal took : 66 ms
[2022-05-16 20:56:25] [INFO ] Flatten gal took : 33 ms
[2022-05-16 20:56:25] [INFO ] Input system was already deterministic with 104 transitions.
Incomplete random walk after 10000 steps, including 90 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 28) seen :27
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 104 rows 112 cols
[2022-05-16 20:56:25] [INFO ] Computed 8 place invariants in 6 ms
[2022-05-16 20:56:26] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 9 ms returned sat
[2022-05-16 20:56:26] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA HirschbergSinclair-PT-05-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 112 stabilizing places and 104 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 112 transition count 104
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' '!(F((F(p0)&&(G(p1)||X((X(G(!p1)) U X(p2)))))))'
Support contains 5 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 104/104 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 111 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 111 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 110 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 110 transition count 102
Applied a total of 4 rules in 28 ms. Remains 110 /112 variables (removed 2) and now considering 102/104 (removed 2) transitions.
// Phase 1: matrix 102 rows 110 cols
[2022-05-16 20:56:26] [INFO ] Computed 8 place invariants in 3 ms
[2022-05-16 20:56:26] [INFO ] Implicit Places using invariants in 125 ms returned []
// Phase 1: matrix 102 rows 110 cols
[2022-05-16 20:56:26] [INFO ] Computed 8 place invariants in 3 ms
[2022-05-16 20:56:26] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
// Phase 1: matrix 102 rows 110 cols
[2022-05-16 20:56:26] [INFO ] Computed 8 place invariants in 3 ms
[2022-05-16 20:56:27] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 110/112 places, 102/104 transitions.
Finished structural reductions, in 1 iterations. Remains : 110/112 places, 102/104 transitions.
Stuttering acceptance computed with spot in 913 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), false, (AND (NOT p0) p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 5}, { cond=p1, acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}, { cond=p1, acceptance={} source=3 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s82 1)), p1:(OR (LT s3 1) (LT s12 1)), p2:(GEQ s98 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1290 reset in 541 ms.
Product exploration explored 100000 steps with 1289 reset in 243 ms.
Computed a total of 110 stabilizing places and 102 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 110 transition count 102
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (F (G (NOT p0))), (F (G p1)), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
Knowledge based reduction with 10 factoid took 1081 ms. Reduced automaton from 10 states, 27 edges and 3 AP to 9 states, 21 edges and 3 AP.
Stuttering acceptance computed with spot in 455 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), false, (AND (NOT p0) p1), (AND (NOT p0) (NOT p1))]
Finished random walk after 73 steps, including 0 resets, run visited all 8 properties in 10 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (F (G (NOT p0))), (F (G p1)), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (AND (NOT p2) (NOT p1))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) p1))), (F (NOT (AND (NOT p2) p1))), (F p0), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (NOT (AND (NOT p0) (NOT p2) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 10 factoid took 1235 ms. Reduced automaton from 9 states, 21 edges and 3 AP to 9 states, 21 edges and 3 AP.
Stuttering acceptance computed with spot in 461 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), false, (AND (NOT p0) p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 466 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), false, (AND (NOT p0) p1), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 102 rows 110 cols
[2022-05-16 20:56:32] [INFO ] Computed 8 place invariants in 5 ms
[2022-05-16 20:56:32] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 11 ms returned sat
[2022-05-16 20:56:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 20:56:32] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2022-05-16 20:56:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 20:56:33] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 10 ms returned sat
[2022-05-16 20:56:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 20:56:33] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2022-05-16 20:56:33] [INFO ] Computed and/alt/rep : 47/51/47 causal constraints (skipped 50 transitions) in 59 ms.
[2022-05-16 20:56:33] [INFO ] Added : 34 causal constraints over 7 iterations in 348 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 5 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 102/102 transitions.
Applied a total of 0 rules in 6 ms. Remains 110 /110 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 110 cols
[2022-05-16 20:56:33] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-16 20:56:33] [INFO ] Implicit Places using invariants in 197 ms returned []
// Phase 1: matrix 102 rows 110 cols
[2022-05-16 20:56:33] [INFO ] Computed 8 place invariants in 5 ms
[2022-05-16 20:56:34] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
// Phase 1: matrix 102 rows 110 cols
[2022-05-16 20:56:34] [INFO ] Computed 8 place invariants in 10 ms
[2022-05-16 20:56:34] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 110/110 places, 102/102 transitions.
Computed a total of 110 stabilizing places and 102 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 110 transition count 102
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 p2) p1), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
Knowledge based reduction with 6 factoid took 725 ms. Reduced automaton from 9 states, 21 edges and 3 AP to 9 states, 21 edges and 3 AP.
Stuttering acceptance computed with spot in 471 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), false, (AND (NOT p0) p1), (AND (NOT p0) (NOT p1))]
Finished random walk after 77 steps, including 0 resets, run visited all 8 properties in 6 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) p1))), (F (NOT (AND p1 (NOT p2)))), (F p0), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 883 ms. Reduced automaton from 9 states, 21 edges and 3 AP to 9 states, 21 edges and 3 AP.
Stuttering acceptance computed with spot in 467 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), false, (AND (NOT p0) p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 453 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), false, (AND (NOT p0) p1), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 102 rows 110 cols
[2022-05-16 20:56:37] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 20:56:37] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 10 ms returned sat
[2022-05-16 20:56:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 20:56:37] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2022-05-16 20:56:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 20:56:38] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2022-05-16 20:56:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 20:56:38] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2022-05-16 20:56:38] [INFO ] Computed and/alt/rep : 47/51/47 causal constraints (skipped 50 transitions) in 13 ms.
[2022-05-16 20:56:38] [INFO ] Added : 34 causal constraints over 7 iterations in 157 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 471 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), false, (AND (NOT p0) p1), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1291 reset in 191 ms.
Product exploration explored 100000 steps with 1292 reset in 229 ms.
Applying partial POR strategy [false, true, false, true, false, false, true, true, true]
Stuttering acceptance computed with spot in 337 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), false, (AND (NOT p0) p1), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 102/102 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 110 transition count 102
Deduced a syphon composed of 26 places in 0 ms
Applied a total of 26 rules in 41 ms. Remains 110 /110 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2022-05-16 20:56:39] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 102 rows 110 cols
[2022-05-16 20:56:39] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 20:56:40] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/110 places, 102/102 transitions.
Finished structural reductions, in 1 iterations. Remains : 110/110 places, 102/102 transitions.
Product exploration explored 100000 steps with 1784 reset in 354 ms.
Product exploration explored 100000 steps with 1777 reset in 266 ms.
Built C files in :
/tmp/ltsmin4934662678740239184
[2022-05-16 20:56:40] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4934662678740239184
Running compilation step : cd /tmp/ltsmin4934662678740239184;'/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 480 ms.
Running link step : cd /tmp/ltsmin4934662678740239184;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin4934662678740239184;'/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/stateBased9269971444325495342.hoa' '--buchi-type=spotba'
LTSmin run took 10667 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-05-LTLFireability-00 finished in 25642 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!G(((F(p0)||p0)&&p1)) U p2))'
Support contains 4 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 104/104 transitions.
Reduce places removed 4 places and 4 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 108 transition count 67
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 75 transition count 67
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 68 place count 73 transition count 65
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 73 transition count 65
Applied a total of 70 rules in 26 ms. Remains 73 /112 variables (removed 39) and now considering 65/104 (removed 39) transitions.
// Phase 1: matrix 65 rows 73 cols
[2022-05-16 20:56:52] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-16 20:56:52] [INFO ] Implicit Places using invariants in 140 ms returned []
// Phase 1: matrix 65 rows 73 cols
[2022-05-16 20:56:52] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-16 20:56:52] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2022-05-16 20:56:52] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 65 rows 73 cols
[2022-05-16 20:56:52] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-16 20:56:52] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/112 places, 65/104 transitions.
Finished structural reductions, in 1 iterations. Remains : 73/112 places, 65/104 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p2), (AND p1 p0)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(GEQ s19 1), p1:(LT s21 1), p0:(AND (GEQ s2 1) (GEQ s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7722 reset in 153 ms.
Product exploration explored 100000 steps with 7843 reset in 160 ms.
Computed a total of 73 stabilizing places and 65 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 73 transition count 65
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 (AND p1 p0))), (X (AND p1 (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (F (G (NOT p2))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X p2), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 8 factoid took 614 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 45 ms :[(NOT p2)]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (F (G (NOT p2))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X p2), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 8 factoid took 581 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 46 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p2)]
// Phase 1: matrix 65 rows 73 cols
[2022-05-16 20:56:54] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-16 20:56:54] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 8 ms returned sat
[2022-05-16 20:56:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 20:56:54] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2022-05-16 20:56:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 20:56:54] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-16 20:56:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 20:56:54] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2022-05-16 20:56:54] [INFO ] Computed and/alt/rep : 49/54/49 causal constraints (skipped 10 transitions) in 8 ms.
[2022-05-16 20:56:54] [INFO ] Added : 5 causal constraints over 1 iterations in 31 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 1 out of 73 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 : 73/73 places, 65/65 transitions.
Applied a total of 0 rules in 5 ms. Remains 73 /73 variables (removed 0) and now considering 65/65 (removed 0) transitions.
// Phase 1: matrix 65 rows 73 cols
[2022-05-16 20:56:54] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-16 20:56:54] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 65 rows 73 cols
[2022-05-16 20:56:54] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 20:56:55] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2022-05-16 20:56:55] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 65 rows 73 cols
[2022-05-16 20:56:55] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 20:56:55] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 73/73 places, 65/65 transitions.
Computed a total of 73 stabilizing places and 65 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 73 transition count 65
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p2), (F (G (NOT p2)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 229 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 p2)]
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Knowledge obtained : [(NOT p2), (F (G (NOT p2)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 2 factoid took 223 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 41 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p2)]
// Phase 1: matrix 65 rows 73 cols
[2022-05-16 20:56:55] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 20:56:55] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2022-05-16 20:56:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 20:56:55] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2022-05-16 20:56:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 20:56:55] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2022-05-16 20:56:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 20:56:55] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2022-05-16 20:56:55] [INFO ] Computed and/alt/rep : 49/54/49 causal constraints (skipped 10 transitions) in 7 ms.
[2022-05-16 20:56:56] [INFO ] Added : 5 causal constraints over 1 iterations in 24 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 37 ms :[(NOT p2)]
Product exploration explored 100000 steps with 15606 reset in 155 ms.
Product exploration explored 100000 steps with 15655 reset in 142 ms.
Built C files in :
/tmp/ltsmin11649003358207343080
[2022-05-16 20:56:56] [INFO ] Computing symmetric may disable matrix : 65 transitions.
[2022-05-16 20:56:56] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 20:56:56] [INFO ] Computing symmetric may enable matrix : 65 transitions.
[2022-05-16 20:56:56] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 20:56:56] [INFO ] Computing Do-Not-Accords matrix : 65 transitions.
[2022-05-16 20:56:56] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 20:56:56] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11649003358207343080
Running compilation step : cd /tmp/ltsmin11649003358207343080;'/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 221 ms.
Running link step : cd /tmp/ltsmin11649003358207343080;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin11649003358207343080;'/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/stateBased9293549699823762296.hoa' '--buchi-type=spotba'
LTSmin run took 62 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-05-LTLFireability-01 finished in 4576 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))&&(G(p2)||p1))))'
Support contains 3 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 104/104 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 111 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 111 transition count 103
Applied a total of 2 rules in 9 ms. Remains 111 /112 variables (removed 1) and now considering 103/104 (removed 1) transitions.
// Phase 1: matrix 103 rows 111 cols
[2022-05-16 20:56:56] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 20:56:56] [INFO ] Implicit Places using invariants in 94 ms returned []
// Phase 1: matrix 103 rows 111 cols
[2022-05-16 20:56:56] [INFO ] Computed 8 place invariants in 5 ms
[2022-05-16 20:56:56] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 111 cols
[2022-05-16 20:56:56] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-16 20:56:57] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 111/112 places, 103/104 transitions.
Finished structural reductions, in 1 iterations. Remains : 111/112 places, 103/104 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p2)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(OR p1 p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (GEQ s25 1) (AND (GEQ s1 1) (GEQ s83 1))), p2:(OR (LT s1 1) (LT s83 1)), p0:(LT s25 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]]
Entered a terminal (fully accepting) state of product in 76 steps with 1 reset in 0 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLFireability-02 finished in 601 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(F(X(X(p0))))))||G(G(p1))))'
Support contains 4 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 104/104 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 110 transition count 102
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 110 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 109 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 109 transition count 101
Applied a total of 6 rules in 14 ms. Remains 109 /112 variables (removed 3) and now considering 101/104 (removed 3) transitions.
// Phase 1: matrix 101 rows 109 cols
[2022-05-16 20:56:57] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 20:56:57] [INFO ] Implicit Places using invariants in 92 ms returned []
// Phase 1: matrix 101 rows 109 cols
[2022-05-16 20:56:57] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 20:56:57] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
// Phase 1: matrix 101 rows 109 cols
[2022-05-16 20:56:57] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-16 20:56:57] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/112 places, 101/104 transitions.
Finished structural reductions, in 1 iterations. Remains : 109/112 places, 101/104 transitions.
Stuttering acceptance computed with spot in 566 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=p1, acceptance={} source=4 dest: 1}, { cond=(NOT p1), acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 3}], [{ cond=p1, acceptance={} source=6 dest: 4}, { cond=(NOT p1), acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 5}], [{ cond=true, acceptance={} source=8 dest: 7}], [{ cond=(NOT p1), acceptance={} source=9 dest: 8}, { cond=p1, acceptance={} source=9 dest: 10}], [{ cond=p1, acceptance={} source=10 dest: 6}, { cond=(NOT p1), acceptance={} source=10 dest: 7}]], initial=9, aps=[p0:(AND (GEQ s1 1) (GEQ s14 1)), p1:(OR (LT s7 1) (LT s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 153 steps with 4 reset in 1 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLFireability-03 finished in 960 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((F((G(p1)||p2))&&p0)))))'
Support contains 3 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 104/104 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 110 transition count 102
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 110 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 109 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 109 transition count 101
Applied a total of 6 rules in 7 ms. Remains 109 /112 variables (removed 3) and now considering 101/104 (removed 3) transitions.
// Phase 1: matrix 101 rows 109 cols
[2022-05-16 20:56:58] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 20:56:58] [INFO ] Implicit Places using invariants in 142 ms returned []
// Phase 1: matrix 101 rows 109 cols
[2022-05-16 20:56:58] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 20:56:58] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
// Phase 1: matrix 101 rows 109 cols
[2022-05-16 20:56:58] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 20:56:58] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/112 places, 101/104 transitions.
Finished structural reductions, in 1 iterations. Remains : 109/112 places, 101/104 transitions.
Stuttering acceptance computed with spot in 307 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p2) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s9 1) (GEQ s66 1)), p2:(AND (GEQ s9 1) (GEQ s66 1)), p1:(OR (LT s9 1) (LT s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLFireability-04 finished in 937 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||p1)))'
Support contains 3 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 104/104 transitions.
Reduce places removed 3 places and 3 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 109 transition count 67
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 75 transition count 67
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 73 transition count 65
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 73 transition count 65
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 73 place count 73 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 74 place count 72 transition count 64
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 75 place count 71 transition count 63
Iterating global reduction 4 with 1 rules applied. Total rules applied 76 place count 71 transition count 63
Applied a total of 76 rules in 11 ms. Remains 71 /112 variables (removed 41) and now considering 63/104 (removed 41) transitions.
// Phase 1: matrix 63 rows 71 cols
[2022-05-16 20:56:59] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-16 20:56:59] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 63 rows 71 cols
[2022-05-16 20:56:59] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-16 20:56:59] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-16 20:56:59] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2022-05-16 20:56:59] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 63 rows 71 cols
[2022-05-16 20:56:59] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-16 20:56:59] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/112 places, 63/104 transitions.
Finished structural reductions, in 1 iterations. Remains : 71/112 places, 63/104 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-07 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=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=2, aps=[p0:(LT s16 1), p1:(AND (GEQ s4 1) (GEQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLFireability-07 finished in 387 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(G((p0 U p1))))))'
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 104/104 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 110 transition count 102
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 110 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 109 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 109 transition count 101
Applied a total of 6 rules in 6 ms. Remains 109 /112 variables (removed 3) and now considering 101/104 (removed 3) transitions.
// Phase 1: matrix 101 rows 109 cols
[2022-05-16 20:56:59] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 20:56:59] [INFO ] Implicit Places using invariants in 169 ms returned []
// Phase 1: matrix 101 rows 109 cols
[2022-05-16 20:56:59] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 20:56:59] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
// Phase 1: matrix 101 rows 109 cols
[2022-05-16 20:56:59] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 20:57:00] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/112 places, 101/104 transitions.
Finished structural reductions, in 1 iterations. Remains : 109/112 places, 101/104 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s97 1), p0:(LT s63 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]]
Entered a terminal (fully accepting) state of product in 77 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLFireability-09 finished in 724 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p1)&&p0) U (F(X(p2))||p3)))'
Support contains 5 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 104/104 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 110 transition count 102
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 110 transition count 102
Applied a total of 4 rules in 4 ms. Remains 110 /112 variables (removed 2) and now considering 102/104 (removed 2) transitions.
// Phase 1: matrix 102 rows 110 cols
[2022-05-16 20:57:00] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 20:57:00] [INFO ] Implicit Places using invariants in 149 ms returned []
// Phase 1: matrix 102 rows 110 cols
[2022-05-16 20:57:00] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 20:57:00] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
// Phase 1: matrix 102 rows 110 cols
[2022-05-16 20:57:00] [INFO ] Computed 8 place invariants in 5 ms
[2022-05-16 20:57:00] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 110/112 places, 102/104 transitions.
Finished structural reductions, in 1 iterations. Remains : 110/112 places, 102/104 transitions.
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (NOT p2)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p3) p0 p1), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p1))), acceptance={} source=1 dest: 3}], [{ cond=(AND p3 p1 (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p3) p0 p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(AND (GEQ s7 1) (GEQ s20 1)), p2:(AND (GEQ s3 1) (GEQ s61 1)), p3:(GEQ s56 1), p0:(AND (GEQ s7 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1428 reset in 256 ms.
Product exploration explored 100000 steps with 1433 reset in 345 ms.
Computed a total of 110 stabilizing places and 102 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 110 transition count 102
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 p2) (NOT p3) (NOT p0)), (X (NOT (AND (NOT p3) p0 p1 (NOT p2)))), (X (OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (X (NOT p2)), (X (NOT (AND p3 p1 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p3 p1 (NOT p2))))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p3))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p3) p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p3) p0 p1 (NOT p2))))), (X (X (OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))))]
Knowledge based reduction with 11 factoid took 629 ms. Reduced automaton from 4 states, 8 edges and 4 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 63 ms :[(NOT p2), (NOT p2)]
Finished random walk after 71 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=71 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (X (NOT (AND (NOT p3) p0 p1 (NOT p2)))), (X (OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (X (NOT p2)), (X (NOT (AND p3 p1 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p3 p1 (NOT p2))))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p3))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p3) p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p3) p0 p1 (NOT p2))))), (X (X (OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (F p2)]
Knowledge based reduction with 11 factoid took 916 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 35 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p2)]
// Phase 1: matrix 102 rows 110 cols
[2022-05-16 20:57:03] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 20:57:03] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 9 ms returned sat
[2022-05-16 20:57:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 20:57:03] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2022-05-16 20:57:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 20:57:03] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 10 ms returned sat
[2022-05-16 20:57:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 20:57:04] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2022-05-16 20:57:04] [INFO ] Computed and/alt/rep : 47/51/47 causal constraints (skipped 50 transitions) in 15 ms.
[2022-05-16 20:57:04] [INFO ] Added : 25 causal constraints over 5 iterations in 162 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 2 out of 110 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 : 110/110 places, 102/102 transitions.
Reduce places removed 2 places and 2 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 108 transition count 76
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 84 transition count 76
Applied a total of 48 rules in 16 ms. Remains 84 /110 variables (removed 26) and now considering 76/102 (removed 26) transitions.
// Phase 1: matrix 76 rows 84 cols
[2022-05-16 20:57:04] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 20:57:04] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 76 rows 84 cols
[2022-05-16 20:57:04] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 20:57:04] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-16 20:57:04] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
[2022-05-16 20:57:04] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 76 rows 84 cols
[2022-05-16 20:57:04] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 20:57:04] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/110 places, 76/102 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/110 places, 76/102 transitions.
Computed a total of 84 stabilizing places and 76 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 84 transition count 76
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 145 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 p2)]
Finished random walk after 51 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=51 )
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (G (NOT p2)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 4 factoid took 172 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 34 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p2)]
// Phase 1: matrix 76 rows 84 cols
[2022-05-16 20:57:05] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-16 20:57:05] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 9 ms returned sat
[2022-05-16 20:57:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 20:57:05] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2022-05-16 20:57:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 20:57:05] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 9 ms returned sat
[2022-05-16 20:57:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 20:57:05] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2022-05-16 20:57:05] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-16 20:57:05] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2022-05-16 20:57:05] [INFO ] Computed and/alt/rep : 50/76/50 causal constraints (skipped 21 transitions) in 11 ms.
[2022-05-16 20:57:05] [INFO ] Added : 25 causal constraints over 5 iterations in 96 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 49 ms :[(NOT p2)]
Product exploration explored 100000 steps with 1887 reset in 128 ms.
Product exploration explored 100000 steps with 1886 reset in 146 ms.
Built C files in :
/tmp/ltsmin12332591016789755549
[2022-05-16 20:57:06] [INFO ] Computing symmetric may disable matrix : 76 transitions.
[2022-05-16 20:57:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 20:57:06] [INFO ] Computing symmetric may enable matrix : 76 transitions.
[2022-05-16 20:57:06] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 20:57:06] [INFO ] Computing Do-Not-Accords matrix : 76 transitions.
[2022-05-16 20:57:06] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 20:57:06] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12332591016789755549
Running compilation step : cd /tmp/ltsmin12332591016789755549;'/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 426 ms.
Running link step : cd /tmp/ltsmin12332591016789755549;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin12332591016789755549;'/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/stateBased14969003452173733844.hoa' '--buchi-type=spotba'
LTSmin run took 1349 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-05-LTLFireability-10 finished in 7727 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 104/104 transitions.
Reduce places removed 4 places and 4 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 108 transition count 67
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 75 transition count 67
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 68 place count 73 transition count 65
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 73 transition count 65
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 71 place count 73 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 72 place count 72 transition count 64
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 73 place count 71 transition count 63
Iterating global reduction 4 with 1 rules applied. Total rules applied 74 place count 71 transition count 63
Applied a total of 74 rules in 15 ms. Remains 71 /112 variables (removed 41) and now considering 63/104 (removed 41) transitions.
// Phase 1: matrix 63 rows 71 cols
[2022-05-16 20:57:08] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 20:57:08] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 63 rows 71 cols
[2022-05-16 20:57:08] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-16 20:57:08] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2022-05-16 20:57:08] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 63 rows 71 cols
[2022-05-16 20:57:08] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-16 20:57:08] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/112 places, 63/104 transitions.
Finished structural reductions, in 1 iterations. Remains : 71/112 places, 63/104 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s64 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 64 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLFireability-11 finished in 314 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F((X(X(F((X(X(F(X(p1))))&&p0)))) U p2)))))'
Support contains 2 out of 112 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 104/104 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 110 transition count 102
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 110 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 109 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 109 transition count 101
Applied a total of 6 rules in 4 ms. Remains 109 /112 variables (removed 3) and now considering 101/104 (removed 3) transitions.
// Phase 1: matrix 101 rows 109 cols
[2022-05-16 20:57:08] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 20:57:08] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 101 rows 109 cols
[2022-05-16 20:57:08] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 20:57:08] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
// Phase 1: matrix 101 rows 109 cols
[2022-05-16 20:57:08] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 20:57:08] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/112 places, 101/104 transitions.
Finished structural reductions, in 1 iterations. Remains : 109/112 places, 101/104 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p2), (NOT p2)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s92 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 796 steps with 7 reset in 1 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLFireability-12 finished in 507 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 104/104 transitions.
Reduce places removed 4 places and 4 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 108 transition count 56
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 64 transition count 56
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 90 place count 62 transition count 54
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 62 transition count 54
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 93 place count 62 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 61 transition count 53
Applied a total of 94 rules in 11 ms. Remains 61 /112 variables (removed 51) and now considering 53/104 (removed 51) transitions.
// Phase 1: matrix 53 rows 61 cols
[2022-05-16 20:57:08] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 20:57:08] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 53 rows 61 cols
[2022-05-16 20:57:08] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-16 20:57:09] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-16 20:57:09] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2022-05-16 20:57:09] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 53 rows 61 cols
[2022-05-16 20:57:09] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-16 20:57:09] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/112 places, 53/104 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/112 places, 53/104 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 18074 reset in 172 ms.
Product exploration explored 100000 steps with 17931 reset in 189 ms.
Computed a total of 61 stabilizing places and 53 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 61 transition count 53
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), (F (G p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 158 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA HirschbergSinclair-PT-05-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-05-LTLFireability-13 finished in 961 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)&&p1))))'
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 104/104 transitions.
Reduce places removed 5 places and 5 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 107 transition count 57
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 65 transition count 57
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 86 place count 63 transition count 55
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 63 transition count 55
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 89 place count 63 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 90 place count 62 transition count 54
Applied a total of 90 rules in 11 ms. Remains 62 /112 variables (removed 50) and now considering 54/104 (removed 50) transitions.
// Phase 1: matrix 54 rows 62 cols
[2022-05-16 20:57:09] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-16 20:57:09] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 54 rows 62 cols
[2022-05-16 20:57:09] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-16 20:57:10] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2022-05-16 20:57:10] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 54 rows 62 cols
[2022-05-16 20:57:10] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-16 20:57:10] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/112 places, 54/104 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/112 places, 54/104 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s56 1), p0:(GEQ s44 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 59 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLFireability-14 finished in 523 ms.
All properties solved by simple procedures.
Total runtime 46367 ms.

BK_STOP 1652734630955

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

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