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.r150-smll-165276998500172.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 NoC3x3-PT-4B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-smll-165276998500172
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 7.9K Apr 29 13:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 29 13:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 29 13:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 29 13:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:21 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 608K 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 NoC3x3-PT-4B-LTLFireability-00
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-01
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-02
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-03
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-04
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-05
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-06
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-07
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-08
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-09
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-10
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-11
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-12
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-13
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-14
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652996015085

Running Version 202205111006
[2022-05-19 21:33: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-19 21:33:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 21:33:38] [INFO ] Load time of PNML (sax parser for PT used): 432 ms
[2022-05-19 21:33:38] [INFO ] Transformed 2328 places.
[2022-05-19 21:33:38] [INFO ] Transformed 2701 transitions.
[2022-05-19 21:33:38] [INFO ] Found NUPN structural information;
[2022-05-19 21:33:38] [INFO ] Parsed PT model containing 2328 places and 2701 transitions in 712 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA NoC3x3-PT-4B-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4B-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4B-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 2328 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2328/2328 places, 2701/2701 transitions.
Discarding 603 places :
Symmetric choice reduction at 0 with 603 rule applications. Total rules 603 place count 1725 transition count 2098
Iterating global reduction 0 with 603 rules applied. Total rules applied 1206 place count 1725 transition count 2098
Discarding 312 places :
Symmetric choice reduction at 0 with 312 rule applications. Total rules 1518 place count 1413 transition count 1786
Iterating global reduction 0 with 312 rules applied. Total rules applied 1830 place count 1413 transition count 1786
Ensure Unique test removed 113 transitions
Reduce isomorphic transitions removed 113 transitions.
Iterating post reduction 0 with 113 rules applied. Total rules applied 1943 place count 1413 transition count 1673
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 1973 place count 1383 transition count 1643
Iterating global reduction 1 with 30 rules applied. Total rules applied 2003 place count 1383 transition count 1643
Applied a total of 2003 rules in 1136 ms. Remains 1383 /2328 variables (removed 945) and now considering 1643/2701 (removed 1058) transitions.
// Phase 1: matrix 1643 rows 1383 cols
[2022-05-19 21:33:39] [INFO ] Computed 66 place invariants in 50 ms
[2022-05-19 21:33:40] [INFO ] Implicit Places using invariants in 970 ms returned []
// Phase 1: matrix 1643 rows 1383 cols
[2022-05-19 21:33:40] [INFO ] Computed 66 place invariants in 19 ms
[2022-05-19 21:33:42] [INFO ] Implicit Places using invariants and state equation in 1736 ms returned []
Implicit Place search using SMT with State Equation took 2755 ms to find 0 implicit places.
// Phase 1: matrix 1643 rows 1383 cols
[2022-05-19 21:33:42] [INFO ] Computed 66 place invariants in 7 ms
[2022-05-19 21:33:44] [INFO ] Dead Transitions using invariants and state equation in 1797 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1383/2328 places, 1643/2701 transitions.
Finished structural reductions, in 1 iterations. Remains : 1383/2328 places, 1643/2701 transitions.
Support contains 35 out of 1383 places after structural reductions.
[2022-05-19 21:33:45] [INFO ] Flatten gal took : 276 ms
[2022-05-19 21:33:45] [INFO ] Flatten gal took : 107 ms
[2022-05-19 21:33:45] [INFO ] Input system was already deterministic with 1643 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 945 ms. (steps per millisecond=10 ) properties (out of 30) seen :19
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 1643 rows 1383 cols
[2022-05-19 21:33:46] [INFO ] Computed 66 place invariants in 9 ms
[2022-05-19 21:33:47] [INFO ] [Real]Absence check using 66 positive place invariants in 94 ms returned sat
[2022-05-19 21:33:49] [INFO ] After 1646ms SMT Verify possible using state equation in real domain returned unsat :0 sat :9
[2022-05-19 21:33:51] [INFO ] After 3067ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 937 ms.
[2022-05-19 21:33:52] [INFO ] After 5084ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :8 real:1
[2022-05-19 21:33:52] [INFO ] [Nat]Absence check using 66 positive place invariants in 81 ms returned sat
[2022-05-19 21:33:54] [INFO ] After 1627ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-05-19 21:33:55] [INFO ] After 2936ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 620 ms.
[2022-05-19 21:33:56] [INFO ] After 4571ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 2 different solutions.
Parikh walk visited 7 properties in 127 ms.
Support contains 3 out of 1383 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1383/1383 places, 1643/1643 transitions.
Graph (trivial) has 1292 edges and 1383 vertex of which 868 / 1383 are part of one of the 33 SCC in 13 ms
Free SCC test removed 835 places
Drop transitions removed 1009 transitions
Reduce isomorphic transitions removed 1009 transitions.
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 35 Pre rules applied. Total rules applied 1 place count 548 transition count 599
Deduced a syphon composed of 35 places in 3 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 0 with 70 rules applied. Total rules applied 71 place count 513 transition count 599
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 98 place count 486 transition count 541
Iterating global reduction 0 with 27 rules applied. Total rules applied 125 place count 486 transition count 541
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 125 place count 486 transition count 540
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 127 place count 485 transition count 540
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 129 place count 483 transition count 537
Iterating global reduction 0 with 2 rules applied. Total rules applied 131 place count 483 transition count 537
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 0 with 202 rules applied. Total rules applied 333 place count 382 transition count 436
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 335 place count 381 transition count 450
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 337 place count 381 transition count 448
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 343 place count 381 transition count 442
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 345 place count 380 transition count 453
Free-agglomeration rule applied 199 times.
Iterating global reduction 1 with 199 rules applied. Total rules applied 544 place count 380 transition count 254
Reduce places removed 199 places and 0 transitions.
Drop transitions removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Graph (complete) has 495 edges and 181 vertex of which 17 are kept as prefixes of interest. Removing 164 places using SCC suffix rule.9 ms
Discarding 164 places :
Also discarding 178 output transitions
Drop transitions removed 178 transitions
Iterating post reduction 1 with 235 rules applied. Total rules applied 779 place count 17 transition count 41
Drop transitions removed 21 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 803 place count 17 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 804 place count 16 transition count 16
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 7 rules applied. Total rules applied 811 place count 12 transition count 13
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 816 place count 9 transition count 11
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 817 place count 9 transition count 10
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 818 place count 9 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 819 place count 8 transition count 9
Applied a total of 819 rules in 406 ms. Remains 8 /1383 variables (removed 1375) and now considering 9/1643 (removed 1634) transitions.
Finished structural reductions, in 1 iterations. Remains : 8/1383 places, 9/1643 transitions.
Finished random walk after 6 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=6 )
Computed a total of 65 stabilizing places and 65 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||p1)))'
Support contains 2 out of 1383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1383/1383 places, 1643/1643 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1373 transition count 1633
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1373 transition count 1633
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 1368 transition count 1628
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 1368 transition count 1628
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 1366 transition count 1626
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 1366 transition count 1626
Applied a total of 34 rules in 227 ms. Remains 1366 /1383 variables (removed 17) and now considering 1626/1643 (removed 17) transitions.
// Phase 1: matrix 1626 rows 1366 cols
[2022-05-19 21:33:57] [INFO ] Computed 66 place invariants in 6 ms
[2022-05-19 21:33:58] [INFO ] Implicit Places using invariants in 768 ms returned []
// Phase 1: matrix 1626 rows 1366 cols
[2022-05-19 21:33:58] [INFO ] Computed 66 place invariants in 6 ms
[2022-05-19 21:34:00] [INFO ] Implicit Places using invariants and state equation in 1737 ms returned []
Implicit Place search using SMT with State Equation took 2510 ms to find 0 implicit places.
// Phase 1: matrix 1626 rows 1366 cols
[2022-05-19 21:34:00] [INFO ] Computed 66 place invariants in 6 ms
[2022-05-19 21:34:02] [INFO ] Dead Transitions using invariants and state equation in 1966 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1366/1383 places, 1626/1643 transitions.
Finished structural reductions, in 1 iterations. Remains : 1366/1383 places, 1626/1643 transitions.
Stuttering acceptance computed with spot in 381 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s767 1), p0:(EQ s679 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA NoC3x3-PT-4B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-LTLFireability-00 finished in 5178 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)||p0)))'
Support contains 2 out of 1383 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1383/1383 places, 1643/1643 transitions.
Graph (trivial) has 1293 edges and 1383 vertex of which 868 / 1383 are part of one of the 33 SCC in 6 ms
Free SCC test removed 835 places
Ensure Unique test removed 976 transitions
Reduce isomorphic transitions removed 976 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 35 Pre rules applied. Total rules applied 1 place count 547 transition count 631
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 0 with 70 rules applied. Total rules applied 71 place count 512 transition count 631
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 98 place count 485 transition count 573
Iterating global reduction 0 with 27 rules applied. Total rules applied 125 place count 485 transition count 573
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 125 place count 485 transition count 572
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 127 place count 484 transition count 572
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 129 place count 482 transition count 569
Iterating global reduction 0 with 2 rules applied. Total rules applied 131 place count 482 transition count 569
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 0 with 202 rules applied. Total rules applied 333 place count 381 transition count 468
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 334 place count 380 transition count 467
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 264 edges and 371 vertex of which 48 / 371 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 344 place count 347 transition count 467
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 392 place count 347 transition count 419
Applied a total of 392 rules in 272 ms. Remains 347 /1383 variables (removed 1036) and now considering 419/1643 (removed 1224) transitions.
[2022-05-19 21:34:03] [INFO ] Flow matrix only has 387 transitions (discarded 32 similar events)
// Phase 1: matrix 387 rows 347 cols
[2022-05-19 21:34:03] [INFO ] Computed 57 place invariants in 1 ms
[2022-05-19 21:34:03] [INFO ] Implicit Places using invariants in 390 ms returned []
[2022-05-19 21:34:03] [INFO ] Flow matrix only has 387 transitions (discarded 32 similar events)
// Phase 1: matrix 387 rows 347 cols
[2022-05-19 21:34:03] [INFO ] Computed 57 place invariants in 4 ms
[2022-05-19 21:34:03] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-19 21:34:03] [INFO ] Implicit Places using invariants and state equation in 559 ms returned []
Implicit Place search using SMT with State Equation took 952 ms to find 0 implicit places.
[2022-05-19 21:34:04] [INFO ] Redundant transitions in 40 ms returned []
[2022-05-19 21:34:04] [INFO ] Flow matrix only has 387 transitions (discarded 32 similar events)
// Phase 1: matrix 387 rows 347 cols
[2022-05-19 21:34:04] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-19 21:34:04] [INFO ] Dead Transitions using invariants and state equation in 407 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 347/1383 places, 419/1643 transitions.
Finished structural reductions, in 1 iterations. Remains : 347/1383 places, 419/1643 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s103 1) (EQ s185 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 0 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-4B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-LTLFireability-01 finished in 1750 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((!F(p0)||p1) U (F(p2)&&p3)))'
Support contains 5 out of 1383 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1383/1383 places, 1643/1643 transitions.
Graph (trivial) has 1280 edges and 1383 vertex of which 843 / 1383 are part of one of the 33 SCC in 3 ms
Free SCC test removed 810 places
Ensure Unique test removed 944 transitions
Reduce isomorphic transitions removed 944 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 572 transition count 689
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 563 transition count 687
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 23 place count 561 transition count 687
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 23 place count 561 transition count 649
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 99 place count 523 transition count 649
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 127 place count 495 transition count 588
Iterating global reduction 3 with 28 rules applied. Total rules applied 155 place count 495 transition count 588
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 155 place count 495 transition count 587
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 157 place count 494 transition count 587
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 159 place count 492 transition count 584
Iterating global reduction 3 with 2 rules applied. Total rules applied 161 place count 492 transition count 584
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 0 ms
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 3 with 206 rules applied. Total rules applied 367 place count 389 transition count 481
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 369 place count 389 transition count 479
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 373 place count 387 transition count 503
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 375 place count 387 transition count 501
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 376 place count 386 transition count 500
Reduce places removed 8 places and 0 transitions.
Graph (trivial) has 253 edges and 378 vertex of which 40 / 378 are part of one of the 20 SCC in 1 ms
Free SCC test removed 20 places
Iterating post reduction 5 with 9 rules applied. Total rules applied 385 place count 358 transition count 500
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 6 with 40 rules applied. Total rules applied 425 place count 358 transition count 460
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 429 place count 356 transition count 458
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 438 place count 356 transition count 449
Applied a total of 438 rules in 258 ms. Remains 356 /1383 variables (removed 1027) and now considering 449/1643 (removed 1194) transitions.
[2022-05-19 21:34:04] [INFO ] Flow matrix only has 417 transitions (discarded 32 similar events)
// Phase 1: matrix 417 rows 356 cols
[2022-05-19 21:34:04] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-19 21:34:05] [INFO ] Implicit Places using invariants in 308 ms returned []
[2022-05-19 21:34:05] [INFO ] Flow matrix only has 417 transitions (discarded 32 similar events)
// Phase 1: matrix 417 rows 356 cols
[2022-05-19 21:34:05] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-19 21:34:05] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-19 21:34:05] [INFO ] Implicit Places using invariants and state equation in 637 ms returned []
Implicit Place search using SMT with State Equation took 950 ms to find 0 implicit places.
[2022-05-19 21:34:05] [INFO ] Redundant transitions in 15 ms returned []
[2022-05-19 21:34:05] [INFO ] Flow matrix only has 417 transitions (discarded 32 similar events)
// Phase 1: matrix 417 rows 356 cols
[2022-05-19 21:34:05] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-19 21:34:06] [INFO ] Dead Transitions using invariants and state equation in 410 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 356/1383 places, 449/1643 transitions.
Finished structural reductions, in 1 iterations. Remains : 356/1383 places, 449/1643 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p3) (NOT p2)), true, p0, (NOT p2)]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p3) p1) (AND (NOT p3) (NOT p0))), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND p3 (NOT p2)), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(EQ s276 1), p1:(EQ s51 1), p0:(AND (EQ s10 1) (EQ s21 1)), p2:(EQ s272 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-4B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-LTLFireability-02 finished in 1845 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!(p0 U p1))))'
Support contains 2 out of 1383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1383/1383 places, 1643/1643 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1371 transition count 1631
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1371 transition count 1631
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 1366 transition count 1626
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 1366 transition count 1626
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 1364 transition count 1624
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 1364 transition count 1624
Applied a total of 38 rules in 250 ms. Remains 1364 /1383 variables (removed 19) and now considering 1624/1643 (removed 19) transitions.
// Phase 1: matrix 1624 rows 1364 cols
[2022-05-19 21:34:06] [INFO ] Computed 66 place invariants in 11 ms
[2022-05-19 21:34:07] [INFO ] Implicit Places using invariants in 727 ms returned []
// Phase 1: matrix 1624 rows 1364 cols
[2022-05-19 21:34:07] [INFO ] Computed 66 place invariants in 8 ms
[2022-05-19 21:34:09] [INFO ] Implicit Places using invariants and state equation in 1678 ms returned []
Implicit Place search using SMT with State Equation took 2407 ms to find 0 implicit places.
// Phase 1: matrix 1624 rows 1364 cols
[2022-05-19 21:34:09] [INFO ] Computed 66 place invariants in 9 ms
[2022-05-19 21:34:10] [INFO ] Dead Transitions using invariants and state equation in 1893 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1364/1383 places, 1624/1643 transitions.
Finished structural reductions, in 1 iterations. Remains : 1364/1383 places, 1624/1643 transitions.
Stuttering acceptance computed with spot in 84 ms :[p1, p1]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s819 1), p1:(EQ s938 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1835 ms.
Product exploration explored 100000 steps with 50000 reset in 1852 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) (NOT p1))
Knowledge based reduction with 5 factoid took 169 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA NoC3x3-PT-4B-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-4B-LTLFireability-03 finished in 8563 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(((p0 U p1)&&p2)))||F(p3)))))'
Support contains 4 out of 1383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1383/1383 places, 1643/1643 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1374 transition count 1634
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1374 transition count 1634
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 1370 transition count 1630
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 1370 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1369 transition count 1629
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1369 transition count 1629
Applied a total of 28 rules in 336 ms. Remains 1369 /1383 variables (removed 14) and now considering 1629/1643 (removed 14) transitions.
// Phase 1: matrix 1629 rows 1369 cols
[2022-05-19 21:34:15] [INFO ] Computed 66 place invariants in 5 ms
[2022-05-19 21:34:15] [INFO ] Implicit Places using invariants in 716 ms returned []
// Phase 1: matrix 1629 rows 1369 cols
[2022-05-19 21:34:15] [INFO ] Computed 66 place invariants in 6 ms
[2022-05-19 21:34:17] [INFO ] Implicit Places using invariants and state equation in 1706 ms returned []
Implicit Place search using SMT with State Equation took 2423 ms to find 0 implicit places.
// Phase 1: matrix 1629 rows 1369 cols
[2022-05-19 21:34:17] [INFO ] Computed 66 place invariants in 6 ms
[2022-05-19 21:34:19] [INFO ] Dead Transitions using invariants and state equation in 1985 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1369/1383 places, 1629/1643 transitions.
Finished structural reductions, in 1 iterations. Remains : 1369/1383 places, 1629/1643 transitions.
Stuttering acceptance computed with spot in 322 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p3), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p3), acceptance={} source=1 dest: 2}], [{ cond=(NOT p3), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p3) (NOT p2)) (AND (NOT p3) (NOT p1) (NOT p0))), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p1) p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p3:(EQ s690 1), p2:(EQ s827 0), p1:(EQ s401 1), p0:(EQ s543 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]]
Stuttering criterion allowed to conclude after 3181 steps with 2 reset in 11 ms.
FORMULA NoC3x3-PT-4B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-LTLFireability-04 finished in 5124 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))&&F(G(X(F(p1))))))'
Support contains 4 out of 1383 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1383/1383 places, 1643/1643 transitions.
Graph (trivial) has 1289 edges and 1383 vertex of which 852 / 1383 are part of one of the 33 SCC in 2 ms
Free SCC test removed 819 places
Ensure Unique test removed 956 transitions
Reduce isomorphic transitions removed 956 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 563 transition count 680
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 16 place count 557 transition count 677
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 19 place count 555 transition count 676
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 20 place count 554 transition count 676
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 36 Pre rules applied. Total rules applied 20 place count 554 transition count 640
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 92 place count 518 transition count 640
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 118 place count 492 transition count 583
Iterating global reduction 4 with 26 rules applied. Total rules applied 144 place count 492 transition count 583
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 145 place count 491 transition count 582
Iterating global reduction 4 with 1 rules applied. Total rules applied 146 place count 491 transition count 582
Performed 106 Post agglomeration using F-continuation condition.Transition count delta: 106
Deduced a syphon composed of 106 places in 0 ms
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 4 with 212 rules applied. Total rules applied 358 place count 385 transition count 476
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 360 place count 385 transition count 474
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 361 place count 384 transition count 473
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 264 edges and 375 vertex of which 46 / 375 are part of one of the 23 SCC in 1 ms
Free SCC test removed 23 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 11 rules applied. Total rules applied 372 place count 352 transition count 472
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 6 with 48 rules applied. Total rules applied 420 place count 351 transition count 425
Applied a total of 420 rules in 102 ms. Remains 351 /1383 variables (removed 1032) and now considering 425/1643 (removed 1218) transitions.
[2022-05-19 21:34:20] [INFO ] Flow matrix only has 393 transitions (discarded 32 similar events)
// Phase 1: matrix 393 rows 351 cols
[2022-05-19 21:34:20] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-19 21:34:20] [INFO ] Implicit Places using invariants in 252 ms returned []
[2022-05-19 21:34:20] [INFO ] Flow matrix only has 393 transitions (discarded 32 similar events)
// Phase 1: matrix 393 rows 351 cols
[2022-05-19 21:34:20] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-19 21:34:20] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-19 21:34:21] [INFO ] Implicit Places using invariants and state equation in 660 ms returned []
Implicit Place search using SMT with State Equation took 914 ms to find 0 implicit places.
[2022-05-19 21:34:21] [INFO ] Redundant transitions in 3 ms returned []
[2022-05-19 21:34:21] [INFO ] Flow matrix only has 393 transitions (discarded 32 similar events)
// Phase 1: matrix 393 rows 351 cols
[2022-05-19 21:34:21] [INFO ] Computed 57 place invariants in 1 ms
[2022-05-19 21:34:21] [INFO ] Dead Transitions using invariants and state equation in 313 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 351/1383 places, 425/1643 transitions.
Finished structural reductions, in 1 iterations. Remains : 351/1383 places, 425/1643 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s278 1), p1:(AND (OR (EQ s345 1) (AND (EQ s28 1) (EQ s193 1))) (EQ s28 1) (EQ s193 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 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-LTLFireability-05 finished in 1466 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1383 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1383/1383 places, 1643/1643 transitions.
Graph (trivial) has 1293 edges and 1383 vertex of which 866 / 1383 are part of one of the 33 SCC in 6 ms
Free SCC test removed 833 places
Ensure Unique test removed 973 transitions
Reduce isomorphic transitions removed 973 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 36 Pre rules applied. Total rules applied 1 place count 549 transition count 633
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 0 with 72 rules applied. Total rules applied 73 place count 513 transition count 633
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 101 place count 485 transition count 572
Iterating global reduction 0 with 28 rules applied. Total rules applied 129 place count 485 transition count 572
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 129 place count 485 transition count 571
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 131 place count 484 transition count 571
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 133 place count 482 transition count 568
Iterating global reduction 0 with 2 rules applied. Total rules applied 135 place count 482 transition count 568
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 0 with 202 rules applied. Total rules applied 337 place count 381 transition count 467
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 338 place count 380 transition count 466
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 266 edges and 371 vertex of which 48 / 371 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 348 place count 347 transition count 466
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 396 place count 347 transition count 418
Applied a total of 396 rules in 137 ms. Remains 347 /1383 variables (removed 1036) and now considering 418/1643 (removed 1225) transitions.
[2022-05-19 21:34:21] [INFO ] Flow matrix only has 386 transitions (discarded 32 similar events)
// Phase 1: matrix 386 rows 347 cols
[2022-05-19 21:34:21] [INFO ] Computed 57 place invariants in 1 ms
[2022-05-19 21:34:21] [INFO ] Implicit Places using invariants in 297 ms returned []
[2022-05-19 21:34:21] [INFO ] Flow matrix only has 386 transitions (discarded 32 similar events)
// Phase 1: matrix 386 rows 347 cols
[2022-05-19 21:34:21] [INFO ] Computed 57 place invariants in 1 ms
[2022-05-19 21:34:22] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-19 21:34:22] [INFO ] Implicit Places using invariants and state equation in 757 ms returned []
Implicit Place search using SMT with State Equation took 1058 ms to find 0 implicit places.
[2022-05-19 21:34:22] [INFO ] Redundant transitions in 3 ms returned []
[2022-05-19 21:34:22] [INFO ] Flow matrix only has 386 transitions (discarded 32 similar events)
// Phase 1: matrix 386 rows 347 cols
[2022-05-19 21:34:22] [INFO ] Computed 57 place invariants in 1 ms
[2022-05-19 21:34:23] [INFO ] Dead Transitions using invariants and state equation in 521 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 347/1383 places, 418/1643 transitions.
Finished structural reductions, in 1 iterations. Remains : 347/1383 places, 418/1643 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s255 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 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-LTLFireability-06 finished in 1778 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(F(p0) U G(p1))))'
Support contains 2 out of 1383 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1383/1383 places, 1643/1643 transitions.
Graph (trivial) has 1287 edges and 1383 vertex of which 862 / 1383 are part of one of the 33 SCC in 2 ms
Free SCC test removed 829 places
Ensure Unique test removed 968 transitions
Reduce isomorphic transitions removed 968 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 553 transition count 672
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 551 transition count 672
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 5 place count 551 transition count 636
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 77 place count 515 transition count 636
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 105 place count 487 transition count 575
Iterating global reduction 2 with 28 rules applied. Total rules applied 133 place count 487 transition count 575
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 133 place count 487 transition count 574
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 135 place count 486 transition count 574
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 137 place count 484 transition count 571
Iterating global reduction 2 with 2 rules applied. Total rules applied 139 place count 484 transition count 571
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 341 place count 383 transition count 470
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 342 place count 382 transition count 469
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 263 edges and 373 vertex of which 46 / 373 are part of one of the 23 SCC in 0 ms
Free SCC test removed 23 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 353 place count 350 transition count 468
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 3 with 48 rules applied. Total rules applied 401 place count 349 transition count 421
Applied a total of 401 rules in 126 ms. Remains 349 /1383 variables (removed 1034) and now considering 421/1643 (removed 1222) transitions.
[2022-05-19 21:34:23] [INFO ] Flow matrix only has 389 transitions (discarded 32 similar events)
// Phase 1: matrix 389 rows 349 cols
[2022-05-19 21:34:23] [INFO ] Computed 57 place invariants in 1 ms
[2022-05-19 21:34:23] [INFO ] Implicit Places using invariants in 284 ms returned []
[2022-05-19 21:34:23] [INFO ] Flow matrix only has 389 transitions (discarded 32 similar events)
// Phase 1: matrix 389 rows 349 cols
[2022-05-19 21:34:23] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-19 21:34:23] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-19 21:34:24] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 841 ms to find 0 implicit places.
[2022-05-19 21:34:24] [INFO ] Redundant transitions in 3 ms returned []
[2022-05-19 21:34:24] [INFO ] Flow matrix only has 389 transitions (discarded 32 similar events)
// Phase 1: matrix 389 rows 349 cols
[2022-05-19 21:34:24] [INFO ] Computed 57 place invariants in 1 ms
[2022-05-19 21:34:24] [INFO ] Dead Transitions using invariants and state equation in 551 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 349/1383 places, 421/1643 transitions.
Finished structural reductions, in 1 iterations. Remains : 349/1383 places, 421/1643 transitions.
Stuttering acceptance computed with spot in 237 ms :[p1, p1, (AND p0 p1)]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s255 1), p1:(EQ s311 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 4965 steps with 64 reset in 79 ms.
FORMULA NoC3x3-PT-4B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-LTLFireability-09 finished in 1871 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(X(G((!(p0 U p1)&&p0)))))))))'
Support contains 2 out of 1383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1383/1383 places, 1643/1643 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1372 transition count 1632
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1372 transition count 1632
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 1367 transition count 1627
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 1367 transition count 1627
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 1365 transition count 1625
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 1365 transition count 1625
Applied a total of 36 rules in 259 ms. Remains 1365 /1383 variables (removed 18) and now considering 1625/1643 (removed 18) transitions.
// Phase 1: matrix 1625 rows 1365 cols
[2022-05-19 21:34:25] [INFO ] Computed 66 place invariants in 7 ms
[2022-05-19 21:34:26] [INFO ] Implicit Places using invariants in 699 ms returned []
// Phase 1: matrix 1625 rows 1365 cols
[2022-05-19 21:34:26] [INFO ] Computed 66 place invariants in 4 ms
[2022-05-19 21:34:27] [INFO ] Implicit Places using invariants and state equation in 1562 ms returned []
Implicit Place search using SMT with State Equation took 2264 ms to find 0 implicit places.
// Phase 1: matrix 1625 rows 1365 cols
[2022-05-19 21:34:27] [INFO ] Computed 66 place invariants in 7 ms
[2022-05-19 21:34:29] [INFO ] Dead Transitions using invariants and state equation in 1621 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1365/1383 places, 1625/1643 transitions.
Finished structural reductions, in 1 iterations. Remains : 1365/1383 places, 1625/1643 transitions.
Stuttering acceptance computed with spot in 284 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}], [{ cond=(OR (NOT p0) p1), acceptance={} source=6 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}]], initial=4, aps=[p0:(EQ s660 1), p1:(EQ s300 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, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-4B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-LTLFireability-10 finished in 4474 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 1383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1383/1383 places, 1643/1643 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1371 transition count 1631
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1371 transition count 1631
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 1366 transition count 1626
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 1366 transition count 1626
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 1364 transition count 1624
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 1364 transition count 1624
Applied a total of 38 rules in 388 ms. Remains 1364 /1383 variables (removed 19) and now considering 1624/1643 (removed 19) transitions.
// Phase 1: matrix 1624 rows 1364 cols
[2022-05-19 21:34:30] [INFO ] Computed 66 place invariants in 4 ms
[2022-05-19 21:34:30] [INFO ] Implicit Places using invariants in 868 ms returned []
// Phase 1: matrix 1624 rows 1364 cols
[2022-05-19 21:34:30] [INFO ] Computed 66 place invariants in 5 ms
[2022-05-19 21:34:32] [INFO ] Implicit Places using invariants and state equation in 1775 ms returned []
Implicit Place search using SMT with State Equation took 2654 ms to find 0 implicit places.
// Phase 1: matrix 1624 rows 1364 cols
[2022-05-19 21:34:32] [INFO ] Computed 66 place invariants in 7 ms
[2022-05-19 21:34:34] [INFO ] Dead Transitions using invariants and state equation in 2000 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1364/1383 places, 1624/1643 transitions.
Finished structural reductions, in 1 iterations. Remains : 1364/1383 places, 1624/1643 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-12 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 (NEQ s269 1) (NEQ s942 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 50000 reset in 1818 ms.
Product exploration explored 100000 steps with 50000 reset in 1630 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 59 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA NoC3x3-PT-4B-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-4B-LTLFireability-12 finished in 8706 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U (F(p1)&&p2))||p1)))'
Support contains 3 out of 1383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1383/1383 places, 1643/1643 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1371 transition count 1631
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1371 transition count 1631
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 1366 transition count 1626
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 1366 transition count 1626
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 1364 transition count 1624
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 1364 transition count 1624
Applied a total of 38 rules in 253 ms. Remains 1364 /1383 variables (removed 19) and now considering 1624/1643 (removed 19) transitions.
// Phase 1: matrix 1624 rows 1364 cols
[2022-05-19 21:34:38] [INFO ] Computed 66 place invariants in 5 ms
[2022-05-19 21:34:39] [INFO ] Implicit Places using invariants in 652 ms returned []
// Phase 1: matrix 1624 rows 1364 cols
[2022-05-19 21:34:39] [INFO ] Computed 66 place invariants in 6 ms
[2022-05-19 21:34:40] [INFO ] Implicit Places using invariants and state equation in 1682 ms returned []
Implicit Place search using SMT with State Equation took 2336 ms to find 0 implicit places.
// Phase 1: matrix 1624 rows 1364 cols
[2022-05-19 21:34:40] [INFO ] Computed 66 place invariants in 4 ms
[2022-05-19 21:34:42] [INFO ] Dead Transitions using invariants and state equation in 2000 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1364/1383 places, 1624/1643 transitions.
Finished structural reductions, in 1 iterations. Remains : 1364/1383 places, 1624/1643 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p2:(NEQ s1154 1), p0:(EQ s1322 1), p1:(EQ s610 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 149 reset in 468 ms.
Product exploration explored 100000 steps with 157 reset in 515 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), true, (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 426 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p1)]
Finished random walk after 580 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=82 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), true, (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 9 factoid took 429 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 46 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
// Phase 1: matrix 1624 rows 1364 cols
[2022-05-19 21:34:45] [INFO ] Computed 66 place invariants in 4 ms
[2022-05-19 21:34:46] [INFO ] [Real]Absence check using 66 positive place invariants in 74 ms returned sat
[2022-05-19 21:34:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 21:34:50] [INFO ] [Real]Absence check using state equation in 4005 ms returned sat
[2022-05-19 21:34:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 21:34:52] [INFO ] [Nat]Absence check using 66 positive place invariants in 120 ms returned sat
[2022-05-19 21:34:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 21:34:56] [INFO ] [Nat]Absence check using state equation in 3825 ms returned sat
[2022-05-19 21:34:56] [INFO ] Computed and/alt/rep : 1621/2562/1621 causal constraints (skipped 2 transitions) in 122 ms.
[2022-05-19 21:35:05] [INFO ] Added : 320 causal constraints over 64 iterations in 9668 ms. Result :unknown
Could not prove EG (NOT p1)
Support contains 1 out of 1364 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 : 1364/1364 places, 1624/1624 transitions.
Graph (trivial) has 1263 edges and 1364 vertex of which 818 / 1364 are part of one of the 32 SCC in 3 ms
Free SCC test removed 786 places
Ensure Unique test removed 919 transitions
Reduce isomorphic transitions removed 919 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 577 transition count 688
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 19 rules applied. Total rules applied 36 place count 561 transition count 685
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 40 place count 559 transition count 683
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 42 place count 557 transition count 683
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 41 Pre rules applied. Total rules applied 42 place count 557 transition count 642
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 124 place count 516 transition count 642
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 150 place count 490 transition count 582
Iterating global reduction 4 with 26 rules applied. Total rules applied 176 place count 490 transition count 582
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 0 ms
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 4 with 206 rules applied. Total rules applied 382 place count 387 transition count 479
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 384 place count 387 transition count 477
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 388 place count 385 transition count 490
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 390 place count 385 transition count 488
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 392 place count 384 transition count 507
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 394 place count 384 transition count 505
Applied a total of 394 rules in 131 ms. Remains 384 /1364 variables (removed 980) and now considering 505/1624 (removed 1119) transitions.
[2022-05-19 21:35:05] [INFO ] Flow matrix only has 474 transitions (discarded 31 similar events)
// Phase 1: matrix 474 rows 384 cols
[2022-05-19 21:35:05] [INFO ] Computed 66 place invariants in 1 ms
[2022-05-19 21:35:06] [INFO ] Implicit Places using invariants in 386 ms returned [10, 44, 85, 121, 178, 240, 281, 318, 362]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 391 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 375/1364 places, 505/1624 transitions.
Graph (trivial) has 250 edges and 375 vertex of which 44 / 375 are part of one of the 22 SCC in 1 ms
Free SCC test removed 22 places
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 353 transition count 460
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 352 transition count 459
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 351 transition count 462
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 16 place count 351 transition count 452
Applied a total of 16 rules in 35 ms. Remains 351 /375 variables (removed 24) and now considering 452/505 (removed 53) transitions.
[2022-05-19 21:35:06] [INFO ] Flow matrix only has 421 transitions (discarded 31 similar events)
// Phase 1: matrix 421 rows 351 cols
[2022-05-19 21:35:06] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-19 21:35:06] [INFO ] Implicit Places using invariants in 272 ms returned []
[2022-05-19 21:35:06] [INFO ] Flow matrix only has 421 transitions (discarded 31 similar events)
// Phase 1: matrix 421 rows 351 cols
[2022-05-19 21:35:06] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-19 21:35:06] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-19 21:35:07] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 819 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 351/1364 places, 452/1624 transitions.
Finished structural reductions, in 2 iterations. Remains : 351/1364 places, 452/1624 transitions.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 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 p1)]
Finished random walk after 51 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=17 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 176 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 p1)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p1)]
[2022-05-19 21:35:07] [INFO ] Flow matrix only has 421 transitions (discarded 31 similar events)
// Phase 1: matrix 421 rows 351 cols
[2022-05-19 21:35:07] [INFO ] Computed 57 place invariants in 1 ms
[2022-05-19 21:35:08] [INFO ] [Real]Absence check using 57 positive place invariants in 36 ms returned sat
[2022-05-19 21:35:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 21:35:08] [INFO ] [Real]Absence check using state equation in 386 ms returned sat
[2022-05-19 21:35:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 21:35:08] [INFO ] [Nat]Absence check using 57 positive place invariants in 30 ms returned sat
[2022-05-19 21:35:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 21:35:09] [INFO ] [Nat]Absence check using state equation in 360 ms returned sat
[2022-05-19 21:35:09] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-19 21:35:09] [INFO ] [Nat]Added 18 Read/Feed constraints in 6 ms returned sat
[2022-05-19 21:35:09] [INFO ] Computed and/alt/rep : 370/1798/370 causal constraints (skipped 44 transitions) in 51 ms.
[2022-05-19 21:35:12] [INFO ] Added : 316 causal constraints over 64 iterations in 3542 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 46 ms :[(NOT p1)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-4B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-LTLFireability-13 finished in 34478 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&X(G((p1 U (!G(F(p1))&&G(p2)))))))'
Support contains 3 out of 1383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1383/1383 places, 1643/1643 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1373 transition count 1633
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1373 transition count 1633
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 1369 transition count 1629
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 1369 transition count 1629
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 1367 transition count 1627
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 1367 transition count 1627
Applied a total of 32 rules in 382 ms. Remains 1367 /1383 variables (removed 16) and now considering 1627/1643 (removed 16) transitions.
// Phase 1: matrix 1627 rows 1367 cols
[2022-05-19 21:35:13] [INFO ] Computed 66 place invariants in 4 ms
[2022-05-19 21:35:13] [INFO ] Implicit Places using invariants in 709 ms returned []
// Phase 1: matrix 1627 rows 1367 cols
[2022-05-19 21:35:13] [INFO ] Computed 66 place invariants in 7 ms
[2022-05-19 21:35:15] [INFO ] Implicit Places using invariants and state equation in 1723 ms returned []
Implicit Place search using SMT with State Equation took 2441 ms to find 0 implicit places.
// Phase 1: matrix 1627 rows 1367 cols
[2022-05-19 21:35:15] [INFO ] Computed 66 place invariants in 4 ms
[2022-05-19 21:35:17] [INFO ] Dead Transitions using invariants and state equation in 1968 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1367/1383 places, 1627/1643 transitions.
Finished structural reductions, in 1 iterations. Remains : 1367/1383 places, 1627/1643 transitions.
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p2) (NOT p0) p1), (OR (NOT p2) (NOT p0) p1), true, p1, (NOT p0), (NOT p0), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p2 p1), acceptance={} source=1 dest: 3}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=1 dest: 4}, { cond=(OR p2 p1), acceptance={} source=1 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 6}, { cond=p1, acceptance={} source=1 dest: 7}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 2}, { cond=(AND p2 p1), acceptance={} source=6 dest: 3}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 2}, { cond=(AND p2 p1), acceptance={} source=7 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND p2 p1), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p2) p1), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p2:(EQ s316 1), p1:(EQ s390 1), p0:(EQ s846 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-4B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-LTLFireability-14 finished in 5103 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(G(((G(p0)||p1)&&p0))))&&F(X(F(p2)))))'
Support contains 3 out of 1383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1383/1383 places, 1643/1643 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1372 transition count 1632
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1372 transition count 1632
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 1368 transition count 1628
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 1368 transition count 1628
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 1366 transition count 1626
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 1366 transition count 1626
Applied a total of 34 rules in 326 ms. Remains 1366 /1383 variables (removed 17) and now considering 1626/1643 (removed 17) transitions.
// Phase 1: matrix 1626 rows 1366 cols
[2022-05-19 21:35:18] [INFO ] Computed 66 place invariants in 6 ms
[2022-05-19 21:35:18] [INFO ] Implicit Places using invariants in 703 ms returned []
// Phase 1: matrix 1626 rows 1366 cols
[2022-05-19 21:35:18] [INFO ] Computed 66 place invariants in 7 ms
[2022-05-19 21:35:20] [INFO ] Implicit Places using invariants and state equation in 1689 ms returned []
Implicit Place search using SMT with State Equation took 2395 ms to find 0 implicit places.
// Phase 1: matrix 1626 rows 1366 cols
[2022-05-19 21:35:20] [INFO ] Computed 66 place invariants in 6 ms
[2022-05-19 21:35:22] [INFO ] Dead Transitions using invariants and state equation in 1914 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1366/1383 places, 1626/1643 transitions.
Finished structural reductions, in 1 iterations. Remains : 1366/1383 places, 1626/1643 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0, 1} source=2 dest: 2}], [{ cond=p0, acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={1} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s806 1), p0:(OR (EQ s852 0) (EQ s873 0)), p1:(EQ s806 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 5768 steps with 6 reset in 38 ms.
FORMULA NoC3x3-PT-4B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-LTLFireability-15 finished in 4911 ms.
All properties solved by simple procedures.
Total runtime 105391 ms.

BK_STOP 1652996122959

--------------------
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="NoC3x3-PT-4B"
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 NoC3x3-PT-4B, 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 r150-smll-165276998500172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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