fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r007-tall-162037989600161
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for ASLink-PT-10b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16247.420 3600000.00 3054944.00 504307.00 F?F?TTFFFTT???FT 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.r007-tall-162037989600161.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 ASLink-PT-10b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037989600161
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Mar 28 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Mar 28 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.7K Mar 23 01:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 12K Mar 23 01:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 22 09:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 09:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1.4M 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 ASLink-PT-10b-00
FORMULA_NAME ASLink-PT-10b-01
FORMULA_NAME ASLink-PT-10b-02
FORMULA_NAME ASLink-PT-10b-03
FORMULA_NAME ASLink-PT-10b-04
FORMULA_NAME ASLink-PT-10b-05
FORMULA_NAME ASLink-PT-10b-06
FORMULA_NAME ASLink-PT-10b-07
FORMULA_NAME ASLink-PT-10b-08
FORMULA_NAME ASLink-PT-10b-09
FORMULA_NAME ASLink-PT-10b-10
FORMULA_NAME ASLink-PT-10b-11
FORMULA_NAME ASLink-PT-10b-12
FORMULA_NAME ASLink-PT-10b-13
FORMULA_NAME ASLink-PT-10b-14
FORMULA_NAME ASLink-PT-10b-15

=== Now, execution of the tool begins

BK_START 1620445865142

