About the Execution of ITS-Tools for NoC3x3-PT-6B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16240.336 | 3600000.00 | 12498173.00 | 568.60 | FFFFF?FTFFTFTFF? | normal |
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.r140-tall-162089127700317.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 NoC3x3-PT-6B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127700317
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 928K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 148K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 80K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K Mar 28 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 28 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 16:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 28 16:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 06:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 06:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 25 07:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K Mar 25 07:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 552K 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 NoC3x3-PT-6B-00
FORMULA_NAME NoC3x3-PT-6B-01
FORMULA_NAME NoC3x3-PT-6B-02
FORMULA_NAME NoC3x3-PT-6B-03
FORMULA_NAME NoC3x3-PT-6B-04
FORMULA_NAME NoC3x3-PT-6B-05
FORMULA_NAME NoC3x3-PT-6B-06
FORMULA_NAME NoC3x3-PT-6B-07
FORMULA_NAME NoC3x3-PT-6B-08
FORMULA_NAME NoC3x3-PT-6B-09
FORMULA_NAME NoC3x3-PT-6B-10
FORMULA_NAME NoC3x3-PT-6B-11
FORMULA_NAME NoC3x3-PT-6B-12
FORMULA_NAME NoC3x3-PT-6B-13
FORMULA_NAME NoC3x3-PT-6B-14
FORMULA_NAME NoC3x3-PT-6B-15
=== Now, execution of the tool begins
BK_START 1620968958211
Running Version 0
[2021-05-14 05:09:19] [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-14 05:09:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 05:09:19] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2021-05-14 05:09:19] [INFO ] Transformed 1544 places.
[2021-05-14 05:09:19] [INFO ] Transformed 2229 transitions.
[2021-05-14 05:09:19] [INFO ] Found NUPN structural information;
[2021-05-14 05:09:19] [INFO ] Parsed PT model containing 1544 places and 2229 transitions in 186 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2021-05-14 05:09:19] [INFO ] Initial state test concluded for 4 properties.
FORMULA NoC3x3-PT-6B-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6B-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 1544 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1544/1544 places, 2229/2229 transitions.
Discarding 363 places :
Symmetric choice reduction at 0 with 363 rule applications. Total rules 363 place count 1181 transition count 1866
Iterating global reduction 0 with 363 rules applied. Total rules applied 726 place count 1181 transition count 1866
Discarding 102 places :
Symmetric choice reduction at 0 with 102 rule applications. Total rules 828 place count 1079 transition count 1684
Iterating global reduction 0 with 102 rules applied. Total rules applied 930 place count 1079 transition count 1684
Discarding 88 places :
Symmetric choice reduction at 0 with 88 rule applications. Total rules 1018 place count 991 transition count 1533
Iterating global reduction 0 with 88 rules applied. Total rules applied 1106 place count 991 transition count 1533
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 1126 place count 971 transition count 1493
Iterating global reduction 0 with 20 rules applied. Total rules applied 1146 place count 971 transition count 1493
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 1158 place count 959 transition count 1465
Iterating global reduction 0 with 12 rules applied. Total rules applied 1170 place count 959 transition count 1465
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 1182 place count 947 transition count 1453
Iterating global reduction 0 with 12 rules applied. Total rules applied 1194 place count 947 transition count 1453
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 1196 place count 945 transition count 1449
Iterating global reduction 0 with 2 rules applied. Total rules applied 1198 place count 945 transition count 1449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1199 place count 944 transition count 1447
Iterating global reduction 0 with 1 rules applied. Total rules applied 1200 place count 944 transition count 1447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1201 place count 943 transition count 1446
Iterating global reduction 0 with 1 rules applied. Total rules applied 1202 place count 943 transition count 1446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1203 place count 943 transition count 1445
Applied a total of 1203 rules in 551 ms. Remains 943 /1544 variables (removed 601) and now considering 1445/2229 (removed 784) transitions.
// Phase 1: matrix 1445 rows 943 cols
[2021-05-14 05:09:20] [INFO ] Computed 66 place invariants in 30 ms
[2021-05-14 05:09:21] [INFO ] Implicit Places using invariants in 479 ms returned []
// Phase 1: matrix 1445 rows 943 cols
[2021-05-14 05:09:21] [INFO ] Computed 66 place invariants in 7 ms
[2021-05-14 05:09:21] [INFO ] Implicit Places using invariants and state equation in 890 ms returned []
Implicit Place search using SMT with State Equation took 1394 ms to find 0 implicit places.
// Phase 1: matrix 1445 rows 943 cols
[2021-05-14 05:09:21] [INFO ] Computed 66 place invariants in 6 ms
[2021-05-14 05:09:22] [INFO ] Dead Transitions using invariants and state equation in 595 ms returned []
Finished structural reductions, in 1 iterations. Remains : 943/1544 places, 1445/2229 transitions.
[2021-05-14 05:09:22] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-14 05:09:22] [INFO ] Flatten gal took : 139 ms
FORMULA NoC3x3-PT-6B-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6B-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 05:09:22] [INFO ] Flatten gal took : 83 ms
[2021-05-14 05:09:23] [INFO ] Input system was already deterministic with 1445 transitions.
Finished random walk after 73737 steps, including 162 resets, run visited all 27 properties in 368 ms. (steps per millisecond=200 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0) U (G(p0)&&p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 943 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 943/943 places, 1445/1445 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 925 transition count 1403
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 925 transition count 1403
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 43 place count 918 transition count 1388
Iterating global reduction 0 with 7 rules applied. Total rules applied 50 place count 918 transition count 1388
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 53 place count 918 transition count 1385
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 61 place count 910 transition count 1371
Iterating global reduction 1 with 8 rules applied. Total rules applied 69 place count 910 transition count 1371
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 73 place count 906 transition count 1365
Iterating global reduction 1 with 4 rules applied. Total rules applied 77 place count 906 transition count 1365
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 80 place count 903 transition count 1360
Iterating global reduction 1 with 3 rules applied. Total rules applied 83 place count 903 transition count 1360
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 87 place count 903 transition count 1356
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 89 place count 901 transition count 1353
Iterating global reduction 2 with 2 rules applied. Total rules applied 91 place count 901 transition count 1353
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 92 place count 900 transition count 1352
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 900 transition count 1352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 94 place count 900 transition count 1351
Applied a total of 94 rules in 818 ms. Remains 900 /943 variables (removed 43) and now considering 1351/1445 (removed 94) transitions.
// Phase 1: matrix 1351 rows 900 cols
[2021-05-14 05:09:24] [INFO ] Computed 66 place invariants in 11 ms
[2021-05-14 05:09:24] [INFO ] Implicit Places using invariants in 285 ms returned []
// Phase 1: matrix 1351 rows 900 cols
[2021-05-14 05:09:24] [INFO ] Computed 66 place invariants in 17 ms
[2021-05-14 05:09:25] [INFO ] Implicit Places using invariants and state equation in 804 ms returned []
Implicit Place search using SMT with State Equation took 1090 ms to find 0 implicit places.
// Phase 1: matrix 1351 rows 900 cols
[2021-05-14 05:09:25] [INFO ] Computed 66 place invariants in 4 ms
[2021-05-14 05:09:26] [INFO ] Dead Transitions using invariants and state equation in 586 ms returned []
Finished structural reductions, in 1 iterations. Remains : 900/943 places, 1351/1445 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-6B-00 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s40 1), p1:(AND (EQ s854 1) (EQ s879 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-6B-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-00 finished in 2738 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||(G(p1) U p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 943 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 943/943 places, 1445/1445 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 942 transition count 1407
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 74 place count 905 transition count 1407
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 74 place count 905 transition count 1309
Deduced a syphon composed of 98 places in 2 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 196 rules applied. Total rules applied 270 place count 807 transition count 1309
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 305 place count 772 transition count 1134
Iterating global reduction 2 with 35 rules applied. Total rules applied 340 place count 772 transition count 1134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 342 place count 772 transition count 1132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 343 place count 771 transition count 1132
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 343 place count 771 transition count 1130
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 347 place count 769 transition count 1130
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 352 place count 764 transition count 1106
Iterating global reduction 4 with 5 rules applied. Total rules applied 357 place count 764 transition count 1106
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 359 place count 762 transition count 1102
Iterating global reduction 4 with 2 rules applied. Total rules applied 361 place count 762 transition count 1102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 362 place count 762 transition count 1101
Performed 176 Post agglomeration using F-continuation condition.Transition count delta: 176
Deduced a syphon composed of 176 places in 0 ms
Reduce places removed 176 places and 0 transitions.
Iterating global reduction 5 with 352 rules applied. Total rules applied 714 place count 586 transition count 925
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 718 place count 582 transition count 917
Iterating global reduction 5 with 4 rules applied. Total rules applied 722 place count 582 transition count 917
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 725 place count 579 transition count 911
Iterating global reduction 5 with 3 rules applied. Total rules applied 728 place count 579 transition count 911
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 730 place count 577 transition count 907
Iterating global reduction 5 with 2 rules applied. Total rules applied 732 place count 577 transition count 907
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 733 place count 576 transition count 905
Iterating global reduction 5 with 1 rules applied. Total rules applied 734 place count 576 transition count 905
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 735 place count 576 transition count 904
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 6 with 202 rules applied. Total rules applied 937 place count 475 transition count 934
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 6 with 78 rules applied. Total rules applied 1015 place count 436 transition count 946
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 6 with 24 rules applied. Total rules applied 1039 place count 436 transition count 922
Applied a total of 1039 rules in 902 ms. Remains 436 /943 variables (removed 507) and now considering 922/1445 (removed 523) transitions.
// Phase 1: matrix 922 rows 436 cols
[2021-05-14 05:09:27] [INFO ] Computed 66 place invariants in 9 ms
[2021-05-14 05:09:27] [INFO ] Implicit Places using invariants in 239 ms returned [11, 46, 94, 196, 276, 326, 365, 414]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 241 ms to find 8 implicit places.
[2021-05-14 05:09:27] [INFO ] Redundant transitions in 54 ms returned []
// Phase 1: matrix 922 rows 428 cols
[2021-05-14 05:09:27] [INFO ] Computed 58 place invariants in 6 ms
[2021-05-14 05:09:27] [INFO ] Dead Transitions using invariants and state equation in 319 ms returned []
Starting structural reductions, iteration 1 : 428/943 places, 922/1445 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 407 transition count 901
Applied a total of 42 rules in 35 ms. Remains 407 /428 variables (removed 21) and now considering 901/922 (removed 21) transitions.
// Phase 1: matrix 901 rows 407 cols
[2021-05-14 05:09:27] [INFO ] Computed 58 place invariants in 6 ms
[2021-05-14 05:09:28] [INFO ] Implicit Places using invariants in 193 ms returned []
// Phase 1: matrix 901 rows 407 cols
[2021-05-14 05:09:28] [INFO ] Computed 58 place invariants in 4 ms
[2021-05-14 05:09:28] [INFO ] State equation strengthened by 53 read => feed constraints.
[2021-05-14 05:09:29] [INFO ] Implicit Places using invariants and state equation in 1014 ms returned []
Implicit Place search using SMT with State Equation took 1217 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 407/943 places, 901/1445 transitions.
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-6B-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(EQ s129 1), p0:(AND (EQ s131 1) (EQ s170 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 155 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-6B-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-03 finished in 2842 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G(p0) U (X(X(X(F(p1))))||(X(p3)&&p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 943 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 943/943 places, 1445/1445 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 927 transition count 1410
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 927 transition count 1410
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 920 transition count 1395
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 920 transition count 1395
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 920 transition count 1392
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 57 place count 912 transition count 1378
Iterating global reduction 1 with 8 rules applied. Total rules applied 65 place count 912 transition count 1378
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 69 place count 908 transition count 1372
Iterating global reduction 1 with 4 rules applied. Total rules applied 73 place count 908 transition count 1372
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 76 place count 905 transition count 1367
Iterating global reduction 1 with 3 rules applied. Total rules applied 79 place count 905 transition count 1367
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 83 place count 905 transition count 1363
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 85 place count 903 transition count 1360
Iterating global reduction 2 with 2 rules applied. Total rules applied 87 place count 903 transition count 1360
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 902 transition count 1359
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 902 transition count 1359
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 90 place count 902 transition count 1358
Applied a total of 90 rules in 128 ms. Remains 902 /943 variables (removed 41) and now considering 1358/1445 (removed 87) transitions.
// Phase 1: matrix 1358 rows 902 cols
[2021-05-14 05:09:29] [INFO ] Computed 66 place invariants in 4 ms
[2021-05-14 05:09:29] [INFO ] Implicit Places using invariants in 294 ms returned []
// Phase 1: matrix 1358 rows 902 cols
[2021-05-14 05:09:29] [INFO ] Computed 66 place invariants in 3 ms
[2021-05-14 05:09:30] [INFO ] Implicit Places using invariants and state equation in 914 ms returned []
Implicit Place search using SMT with State Equation took 1210 ms to find 0 implicit places.
// Phase 1: matrix 1358 rows 902 cols
[2021-05-14 05:09:30] [INFO ] Computed 66 place invariants in 3 ms
[2021-05-14 05:09:31] [INFO ] Dead Transitions using invariants and state equation in 562 ms returned []
Finished structural reductions, in 1 iterations. Remains : 902/943 places, 1358/1445 transitions.
Stuttering acceptance computed with spot in 419 ms :[(AND (NOT p1) (NOT p0)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p1), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p1), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-6B-04 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 13}], [{ cond=(AND p0 p3), acceptance={} source=1 dest: 0}, { cond=(AND p2 p0 (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={} source=1 dest: 6}, { cond=(NOT p0), acceptance={} source=1 dest: 13}], [{ cond=(AND p0 p3 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p2 p0 (NOT p3) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p3) (NOT p1)), acceptance={0} source=2 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 13}], [{ cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 7}, { cond=(AND p2 p0), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 10}], [{ cond=(AND p2 p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 5}, { cond=(NOT p0), acceptance={} source=4 dest: 12}], [{ cond=(AND p2 p0), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 6}, { cond=(NOT p0), acceptance={} source=5 dest: 13}], [{ cond=(AND p2 p0 (NOT p1)), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 13}], [{ cond=(NOT p3), acceptance={} source=7 dest: 12}], [{ cond=(AND p2 p0 (NOT p3)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=8 dest: 12}], [{ cond=true, acceptance={} source=9 dest: 11}], [{ cond=true, acceptance={} source=10 dest: 12}], [{ cond=true, acceptance={} source=11 dest: 3}], [{ cond=true, acceptance={} source=12 dest: 13}], [{ cond=(NOT p1), acceptance={0} source=13 dest: 13}]], initial=9, aps=[p0:(EQ s866 1), p1:(EQ s315 1), p3:(AND (EQ s514 1) (EQ s742 1)), p2:(AND (EQ s514 1) (EQ s742 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 393 steps with 0 reset in 4 ms.
FORMULA NoC3x3-PT-6B-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-04 finished in 2349 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((G(F((p1||G(p2))))||p0))))], workingDir=/home/mcc/execution]
Support contains 5 out of 943 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 943/943 places, 1445/1445 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 942 transition count 1408
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 906 transition count 1408
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 72 place count 906 transition count 1310
Deduced a syphon composed of 98 places in 2 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 196 rules applied. Total rules applied 268 place count 808 transition count 1310
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 303 place count 773 transition count 1135
Iterating global reduction 2 with 35 rules applied. Total rules applied 338 place count 773 transition count 1135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 340 place count 773 transition count 1133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 341 place count 772 transition count 1133
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 341 place count 772 transition count 1131
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 345 place count 770 transition count 1131
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 350 place count 765 transition count 1107
Iterating global reduction 4 with 5 rules applied. Total rules applied 355 place count 765 transition count 1107
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 357 place count 763 transition count 1103
Iterating global reduction 4 with 2 rules applied. Total rules applied 359 place count 763 transition count 1103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 360 place count 763 transition count 1102
Performed 176 Post agglomeration using F-continuation condition.Transition count delta: 176
Deduced a syphon composed of 176 places in 0 ms
Reduce places removed 176 places and 0 transitions.
Iterating global reduction 5 with 352 rules applied. Total rules applied 712 place count 587 transition count 926
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 715 place count 584 transition count 920
Iterating global reduction 5 with 3 rules applied. Total rules applied 718 place count 584 transition count 920
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 720 place count 582 transition count 916
Iterating global reduction 5 with 2 rules applied. Total rules applied 722 place count 582 transition count 916
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 723 place count 581 transition count 914
Iterating global reduction 5 with 1 rules applied. Total rules applied 724 place count 581 transition count 914
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 5 with 202 rules applied. Total rules applied 926 place count 480 transition count 944
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 1004 place count 441 transition count 956
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 5 with 24 rules applied. Total rules applied 1028 place count 441 transition count 932
Applied a total of 1028 rules in 207 ms. Remains 441 /943 variables (removed 502) and now considering 932/1445 (removed 513) transitions.
// Phase 1: matrix 932 rows 441 cols
[2021-05-14 05:09:31] [INFO ] Computed 66 place invariants in 4 ms
[2021-05-14 05:09:31] [INFO ] Implicit Places using invariants in 223 ms returned [11, 46, 94, 133, 194, 274, 329, 368, 419]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 229 ms to find 9 implicit places.
[2021-05-14 05:09:31] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 932 rows 432 cols
[2021-05-14 05:09:31] [INFO ] Computed 57 place invariants in 3 ms
[2021-05-14 05:09:32] [INFO ] Dead Transitions using invariants and state equation in 320 ms returned []
Starting structural reductions, iteration 1 : 432/943 places, 932/1445 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 408 transition count 908
Applied a total of 48 rules in 19 ms. Remains 408 /432 variables (removed 24) and now considering 908/932 (removed 24) transitions.
// Phase 1: matrix 908 rows 408 cols
[2021-05-14 05:09:32] [INFO ] Computed 57 place invariants in 7 ms
[2021-05-14 05:09:32] [INFO ] Implicit Places using invariants in 200 ms returned []
// Phase 1: matrix 908 rows 408 cols
[2021-05-14 05:09:32] [INFO ] Computed 57 place invariants in 2 ms
[2021-05-14 05:09:32] [INFO ] State equation strengthened by 52 read => feed constraints.
[2021-05-14 05:09:33] [INFO ] Implicit Places using invariants and state equation in 996 ms returned []
Implicit Place search using SMT with State Equation took 1198 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 408/943 places, 908/1445 transitions.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-6B-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p2:(EQ s276 1), p1:(AND (NEQ s136 0) (NEQ s299 0)), p0:(OR (EQ s328 0) (EQ s354 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 691 reset in 655 ms.
Product exploration explored 100000 steps with 683 reset in 543 ms.
Knowledge obtained : [(NOT p2), (NOT p1), p0]
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 687 reset in 452 ms.
Product exploration explored 100000 steps with 692 reset in 484 ms.
[2021-05-14 05:09:35] [INFO ] Flatten gal took : 58 ms
[2021-05-14 05:09:36] [INFO ] Flatten gal took : 49 ms
[2021-05-14 05:09:36] [INFO ] Time to serialize gal into /tmp/LTL8247085653919245714.gal : 19 ms
[2021-05-14 05:09:36] [INFO ] Time to serialize properties into /tmp/LTL2301655202206647159.ltl : 0 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/LTL8247085653919245714.gal, -t, CGAL, -LTL, /tmp/LTL2301655202206647159.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/LTL8247085653919245714.gal -t CGAL -LTL /tmp/LTL2301655202206647159.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F(("((p1271==0)||(p1355==0))")||(G(F(("((p538!=0)&&(p1183!=0))")||(G("(p1112==1)")))))))))
Formula 0 simplified : !GF("((p1271==0)||(p1355==0))" | GF("((p538!=0)&&(p1183!=0))" | G"(p1112==1)"))
Detected timeout of ITS tools.
[2021-05-14 05:09:51] [INFO ] Flatten gal took : 47 ms
[2021-05-14 05:09:51] [INFO ] Applying decomposition
[2021-05-14 05:09:51] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3105254046815732226.txt, -o, /tmp/graph3105254046815732226.bin, -w, /tmp/graph3105254046815732226.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph3105254046815732226.bin, -l, -1, -v, -w, /tmp/graph3105254046815732226.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 05:09:51] [INFO ] Decomposing Gal with order
[2021-05-14 05:09:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 05:09:51] [INFO ] Removed a total of 517 redundant transitions.
[2021-05-14 05:09:51] [INFO ] Flatten gal took : 124 ms
[2021-05-14 05:09:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 608 labels/synchronizations in 24 ms.
[2021-05-14 05:09:51] [INFO ] Time to serialize gal into /tmp/LTL1973640756579953123.gal : 9 ms
[2021-05-14 05:09:51] [INFO ] Time to serialize properties into /tmp/LTL10105213322801121911.ltl : 0 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/LTL1973640756579953123.gal, -t, CGAL, -LTL, /tmp/LTL10105213322801121911.ltl, -c, -stutter-deadlock], 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/LTL1973640756579953123.gal -t CGAL -LTL /tmp/LTL10105213322801121911.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i7.u27.p1271==0)||(i7.u29.p1355==0))")||(G(F(("((i3.u11.p538!=0)&&(i6.u25.p1183!=0))")||(G("(i5.u20.p1112==1)")))))))))
Formula 0 simplified : !GF("((i7.u27.p1271==0)||(i7.u29.p1355==0))" | GF("((i3.u11.p538!=0)&&(i6.u25.p1183!=0))" | G"(i5.u20.p1112==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13161403127051531382
[2021-05-14 05:10:06] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13161403127051531382
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13161403127051531382]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13161403127051531382] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13161403127051531382] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property NoC3x3-PT-6B-05 finished in 36093 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(G(p1))||p0)))], workingDir=/home/mcc/execution]
Support contains 5 out of 943 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 943/943 places, 1445/1445 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 925 transition count 1403
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 925 transition count 1403
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 43 place count 918 transition count 1388
Iterating global reduction 0 with 7 rules applied. Total rules applied 50 place count 918 transition count 1388
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 53 place count 918 transition count 1385
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 61 place count 910 transition count 1371
Iterating global reduction 1 with 8 rules applied. Total rules applied 69 place count 910 transition count 1371
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 73 place count 906 transition count 1365
Iterating global reduction 1 with 4 rules applied. Total rules applied 77 place count 906 transition count 1365
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 80 place count 903 transition count 1360
Iterating global reduction 1 with 3 rules applied. Total rules applied 83 place count 903 transition count 1360
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 87 place count 903 transition count 1356
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 89 place count 901 transition count 1353
Iterating global reduction 2 with 2 rules applied. Total rules applied 91 place count 901 transition count 1353
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 92 place count 900 transition count 1352
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 900 transition count 1352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 94 place count 900 transition count 1351
Applied a total of 94 rules in 177 ms. Remains 900 /943 variables (removed 43) and now considering 1351/1445 (removed 94) transitions.
// Phase 1: matrix 1351 rows 900 cols
[2021-05-14 05:10:07] [INFO ] Computed 66 place invariants in 3 ms
[2021-05-14 05:10:08] [INFO ] Implicit Places using invariants in 312 ms returned []
// Phase 1: matrix 1351 rows 900 cols
[2021-05-14 05:10:08] [INFO ] Computed 66 place invariants in 4 ms
[2021-05-14 05:10:08] [INFO ] Implicit Places using invariants and state equation in 778 ms returned []
Implicit Place search using SMT with State Equation took 1092 ms to find 0 implicit places.
// Phase 1: matrix 1351 rows 900 cols
[2021-05-14 05:10:08] [INFO ] Computed 66 place invariants in 4 ms
[2021-05-14 05:10:09] [INFO ] Dead Transitions using invariants and state equation in 576 ms returned []
Finished structural reductions, in 1 iterations. Remains : 900/943 places, 1351/1445 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-6B-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s775 1) (AND (EQ s679 1) (EQ s695 1))), p1:(OR (NEQ s79 1) (NEQ s96 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 18233 steps with 40 reset in 58 ms.
FORMULA NoC3x3-PT-6B-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-06 finished in 2014 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X(X((p1||G(p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 943 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 943/943 places, 1445/1445 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 927 transition count 1409
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 927 transition count 1409
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 921 transition count 1396
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 921 transition count 1396
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 921 transition count 1393
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 54 place count 914 transition count 1381
Iterating global reduction 1 with 7 rules applied. Total rules applied 61 place count 914 transition count 1381
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 64 place count 911 transition count 1376
Iterating global reduction 1 with 3 rules applied. Total rules applied 67 place count 911 transition count 1376
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 70 place count 908 transition count 1371
Iterating global reduction 1 with 3 rules applied. Total rules applied 73 place count 908 transition count 1371
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 77 place count 908 transition count 1367
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 79 place count 906 transition count 1364
Iterating global reduction 2 with 2 rules applied. Total rules applied 81 place count 906 transition count 1364
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 82 place count 905 transition count 1363
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 905 transition count 1363
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 85 place count 905 transition count 1361
Applied a total of 85 rules in 147 ms. Remains 905 /943 variables (removed 38) and now considering 1361/1445 (removed 84) transitions.
// Phase 1: matrix 1361 rows 905 cols
[2021-05-14 05:10:09] [INFO ] Computed 66 place invariants in 3 ms
[2021-05-14 05:10:10] [INFO ] Implicit Places using invariants in 271 ms returned []
// Phase 1: matrix 1361 rows 905 cols
[2021-05-14 05:10:10] [INFO ] Computed 66 place invariants in 14 ms
[2021-05-14 05:10:10] [INFO ] Implicit Places using invariants and state equation in 795 ms returned []
Implicit Place search using SMT with State Equation took 1070 ms to find 0 implicit places.
// Phase 1: matrix 1361 rows 905 cols
[2021-05-14 05:10:10] [INFO ] Computed 66 place invariants in 5 ms
[2021-05-14 05:10:11] [INFO ] Dead Transitions using invariants and state equation in 595 ms returned []
Finished structural reductions, in 1 iterations. Remains : 905/943 places, 1361/1445 transitions.
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-6B-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 6}, { cond=(NOT p0), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(NOT p1), acceptance={} source=7 dest: 3}]], initial=0, aps=[p0:(AND (EQ s858 1) (EQ s881 1)), p1:(NEQ s503 1), p2:(AND (EQ s635 1) (EQ s857 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 595 ms.
Product exploration explored 100000 steps with 33333 reset in 587 ms.
Knowledge obtained : [(NOT p0), p1, (NOT p2)]
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 33333 reset in 598 ms.
Product exploration explored 100000 steps with 33333 reset in 623 ms.
Applying partial POR strategy [false, false, false, true, true, true, false, false]
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Support contains 5 out of 905 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 905/905 places, 1361/1361 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 905 transition count 1361
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 97 Pre rules applied. Total rules applied 28 place count 905 transition count 1669
Deduced a syphon composed of 125 places in 3 ms
Iterating global reduction 1 with 97 rules applied. Total rules applied 125 place count 905 transition count 1669
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 149 place count 881 transition count 1495
Deduced a syphon composed of 125 places in 3 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 173 place count 881 transition count 1495
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 197 place count 857 transition count 1321
Deduced a syphon composed of 101 places in 3 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 221 place count 857 transition count 1321
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 279 places in 1 ms
Iterating global reduction 1 with 178 rules applied. Total rules applied 399 place count 857 transition count 1321
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 455 place count 801 transition count 1265
Deduced a syphon composed of 223 places in 0 ms
Iterating global reduction 1 with 56 rules applied. Total rules applied 511 place count 801 transition count 1265
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -334
Deduced a syphon composed of 324 places in 0 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 612 place count 801 transition count 1599
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -124
Deduced a syphon composed of 360 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 648 place count 801 transition count 1723
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 649 place count 800 transition count 1721
Deduced a syphon composed of 359 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 650 place count 800 transition count 1721
Deduced a syphon composed of 359 places in 0 ms
Drop transitions removed 60 transitions
Redundant transition composition rules discarded 60 transitions
Iterating global reduction 1 with 60 rules applied. Total rules applied 710 place count 800 transition count 1661
Deduced a syphon composed of 359 places in 0 ms
Applied a total of 710 rules in 300 ms. Remains 800 /905 variables (removed 105) and now considering 1661/1361 (removed -300) transitions.
[2021-05-14 05:10:14] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 1661 rows 800 cols
[2021-05-14 05:10:14] [INFO ] Computed 66 place invariants in 7 ms
[2021-05-14 05:10:15] [INFO ] Dead Transitions using invariants and state equation in 769 ms returned []
Finished structural reductions, in 1 iterations. Remains : 800/905 places, 1661/1361 transitions.
Product exploration explored 100000 steps with 33333 reset in 2693 ms.
Product exploration explored 100000 steps with 33333 reset in 2512 ms.
[2021-05-14 05:10:21] [INFO ] Flatten gal took : 48 ms
[2021-05-14 05:10:21] [INFO ] Flatten gal took : 47 ms
[2021-05-14 05:10:21] [INFO ] Time to serialize gal into /tmp/LTL13994480745460897724.gal : 7 ms
[2021-05-14 05:10:21] [INFO ] Time to serialize properties into /tmp/LTL17468282716200162636.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/LTL13994480745460897724.gal, -t, CGAL, -LTL, /tmp/LTL17468282716200162636.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/LTL13994480745460897724.gal -t CGAL -LTL /tmp/LTL17468282716200162636.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((("((p1481==1)&&(p1512==1))")U(X(X(("(p815!=1)")||(G("((p1084==1)&&(p1480==1))")))))))
Formula 0 simplified : !("((p1481==1)&&(p1512==1))" U XX("(p815!=1)" | G"((p1084==1)&&(p1480==1))"))
Detected timeout of ITS tools.
[2021-05-14 05:10:36] [INFO ] Flatten gal took : 50 ms
[2021-05-14 05:10:36] [INFO ] Applying decomposition
[2021-05-14 05:10:36] [INFO ] Flatten gal took : 45 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph336721819671909024.txt, -o, /tmp/graph336721819671909024.bin, -w, /tmp/graph336721819671909024.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph336721819671909024.bin, -l, -1, -v, -w, /tmp/graph336721819671909024.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 05:10:36] [INFO ] Decomposing Gal with order
[2021-05-14 05:10:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 05:10:36] [INFO ] Removed a total of 1301 redundant transitions.
[2021-05-14 05:10:36] [INFO ] Flatten gal took : 99 ms
[2021-05-14 05:10:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 195 labels/synchronizations in 41 ms.
[2021-05-14 05:10:36] [INFO ] Time to serialize gal into /tmp/LTL10354270857575423433.gal : 12 ms
[2021-05-14 05:10:36] [INFO ] Time to serialize properties into /tmp/LTL17555601336886095242.ltl : 0 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/LTL10354270857575423433.gal, -t, CGAL, -LTL, /tmp/LTL17555601336886095242.ltl, -c, -stutter-deadlock], 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/LTL10354270857575423433.gal -t CGAL -LTL /tmp/LTL17555601336886095242.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((("((i10.u230.p1481==1)&&(i10.u315.p1512==1))")U(X(X(("(i5.u184.p815!=1)")||(G("((i10.u230.p1084==1)&&(i10.u230.p1480==1))")))))))
Formula 0 simplified : !("((i10.u230.p1481==1)&&(i10.u315.p1512==1))" U XX("(i5.u184.p815!=1)" | G"((i10.u230.p1084==1)&&(i10.u230.p1480==1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1149812707815678222
[2021-05-14 05:10:51] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1149812707815678222
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin1149812707815678222]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin1149812707815678222] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin1149812707815678222] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property NoC3x3-PT-6B-07 finished in 43107 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 943 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 943/943 places, 1445/1445 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 925 transition count 1403
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 925 transition count 1403
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 43 place count 918 transition count 1388
Iterating global reduction 0 with 7 rules applied. Total rules applied 50 place count 918 transition count 1388
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 53 place count 918 transition count 1385
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 61 place count 910 transition count 1371
Iterating global reduction 1 with 8 rules applied. Total rules applied 69 place count 910 transition count 1371
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 73 place count 906 transition count 1365
Iterating global reduction 1 with 4 rules applied. Total rules applied 77 place count 906 transition count 1365
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 80 place count 903 transition count 1360
Iterating global reduction 1 with 3 rules applied. Total rules applied 83 place count 903 transition count 1360
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 87 place count 903 transition count 1356
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 89 place count 901 transition count 1353
Iterating global reduction 2 with 2 rules applied. Total rules applied 91 place count 901 transition count 1353
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 92 place count 900 transition count 1352
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 900 transition count 1352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 94 place count 900 transition count 1351
Applied a total of 94 rules in 185 ms. Remains 900 /943 variables (removed 43) and now considering 1351/1445 (removed 94) transitions.
// Phase 1: matrix 1351 rows 900 cols
[2021-05-14 05:10:52] [INFO ] Computed 66 place invariants in 4 ms
[2021-05-14 05:10:53] [INFO ] Implicit Places using invariants in 382 ms returned []
// Phase 1: matrix 1351 rows 900 cols
[2021-05-14 05:10:53] [INFO ] Computed 66 place invariants in 3 ms
[2021-05-14 05:10:54] [INFO ] Implicit Places using invariants and state equation in 815 ms returned []
Implicit Place search using SMT with State Equation took 1215 ms to find 0 implicit places.
// Phase 1: matrix 1351 rows 900 cols
[2021-05-14 05:10:54] [INFO ] Computed 66 place invariants in 4 ms
[2021-05-14 05:10:54] [INFO ] Dead Transitions using invariants and state equation in 564 ms returned []
Finished structural reductions, in 1 iterations. Remains : 900/943 places, 1351/1445 transitions.
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6B-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s137 1) (NEQ s218 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 87220 steps with 194 reset in 288 ms.
FORMULA NoC3x3-PT-6B-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-08 finished in 2341 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U X(p1))))], workingDir=/home/mcc/execution]
Support contains 1 out of 943 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 943/943 places, 1445/1445 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 925 transition count 1403
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 925 transition count 1403
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 43 place count 918 transition count 1388
Iterating global reduction 0 with 7 rules applied. Total rules applied 50 place count 918 transition count 1388
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 53 place count 918 transition count 1385
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 61 place count 910 transition count 1371
Iterating global reduction 1 with 8 rules applied. Total rules applied 69 place count 910 transition count 1371
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 73 place count 906 transition count 1365
Iterating global reduction 1 with 4 rules applied. Total rules applied 77 place count 906 transition count 1365
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 80 place count 903 transition count 1360
Iterating global reduction 1 with 3 rules applied. Total rules applied 83 place count 903 transition count 1360
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 87 place count 903 transition count 1356
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 89 place count 901 transition count 1353
Iterating global reduction 2 with 2 rules applied. Total rules applied 91 place count 901 transition count 1353
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 92 place count 900 transition count 1352
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 900 transition count 1352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 94 place count 900 transition count 1351
Applied a total of 94 rules in 214 ms. Remains 900 /943 variables (removed 43) and now considering 1351/1445 (removed 94) transitions.
// Phase 1: matrix 1351 rows 900 cols
[2021-05-14 05:10:55] [INFO ] Computed 66 place invariants in 4 ms
[2021-05-14 05:10:55] [INFO ] Implicit Places using invariants in 298 ms returned []
// Phase 1: matrix 1351 rows 900 cols
[2021-05-14 05:10:55] [INFO ] Computed 66 place invariants in 4 ms
[2021-05-14 05:10:56] [INFO ] Implicit Places using invariants and state equation in 818 ms returned []
Implicit Place search using SMT with State Equation took 1117 ms to find 0 implicit places.
// Phase 1: matrix 1351 rows 900 cols
[2021-05-14 05:10:56] [INFO ] Computed 66 place invariants in 3 ms
[2021-05-14 05:10:56] [INFO ] Dead Transitions using invariants and state equation in 543 ms returned []
Finished structural reductions, in 1 iterations. Remains : 900/943 places, 1351/1445 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : NoC3x3-PT-6B-09 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p0:(EQ s623 0), p1:(EQ s623 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, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 413 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-6B-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-09 finished in 2006 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 943 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 943/943 places, 1445/1445 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 925 transition count 1403
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 925 transition count 1403
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 43 place count 918 transition count 1388
Iterating global reduction 0 with 7 rules applied. Total rules applied 50 place count 918 transition count 1388
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 53 place count 918 transition count 1385
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 61 place count 910 transition count 1371
Iterating global reduction 1 with 8 rules applied. Total rules applied 69 place count 910 transition count 1371
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 72 place count 907 transition count 1367
Iterating global reduction 1 with 3 rules applied. Total rules applied 75 place count 907 transition count 1367
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 77 place count 905 transition count 1363
Iterating global reduction 1 with 2 rules applied. Total rules applied 79 place count 905 transition count 1363
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 81 place count 903 transition count 1360
Iterating global reduction 1 with 2 rules applied. Total rules applied 83 place count 903 transition count 1360
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 84 place count 902 transition count 1359
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 902 transition count 1359
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 86 place count 902 transition count 1358
Applied a total of 86 rules in 142 ms. Remains 902 /943 variables (removed 41) and now considering 1358/1445 (removed 87) transitions.
// Phase 1: matrix 1358 rows 902 cols
[2021-05-14 05:10:57] [INFO ] Computed 66 place invariants in 3 ms
[2021-05-14 05:10:57] [INFO ] Implicit Places using invariants in 633 ms returned []
// Phase 1: matrix 1358 rows 902 cols
[2021-05-14 05:10:57] [INFO ] Computed 66 place invariants in 4 ms
[2021-05-14 05:10:58] [INFO ] Implicit Places using invariants and state equation in 855 ms returned []
Implicit Place search using SMT with State Equation took 1491 ms to find 0 implicit places.
// Phase 1: matrix 1358 rows 902 cols
[2021-05-14 05:10:58] [INFO ] Computed 66 place invariants in 4 ms
[2021-05-14 05:10:59] [INFO ] Dead Transitions using invariants and state equation in 565 ms returned []
Finished structural reductions, in 1 iterations. Remains : 902/943 places, 1358/1445 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6B-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s432 1) (EQ s471 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][false, false]]
Stuttering criterion allowed to conclude after 574 steps with 0 reset in 7 ms.
FORMULA NoC3x3-PT-6B-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-11 finished in 2278 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 943 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 943/943 places, 1445/1445 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 925 transition count 1403
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 925 transition count 1403
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 43 place count 918 transition count 1388
Iterating global reduction 0 with 7 rules applied. Total rules applied 50 place count 918 transition count 1388
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 53 place count 918 transition count 1385
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 61 place count 910 transition count 1371
Iterating global reduction 1 with 8 rules applied. Total rules applied 69 place count 910 transition count 1371
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 73 place count 906 transition count 1365
Iterating global reduction 1 with 4 rules applied. Total rules applied 77 place count 906 transition count 1365
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 80 place count 903 transition count 1360
Iterating global reduction 1 with 3 rules applied. Total rules applied 83 place count 903 transition count 1360
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 87 place count 903 transition count 1356
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 89 place count 901 transition count 1353
Iterating global reduction 2 with 2 rules applied. Total rules applied 91 place count 901 transition count 1353
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 92 place count 900 transition count 1352
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 900 transition count 1352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 94 place count 900 transition count 1351
Applied a total of 94 rules in 126 ms. Remains 900 /943 variables (removed 43) and now considering 1351/1445 (removed 94) transitions.
// Phase 1: matrix 1351 rows 900 cols
[2021-05-14 05:10:59] [INFO ] Computed 66 place invariants in 3 ms
[2021-05-14 05:10:59] [INFO ] Implicit Places using invariants in 310 ms returned []
// Phase 1: matrix 1351 rows 900 cols
[2021-05-14 05:10:59] [INFO ] Computed 66 place invariants in 4 ms
[2021-05-14 05:11:00] [INFO ] Implicit Places using invariants and state equation in 793 ms returned []
Implicit Place search using SMT with State Equation took 1134 ms to find 0 implicit places.
// Phase 1: matrix 1351 rows 900 cols
[2021-05-14 05:11:00] [INFO ] Computed 66 place invariants in 7 ms
[2021-05-14 05:11:01] [INFO ] Dead Transitions using invariants and state equation in 542 ms returned []
Finished structural reductions, in 1 iterations. Remains : 900/943 places, 1351/1445 transitions.
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6B-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s44 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, 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 0 ms.
FORMULA NoC3x3-PT-6B-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-13 finished in 1873 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (p1||X(G(p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 943 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 943/943 places, 1445/1445 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 927 transition count 1405
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 927 transition count 1405
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 921 transition count 1391
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 921 transition count 1391
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 921 transition count 1388
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 52 place count 916 transition count 1379
Iterating global reduction 1 with 5 rules applied. Total rules applied 57 place count 916 transition count 1379
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 913 transition count 1375
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 913 transition count 1375
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 911 transition count 1372
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 911 transition count 1372
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 71 place count 911 transition count 1368
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 910 transition count 1366
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 910 transition count 1366
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 909 transition count 1365
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 909 transition count 1365
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 909 transition count 1364
Applied a total of 76 rules in 126 ms. Remains 909 /943 variables (removed 34) and now considering 1364/1445 (removed 81) transitions.
// Phase 1: matrix 1364 rows 909 cols
[2021-05-14 05:11:01] [INFO ] Computed 66 place invariants in 4 ms
[2021-05-14 05:11:01] [INFO ] Implicit Places using invariants in 299 ms returned []
// Phase 1: matrix 1364 rows 909 cols
[2021-05-14 05:11:01] [INFO ] Computed 66 place invariants in 3 ms
[2021-05-14 05:11:02] [INFO ] Implicit Places using invariants and state equation in 805 ms returned []
Implicit Place search using SMT with State Equation took 1105 ms to find 0 implicit places.
// Phase 1: matrix 1364 rows 909 cols
[2021-05-14 05:11:02] [INFO ] Computed 66 place invariants in 3 ms
[2021-05-14 05:11:02] [INFO ] Dead Transitions using invariants and state equation in 556 ms returned []
Finished structural reductions, in 1 iterations. Remains : 909/943 places, 1364/1445 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : NoC3x3-PT-6B-14 automaton TGBA [mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p2:(EQ s38 1), p1:(EQ s523 1), p0:(EQ s506 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-6B-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-14 finished in 1972 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((X(p0)&&F(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 943 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 943/943 places, 1445/1445 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 927 transition count 1406
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 927 transition count 1406
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 921 transition count 1393
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 921 transition count 1393
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 921 transition count 1390
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 54 place count 914 transition count 1378
Iterating global reduction 1 with 7 rules applied. Total rules applied 61 place count 914 transition count 1378
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 65 place count 910 transition count 1372
Iterating global reduction 1 with 4 rules applied. Total rules applied 69 place count 910 transition count 1372
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 72 place count 907 transition count 1367
Iterating global reduction 1 with 3 rules applied. Total rules applied 75 place count 907 transition count 1367
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 79 place count 907 transition count 1363
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 81 place count 905 transition count 1360
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 905 transition count 1360
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 904 transition count 1359
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 904 transition count 1359
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 86 place count 904 transition count 1358
Applied a total of 86 rules in 125 ms. Remains 904 /943 variables (removed 39) and now considering 1358/1445 (removed 87) transitions.
// Phase 1: matrix 1358 rows 904 cols
[2021-05-14 05:11:03] [INFO ] Computed 66 place invariants in 4 ms
[2021-05-14 05:11:03] [INFO ] Implicit Places using invariants in 301 ms returned []
// Phase 1: matrix 1358 rows 904 cols
[2021-05-14 05:11:03] [INFO ] Computed 66 place invariants in 3 ms
[2021-05-14 05:11:04] [INFO ] Implicit Places using invariants and state equation in 778 ms returned []
Implicit Place search using SMT with State Equation took 1080 ms to find 0 implicit places.
// Phase 1: matrix 1358 rows 904 cols
[2021-05-14 05:11:04] [INFO ] Computed 66 place invariants in 3 ms
[2021-05-14 05:11:04] [INFO ] Dead Transitions using invariants and state equation in 566 ms returned []
Finished structural reductions, in 1 iterations. Remains : 904/943 places, 1358/1445 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : NoC3x3-PT-6B-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (NEQ s407 1) (NEQ s547 1)), p0:(NEQ s412 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20017 reset in 422 ms.
Product exploration explored 100000 steps with 20005 reset in 441 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Product exploration explored 100000 steps with 20007 reset in 437 ms.
Product exploration explored 100000 steps with 20028 reset in 440 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Support contains 3 out of 904 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 904/904 places, 1358/1358 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 904 transition count 1358
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 96 Pre rules applied. Total rules applied 27 place count 904 transition count 1660
Deduced a syphon composed of 123 places in 3 ms
Iterating global reduction 1 with 96 rules applied. Total rules applied 123 place count 904 transition count 1660
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 146 place count 881 transition count 1493
Deduced a syphon composed of 123 places in 3 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 169 place count 881 transition count 1493
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 192 place count 858 transition count 1326
Deduced a syphon composed of 100 places in 3 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 215 place count 858 transition count 1326
Performed 181 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 281 places in 0 ms
Iterating global reduction 1 with 181 rules applied. Total rules applied 396 place count 858 transition count 1326
Discarding 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 454 place count 800 transition count 1262
Deduced a syphon composed of 224 places in 1 ms
Iterating global reduction 1 with 58 rules applied. Total rules applied 512 place count 800 transition count 1262
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -336
Deduced a syphon composed of 325 places in 1 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 613 place count 800 transition count 1598
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -126
Deduced a syphon composed of 362 places in 0 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 650 place count 800 transition count 1724
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 651 place count 799 transition count 1722
Deduced a syphon composed of 361 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 652 place count 799 transition count 1722
Deduced a syphon composed of 361 places in 0 ms
Drop transitions removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 1 with 58 rules applied. Total rules applied 710 place count 799 transition count 1664
Deduced a syphon composed of 361 places in 0 ms
Applied a total of 710 rules in 194 ms. Remains 799 /904 variables (removed 105) and now considering 1664/1358 (removed -306) transitions.
[2021-05-14 05:11:07] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 1664 rows 799 cols
[2021-05-14 05:11:07] [INFO ] Computed 66 place invariants in 9 ms
[2021-05-14 05:11:08] [INFO ] Dead Transitions using invariants and state equation in 674 ms returned []
Finished structural reductions, in 1 iterations. Remains : 799/904 places, 1664/1358 transitions.
Product exploration explored 100000 steps with 20030 reset in 1658 ms.
Product exploration explored 100000 steps with 20037 reset in 1675 ms.
[2021-05-14 05:11:11] [INFO ] Flatten gal took : 42 ms
[2021-05-14 05:11:11] [INFO ] Flatten gal took : 41 ms
[2021-05-14 05:11:11] [INFO ] Time to serialize gal into /tmp/LTL521254697312312611.gal : 5 ms
[2021-05-14 05:11:11] [INFO ] Time to serialize properties into /tmp/LTL2891652661466632402.ltl : 0 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/LTL521254697312312611.gal, -t, CGAL, -LTL, /tmp/LTL2891652661466632402.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/LTL521254697312312611.gal -t CGAL -LTL /tmp/LTL2891652661466632402.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(G((X("(p633!=1)"))&&(F("((p628!=1)||(p914!=1))")))))))
Formula 0 simplified : !XXG(X"(p633!=1)" & F"((p628!=1)||(p914!=1))")
Detected timeout of ITS tools.
[2021-05-14 05:11:26] [INFO ] Flatten gal took : 41 ms
[2021-05-14 05:11:26] [INFO ] Applying decomposition
[2021-05-14 05:11:26] [INFO ] Flatten gal took : 53 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph16364194631036590801.txt, -o, /tmp/graph16364194631036590801.bin, -w, /tmp/graph16364194631036590801.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph16364194631036590801.bin, -l, -1, -v, -w, /tmp/graph16364194631036590801.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 05:11:26] [INFO ] Decomposing Gal with order
[2021-05-14 05:11:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 05:11:26] [INFO ] Removed a total of 1285 redundant transitions.
[2021-05-14 05:11:26] [INFO ] Flatten gal took : 91 ms
[2021-05-14 05:11:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 192 labels/synchronizations in 29 ms.
[2021-05-14 05:11:27] [INFO ] Time to serialize gal into /tmp/LTL9603854388872079082.gal : 19 ms
[2021-05-14 05:11:27] [INFO ] Time to serialize properties into /tmp/LTL2942631920656866752.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/LTL9603854388872079082.gal, -t, CGAL, -LTL, /tmp/LTL2942631920656866752.ltl, -c, -stutter-deadlock], 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/LTL9603854388872079082.gal -t CGAL -LTL /tmp/LTL2942631920656866752.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(G((X("(i5.u148.p633!=1)"))&&(F("((i6.i0.i2.u147.p628!=1)||(i6.i0.i0.u199.p914!=1))")))))))
Formula 0 simplified : !XXG(X"(i5.u148.p633!=1)" & F"((i6.i0.i2.u147.p628!=1)||(i6.i0.i0.u199.p914!=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14220676926772677143
[2021-05-14 05:11:42] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14220676926772677143
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14220676926772677143]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14220676926772677143] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14220676926772677143] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property NoC3x3-PT-6B-15 finished in 39928 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9825093133123362146
[2021-05-14 05:11:43] [INFO ] Computing symmetric may disable matrix : 1445 transitions.
[2021-05-14 05:11:43] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 05:11:43] [INFO ] Computing symmetric may enable matrix : 1445 transitions.
[2021-05-14 05:11:43] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 05:11:43] [INFO ] Applying decomposition
[2021-05-14 05:11:43] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph8571554668055559992.txt, -o, /tmp/graph8571554668055559992.bin, -w, /tmp/graph8571554668055559992.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph8571554668055559992.bin, -l, -1, -v, -w, /tmp/graph8571554668055559992.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 05:11:43] [INFO ] Decomposing Gal with order
[2021-05-14 05:11:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 05:11:43] [INFO ] Computing Do-Not-Accords matrix : 1445 transitions.
[2021-05-14 05:11:43] [INFO ] Computation of Completed DNA matrix. took 51 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 05:11:43] [INFO ] Built C files in 387ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9825093133123362146
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9825093133123362146]
[2021-05-14 05:11:43] [INFO ] Removed a total of 1413 redundant transitions.
[2021-05-14 05:11:43] [INFO ] Flatten gal took : 119 ms
[2021-05-14 05:11:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 160 labels/synchronizations in 21 ms.
[2021-05-14 05:11:43] [INFO ] Time to serialize gal into /tmp/LTLFireability17411661450114229224.gal : 8 ms
[2021-05-14 05:11:43] [INFO ] Time to serialize properties into /tmp/LTLFireability15016967166810382482.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/LTLFireability17411661450114229224.gal, -t, CGAL, -LTL, /tmp/LTLFireability15016967166810382482.ltl, -c, -stutter-deadlock], 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/LTLFireability17411661450114229224.gal -t CGAL -LTL /tmp/LTLFireability15016967166810382482.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !((G(F(("((i11.i0.i0.u273.p1271==0)||(i11.i0.i2.u294.p1355==0))")||(G(F((!("((i10.u252.p538==0)||(i10.u253.p1183==0))"))||(G("(i9.i0.i4.u240.p1112==1)")))))))))
Formula 0 simplified : !GF("((i11.i0.i0.u273.p1271==0)||(i11.i0.i2.u294.p1355==0))" | GF(!"((i10.u252.p538==0)||(i10.u253.p1183==0))" | G"(i9.i0.i4.u240.p1112==1)"))
Compilation finished in 13183 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin9825093133123362146]
Link finished in 88 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>(([](<>(((LTLAPp1==true)||[]((LTLAPp2==true)))))||(LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin9825093133123362146]
WARNING : LTSmin timed out (>300 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>(([](<>(((LTLAPp1==true)||[]((LTLAPp2==true)))))||(LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin9825093133123362146]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, ((LTLAPp3==true) U X(X(((LTLAPp4==true)||[]((LTLAPp5==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin9825093133123362146]
LTSmin run took 314 ms.
FORMULA NoC3x3-PT-6B-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X([]((X((LTLAPp6==true))&&<>((LTLAPp7==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin9825093133123362146]
WARNING : LTSmin timed out (>300 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X([]((X((LTLAPp6==true))&&<>((LTLAPp7==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin9825093133123362146]
Retrying LTSmin with larger timeout 2400 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>(([](<>(((LTLAPp1==true)||[]((LTLAPp2==true)))))||(LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin9825093133123362146]
Detected timeout of ITS tools.
[2021-05-14 05:32:31] [INFO ] Applying decomposition
[2021-05-14 05:32:31] [INFO ] Flatten gal took : 82 ms
[2021-05-14 05:32:31] [INFO ] Decomposing Gal with order
[2021-05-14 05:32:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 05:32:31] [INFO ] Removed a total of 985 redundant transitions.
[2021-05-14 05:32:31] [INFO ] Flatten gal took : 259 ms
[2021-05-14 05:32:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 2141 labels/synchronizations in 287 ms.
[2021-05-14 05:32:32] [INFO ] Time to serialize gal into /tmp/LTLFireability4398999947233874586.gal : 5 ms
[2021-05-14 05:32:32] [INFO ] Time to serialize properties into /tmp/LTLFireability4142562414593376935.ltl : 0 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/LTLFireability4398999947233874586.gal, -t, CGAL, -LTL, /tmp/LTLFireability4142562414593376935.ltl, -c, -stutter-deadlock], 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/LTLFireability4398999947233874586.gal -t CGAL -LTL /tmp/LTLFireability4142562414593376935.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((G(F(("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u117.p1271==0)||(i0.i0.i0.i0.i0.i0.i0.i0.u122.p1355==0))")||(G(F((!("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u91.p538==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u111.p1183==0))"))||(G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u109.p1112==1)")))))))))
Formula 0 simplified : !GF("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u117.p1271==0)||(i0.i0.i0.i0.i0.i0.i0.i0.u122.p1355==0))" | GF(!"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u91.p538==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u111.p1183==0))" | G"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u109.p1112==1)"))
Detected timeout of ITS tools.
[2021-05-14 05:53:22] [INFO ] Flatten gal took : 311 ms
[2021-05-14 05:53:23] [INFO ] Input system was already deterministic with 1445 transitions.
[2021-05-14 05:53:23] [INFO ] Transformed 943 places.
[2021-05-14 05:53:23] [INFO ] Transformed 1445 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-14 05:53:23] [INFO ] Time to serialize gal into /tmp/LTLFireability14990257215754663083.gal : 9 ms
[2021-05-14 05:53:23] [INFO ] Time to serialize properties into /tmp/LTLFireability11289837058327400921.ltl : 0 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/LTLFireability14990257215754663083.gal, -t, CGAL, -LTL, /tmp/LTLFireability11289837058327400921.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --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/LTLFireability14990257215754663083.gal -t CGAL -LTL /tmp/LTLFireability11289837058327400921.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(("((p1271==0)||(p1355==0))")||(G(F((!("((p538==0)||(p1183==0))"))||(G("(p1112==1)")))))))))
Formula 0 simplified : !GF("((p1271==0)||(p1355==0))" | GF(!"((p538==0)||(p1183==0))" | G"(p1112==1)"))
WARNING : LTSmin timed out (>2400 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>(([](<>(((LTLAPp1==true)||[]((LTLAPp2==true)))))||(LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin9825093133123362146]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X([]((X((LTLAPp6==true))&&<>((LTLAPp7==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin9825093133123362146]
BK_TIME_CONFINEMENT_REACHED
--------------------
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
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
++ cut -d . -f 9
+ 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="NoC3x3-PT-6B"
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-6B, 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 r140-tall-162089127700317"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-6B.tgz
mv NoC3x3-PT-6B 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 '
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 ;