Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r064-tall-162038397100389.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DLCround-PT-10a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r064-tall-162038397100389
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 128K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 15:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 15:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 08:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 08:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 15:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 15:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 660K May 5 16:51 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 DLCround-PT-10a-00
FORMULA_NAME DLCround-PT-10a-01
FORMULA_NAME DLCround-PT-10a-02
FORMULA_NAME DLCround-PT-10a-03
FORMULA_NAME DLCround-PT-10a-04
FORMULA_NAME DLCround-PT-10a-05
FORMULA_NAME DLCround-PT-10a-06
FORMULA_NAME DLCround-PT-10a-07
FORMULA_NAME DLCround-PT-10a-08
FORMULA_NAME DLCround-PT-10a-09
FORMULA_NAME DLCround-PT-10a-10
FORMULA_NAME DLCround-PT-10a-11
FORMULA_NAME DLCround-PT-10a-12
FORMULA_NAME DLCround-PT-10a-13
FORMULA_NAME DLCround-PT-10a-14
FORMULA_NAME DLCround-PT-10a-15

=== Now, execution of the tool begins

BK_START 1620520096223

Running Version 0
[2021-05-09 00:28:17] [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]
[2021-05-09 00:28:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 00:28:18] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2021-05-09 00:28:18] [INFO ] Transformed 337 places.
[2021-05-09 00:28:18] [INFO ] Transformed 2605 transitions.
[2021-05-09 00:28:18] [INFO ] Found NUPN structural information;
[2021-05-09 00:28:18] [INFO ] Parsed PT model containing 337 places and 2605 transitions in 181 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 00:28:18] [INFO ] Initial state test concluded for 3 properties.
Ensure Unique test removed 247 transitions
Reduce redundant transitions removed 247 transitions.
Support contains 72 out of 337 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 337/337 places, 2358/2358 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 317 transition count 2062
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 317 transition count 2062
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 317 transition count 2059
Drop transitions removed 662 transitions
Redundant transition composition rules discarded 662 transitions
Iterating global reduction 1 with 662 rules applied. Total rules applied 705 place count 317 transition count 1397
Applied a total of 705 rules in 105 ms. Remains 317 /337 variables (removed 20) and now considering 1397/2358 (removed 961) transitions.
[2021-05-09 00:28:18] [INFO ] Flow matrix only has 195 transitions (discarded 1202 similar events)
// Phase 1: matrix 195 rows 317 cols
[2021-05-09 00:28:18] [INFO ] Computed 213 place invariants in 17 ms
[2021-05-09 00:28:19] [INFO ] Implicit Places using invariants in 843 ms returned [119, 120, 121, 122, 123, 126, 127, 128, 129, 130, 131, 133, 134, 135, 136, 137, 139, 141, 142, 143, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 158, 159, 160, 161, 162, 163, 164, 166, 167, 169, 170, 171, 173, 175, 176, 177, 178, 179, 181, 182, 183, 184, 185, 186, 187, 188, 189, 191, 192, 193, 194, 195, 196, 197, 199, 200, 201, 202, 203, 205, 207, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 221, 222, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 235, 236, 237, 238, 240, 241, 242, 243, 244, 245, 247, 248, 250, 251, 253, 254, 255, 256, 258, 259, 260, 261, 262, 263, 264, 265, 267, 268, 269, 270, 271, 273, 274, 275, 276, 277, 278, 280, 281, 283, 285, 286, 287, 288, 289, 290, 293, 294, 295, 296, 297, 298, 299, 301, 302, 304, 305, 307, 308, 309, 310, 311, 312, 313, 314, 316]
Discarding 161 places :
Ensure Unique test removed 888 transitions
Reduce isomorphic transitions removed 888 transitions.
Implicit Place search using SMT only with invariants took 874 ms to find 161 implicit places.
[2021-05-09 00:28:19] [INFO ] Flow matrix only has 195 transitions (discarded 314 similar events)
// Phase 1: matrix 195 rows 156 cols
[2021-05-09 00:28:19] [INFO ] Computed 52 place invariants in 3 ms
[2021-05-09 00:28:19] [INFO ] Dead Transitions using invariants and state equation in 260 ms returned []
Starting structural reductions, iteration 1 : 156/337 places, 509/2358 transitions.
Drop transitions removed 253 transitions
Redundant transition composition rules discarded 253 transitions
Iterating global reduction 0 with 253 rules applied. Total rules applied 253 place count 156 transition count 256
Applied a total of 253 rules in 22 ms. Remains 156 /156 variables (removed 0) and now considering 256/509 (removed 253) transitions.
[2021-05-09 00:28:19] [INFO ] Flow matrix only has 195 transitions (discarded 61 similar events)
// Phase 1: matrix 195 rows 156 cols
[2021-05-09 00:28:19] [INFO ] Computed 52 place invariants in 3 ms
[2021-05-09 00:28:19] [INFO ] Implicit Places using invariants in 59 ms returned []
[2021-05-09 00:28:19] [INFO ] Flow matrix only has 195 transitions (discarded 61 similar events)
// Phase 1: matrix 195 rows 156 cols
[2021-05-09 00:28:19] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-09 00:28:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 00:28:19] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 156/337 places, 256/2358 transitions.
[2021-05-09 00:28:19] [INFO ] Flatten gal took : 42 ms
[2021-05-09 00:28:19] [INFO ] Flatten gal took : 16 ms
[2021-05-09 00:28:19] [INFO ] Input system was already deterministic with 256 transitions.
Finished random walk after 2789 steps, including 0 resets, run visited all 44 properties in 26 ms. (steps per millisecond=107 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((G(p0)||X(p1)) U (p2||(p3 U X(p4)))))], workingDir=/home/mcc/execution]
Support contains 8 out of 156 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 156/156 places, 256/256 transitions.
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 123 transition count 256
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 41 place count 115 transition count 240
Iterating global reduction 1 with 8 rules applied. Total rules applied 49 place count 115 transition count 240
Applied a total of 49 rules in 7 ms. Remains 115 /156 variables (removed 41) and now considering 240/256 (removed 16) transitions.
[2021-05-09 00:28:22] [INFO ] Flow matrix only has 187 transitions (discarded 53 similar events)
// Phase 1: matrix 187 rows 115 cols
[2021-05-09 00:28:22] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-09 00:28:22] [INFO ] Implicit Places using invariants in 41 ms returned []
[2021-05-09 00:28:22] [INFO ] Flow matrix only has 187 transitions (discarded 53 similar events)
// Phase 1: matrix 187 rows 115 cols
[2021-05-09 00:28:22] [INFO ] Computed 19 place invariants in 2 ms
[2021-05-09 00:28:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 00:28:22] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2021-05-09 00:28:22] [INFO ] Flow matrix only has 187 transitions (discarded 53 similar events)
// Phase 1: matrix 187 rows 115 cols
[2021-05-09 00:28:22] [INFO ] Computed 19 place invariants in 1 ms
[2021-05-09 00:28:22] [INFO ] Dead Transitions using invariants and state equation in 102 ms returned []
Finished structural reductions, in 1 iterations. Remains : 115/156 places, 240/256 transitions.
Stuttering acceptance computed with spot in 566 ms :[(AND (NOT p2) (NOT p4)), (AND (NOT p0) (NOT p1) (NOT p4)), (AND (NOT p2) (NOT p4)), (AND (NOT p0) (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (NOT p4), (AND (NOT p0) (NOT p4)), (AND (NOT p0) (NOT p4)), (NOT p4), true, (NOT p0)]
Running random walk in product with property : DLCround-PT-10a-00 automaton TGBA [mat=[[{ cond=(AND (NOT p2) p3 p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p3 (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p1) (NOT p4)), acceptance={} source=1 dest: 6}, { cond=(AND p3 p0 (NOT p1) (NOT p4)), acceptance={} source=1 dest: 7}, { cond=(AND (NOT p3) p0 (NOT p1) (NOT p4)), acceptance={} source=1 dest: 8}, { cond=(AND p3 (NOT p0) (NOT p1) (NOT p4)), acceptance={} source=1 dest: 9}], [{ cond=(AND (NOT p2) p3 p0 (NOT p4)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p4)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p4)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p2) p3 (NOT p0) (NOT p4)), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) (NOT p4)), acceptance={0} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p4)), acceptance={} source=3 dest: 10}, { cond=(AND p0 (NOT p1) (NOT p4)), acceptance={} source=3 dest: 11}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p4)), acceptance={} source=4 dest: 6}, { cond=(AND p3 (NOT p1) (NOT p4)), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p1) (NOT p4)), acceptance={} source=5 dest: 10}], [{ cond=(NOT p4), acceptance={} source=6 dest: 10}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p4)), acceptance={} source=7 dest: 6}, { cond=(AND p3 p0 (NOT p4)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p3) p0 (NOT p4)), acceptance={} source=7 dest: 8}, { cond=(AND p3 (NOT p0) (NOT p4)), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p0) (NOT p4)), acceptance={} source=8 dest: 10}, { cond=(AND p0 (NOT p4)), acceptance={} source=8 dest: 11}], [{ cond=(AND (NOT p3) (NOT p4)), acceptance={0} source=9 dest: 6}, { cond=(AND p3 (NOT p4)), acceptance={0} source=9 dest: 9}], [{ cond=true, acceptance={0} source=10 dest: 10}], [{ cond=(NOT p0), acceptance={} source=11 dest: 10}, { cond=p0, acceptance={} source=11 dest: 11}]], initial=0, aps=[p2:(AND (EQ s16 1) (EQ s112 1) (EQ s77 1) (EQ s113 1)), p3:(AND (EQ s77 1) (EQ s113 1)), p0:(AND (EQ s40 1) (EQ s111 1)), p1:(AND (EQ s16 1) (EQ s112 1)), p4:(AND (EQ s93 1) (EQ s114 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA DLCround-PT-10a-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-10a-00 finished in 3164 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G((p1||X((X(p2) U (X(p2)&&p3)))))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 156 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 156/156 places, 256/256 transitions.
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 122 transition count 256
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 42 place count 114 transition count 240
Iterating global reduction 1 with 8 rules applied. Total rules applied 50 place count 114 transition count 240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 114 transition count 239
Applied a total of 51 rules in 6 ms. Remains 114 /156 variables (removed 42) and now considering 239/256 (removed 17) transitions.
[2021-05-09 00:28:23] [INFO ] Flow matrix only has 186 transitions (discarded 53 similar events)
// Phase 1: matrix 186 rows 114 cols
[2021-05-09 00:28:23] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-09 00:28:23] [INFO ] Implicit Places using invariants in 34 ms returned []
[2021-05-09 00:28:23] [INFO ] Flow matrix only has 186 transitions (discarded 53 similar events)
// Phase 1: matrix 186 rows 114 cols
[2021-05-09 00:28:23] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-09 00:28:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 00:28:23] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2021-05-09 00:28:23] [INFO ] Flow matrix only has 186 transitions (discarded 53 similar events)
// Phase 1: matrix 186 rows 114 cols
[2021-05-09 00:28:23] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-09 00:28:23] [INFO ] Dead Transitions using invariants and state equation in 86 ms returned []
Finished structural reductions, in 1 iterations. Remains : 114/156 places, 239/256 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DLCround-PT-10a-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=true, acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p3), acceptance={0} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p3 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s63 0) (EQ s113 0)), p1:(AND (EQ s106 1) (EQ s111 1)), p3:(AND (EQ s106 1) (EQ s111 1)), p2:(AND (EQ s27 1) (EQ s112 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-10a-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-10a-01 finished in 405 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X((F((p0&&X(p1)))||G(p2))) U (X((F((p0&&X(p1)))||G(p2)))&&p3))))], workingDir=/home/mcc/execution]
Support contains 6 out of 156 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 156/156 places, 256/256 transitions.
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 122 transition count 256
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 43 place count 113 transition count 238
Iterating global reduction 1 with 9 rules applied. Total rules applied 52 place count 113 transition count 238
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 53 place count 113 transition count 237
Applied a total of 53 rules in 5 ms. Remains 113 /156 variables (removed 43) and now considering 237/256 (removed 19) transitions.
[2021-05-09 00:28:23] [INFO ] Flow matrix only has 185 transitions (discarded 52 similar events)
// Phase 1: matrix 185 rows 113 cols
[2021-05-09 00:28:23] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-09 00:28:23] [INFO ] Implicit Places using invariants in 19 ms returned []
[2021-05-09 00:28:23] [INFO ] Flow matrix only has 185 transitions (discarded 52 similar events)
// Phase 1: matrix 185 rows 113 cols
[2021-05-09 00:28:23] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-09 00:28:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 00:28:23] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2021-05-09 00:28:23] [INFO ] Flow matrix only has 185 transitions (discarded 52 similar events)
// Phase 1: matrix 185 rows 113 cols
[2021-05-09 00:28:23] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-09 00:28:23] [INFO ] Dead Transitions using invariants and state equation in 87 ms returned []
Finished structural reductions, in 1 iterations. Remains : 113/156 places, 237/256 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : DLCround-PT-10a-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 5}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p3:(AND (EQ s47 1) (EQ s111 1)), p0:(OR (NEQ s47 1) (NEQ s111 1)), p2:(OR (NEQ s43 1) (NEQ s112 1)), p1:(AND (EQ s53 1) (EQ s110 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-10a-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-10a-02 finished in 378 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 156/156 places, 256/256 transitions.
Graph (trivial) has 252 edges and 156 vertex of which 116 / 156 are part of one of the 15 SCC in 4 ms
Free SCC test removed 101 places
Ensure Unique test removed 236 transitions
Reduce isomorphic transitions removed 236 transitions.
Graph (complete) has 71 edges and 55 vertex of which 18 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.10 ms
Discarding 37 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 29 place count 3 transition count 6
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 31 place count 3 transition count 3
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 33 place count 2 transition count 3
Applied a total of 33 rules in 25 ms. Remains 2 /156 variables (removed 154) and now considering 3/256 (removed 253) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 00:28:23] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 00:28:23] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 00:28:23] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 00:28:23] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
[2021-05-09 00:28:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-09 00:28:23] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 00:28:23] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/156 places, 3/256 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-10a-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s0 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-10a-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-10a-03 finished in 113 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)||G(((p1&&X(p0))||G(p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 156 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 156/156 places, 256/256 transitions.
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 121 transition count 256
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 44 place count 112 transition count 238
Iterating global reduction 1 with 9 rules applied. Total rules applied 53 place count 112 transition count 238
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 112 transition count 237
Applied a total of 54 rules in 5 ms. Remains 112 /156 variables (removed 44) and now considering 237/256 (removed 19) transitions.
[2021-05-09 00:28:23] [INFO ] Flow matrix only has 185 transitions (discarded 52 similar events)
// Phase 1: matrix 185 rows 112 cols
[2021-05-09 00:28:23] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-09 00:28:24] [INFO ] Implicit Places using invariants in 23 ms returned []
[2021-05-09 00:28:24] [INFO ] Flow matrix only has 185 transitions (discarded 52 similar events)
// Phase 1: matrix 185 rows 112 cols
[2021-05-09 00:28:24] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-09 00:28:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 00:28:24] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2021-05-09 00:28:24] [INFO ] Flow matrix only has 185 transitions (discarded 52 similar events)
// Phase 1: matrix 185 rows 112 cols
[2021-05-09 00:28:24] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-09 00:28:24] [INFO ] Dead Transitions using invariants and state equation in 95 ms returned []
Finished structural reductions, in 1 iterations. Remains : 112/156 places, 237/256 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DLCround-PT-10a-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s68 1) (EQ s110 1)), p2:(AND (EQ s103 1) (EQ s111 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 406 ms.
Product exploration explored 100000 steps with 50000 reset in 268 ms.
Graph (complete) has 253 edges and 112 vertex of which 110 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Knowledge obtained : [(NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 50000 reset in 215 ms.
Product exploration explored 100000 steps with 50000 reset in 236 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 112 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 112/112 places, 237/237 transitions.
Graph (trivial) has 229 edges and 112 vertex of which 106 / 112 are part of one of the 16 SCC in 0 ms
Free SCC test removed 90 places
Ensure Unique test removed 211 transitions
Reduce isomorphic transitions removed 211 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 22 transition count 26
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 22 transition count 25
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 15 place count 10 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 27 place count 10 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 27 rules in 3 ms. Remains 10 /112 variables (removed 102) and now considering 13/237 (removed 224) transitions.
[2021-05-09 00:28:25] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 00:28:25] [INFO ] Flow matrix only has 8 transitions (discarded 5 similar events)
// Phase 1: matrix 8 rows 10 cols
[2021-05-09 00:28:25] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 00:28:25] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/112 places, 13/237 transitions.
Product exploration explored 100000 steps with 50000 reset in 273 ms.
Product exploration explored 100000 steps with 50000 reset in 239 ms.
Starting structural reductions, iteration 0 : 112/112 places, 237/237 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 110 transition count 237
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 109 transition count 235
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 109 transition count 235
Applied a total of 4 rules in 2 ms. Remains 109 /112 variables (removed 3) and now considering 235/237 (removed 2) transitions.
[2021-05-09 00:28:26] [INFO ] Flow matrix only has 184 transitions (discarded 51 similar events)
// Phase 1: matrix 184 rows 109 cols
[2021-05-09 00:28:26] [INFO ] Computed 15 place invariants in 8 ms
[2021-05-09 00:28:26] [INFO ] Implicit Places using invariants in 39 ms returned []
[2021-05-09 00:28:26] [INFO ] Flow matrix only has 184 transitions (discarded 51 similar events)
// Phase 1: matrix 184 rows 109 cols
[2021-05-09 00:28:26] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-09 00:28:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 00:28:26] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2021-05-09 00:28:26] [INFO ] Flow matrix only has 184 transitions (discarded 51 similar events)
// Phase 1: matrix 184 rows 109 cols
[2021-05-09 00:28:26] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-09 00:28:26] [INFO ] Dead Transitions using invariants and state equation in 82 ms returned []
Finished structural reductions, in 1 iterations. Remains : 109/112 places, 235/237 transitions.
[2021-05-09 00:28:26] [INFO ] Flatten gal took : 11 ms
[2021-05-09 00:28:26] [INFO ] Flatten gal took : 10 ms
[2021-05-09 00:28:26] [INFO ] Time to serialize gal into /tmp/LTL1490607727150896131.gal : 5 ms
[2021-05-09 00:28:26] [INFO ] Time to serialize properties into /tmp/LTL3790380114576255738.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL1490607727150896131.gal, -t, CGAL, -LTL, /tmp/LTL3790380114576255738.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1490607727150896131.gal -t CGAL -LTL /tmp/LTL3790380114576255738.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 12 LTL properties
Checking formula 0 : !((X((F("((p88==1)&&(p286==1))"))||(G((("((p7==0)||(p188==0))")&&(X("((p88==1)&&(p286==1))")))||(G("((p131==1)&&(p335==1))")))))))
Formula 0 simplified : !X(F"((p88==1)&&(p286==1))" | G(("((p7==0)||(p188==0))" & X"((p88==1)&&(p286==1))") | G"((p131==1)&&(p335==1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
11 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.135426,20700,1,0,6,21091,23,0,3123,1796,10
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DLCround-PT-10a-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((F(G(("((p87==1)&&(p277==1))")||(X(F("((((p21!=1)||(p192!=1))||(p21!=1))||(p224!=1))")))))))
Formula 1 simplified : !FG("((p87==1)&&(p277==1))" | XF"((((p21!=1)||(p192!=1))||(p21!=1))||(p224!=1))")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.164593,21572,1,0,14,23925,47,5,3351,6636,60
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DLCround-PT-10a-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((X(("(((p46==1)&&(p240==1))||((p21==1)&&(p200==1)))")&&(G("((p77==1)&&(p311==1))")))))
Formula 2 simplified : !X("(((p46==1)&&(p240==1))||((p21==1)&&(p200==1)))" & G"((p77==1)&&(p311==1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.168647,22024,1,0,15,24289,60,5,3375,6846,71
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DLCround-PT-10a-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((X(("((p25==0)||(p145==0))")||(X(F((X("((p25==1)&&(p145==1))"))||(("(((p25!=1)||(p145!=1))&&((p117!=1)||(p254!=1)))")U(("((((p25!=1)||(p177!=1))&&((p25!=1)||(p145!=1)))&&((p117!=1)||(p254!=1)))")||(G("(((p25!=1)||(p145!=1))&&((p117!=1)||(p254!=1)))"))))))))))
Formula 3 simplified : !X("((p25==0)||(p145==0))" | XF(X"((p25==1)&&(p145==1))" | ("(((p25!=1)||(p145!=1))&&((p117!=1)||(p254!=1)))" U ("((((p25!=1)||(p177!=1))&&((p25!=1)||(p145!=1)))&&((p117!=1)||(p254!=1)))" | G"(((p25!=1)||(p145!=1))&&((p117!=1)||(p254!=1)))"))))
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.170018,22372,1,0,15,24289,63,5,3381,6846,73
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA DLCround-PT-10a-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !(((X(X("((p108==1)&&(p304==1))")))||((G("((p36==1)&&(p229==1))"))&&(X(F(!("((p108==1)&&(p304==1))")))))))
Formula 4 simplified : !(XX"((p108==1)&&(p304==1))" | (G"((p36==1)&&(p229==1))" & XF!"((p108==1)&&(p304==1))"))
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.172304,22504,1,0,17,24494,70,5,3393,6918,84
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DLCround-PT-10a-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((X((("((p28==1)&&(p210==1))")U("(((p126==0)||(p218==0))&&((p134==0)||(p224==0)))"))||(X("((p134==0)||(p224==0))")))))
Formula 5 simplified : !X(("((p28==1)&&(p210==1))" U "(((p126==0)||(p218==0))&&((p134==0)||(p224==0)))") | X"((p134==0)||(p224==0))")
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.173767,22504,1,0,17,24494,80,5,3417,6918,88
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA DLCround-PT-10a-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((X(X((F(G("(p110!=1)")))||(G("((p96==1)&&(p292==1))"))))))
Formula 6 simplified : !XX(FG"(p110!=1)" | G"((p96==1)&&(p292==1))")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
19 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.358655,29168,1,0,111,53163,99,53,3425,62132,347
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DLCround-PT-10a-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((F("((p106==1)&&(p302==1))")))
Formula 7 simplified : !F"((p106==1)&&(p302==1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
8 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.443865,32988,1,0,245,69068,108,100,3431,91842,590
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DLCround-PT-10a-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((X(X(F("((p48==1)&&(p152==1))")))))
Formula 8 simplified : !XXF"((p48==1)&&(p152==1))"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
19 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.635359,39588,1,0,333,97892,117,143,3437,144115,820
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DLCround-PT-10a-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !(((G("((p61!=1)||(p266!=1))"))||(X(("((p35!=1)||(p144!=1))")U((X("((p95!=0)&&(p194!=0))"))||(G("((p35!=1)||(p144!=1))")))))))
Formula 9 simplified : !(G"((p61!=1)||(p266!=1))" | X("((p35!=1)||(p144!=1))" U (X"((p95!=0)&&(p194!=0))" | G"((p35!=1)||(p144!=1))")))
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 items max in DFS search stack
23 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.86766,48580,1,0,434,139792,160,189,3480,204150,1103
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA DLCround-PT-10a-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((X((("((p76==1)&&(p269==1))")&&(("((p42!=1)||(p243!=1))")U(("(((p128!=1)||(p326!=1))&&((p42!=1)||(p243!=1)))")||(G("((p42!=1)||(p243!=1))")))))U(G("((((p128==1)&&(p326==1))&&(p118==1))&&(p312==1))")))))
Formula 10 simplified : !X(("((p76==1)&&(p269==1))" & ("((p42!=1)||(p243!=1))" U ("(((p128!=1)||(p326!=1))&&((p42!=1)||(p243!=1)))" | G"((p42!=1)||(p243!=1))"))) U G"((((p128==1)&&(p326==1))&&(p118==1))&&(p312==1))")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
13 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.998754,51224,1,0,512,150138,219,227,3562,218975,1315
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DLCround-PT-10a-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((X((("((p67!=1)||(p320!=1))")U(("(((p54!=0)&&(p158!=0))&&((p67!=1)||(p320!=1)))")||(G("((p67!=1)||(p320!=1))"))))||(X((("((p76!=1)||(p272!=1))")&&(G(F("((p67!=1)||(p320!=1))"))))||(G("((p76!=1)||(p272!=1))")))))))
Formula 11 simplified : !X(("((p67!=1)||(p320!=1))" U ("(((p54!=0)&&(p158!=0))&&((p67!=1)||(p320!=1)))" | G"((p67!=1)||(p320!=1))")) | X(("((p76!=1)||(p272!=1))" & GF"((p67!=1)||(p320!=1))") | G"((p76!=1)||(p272!=1))"))
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
45 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.45403,65112,1,0,696,215895,263,315,3600,318727,1802
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA DLCround-PT-10a-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property DLCround-PT-10a-04 finished in 4183 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620520109455

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="DLCround-PT-10a"
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 DLCround-PT-10a, 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 r064-tall-162038397100389"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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