Running Version 0
[2021-05-08 03:51:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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-08 03:51:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 03:51:06] [INFO ] Load time of PNML (sax parser for PT used): 255 ms
[2021-05-08 03:51:07] [INFO ] Transformed 4410 places.
[2021-05-08 03:51:07] [INFO ] Transformed 5405 transitions.
[2021-05-08 03:51:07] [INFO ] Found NUPN structural information;
[2021-05-08 03:51:07] [INFO ] Parsed PT model containing 4410 places and 5405 transitions in 389 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2021-05-08 03:51:07] [INFO ] Initial state test concluded for 1 properties.
FORMULA ASLink-PT-10b-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10b-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10b-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10b-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 4410 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4410/4410 places, 5405/5405 transitions.
Discarding 271 places :
Symmetric choice reduction at 0 with 271 rule applications. Total rules 271 place count 4139 transition count 5134
Iterating global reduction 0 with 271 rules applied. Total rules applied 542 place count 4139 transition count 5134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 543 place count 4139 transition count 5133
Discarding 107 places :
Symmetric choice reduction at 1 with 107 rule applications. Total rules 650 place count 4032 transition count 4968
Iterating global reduction 1 with 107 rules applied. Total rules applied 757 place count 4032 transition count 4968
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 790 place count 4032 transition count 4935
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 804 place count 4018 transition count 4921
Iterating global reduction 2 with 14 rules applied. Total rules applied 818 place count 4018 transition count 4921
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 822 place count 4014 transition count 4910
Iterating global reduction 2 with 4 rules applied. Total rules applied 826 place count 4014 transition count 4910
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 829 place count 4011 transition count 4907
Iterating global reduction 2 with 3 rules applied. Total rules applied 832 place count 4011 transition count 4907
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 835 place count 4008 transition count 4897
Iterating global reduction 2 with 3 rules applied. Total rules applied 838 place count 4008 transition count 4897
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 839 place count 4007 transition count 4889
Iterating global reduction 2 with 1 rules applied. Total rules applied 840 place count 4007 transition count 4889
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 841 place count 4006 transition count 4888
Iterating global reduction 2 with 1 rules applied. Total rules applied 842 place count 4006 transition count 4888
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 843 place count 4005 transition count 4880
Iterating global reduction 2 with 1 rules applied. Total rules applied 844 place count 4005 transition count 4880
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 845 place count 4004 transition count 4872
Iterating global reduction 2 with 1 rules applied. Total rules applied 846 place count 4004 transition count 4872
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 847 place count 4003 transition count 4871
Iterating global reduction 2 with 1 rules applied. Total rules applied 848 place count 4003 transition count 4871
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 849 place count 4002 transition count 4863
Iterating global reduction 2 with 1 rules applied. Total rules applied 850 place count 4002 transition count 4863
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 851 place count 4001 transition count 4855
Iterating global reduction 2 with 1 rules applied. Total rules applied 852 place count 4001 transition count 4855
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 853 place count 4000 transition count 4854
Iterating global reduction 2 with 1 rules applied. Total rules applied 854 place count 4000 transition count 4854
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 855 place count 3999 transition count 4846
Iterating global reduction 2 with 1 rules applied. Total rules applied 856 place count 3999 transition count 4846
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 857 place count 3998 transition count 4838
Iterating global reduction 2 with 1 rules applied. Total rules applied 858 place count 3998 transition count 4838
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 859 place count 3997 transition count 4837
Iterating global reduction 2 with 1 rules applied. Total rules applied 860 place count 3997 transition count 4837
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 861 place count 3996 transition count 4829
Iterating global reduction 2 with 1 rules applied. Total rules applied 862 place count 3996 transition count 4829
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 863 place count 3995 transition count 4821
Iterating global reduction 2 with 1 rules applied. Total rules applied 864 place count 3995 transition count 4821
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 865 place count 3994 transition count 4820
Iterating global reduction 2 with 1 rules applied. Total rules applied 866 place count 3994 transition count 4820
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 867 place count 3993 transition count 4812
Iterating global reduction 2 with 1 rules applied. Total rules applied 868 place count 3993 transition count 4812
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 869 place count 3992 transition count 4804
Iterating global reduction 2 with 1 rules applied. Total rules applied 870 place count 3992 transition count 4804
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 871 place count 3991 transition count 4803
Iterating global reduction 2 with 1 rules applied. Total rules applied 872 place count 3991 transition count 4803
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 873 place count 3990 transition count 4795
Iterating global reduction 2 with 1 rules applied. Total rules applied 874 place count 3990 transition count 4795
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 875 place count 3989 transition count 4787
Iterating global reduction 2 with 1 rules applied. Total rules applied 876 place count 3989 transition count 4787
Applied a total of 876 rules in 9209 ms. Remains 3989 /4410 variables (removed 421) and now considering 4787/5405 (removed 618) transitions.
// Phase 1: matrix 4787 rows 3989 cols
[2021-05-08 03:51:17] [INFO ] Computed 433 place invariants in 495 ms
[2021-05-08 03:51:18] [INFO ] Implicit Places using invariants in 2088 ms returned []
// Phase 1: matrix 4787 rows 3989 cols
[2021-05-08 03:51:18] [INFO ] Computed 433 place invariants in 253 ms
[2021-05-08 03:51:20] [INFO ] Implicit Places using invariants and state equation in 1638 ms returned []
Implicit Place search using SMT with State Equation took 3752 ms to find 0 implicit places.
// Phase 1: matrix 4787 rows 3989 cols
[2021-05-08 03:51:20] [INFO ] Computed 433 place invariants in 107 ms
[2021-05-08 03:51:23] [INFO ] Dead Transitions using invariants and state equation in 2721 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3989/4410 places, 4787/5405 transitions.
[2021-05-08 03:51:23] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-08 03:51:23] [INFO ] Flatten gal took : 368 ms
FORMULA ASLink-PT-10b-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10b-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10b-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10b-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 03:51:23] [INFO ] Flatten gal took : 264 ms
[2021-05-08 03:51:24] [INFO ] Input system was already deterministic with 4787 transitions.
Incomplete random walk after 100000 steps, including 113 resets, run finished after 859 ms. (steps per millisecond=116 ) properties (out of 15) seen :10
Running SMT prover for 5 properties.
// Phase 1: matrix 4787 rows 3989 cols
[2021-05-08 03:51:25] [INFO ] Computed 433 place invariants in 104 ms
[2021-05-08 03:51:26] [INFO ] SMT Verify possible in real domain returnedunsat :0 sat :0 real:5
[2021-05-08 03:51:27] [INFO ] [Nat]Absence check using 102 positive place invariants in 44 ms returned sat
[2021-05-08 03:51:27] [INFO ] [Nat]Absence check using 102 positive and 331 generalized place invariants in 196 ms returned sat
[2021-05-08 03:51:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 03:51:34] [INFO ] [Nat]Absence check using state equation in 7057 ms returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 6140 ms.
[2021-05-08 03:51:40] [INFO ] SMT Verify possible in nat domain returned unsat :0 sat :5
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0 U (p1&&X(p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 3989 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3989/3989 places, 4787/4787 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 3985 transition count 4783
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 3985 transition count 4783
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 3983 transition count 4774
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 3983 transition count 4774
Applied a total of 12 rules in 999 ms. Remains 3983 /3989 variables (removed 6) and now considering 4774/4787 (removed 13) transitions.
// Phase 1: matrix 4774 rows 3983 cols
[2021-05-08 03:51:41] [INFO ] Computed 433 place invariants in 106 ms
[2021-05-08 03:51:43] [INFO ] Implicit Places using invariants in 1551 ms returned []
// Phase 1: matrix 4774 rows 3983 cols
[2021-05-08 03:51:43] [INFO ] Computed 433 place invariants in 106 ms
[2021-05-08 03:51:44] [INFO ] Implicit Places using invariants and state equation in 1451 ms returned []
Implicit Place search using SMT with State Equation took 3003 ms to find 0 implicit places.
// Phase 1: matrix 4774 rows 3983 cols
[2021-05-08 03:51:44] [INFO ] Computed 433 place invariants in 140 ms
[2021-05-08 03:51:47] [INFO ] Dead Transitions using invariants and state equation in 2605 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3983/3989 places, 4774/4787 transitions.
Stuttering acceptance computed with spot in 307 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : ASLink-PT-10b-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}, { cond=(AND p1 p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s1074 0), p0:(AND (OR (EQ s430 0) (EQ s3852 1)) (OR (EQ s3827 0) (EQ s2110 1))), p2:(AND (EQ s2110 0) (EQ s3827 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 655 steps with 0 reset in 15 ms.
FORMULA ASLink-PT-10b-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10b-00 finished in 7007 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((!p0||X(X(F((p1||G(p0))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 3989 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3989/3989 places, 4787/4787 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 3984 transition count 4782
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 3984 transition count 4782
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 3982 transition count 4773
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 3982 transition count 4773
Applied a total of 14 rules in 973 ms. Remains 3982 /3989 variables (removed 7) and now considering 4773/4787 (removed 14) transitions.
// Phase 1: matrix 4773 rows 3982 cols
[2021-05-08 03:51:48] [INFO ] Computed 433 place invariants in 103 ms
[2021-05-08 03:51:50] [INFO ] Implicit Places using invariants in 1374 ms returned []
// Phase 1: matrix 4773 rows 3982 cols
[2021-05-08 03:51:50] [INFO ] Computed 433 place invariants in 105 ms
[2021-05-08 03:51:51] [INFO ] Implicit Places using invariants and state equation in 1445 ms returned []
Implicit Place search using SMT with State Equation took 2820 ms to find 0 implicit places.
// Phase 1: matrix 4773 rows 3982 cols
[2021-05-08 03:51:51] [INFO ] Computed 433 place invariants in 104 ms
[2021-05-08 03:51:54] [INFO ] Dead Transitions using invariants and state equation in 2616 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3982/3989 places, 4773/4787 transitions.
Stuttering acceptance computed with spot in 75 ms :[false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-10b-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s2080 0) (EQ s858 1)), p1:(NEQ s3765 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 24935 reset in 1536 ms.
Product exploration explored 100000 steps with 24938 reset in 1446 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 66 ms :[false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25030 reset in 1633 ms.
Product exploration explored 100000 steps with 24945 reset in 1606 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 68 ms :[false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 3982 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 3982/3982 places, 4773/4773 transitions.
Performed 726 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 726 rules applied. Total rules applied 726 place count 3982 transition count 4773
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 727 place count 3982 transition count 4772
Performed 864 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 864 Pre rules applied. Total rules applied 727 place count 3982 transition count 6527
Deduced a syphon composed of 1590 places in 24 ms
Iterating global reduction 2 with 864 rules applied. Total rules applied 1591 place count 3982 transition count 6527
Discarding 355 places :
Symmetric choice reduction at 2 with 355 rule applications. Total rules 1946 place count 3627 transition count 6022
Deduced a syphon composed of 1235 places in 24 ms
Iterating global reduction 2 with 355 rules applied. Total rules applied 2301 place count 3627 transition count 6022
Performed 546 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1781 places in 21 ms
Iterating global reduction 2 with 546 rules applied. Total rules applied 2847 place count 3627 transition count 6023
Discarding 270 places :
Symmetric choice reduction at 2 with 270 rule applications. Total rules 3117 place count 3357 transition count 5751
Deduced a syphon composed of 1512 places in 38 ms
Iterating global reduction 2 with 270 rules applied. Total rules applied 3387 place count 3357 transition count 5751
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3388 place count 3356 transition count 5749
Deduced a syphon composed of 1512 places in 12 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 3389 place count 3356 transition count 5749
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 3391 place count 3356 transition count 5747
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: -233
Deduced a syphon composed of 1564 places in 13 ms
Iterating global reduction 3 with 52 rules applied. Total rules applied 3443 place count 3356 transition count 5980
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 3453 place count 3346 transition count 5960
Deduced a syphon composed of 1554 places in 13 ms
Iterating global reduction 3 with 10 rules applied. Total rules applied 3463 place count 3346 transition count 5960
Performed 10(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 1564 places in 13 ms
Iterating global reduction 3 with 10 rules applied. Total rules applied 3473 place count 3346 transition count 6052
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 3483 place count 3336 transition count 5996
Deduced a syphon composed of 1554 places in 13 ms
Iterating global reduction 3 with 10 rules applied. Total rules applied 3493 place count 3336 transition count 5996
Deduced a syphon composed of 1554 places in 11 ms
Applied a total of 3493 rules in 2622 ms. Remains 3336 /3982 variables (removed 646) and now considering 5996/4773 (removed -1223) transitions.
[2021-05-08 03:52:04] [INFO ] Redundant transitions in 555 ms returned []
// Phase 1: matrix 5996 rows 3336 cols
[2021-05-08 03:52:04] [INFO ] Computed 433 place invariants in 227 ms
[2021-05-08 03:52:07] [INFO ] Dead Transitions using invariants and state equation in 3715 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3336/3982 places, 5996/4773 transitions.
Product exploration explored 100000 steps with 24962 reset in 7131 ms.
Product exploration explored 100000 steps with 25053 reset in 6989 ms.
[2021-05-08 03:52:22] [INFO ] Flatten gal took : 165 ms
[2021-05-08 03:52:22] [INFO ] Flatten gal took : 158 ms
[2021-05-08 03:52:22] [INFO ] Time to serialize gal into /tmp/LTL10023721786484420727.gal : 96 ms
[2021-05-08 03:52:22] [INFO ] Time to serialize properties into /tmp/LTL14775478708100704889.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/LTL10023721786484420727.gal, -t, CGAL, -LTL, /tmp/LTL14775478708100704889.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/LTL10023721786484420727.gal -t CGAL -LTL /tmp/LTL14775478708100704889.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((X(X(F(("(p4159!=1)")||(G("((p2282==0)||(p937==1))"))))))||("((p2282!=0)&&(p937!=1))"))))
Formula 0 simplified : !G("((p2282!=0)&&(p937!=1))" | XXF("(p4159!=1)" | G"((p2282==0)||(p937==1))"))
Detected timeout of ITS tools.
[2021-05-08 03:52:37] [INFO ] Flatten gal took : 145 ms
[2021-05-08 03:52:37] [INFO ] Applying decomposition
[2021-05-08 03:52:37] [INFO ] Flatten gal took : 149 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/graph5149351469745413328.txt, -o, /tmp/graph5149351469745413328.bin, -w, /tmp/graph5149351469745413328.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/graph5149351469745413328.bin, -l, -1, -v, -w, /tmp/graph5149351469745413328.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 03:52:39] [INFO ] Decomposing Gal with order
[2021-05-08 03:52:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 03:52:40] [INFO ] Removed a total of 3479 redundant transitions.
[2021-05-08 03:52:40] [INFO ] Flatten gal took : 402 ms
[2021-05-08 03:52:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 65 ms.
[2021-05-08 03:52:40] [INFO ] Time to serialize gal into /tmp/LTL2895763167571127033.gal : 46 ms
[2021-05-08 03:52:40] [INFO ] Time to serialize properties into /tmp/LTL10251854627510996290.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/LTL2895763167571127033.gal, -t, CGAL, -LTL, /tmp/LTL10251854627510996290.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/LTL2895763167571127033.gal -t CGAL -LTL /tmp/LTL10251854627510996290.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G((X(X(F(("(i35.u1448.p4159!=1)")||(G("((i25.u796.p2282==0)||(i11.u324.p937==1))"))))))||("((i25.u796.p2282!=0)&&(i11.u324.p937!=1))"))))
Formula 0 simplified : !G("((i25.u796.p2282!=0)&&(i11.u324.p937!=1))" | XXF("(i35.u1448.p4159!=1)" | G"((i25.u796.p2282==0)||(i11.u324.p937==1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13891442875091757783
[2021-05-08 03:52:55] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13891442875091757783
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/ltsmin13891442875091757783]
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/ltsmin13891442875091757783] 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/ltsmin13891442875091757783] 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 ASLink-PT-10b-01 finished in 68752 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(F(p0))||G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 3989 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3989/3989 places, 4787/4787 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 3985 transition count 4783
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 3985 transition count 4783
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 3984 transition count 4782
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 3984 transition count 4782
Applied a total of 10 rules in 1054 ms. Remains 3984 /3989 variables (removed 5) and now considering 4782/4787 (removed 5) transitions.
// Phase 1: matrix 4782 rows 3984 cols
[2021-05-08 03:52:57] [INFO ] Computed 433 place invariants in 103 ms
[2021-05-08 03:52:59] [INFO ] Implicit Places using invariants in 1631 ms returned []
// Phase 1: matrix 4782 rows 3984 cols
[2021-05-08 03:52:59] [INFO ] Computed 433 place invariants in 103 ms
[2021-05-08 03:53:00] [INFO ] Implicit Places using invariants and state equation in 1494 ms returned []
Implicit Place search using SMT with State Equation took 3134 ms to find 0 implicit places.
// Phase 1: matrix 4782 rows 3984 cols
[2021-05-08 03:53:00] [INFO ] Computed 433 place invariants in 103 ms
[2021-05-08 03:53:03] [INFO ] Dead Transitions using invariants and state equation in 2786 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3984/3989 places, 4782/4787 transitions.
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-10b-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s494 0) (EQ s3703 1)), p0:(OR (EQ s3703 0) (EQ s494 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 143 reset in 638 ms.
Product exploration explored 100000 steps with 145 reset in 745 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 136 reset in 610 ms.
Product exploration explored 100000 steps with 137 reset in 638 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 4058 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 2 out of 3984 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 3984/3984 places, 4782/4782 transitions.
Performed 726 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 726 rules applied. Total rules applied 726 place count 3984 transition count 4782
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 727 place count 3984 transition count 4781
Performed 863 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 863 Pre rules applied. Total rules applied 727 place count 3984 transition count 6530
Deduced a syphon composed of 1589 places in 24 ms
Iterating global reduction 2 with 863 rules applied. Total rules applied 1590 place count 3984 transition count 6530
Discarding 355 places :
Symmetric choice reduction at 2 with 355 rule applications. Total rules 1945 place count 3629 transition count 6025
Deduced a syphon composed of 1234 places in 23 ms
Iterating global reduction 2 with 355 rules applied. Total rules applied 2300 place count 3629 transition count 6025
Performed 549 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1783 places in 14 ms
Iterating global reduction 2 with 549 rules applied. Total rules applied 2849 place count 3629 transition count 6026
Discarding 271 places :
Symmetric choice reduction at 2 with 271 rule applications. Total rules 3120 place count 3358 transition count 5753
Deduced a syphon composed of 1513 places in 13 ms
Iterating global reduction 2 with 271 rules applied. Total rules applied 3391 place count 3358 transition count 5753
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3392 place count 3357 transition count 5751
Deduced a syphon composed of 1513 places in 12 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 3393 place count 3357 transition count 5751
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 3395 place count 3357 transition count 5749
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: -233
Deduced a syphon composed of 1565 places in 20 ms
Iterating global reduction 3 with 52 rules applied. Total rules applied 3447 place count 3357 transition count 5982
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 3457 place count 3347 transition count 5962
Deduced a syphon composed of 1555 places in 15 ms
Iterating global reduction 3 with 10 rules applied. Total rules applied 3467 place count 3347 transition count 5962
Performed 10(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 1565 places in 14 ms
Iterating global reduction 3 with 10 rules applied. Total rules applied 3477 place count 3347 transition count 6054
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 3487 place count 3337 transition count 5998
Deduced a syphon composed of 1555 places in 15 ms
Iterating global reduction 3 with 10 rules applied. Total rules applied 3497 place count 3337 transition count 5998
Deduced a syphon composed of 1555 places in 15 ms
Applied a total of 3497 rules in 1639 ms. Remains 3337 /3984 variables (removed 647) and now considering 5998/4782 (removed -1216) transitions.
[2021-05-08 03:53:12] [INFO ] Redundant transitions in 584 ms returned []
// Phase 1: matrix 5998 rows 3337 cols
[2021-05-08 03:53:13] [INFO ] Computed 433 place invariants in 227 ms
[2021-05-08 03:53:16] [INFO ] Dead Transitions using invariants and state equation in 3849 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3337/3984 places, 5998/4782 transitions.
Product exploration explored 100000 steps with 608 reset in 857 ms.
Product exploration explored 100000 steps with 599 reset in 961 ms.
[2021-05-08 03:53:18] [INFO ] Flatten gal took : 154 ms
[2021-05-08 03:53:19] [INFO ] Flatten gal took : 166 ms
[2021-05-08 03:53:19] [INFO ] Time to serialize gal into /tmp/LTL2364517129629717791.gal : 16 ms
[2021-05-08 03:53:19] [INFO ] Time to serialize properties into /tmp/LTL1545142780097931378.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/LTL2364517129629717791.gal, -t, CGAL, -LTL, /tmp/LTL1545142780097931378.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/LTL2364517129629717791.gal -t CGAL -LTL /tmp/LTL1545142780097931378.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((G(F("((p4066==0)||(p537==1))")))||(G("((p537==0)&&(p4066==1))")))))
Formula 0 simplified : !X(GF"((p4066==0)||(p537==1))" | G"((p537==0)&&(p4066==1))")
Detected timeout of ITS tools.
[2021-05-08 03:53:34] [INFO ] Flatten gal took : 136 ms
[2021-05-08 03:53:34] [INFO ] Applying decomposition
[2021-05-08 03:53:34] [INFO ] Flatten gal took : 139 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/graph5257560890821592087.txt, -o, /tmp/graph5257560890821592087.bin, -w, /tmp/graph5257560890821592087.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/graph5257560890821592087.bin, -l, -1, -v, -w, /tmp/graph5257560890821592087.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 03:53:35] [INFO ] Decomposing Gal with order
[2021-05-08 03:53:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 03:53:36] [INFO ] Removed a total of 3477 redundant transitions.
[2021-05-08 03:53:36] [INFO ] Flatten gal took : 251 ms
[2021-05-08 03:53:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 48 ms.
[2021-05-08 03:53:36] [INFO ] Time to serialize gal into /tmp/LTL11297790840521438638.gal : 27 ms
[2021-05-08 03:53:36] [INFO ] Time to serialize properties into /tmp/LTL4312491109028490449.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/LTL11297790840521438638.gal, -t, CGAL, -LTL, /tmp/LTL4312491109028490449.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/LTL11297790840521438638.gal -t CGAL -LTL /tmp/LTL4312491109028490449.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((G(F("((i39.u1419.p4066==0)||(i8.i2.i0.u185.p537==1))")))||(G("((i8.i2.i0.u185.p537==0)&&(i39.u1419.p4066==1))")))))
Formula 0 simplified : !X(GF"((i39.u1419.p4066==0)||(i8.i2.i0.u185.p537==1))" | G"((i8.i2.i0.u185.p537==0)&&(i39.u1419.p4066==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14083123285986293205
[2021-05-08 03:53:51] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14083123285986293205
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/ltsmin14083123285986293205]
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/ltsmin14083123285986293205] 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/ltsmin14083123285986293205] 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 ASLink-PT-10b-03 finished in 56118 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 3989 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3989/3989 places, 4787/4787 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 3984 transition count 4782
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 3984 transition count 4782
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 3982 transition count 4773
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 3982 transition count 4773
Applied a total of 14 rules in 995 ms. Remains 3982 /3989 variables (removed 7) and now considering 4773/4787 (removed 14) transitions.
// Phase 1: matrix 4773 rows 3982 cols
[2021-05-08 03:53:53] [INFO ] Computed 433 place invariants in 103 ms
[2021-05-08 03:53:55] [INFO ] Implicit Places using invariants in 1672 ms returned []
// Phase 1: matrix 4773 rows 3982 cols
[2021-05-08 03:53:55] [INFO ] Computed 433 place invariants in 106 ms
[2021-05-08 03:53:56] [INFO ] Implicit Places using invariants and state equation in 1645 ms returned []
Implicit Place search using SMT with State Equation took 3319 ms to find 0 implicit places.
// Phase 1: matrix 4773 rows 3982 cols
[2021-05-08 03:53:57] [INFO ] Computed 433 place invariants in 103 ms
[2021-05-08 03:53:59] [INFO ] Dead Transitions using invariants and state equation in 2740 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3982/3989 places, 4773/4787 transitions.
Stuttering acceptance computed with spot in 6054 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-10b-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:(AND (NEQ s2169 0) (NEQ s3728 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 ASLink-PT-10b-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10b-08 finished in 13234 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 3989 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3989/3989 places, 4787/4787 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 3984 transition count 4782
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 3984 transition count 4782
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 3982 transition count 4773
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 3982 transition count 4773
Applied a total of 14 rules in 969 ms. Remains 3982 /3989 variables (removed 7) and now considering 4773/4787 (removed 14) transitions.
// Phase 1: matrix 4773 rows 3982 cols
[2021-05-08 03:54:06] [INFO ] Computed 433 place invariants in 102 ms
[2021-05-08 03:54:08] [INFO ] Implicit Places using invariants in 1423 ms returned []
// Phase 1: matrix 4773 rows 3982 cols
[2021-05-08 03:54:08] [INFO ] Computed 433 place invariants in 101 ms
[2021-05-08 03:54:09] [INFO ] Implicit Places using invariants and state equation in 1530 ms returned []
Implicit Place search using SMT with State Equation took 2956 ms to find 0 implicit places.
// Phase 1: matrix 4773 rows 3982 cols
[2021-05-08 03:54:09] [INFO ] Computed 433 place invariants in 102 ms
[2021-05-08 03:54:12] [INFO ] Dead Transitions using invariants and state equation in 2602 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3982/3989 places, 4773/4787 transitions.
Stuttering acceptance computed with spot in 2717 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-10b-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(NEQ s484 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 2099 ms.
Product exploration explored 100000 steps with 33333 reset in 2092 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 2105 ms.
Product exploration explored 100000 steps with 33333 reset in 2093 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 3982 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 3982/3982 places, 4773/4773 transitions.
Performed 725 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 725 rules applied. Total rules applied 725 place count 3982 transition count 4773
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 726 place count 3982 transition count 4772
Performed 865 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 865 Pre rules applied. Total rules applied 726 place count 3982 transition count 6528
Deduced a syphon composed of 1590 places in 46 ms
Iterating global reduction 2 with 865 rules applied. Total rules applied 1591 place count 3982 transition count 6528
Discarding 355 places :
Symmetric choice reduction at 2 with 355 rule applications. Total rules 1946 place count 3627 transition count 6023
Deduced a syphon composed of 1235 places in 22 ms
Iterating global reduction 2 with 355 rules applied. Total rules applied 2301 place count 3627 transition count 6023
Performed 547 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1782 places in 14 ms
Iterating global reduction 2 with 547 rules applied. Total rules applied 2848 place count 3627 transition count 6024
Discarding 270 places :
Symmetric choice reduction at 2 with 270 rule applications. Total rules 3118 place count 3357 transition count 5752
Deduced a syphon composed of 1513 places in 13 ms
Iterating global reduction 2 with 270 rules applied. Total rules applied 3388 place count 3357 transition count 5752
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3389 place count 3356 transition count 5750
Deduced a syphon composed of 1513 places in 13 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 3390 place count 3356 transition count 5750
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 3392 place count 3356 transition count 5748
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: -233
Deduced a syphon composed of 1565 places in 13 ms
Iterating global reduction 3 with 52 rules applied. Total rules applied 3444 place count 3356 transition count 5981
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 3454 place count 3346 transition count 5961
Deduced a syphon composed of 1555 places in 14 ms
Iterating global reduction 3 with 10 rules applied. Total rules applied 3464 place count 3346 transition count 5961
Performed 10(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 1565 places in 14 ms
Iterating global reduction 3 with 10 rules applied. Total rules applied 3474 place count 3346 transition count 6053
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 3484 place count 3336 transition count 5997
Deduced a syphon composed of 1555 places in 17 ms
Iterating global reduction 3 with 10 rules applied. Total rules applied 3494 place count 3336 transition count 5997
Deduced a syphon composed of 1555 places in 12 ms
Applied a total of 3494 rules in 1522 ms. Remains 3336 /3982 variables (removed 646) and now considering 5997/4773 (removed -1224) transitions.
[2021-05-08 03:54:28] [INFO ] Redundant transitions in 304 ms returned []
// Phase 1: matrix 5997 rows 3336 cols
[2021-05-08 03:54:28] [INFO ] Computed 433 place invariants in 225 ms
[2021-05-08 03:54:32] [INFO ] Dead Transitions using invariants and state equation in 3815 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3336/3982 places, 5997/4773 transitions.
Product exploration explored 100000 steps with 33333 reset in 9718 ms.
Product exploration explored 100000 steps with 33333 reset in 9748 ms.
[2021-05-08 03:54:52] [INFO ] Flatten gal took : 144 ms
[2021-05-08 03:54:52] [INFO ] Flatten gal took : 151 ms
[2021-05-08 03:54:54] [INFO ] Time to serialize gal into /tmp/LTL13695642496322037348.gal : 1579 ms
[2021-05-08 03:54:54] [INFO ] Time to serialize properties into /tmp/LTL7138769528922543838.ltl : 548 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/LTL13695642496322037348.gal, -t, CGAL, -LTL, /tmp/LTL7138769528922543838.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/LTL13695642496322037348.gal -t CGAL -LTL /tmp/LTL7138769528922543838.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(p526!=1)")))))
Formula 0 simplified : !XXF"(p526!=1)"
Detected timeout of ITS tools.
[2021-05-08 03:55:09] [INFO ] Flatten gal took : 151 ms
[2021-05-08 03:55:09] [INFO ] Applying decomposition
[2021-05-08 03:55:09] [INFO ] Flatten gal took : 152 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/graph12641152923082272541.txt, -o, /tmp/graph12641152923082272541.bin, -w, /tmp/graph12641152923082272541.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/graph12641152923082272541.bin, -l, -1, -v, -w, /tmp/graph12641152923082272541.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 03:55:10] [INFO ] Decomposing Gal with order
[2021-05-08 03:55:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 03:55:10] [INFO ] Removed a total of 3478 redundant transitions.
[2021-05-08 03:55:11] [INFO ] Flatten gal took : 241 ms
[2021-05-08 03:55:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 65 ms.
[2021-05-08 03:55:11] [INFO ] Time to serialize gal into /tmp/LTL3117561619910712543.gal : 275 ms
[2021-05-08 03:55:11] [INFO ] Time to serialize properties into /tmp/LTL6894259023850222195.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/LTL3117561619910712543.gal, -t, CGAL, -LTL, /tmp/LTL6894259023850222195.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/LTL3117561619910712543.gal -t CGAL -LTL /tmp/LTL6894259023850222195.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(i7.u181.p526!=1)")))))
Formula 0 simplified : !XXF"(i7.u181.p526!=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1271468009798598240
[2021-05-08 03:55:26] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1271468009798598240
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/ltsmin1271468009798598240]
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/ltsmin1271468009798598240] 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/ltsmin1271468009798598240] 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 ASLink-PT-10b-11 finished in 81696 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 3989 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3989/3989 places, 4787/4787 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 749 transitions
Trivial Post-agglo rules discarded 749 transitions
Performed 749 trivial Post agglomeration. Transition count delta: 749
Iterating post reduction 0 with 749 rules applied. Total rules applied 749 place count 3988 transition count 4037
Reduce places removed 749 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 752 rules applied. Total rules applied 1501 place count 3239 transition count 4034
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1503 place count 3237 transition count 4034
Performed 1072 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1072 Pre rules applied. Total rules applied 1503 place count 3237 transition count 2962
Deduced a syphon composed of 1072 places in 8 ms
Ensure Unique test removed 104 places
Reduce places removed 1176 places and 0 transitions.
Iterating global reduction 3 with 2248 rules applied. Total rules applied 3751 place count 2061 transition count 2962
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 3 with 74 rules applied. Total rules applied 3825 place count 2051 transition count 2898
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 4 with 64 rules applied. Total rules applied 3889 place count 1987 transition count 2898
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 41 Pre rules applied. Total rules applied 3889 place count 1987 transition count 2857
Deduced a syphon composed of 41 places in 25 ms
Ensure Unique test removed 41 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 5 with 123 rules applied. Total rules applied 4012 place count 1905 transition count 2857
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 40 Pre rules applied. Total rules applied 4012 place count 1905 transition count 2817
Deduced a syphon composed of 40 places in 8 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 4092 place count 1865 transition count 2817
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 4095 place count 1862 transition count 2814
Iterating global reduction 5 with 3 rules applied. Total rules applied 4098 place count 1862 transition count 2814
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 4098 place count 1862 transition count 2811
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 4104 place count 1859 transition count 2811
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4105 place count 1858 transition count 2803
Iterating global reduction 5 with 1 rules applied. Total rules applied 4106 place count 1858 transition count 2803
Performed 300 Post agglomeration using F-continuation condition.Transition count delta: 300
Deduced a syphon composed of 300 places in 5 ms
Reduce places removed 300 places and 0 transitions.
Iterating global reduction 5 with 600 rules applied. Total rules applied 4706 place count 1558 transition count 2503
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4707 place count 1557 transition count 2502
Ensure Unique test removed 1 places
Iterating global reduction 5 with 2 rules applied. Total rules applied 4709 place count 1556 transition count 2502
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4710 place count 1555 transition count 2501
Iterating global reduction 5 with 1 rules applied. Total rules applied 4711 place count 1555 transition count 2501
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 5 with 2 rules applied. Total rules applied 4713 place count 1555 transition count 2499
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4714 place count 1554 transition count 2499
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4716 place count 1553 transition count 2508
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 4717 place count 1552 transition count 2507
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 4718 place count 1551 transition count 2506
Reduce places removed 19 places and 0 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 7 with 28 rules applied. Total rules applied 4746 place count 1532 transition count 2497
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 4755 place count 1523 transition count 2497
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 29 Pre rules applied. Total rules applied 4755 place count 1523 transition count 2468
Deduced a syphon composed of 29 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 9 with 59 rules applied. Total rules applied 4814 place count 1493 transition count 2468
Discarding 20 places :
Implicit places reduction removed 20 places
Iterating post reduction 9 with 20 rules applied. Total rules applied 4834 place count 1473 transition count 2468
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 4834 place count 1473 transition count 2467
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 4836 place count 1472 transition count 2467
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 5 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 10 with 60 rules applied. Total rules applied 4896 place count 1442 transition count 2437
Discarding 18 places :
Symmetric choice reduction at 10 with 18 rule applications. Total rules 4914 place count 1424 transition count 2419
Iterating global reduction 10 with 18 rules applied. Total rules applied 4932 place count 1424 transition count 2419
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 4941 place count 1415 transition count 2410
Iterating global reduction 10 with 9 rules applied. Total rules applied 4950 place count 1415 transition count 2410
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 4959 place count 1415 transition count 2401
Applied a total of 4959 rules in 1182 ms. Remains 1415 /3989 variables (removed 2574) and now considering 2401/4787 (removed 2386) transitions.
// Phase 1: matrix 2401 rows 1415 cols
[2021-05-08 03:55:28] [INFO ] Computed 237 place invariants in 41 ms
[2021-05-08 03:55:29] [INFO ] Implicit Places using invariants in 1005 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 259, 260, 272, 273, 275, 292, 310, 330, 381, 382, 394, 395, 397, 414, 432, 451, 503, 504, 516, 517, 519, 536, 554, 574, 625, 626, 638, 639, 641, 658, 676, 696, 747, 748, 760, 761, 763, 780, 798, 818, 869, 870, 882, 883, 887, 904, 922, 943, 999, 1011, 1012, 1013, 1015, 1032, 1050, 1070, 1121, 1122, 1134, 1135, 1137, 1154, 1172, 1192, 1244, 1245, 1248, 1259, 1260, 1261, 1279, 1281, 1285, 1303, 1304, 1305, 1306, 1319, 1325, 1331, 1337, 1343, 1349, 1355, 1361, 1367, 1373, 1379]
Discarding 101 places :
Implicit Place search using SMT only with invariants took 1017 ms to find 101 implicit places.
[2021-05-08 03:55:29] [INFO ] Redundant transitions in 48 ms returned []
// Phase 1: matrix 2401 rows 1314 cols
[2021-05-08 03:55:29] [INFO ] Computed 136 place invariants in 27 ms
[2021-05-08 03:55:30] [INFO ] Dead Transitions using invariants and state equation in 1022 ms returned []
Starting structural reductions, iteration 1 : 1314/3989 places, 2401/4787 transitions.
Drop transitions removed 184 transitions
Trivial Post-agglo rules discarded 184 transitions
Performed 184 trivial Post agglomeration. Transition count delta: 184
Iterating post reduction 0 with 184 rules applied. Total rules applied 184 place count 1314 transition count 2217
Reduce places removed 184 places and 0 transitions.
Iterating post reduction 1 with 184 rules applied. Total rules applied 368 place count 1130 transition count 2217
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 368 place count 1130 transition count 2169
Deduced a syphon composed of 48 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 97 rules applied. Total rules applied 465 place count 1081 transition count 2169
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 13 rules applied. Total rules applied 478 place count 1076 transition count 2161
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 486 place count 1068 transition count 2161
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 501 place count 1053 transition count 2146
Iterating global reduction 4 with 15 rules applied. Total rules applied 516 place count 1053 transition count 2146
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 519 place count 1053 transition count 2143
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 519 place count 1053 transition count 2142
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 521 place count 1052 transition count 2142
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 524 place count 1049 transition count 2136
Iterating global reduction 5 with 3 rules applied. Total rules applied 527 place count 1049 transition count 2136
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 528 place count 1048 transition count 2135
Iterating global reduction 5 with 1 rules applied. Total rules applied 529 place count 1048 transition count 2135
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 530 place count 1047 transition count 2133
Iterating global reduction 5 with 1 rules applied. Total rules applied 531 place count 1047 transition count 2133
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 4 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 5 with 154 rules applied. Total rules applied 685 place count 970 transition count 2056
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 689 place count 968 transition count 2057
Applied a total of 689 rules in 271 ms. Remains 968 /1314 variables (removed 346) and now considering 2057/2401 (removed 344) transitions.
// Phase 1: matrix 2057 rows 968 cols
[2021-05-08 03:55:31] [INFO ] Computed 130 place invariants in 22 ms
[2021-05-08 03:55:31] [INFO ] Implicit Places using invariants in 572 ms returned [88, 94, 99, 177, 183, 188, 266, 272, 277, 354, 360, 365, 442, 448, 453, 530, 536, 541, 618, 624, 629, 711, 717, 722, 800, 806, 811, 888, 894, 900, 965]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 583 ms to find 31 implicit places.
Starting structural reductions, iteration 2 : 937/3989 places, 2057/4787 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 0 with 1 rules applied. Total rules applied 1 place count 937 transition count 2056
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 936 transition count 2056
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 22 place count 916 transition count 2036
Iterating global reduction 2 with 20 rules applied. Total rules applied 42 place count 916 transition count 2036
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 62 place count 896 transition count 2016
Iterating global reduction 2 with 20 rules applied. Total rules applied 82 place count 896 transition count 2016
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 92 place count 886 transition count 2006
Iterating global reduction 2 with 10 rules applied. Total rules applied 102 place count 886 transition count 2006
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 122 place count 876 transition count 1996
Applied a total of 122 rules in 133 ms. Remains 876 /937 variables (removed 61) and now considering 1996/2057 (removed 61) transitions.
// Phase 1: matrix 1996 rows 876 cols
[2021-05-08 03:55:31] [INFO ] Computed 99 place invariants in 20 ms
[2021-05-08 03:55:32] [INFO ] Implicit Places using invariants in 507 ms returned []
// Phase 1: matrix 1996 rows 876 cols
[2021-05-08 03:55:32] [INFO ] Computed 99 place invariants in 20 ms
[2021-05-08 03:55:34] [INFO ] Implicit Places using invariants and state equation in 1858 ms returned []
Implicit Place search using SMT with State Equation took 2367 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 876/3989 places, 1996/4787 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-10b-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s580 1) (AND (EQ s150 0) (EQ s810 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7176 reset in 502 ms.
Product exploration explored 100000 steps with 7196 reset in 513 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7174 reset in 480 ms.
Product exploration explored 100000 steps with 7163 reset in 525 ms.
[2021-05-08 03:55:45] [INFO ] Flatten gal took : 66 ms
[2021-05-08 03:55:45] [INFO ] Flatten gal took : 68 ms
[2021-05-08 03:55:45] [INFO ] Time to serialize gal into /tmp/LTL5118089829822444845.gal : 5 ms
[2021-05-08 03:55:45] [INFO ] Time to serialize properties into /tmp/LTL12303422326229760620.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/LTL5118089829822444845.gal, -t, CGAL, -LTL, /tmp/LTL12303422326229760620.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/LTL5118089829822444845.gal -t CGAL -LTL /tmp/LTL12303422326229760620.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("((p2854==1)||((p616==0)&&(p3926==1)))")))
Formula 0 simplified : !F"((p2854==1)||((p616==0)&&(p3926==1)))"
Detected timeout of ITS tools.
[2021-05-08 03:56:00] [INFO ] Flatten gal took : 73 ms
[2021-05-08 03:56:00] [INFO ] Applying decomposition
[2021-05-08 03:56:00] [INFO ] Flatten gal took : 73 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/graph12954023203578735466.txt, -o, /tmp/graph12954023203578735466.bin, -w, /tmp/graph12954023203578735466.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/graph12954023203578735466.bin, -l, -1, -v, -w, /tmp/graph12954023203578735466.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 03:56:00] [INFO ] Decomposing Gal with order
[2021-05-08 03:56:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 03:56:01] [INFO ] Removed a total of 3908 redundant transitions.
[2021-05-08 03:56:01] [INFO ] Flatten gal took : 145 ms
[2021-05-08 03:56:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 113 labels/synchronizations in 21 ms.
[2021-05-08 03:56:01] [INFO ] Time to serialize gal into /tmp/LTL5213418659382791606.gal : 542 ms
[2021-05-08 03:56:01] [INFO ] Time to serialize properties into /tmp/LTL11564609254658178491.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/LTL5213418659382791606.gal, -t, CGAL, -LTL, /tmp/LTL11564609254658178491.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/LTL5213418659382791606.gal -t CGAL -LTL /tmp/LTL11564609254658178491.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F("((i14.u137.p2854==1)||((i4.u44.p616==0)&&(i20.u193.p3926==1)))")))
Formula 0 simplified : !F"((i14.u137.p2854==1)||((i4.u44.p616==0)&&(i20.u193.p3926==1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8201699573132510849
[2021-05-08 03:56:16] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8201699573132510849
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/ltsmin8201699573132510849]
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/ltsmin8201699573132510849] 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/ltsmin8201699573132510849] 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 ASLink-PT-10b-12 finished in 50106 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X(p0)||F((p1&&G((X(X(G(p0)))&&p2)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 3989 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3989/3989 places, 4787/4787 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 3985 transition count 4783
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 3985 transition count 4783
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 3984 transition count 4775
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 3984 transition count 4775
Applied a total of 10 rules in 966 ms. Remains 3984 /3989 variables (removed 5) and now considering 4775/4787 (removed 12) transitions.
// Phase 1: matrix 4775 rows 3984 cols
[2021-05-08 03:56:18] [INFO ] Computed 433 place invariants in 106 ms
[2021-05-08 03:56:20] [INFO ] Implicit Places using invariants in 2201 ms returned [3818, 3829, 3840, 3848, 3856, 3864, 3872, 3883, 3891, 3899, 3910]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 2206 ms to find 11 implicit places.
// Phase 1: matrix 4775 rows 3973 cols
[2021-05-08 03:56:20] [INFO ] Computed 422 place invariants in 99 ms
[2021-05-08 03:56:23] [INFO ] Dead Transitions using invariants and state equation in 2857 ms returned []
Starting structural reductions, iteration 1 : 3973/3989 places, 4775/4787 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3960 transition count 4762
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3960 transition count 4762
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 37 place count 3949 transition count 4751
Iterating global reduction 0 with 11 rules applied. Total rules applied 48 place count 3949 transition count 4751
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 57 place count 3940 transition count 4742
Iterating global reduction 0 with 9 rules applied. Total rules applied 66 place count 3940 transition count 4742
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 3936 transition count 4738
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 3936 transition count 4738
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 3934 transition count 4736
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 3934 transition count 4736
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 3932 transition count 4734
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 3932 transition count 4734
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 3930 transition count 4732
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 3930 transition count 4732
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 3928 transition count 4730
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 3928 transition count 4730
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 3927 transition count 4729
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 3927 transition count 4729
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 3926 transition count 4728
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 3926 transition count 4728
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 3925 transition count 4727
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 3925 transition count 4727
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 3924 transition count 4726
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 3924 transition count 4726
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 3923 transition count 4725
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 3923 transition count 4725
Applied a total of 100 rules in 4315 ms. Remains 3923 /3973 variables (removed 50) and now considering 4725/4775 (removed 50) transitions.
// Phase 1: matrix 4725 rows 3923 cols
[2021-05-08 03:56:28] [INFO ] Computed 422 place invariants in 105 ms
[2021-05-08 03:56:29] [INFO ] Implicit Places using invariants in 1463 ms returned []
// Phase 1: matrix 4725 rows 3923 cols
[2021-05-08 03:56:29] [INFO ] Computed 422 place invariants in 97 ms
[2021-05-08 03:56:30] [INFO ] Implicit Places using invariants and state equation in 1471 ms returned []
Implicit Place search using SMT with State Equation took 2936 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 3923/3989 places, 4725/4787 transitions.
Stuttering acceptance computed with spot in 4053 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : ASLink-PT-10b-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 p2), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 6}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 7}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 8}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=2 dest: 6}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=2 dest: 7}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=2 dest: 8}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p1 p2 p0), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={1} source=3 dest: 4}, { cond=(AND p1 p2 p0), acceptance={} source=3 dest: 4}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={0, 1} source=3 dest: 5}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={0} source=3 dest: 5}], [{ cond=(AND (NOT p1) p2 p0), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=4 dest: 6}, { cond=(AND p2 (NOT p0)), acceptance={0, 1} source=4 dest: 7}, { cond=(AND p2 (NOT p0)), acceptance={1} source=4 dest: 8}], [{ cond=(AND p1 p2 p0), acceptance={0} source=5 dest: 3}, { cond=(AND p1 p2 p0), acceptance={} source=5 dest: 4}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={0} source=5 dest: 5}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={0, 1} source=5 dest: 6}, { cond=(AND p1 p2 (NOT p0)), acceptance={0, 1} source=5 dest: 7}, { cond=(AND p1 p2 (NOT p0)), acceptance={1} source=5 dest: 8}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 6}, { cond=(AND p1 p2), acceptance={0, 1} source=6 dest: 7}, { cond=(AND p1 p2), acceptance={1} source=6 dest: 8}], [{ cond=(AND p1 p2), acceptance={0, 1} source=7 dest: 3}, { cond=(AND p1 p2), acceptance={1} source=7 dest: 4}, { cond=(OR (NOT p1) (NOT p2)), acceptance={0, 1} source=7 dest: 5}], [{ cond=(NOT p2), acceptance={0, 1} source=8 dest: 6}, { cond=p2, acceptance={0, 1} source=8 dest: 7}, { cond=p2, acceptance={1} source=8 dest: 8}]], initial=0, aps=[p1:(OR (EQ s2238 0) (EQ s1474 1)), p2:(AND (EQ s1474 0) (EQ s2238 1)), p0:(OR (EQ s119 0) (EQ s1265 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33399 reset in 2078 ms.
Product exploration explored 100000 steps with 33314 reset in 2102 ms.
Knowledge obtained : [p1, (NOT p2), p0]
Stuttering acceptance computed with spot in 307 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 33274 reset in 2104 ms.
Product exploration explored 100000 steps with 33357 reset in 2082 ms.
[2021-05-08 03:56:55] [INFO ] Flatten gal took : 148 ms
[2021-05-08 03:56:55] [INFO ] Flatten gal took : 151 ms
[2021-05-08 03:56:55] [INFO ] Time to serialize gal into /tmp/LTL5530104768157833146.gal : 13 ms
[2021-05-08 03:56:55] [INFO ] Time to serialize properties into /tmp/LTL9601036186425412071.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/LTL5530104768157833146.gal, -t, CGAL, -LTL, /tmp/LTL9601036186425412071.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/LTL5530104768157833146.gal -t CGAL -LTL /tmp/LTL9601036186425412071.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((X("((p125==0)||(p1380==1))"))||(F(("((p2454==0)||(p1610==1))")&&(G(("((p1610==0)&&(p2454==1))")&&(X(X(G("((p125==0)||(p1380==1))")))))))))))
Formula 0 simplified : !G(X"((p125==0)||(p1380==1))" | F("((p2454==0)||(p1610==1))" & G("((p1610==0)&&(p2454==1))" & XXG"((p125==0)||(p1380==1))")))
Detected timeout of ITS tools.
[2021-05-08 03:57:10] [INFO ] Flatten gal took : 148 ms
[2021-05-08 03:57:10] [INFO ] Applying decomposition
[2021-05-08 03:57:10] [INFO ] Flatten gal took : 152 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/graph3799972624045430201.txt, -o, /tmp/graph3799972624045430201.bin, -w, /tmp/graph3799972624045430201.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/graph3799972624045430201.bin, -l, -1, -v, -w, /tmp/graph3799972624045430201.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 03:57:11] [INFO ] Decomposing Gal with order
[2021-05-08 03:57:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 03:57:11] [INFO ] Removed a total of 3417 redundant transitions.
[2021-05-08 03:57:11] [INFO ] Flatten gal took : 226 ms
[2021-05-08 03:57:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 16 ms.
[2021-05-08 03:57:13] [INFO ] Time to serialize gal into /tmp/LTL17281558969779830038.gal : 1209 ms
[2021-05-08 03:57:14] [INFO ] Time to serialize properties into /tmp/LTL18300879151998736922.ltl : 1104 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/LTL17281558969779830038.gal, -t, CGAL, -LTL, /tmp/LTL18300879151998736922.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/LTL17281558969779830038.gal -t CGAL -LTL /tmp/LTL18300879151998736922.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G((X("((i2.u43.p125==0)||(i14.i3.i0.u482.p1380==1))"))||(F(("((i24.i2.i6.u855.p2454==0)||(i7.i2.i2.u564.p1610==1))")&&(G(("((i7.i2.i2.u564.p1610==0)&&(i24.i2.i6.u855.p2454==1))")&&(X(X(G("((i2.u43.p125==0)||(i14.i3.i0.u482.p1380==1))")))))))))))
Formula 0 simplified : !G(X"((i2.u43.p125==0)||(i14.i3.i0.u482.p1380==1))" | F("((i24.i2.i6.u855.p2454==0)||(i7.i2.i2.u564.p1610==1))" & G("((i7.i2.i2.u564.p1610==0)&&(i24.i2.i6.u855.p2454==1))" & XXG"((i2.u43.p125==0)||(i14.i3.i0.u482.p1380==1))")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5843716663042551788
[2021-05-08 03:57:29] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5843716663042551788
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/ltsmin5843716663042551788]
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/ltsmin5843716663042551788] 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/ltsmin5843716663042551788] 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 ASLink-PT-10b-13 finished in 72678 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X(F(p0))&&(p1 U X(X(G(!p1)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 3989 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3989/3989 places, 4787/4787 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 3984 transition count 4782
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 3984 transition count 4782
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 3982 transition count 4773
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 3982 transition count 4773
Applied a total of 14 rules in 1011 ms. Remains 3982 /3989 variables (removed 7) and now considering 4773/4787 (removed 14) transitions.
// Phase 1: matrix 4773 rows 3982 cols
[2021-05-08 03:57:31] [INFO ] Computed 433 place invariants in 100 ms
[2021-05-08 03:57:32] [INFO ] Implicit Places using invariants in 1581 ms returned []
// Phase 1: matrix 4773 rows 3982 cols
[2021-05-08 03:57:33] [INFO ] Computed 433 place invariants in 104 ms
[2021-05-08 03:57:34] [INFO ] Implicit Places using invariants and state equation in 1469 ms returned []
Implicit Place search using SMT with State Equation took 3063 ms to find 0 implicit places.
// Phase 1: matrix 4773 rows 3982 cols
[2021-05-08 03:57:34] [INFO ] Computed 433 place invariants in 101 ms
[2021-05-08 03:57:37] [INFO ] Dead Transitions using invariants and state equation in 2665 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3982/3989 places, 4773/4787 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) p1), (NOT p0), p1, p1, (AND (NOT p0) p1)]
Running random walk in product with property : ASLink-PT-10b-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s2367 0) (EQ s3835 1)), p0:(OR (EQ s932 0) (EQ s1144 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1244 steps with 1 reset in 8 ms.
FORMULA ASLink-PT-10b-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10b-14 finished in 7055 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11822063713718612074
[2021-05-08 03:57:37] [INFO ] Too many transitions (4787) to apply POR reductions. Disabling POR matrices.
[2021-05-08 03:57:37] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11822063713718612074
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/ltsmin11822063713718612074]
[2021-05-08 03:57:37] [INFO ] Applying decomposition
[2021-05-08 03:57:37] [INFO ] Flatten gal took : 176 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/graph8101350243877746280.txt, -o, /tmp/graph8101350243877746280.bin, -w, /tmp/graph8101350243877746280.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/graph8101350243877746280.bin, -l, -1, -v, -w, /tmp/graph8101350243877746280.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 03:57:38] [INFO ] Decomposing Gal with order
[2021-05-08 03:57:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 03:57:38] [INFO ] Removed a total of 3486 redundant transitions.
[2021-05-08 03:57:38] [INFO ] Flatten gal took : 216 ms
[2021-05-08 03:57:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 45 ms.
[2021-05-08 03:57:39] [INFO ] Time to serialize gal into /tmp/LTLCardinality1471577897709433230.gal : 50 ms
[2021-05-08 03:57:39] [INFO ] Time to serialize properties into /tmp/LTLCardinality8541254809499626615.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/LTLCardinality1471577897709433230.gal, -t, CGAL, -LTL, /tmp/LTLCardinality8541254809499626615.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/LTLCardinality1471577897709433230.gal -t CGAL -LTL /tmp/LTLCardinality8541254809499626615.ltl -c -stutter-deadlock
Read 5 LTL properties
Checking formula 0 : !((G((!("((i15.i1.i3.i0.u793.p2282==0)||(i7.u323.p937==1))"))||(X(X(F(("(i37.u1449.p4159!=1)")||(G("((i15.i1.i3.i0.u793.p2282==0)||(i7.u323.p937==1))")))))))))
Formula 0 simplified : !G(!"((i15.i1.i3.i0.u793.p2282==0)||(i7.u323.p937==1))" | XXF("(i37.u1449.p4159!=1)" | G"((i15.i1.i3.i0.u793.p2282==0)||(i7.u323.p937==1))"))
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/ltsmin11822063713718612074] killed by timeout after 45 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/ltsmin11822063713718612074] killed by timeout after 45 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-08 04:19:50] [INFO ] Applying decomposition
[2021-05-08 04:19:51] [INFO ] Flatten gal took : 579 ms
[2021-05-08 04:19:51] [INFO ] Decomposing Gal with order
[2021-05-08 04:19:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 04:19:52] [INFO ] Removed a total of 3198 redundant transitions.
[2021-05-08 04:19:52] [INFO ] Flatten gal took : 702 ms
[2021-05-08 04:19:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 5505 labels/synchronizations in 2151 ms.
[2021-05-08 04:19:58] [INFO ] Time to serialize gal into /tmp/LTLCardinality571057195220928029.gal : 41 ms
[2021-05-08 04:19:58] [INFO ] Time to serialize properties into /tmp/LTLCardinality11917316698247582221.ltl : 7 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/LTLCardinality571057195220928029.gal, -t, CGAL, -LTL, /tmp/LTLCardinality11917316698247582221.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/LTLCardinality571057195220928029.gal -t CGAL -LTL /tmp/LTLCardinality11917316698247582221.ltl -c -stutter-deadlock
Read 5 LTL properties
Checking formula 0 : !((G((!("((i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.i3.i0.u272.p2282==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i0.u119.p937==1))"))||(X(X(F(("(i1.i1.u641.p4159!=1)")||(G("((i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.i3.i0.u272.p2282==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i0.u119.p937==1))")))))))))
Formula 0 simplified : !G(!"((i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.i3.i0.u272.p2282==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i0.u119.p937==1))" | XXF("(i1.i1.u641.p4159!=1)" | G"((i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.i3.i0.u272.p2282==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i0.u119.p937==1))"))
Detected timeout of ITS tools.
[2021-05-08 04:42:10] [INFO ] Flatten gal took : 506 ms
[2021-05-08 04:42:17] [INFO ] Input system was already deterministic with 4787 transitions.
[2021-05-08 04:42:17] [INFO ] Transformed 3989 places.
[2021-05-08 04:42:17] [INFO ] Transformed 4787 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
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-08 04:42:47] [INFO ] Time to serialize gal into /tmp/LTLCardinality16457832098512546195.gal : 12 ms
[2021-05-08 04:42:47] [INFO ] Time to serialize properties into /tmp/LTLCardinality5042474586781517799.ltl : 3 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/LTLCardinality16457832098512546195.gal, -t, CGAL, -LTL, /tmp/LTLCardinality5042474586781517799.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/LTLCardinality16457832098512546195.gal -t CGAL -LTL /tmp/LTLCardinality5042474586781517799.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 5 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((!("((p2282==0)||(p937==1))"))||(X(X(F(("(p4159!=1)")||(G("((p2282==0)||(p937==1))")))))))))
Formula 0 simplified : !G(!"((p2282==0)||(p937==1))" | XXF("(p4159!=1)" | G"((p2282==0)||(p937==1))"))

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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="ASLink-PT-10b"
export BK_EXAMINATION="LTLCardinality"
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 ASLink-PT-10b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r007-tall-162037989600161"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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