About the Execution of ITS-Tools for PermAdmissibility-PT-05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12482.447 | 3600000.00 | 12756307.00 | 31472.70 | FFFFF?TFFFTFFT?F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r140-tall-162089128000524.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 PermAdmissibility-PT-05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089128000524
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.0M
-rw-r--r-- 1 mcc users 23K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 163K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 338K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.7M May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.7K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 27 06:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 27 06:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Mar 25 08:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Mar 25 08:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 481K 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 PermAdmissibility-PT-05-00
FORMULA_NAME PermAdmissibility-PT-05-01
FORMULA_NAME PermAdmissibility-PT-05-02
FORMULA_NAME PermAdmissibility-PT-05-03
FORMULA_NAME PermAdmissibility-PT-05-04
FORMULA_NAME PermAdmissibility-PT-05-05
FORMULA_NAME PermAdmissibility-PT-05-06
FORMULA_NAME PermAdmissibility-PT-05-07
FORMULA_NAME PermAdmissibility-PT-05-08
FORMULA_NAME PermAdmissibility-PT-05-09
FORMULA_NAME PermAdmissibility-PT-05-10
FORMULA_NAME PermAdmissibility-PT-05-11
FORMULA_NAME PermAdmissibility-PT-05-12
FORMULA_NAME PermAdmissibility-PT-05-13
FORMULA_NAME PermAdmissibility-PT-05-14
FORMULA_NAME PermAdmissibility-PT-05-15
=== Now, execution of the tool begins
BK_START 1620998634252
Running Version 0
[2021-05-14 13:24:09] [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-14 13:24:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 13:24:09] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2021-05-14 13:24:09] [INFO ] Transformed 168 places.
[2021-05-14 13:24:09] [INFO ] Transformed 592 transitions.
[2021-05-14 13:24:09] [INFO ] Parsed PT model containing 168 places and 592 transitions in 130 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-14 13:24:09] [INFO ] Initial state test concluded for 6 properties.
FORMULA PermAdmissibility-PT-05-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-05-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-05-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-05-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-05-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-05-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 102 out of 168 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 146 transition count 592
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 27 place count 141 transition count 512
Iterating global reduction 1 with 5 rules applied. Total rules applied 32 place count 141 transition count 512
Applied a total of 32 rules in 32 ms. Remains 141 /168 variables (removed 27) and now considering 512/592 (removed 80) transitions.
// Phase 1: matrix 512 rows 141 cols
[2021-05-14 13:24:09] [INFO ] Computed 22 place invariants in 34 ms
[2021-05-14 13:24:09] [INFO ] Implicit Places using invariants in 202 ms returned []
// Phase 1: matrix 512 rows 141 cols
[2021-05-14 13:24:09] [INFO ] Computed 22 place invariants in 12 ms
[2021-05-14 13:24:09] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
// Phase 1: matrix 512 rows 141 cols
[2021-05-14 13:24:09] [INFO ] Computed 22 place invariants in 12 ms
[2021-05-14 13:24:10] [INFO ] Dead Transitions using invariants and state equation in 247 ms returned []
Finished structural reductions, in 1 iterations. Remains : 141/168 places, 512/592 transitions.
[2021-05-14 13:24:10] [INFO ] Flatten gal took : 95 ms
[2021-05-14 13:24:10] [INFO ] Flatten gal took : 59 ms
[2021-05-14 13:24:10] [INFO ] Input system was already deterministic with 512 transitions.
Finished random walk after 2609 steps, including 26 resets, run visited all 18 properties in 16 ms. (steps per millisecond=163 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0 U (F(G(p0))||((p0||F(G(p0)))&&G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 14 out of 141 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 141/141 places, 512/512 transitions.
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 99 transition count 512
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 63 place count 78 transition count 344
Iterating global reduction 1 with 21 rules applied. Total rules applied 84 place count 78 transition count 344
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 103 place count 59 transition count 138
Iterating global reduction 1 with 19 rules applied. Total rules applied 122 place count 59 transition count 138
Applied a total of 122 rules in 13 ms. Remains 59 /141 variables (removed 82) and now considering 138/512 (removed 374) transitions.
// Phase 1: matrix 138 rows 59 cols
[2021-05-14 13:24:10] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-14 13:24:10] [INFO ] Implicit Places using invariants in 48 ms returned [0, 5, 19, 26]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 51 ms to find 4 implicit places.
// Phase 1: matrix 138 rows 55 cols
[2021-05-14 13:24:10] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-14 13:24:10] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Starting structural reductions, iteration 1 : 55/141 places, 138/512 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 55 cols
[2021-05-14 13:24:10] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-14 13:24:10] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Finished structural reductions, in 2 iterations. Remains : 55/141 places, 138/512 transitions.
Stuttering acceptance computed with spot in 307 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-05-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GT s44 (ADD s31 s32 s33 s34 s40 s41 s42 s43)), p1:(GT s5 (ADD s9 s11 s12 s14))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 7 ms.
FORMULA PermAdmissibility-PT-05-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-00 finished in 538 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 8 out of 141 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 141/141 places, 512/512 transitions.
Graph (complete) has 1225 edges and 141 vertex of which 107 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.9 ms
Discarding 34 places :
Also discarding 0 output transitions
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 93 transition count 372
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 93 transition count 372
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 39 place count 83 transition count 262
Iterating global reduction 0 with 10 rules applied. Total rules applied 49 place count 83 transition count 262
Applied a total of 49 rules in 49 ms. Remains 83 /141 variables (removed 58) and now considering 262/512 (removed 250) transitions.
// Phase 1: matrix 262 rows 83 cols
[2021-05-14 13:24:11] [INFO ] Computed 17 place invariants in 2 ms
[2021-05-14 13:24:11] [INFO ] Implicit Places using invariants in 83 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 84 ms to find 1 implicit places.
[2021-05-14 13:24:11] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 262 rows 82 cols
[2021-05-14 13:24:11] [INFO ] Computed 16 place invariants in 3 ms
[2021-05-14 13:24:11] [INFO ] Dead Transitions using invariants and state equation in 109 ms returned []
Starting structural reductions, iteration 1 : 82/141 places, 262/512 transitions.
Applied a total of 0 rules in 11 ms. Remains 82 /82 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2021-05-14 13:24:11] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 262 rows 82 cols
[2021-05-14 13:24:11] [INFO ] Computed 16 place invariants in 4 ms
[2021-05-14 13:24:11] [INFO ] Dead Transitions using invariants and state equation in 95 ms returned []
Finished structural reductions, in 2 iterations. Remains : 82/141 places, 262/512 transitions.
Stuttering acceptance computed with spot in 34 ms :[true, (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-05-01 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(GT 1 (ADD s15 s17 s18 s19 s20 s21 s22 s23))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 32 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-05-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-01 finished in 440 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (p1 U X(p2))))], workingDir=/home/mcc/execution]
Support contains 34 out of 141 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 141/141 places, 512/512 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 115 transition count 512
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 33 place count 108 transition count 400
Iterating global reduction 1 with 7 rules applied. Total rules applied 40 place count 108 transition count 400
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 50 place count 98 transition count 290
Iterating global reduction 1 with 10 rules applied. Total rules applied 60 place count 98 transition count 290
Applied a total of 60 rules in 13 ms. Remains 98 /141 variables (removed 43) and now considering 290/512 (removed 222) transitions.
// Phase 1: matrix 290 rows 98 cols
[2021-05-14 13:24:11] [INFO ] Computed 18 place invariants in 3 ms
[2021-05-14 13:24:11] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 290 rows 98 cols
[2021-05-14 13:24:11] [INFO ] Computed 18 place invariants in 3 ms
[2021-05-14 13:24:11] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
// Phase 1: matrix 290 rows 98 cols
[2021-05-14 13:24:11] [INFO ] Computed 18 place invariants in 4 ms
[2021-05-14 13:24:11] [INFO ] Dead Transitions using invariants and state equation in 106 ms returned []
Finished structural reductions, in 1 iterations. Remains : 98/141 places, 290/512 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p2), true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : PermAdmissibility-PT-05-03 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ (ADD s63 s65 s66 s67 s68 s82 s83 s84) (ADD s40 s45 s47 s48)), p0:(LEQ (ADD s30 s31 s33 s34 s35 s36 s37 s38) (ADD s70 s71 s72 s73)), p2:(LEQ (ADD s80 s81) (ADD s11 s12 s13 s14 s15 s16 s17 s18))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 883 steps with 16 reset in 20 ms.
FORMULA PermAdmissibility-PT-05-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-03 finished in 493 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0 U (p1&&F(!p0))))))], workingDir=/home/mcc/execution]
Support contains 24 out of 141 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 141/141 places, 512/512 transitions.
Graph (complete) has 1225 edges and 141 vertex of which 107 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.3 ms
Discarding 34 places :
Also discarding 0 output transitions
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 100 transition count 400
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 100 transition count 400
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 25 place count 90 transition count 290
Iterating global reduction 0 with 10 rules applied. Total rules applied 35 place count 90 transition count 290
Applied a total of 35 rules in 27 ms. Remains 90 /141 variables (removed 51) and now considering 290/512 (removed 222) transitions.
// Phase 1: matrix 290 rows 90 cols
[2021-05-14 13:24:12] [INFO ] Computed 17 place invariants in 2 ms
[2021-05-14 13:24:12] [INFO ] Implicit Places using invariants in 92 ms returned []
// Phase 1: matrix 290 rows 90 cols
[2021-05-14 13:24:12] [INFO ] Computed 17 place invariants in 2 ms
[2021-05-14 13:24:12] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2021-05-14 13:24:12] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 290 rows 90 cols
[2021-05-14 13:24:12] [INFO ] Computed 17 place invariants in 2 ms
[2021-05-14 13:24:12] [INFO ] Dead Transitions using invariants and state equation in 123 ms returned []
Finished structural reductions, in 1 iterations. Remains : 90/141 places, 290/512 transitions.
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p1) p0), p0, (OR (NOT p1) p0)]
Running random walk in product with property : PermAdmissibility-PT-05-05 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 1 (ADD s20 s21 s22 s23 s24 s25 s26 s28)), p0:(GT (ADD s41 s42 s43 s44 s45 s46 s47 s52) (ADD s11 s12 s14 s15 s16 s17 s18 s19))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2260 reset in 744 ms.
Product exploration explored 100000 steps with 2277 reset in 715 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 90 transition count 290
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p1) p0), p0, (OR (NOT p1) p0)]
Product exploration explored 100000 steps with 2238 reset in 659 ms.
Product exploration explored 100000 steps with 2266 reset in 662 ms.
[2021-05-14 13:24:15] [INFO ] Flatten gal took : 72 ms
[2021-05-14 13:24:15] [INFO ] Flatten gal took : 33 ms
[2021-05-14 13:24:15] [INFO ] Time to serialize gal into /tmp/LTL8953410159156394320.gal : 21 ms
[2021-05-14 13:24:15] [INFO ] Time to serialize properties into /tmp/LTL5666858474248514237.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/LTL8953410159156394320.gal, -t, CGAL, -LTL, /tmp/LTL5666858474248514237.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/LTL8953410159156394320.gal -t CGAL -LTL /tmp/LTL5666858474248514237.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G(("((((((((aux12_6+aux12_5)+aux12_4)+aux12_3)+aux12_2)+aux12_1)+aux12_0)+aux12_7)>(((((((out5_1+out5_2)+out5_0)+out5_5)+out5_6)+out5_3)+out5_4)+out5_7))")U(("((((((((aux15_2+aux15_1)+aux15_0)+aux15_6)+aux15_5)+aux15_4)+aux15_3)+aux15_7)>=1)")&&(F("((((((((aux12_6+aux12_5)+aux12_4)+aux12_3)+aux12_2)+aux12_1)+aux12_0)+aux12_7)<=(((((((out5_1+out5_2)+out5_0)+out5_5)+out5_6)+out5_3)+out5_4)+out5_7))")))))))
Formula 0 simplified : !FG("((((((((aux12_6+aux12_5)+aux12_4)+aux12_3)+aux12_2)+aux12_1)+aux12_0)+aux12_7)>(((((((out5_1+out5_2)+out5_0)+out5_5)+out5_6)+out5_3)+out5_4)+out5_7))" U ("((((((((aux15_2+aux15_1)+aux15_0)+aux15_6)+aux15_5)+aux15_4)+aux15_3)+aux15_7)>=1)" & F"((((((((aux12_6+aux12_5)+aux12_4)+aux12_3)+aux12_2)+aux12_1)+aux12_0)+aux12_7)<=(((((((out5_1+out5_2)+out5_0)+out5_5)+out5_6)+out5_3)+out5_4)+out5_7))"))
Detected timeout of ITS tools.
[2021-05-14 13:24:43] [INFO ] Flatten gal took : 90 ms
[2021-05-14 13:24:43] [INFO ] Applying decomposition
[2021-05-14 13:24:43] [INFO ] Flatten gal took : 51 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/graph2231774323601566576.txt, -o, /tmp/graph2231774323601566576.bin, -w, /tmp/graph2231774323601566576.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/graph2231774323601566576.bin, -l, -1, -v, -w, /tmp/graph2231774323601566576.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 13:24:48] [INFO ] Decomposing Gal with order
[2021-05-14 13:24:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 13:24:48] [INFO ] Removed a total of 414 redundant transitions.
[2021-05-14 13:24:48] [INFO ] Flatten gal took : 111 ms
[2021-05-14 13:24:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 265 labels/synchronizations in 20 ms.
[2021-05-14 13:24:48] [INFO ] Time to serialize gal into /tmp/LTL7580136841058063682.gal : 5 ms
[2021-05-14 13:24:48] [INFO ] Time to serialize properties into /tmp/LTL17827169040473178294.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/LTL7580136841058063682.gal, -t, CGAL, -LTL, /tmp/LTL17827169040473178294.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/LTL7580136841058063682.gal -t CGAL -LTL /tmp/LTL17827169040473178294.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G(("((((((((gu0.aux12_6+gu0.aux12_5)+gu0.aux12_4)+gu0.aux12_3)+gu0.aux12_2)+gu0.aux12_1)+gu0.aux12_0)+gu0.aux12_7)>(((((((gu0.out5_1+gu0.out5_2)+gu0.out5_0)+gu0.out5_5)+gu0.out5_6)+gu0.out5_3)+gu0.out5_4)+gu0.out5_7))")U(("((((((((gi1.gi1.gu2.aux15_2+gi1.gi1.gu2.aux15_1)+gi1.gi1.gu2.aux15_0)+gi1.gi1.gu2.aux15_6)+gi1.gi1.gu2.aux15_5)+gi1.gi1.gu2.aux15_4)+gi1.gi1.gu2.aux15_3)+gi1.gi1.gu2.aux15_7)>=1)")&&(F("((((((((gu0.aux12_6+gu0.aux12_5)+gu0.aux12_4)+gu0.aux12_3)+gu0.aux12_2)+gu0.aux12_1)+gu0.aux12_0)+gu0.aux12_7)<=(((((((gu0.out5_1+gu0.out5_2)+gu0.out5_0)+gu0.out5_5)+gu0.out5_6)+gu0.out5_3)+gu0.out5_4)+gu0.out5_7))")))))))
Formula 0 simplified : !FG("((((((((gu0.aux12_6+gu0.aux12_5)+gu0.aux12_4)+gu0.aux12_3)+gu0.aux12_2)+gu0.aux12_1)+gu0.aux12_0)+gu0.aux12_7)>(((((((gu0.out5_1+gu0.out5_2)+gu0.out5_0)+gu0.out5_5)+gu0.out5_6)+gu0.out5_3)+gu0.out5_4)+gu0.out5_7))" U ("((((((((gi1.gi1.gu2.aux15_2+gi1.gi1.gu2.aux15_1)+gi1.gi1.gu2.aux15_0)+gi1.gi1.gu2.aux15_6)+gi1.gi1.gu2.aux15_5)+gi1.gi1.gu2.aux15_4)+gi1.gi1.gu2.aux15_3)+gi1.gi1.gu2.aux15_7)>=1)" & F"((((((((gu0.aux12_6+gu0.aux12_5)+gu0.aux12_4)+gu0.aux12_3)+gu0.aux12_2)+gu0.aux12_1)+gu0.aux12_0)+gu0.aux12_7)<=(((((((gu0.out5_1+gu0.out5_2)+gu0.out5_0)+gu0.out5_5)+gu0.out5_6)+gu0.out5_3)+gu0.out5_4)+gu0.out5_7))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18061430663020197066
[2021-05-14 13:25:08] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18061430663020197066
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/ltsmin18061430663020197066]
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/ltsmin18061430663020197066] 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/ltsmin18061430663020197066] 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 PermAdmissibility-PT-05-05 finished in 57528 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(G(p0))&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 16 out of 141 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 141/141 places, 512/512 transitions.
Graph (complete) has 1225 edges and 141 vertex of which 107 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.2 ms
Discarding 34 places :
Also discarding 0 output transitions
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 16 place count 92 transition count 356
Iterating global reduction 0 with 15 rules applied. Total rules applied 31 place count 92 transition count 356
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 45 place count 78 transition count 230
Iterating global reduction 0 with 14 rules applied. Total rules applied 59 place count 78 transition count 230
Applied a total of 59 rules in 19 ms. Remains 78 /141 variables (removed 63) and now considering 230/512 (removed 282) transitions.
// Phase 1: matrix 230 rows 78 cols
[2021-05-14 13:25:09] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-14 13:25:09] [INFO ] Implicit Places using invariants in 188 ms returned [0, 5, 33, 44]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 189 ms to find 4 implicit places.
[2021-05-14 13:25:09] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 230 rows 74 cols
[2021-05-14 13:25:09] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-14 13:25:09] [INFO ] Dead Transitions using invariants and state equation in 103 ms returned []
Starting structural reductions, iteration 1 : 74/141 places, 230/512 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 74 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 73 transition count 229
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 73 transition count 228
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 72 transition count 228
Applied a total of 4 rules in 18 ms. Remains 72 /74 variables (removed 2) and now considering 228/230 (removed 2) transitions.
// Phase 1: matrix 228 rows 72 cols
[2021-05-14 13:25:09] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-14 13:25:09] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 228 rows 72 cols
[2021-05-14 13:25:09] [INFO ] Computed 13 place invariants in 4 ms
[2021-05-14 13:25:10] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 72/141 places, 228/512 transitions.
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-05-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 2 (ADD s4 s5 s6 s7 s9 s10 s11 s12)), p1:(GT 2 (ADD s13 s14 s16 s17 s18 s19 s20 s21))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 70 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-PT-05-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-07 finished in 609 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 141/141 places, 512/512 transitions.
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 100 transition count 512
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 61 place count 80 transition count 348
Iterating global reduction 1 with 20 rules applied. Total rules applied 81 place count 80 transition count 348
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 103 place count 58 transition count 118
Iterating global reduction 1 with 22 rules applied. Total rules applied 125 place count 58 transition count 118
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 127 place count 56 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 129 place count 56 transition count 102
Applied a total of 129 rules in 5 ms. Remains 56 /141 variables (removed 85) and now considering 102/512 (removed 410) transitions.
// Phase 1: matrix 102 rows 56 cols
[2021-05-14 13:25:10] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-14 13:25:10] [INFO ] Implicit Places using invariants in 37 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
// Phase 1: matrix 102 rows 55 cols
[2021-05-14 13:25:10] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-14 13:25:10] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Starting structural reductions, iteration 1 : 55/141 places, 102/512 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 55 cols
[2021-05-14 13:25:10] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-14 13:25:10] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 2 iterations. Remains : 55/141 places, 102/512 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : PermAdmissibility-PT-05-09 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(GT s5 s45), p0:(LEQ s6 s42)], 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]]
Entered a terminal (fully accepting) state of product in 53 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-05-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-09 finished in 200 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 141/141 places, 512/512 transitions.
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 99 transition count 512
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 63 place count 78 transition count 344
Iterating global reduction 1 with 21 rules applied. Total rules applied 84 place count 78 transition count 344
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 107 place count 55 transition count 114
Iterating global reduction 1 with 23 rules applied. Total rules applied 130 place count 55 transition count 114
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 132 place count 53 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 134 place count 53 transition count 98
Applied a total of 134 rules in 5 ms. Remains 53 /141 variables (removed 88) and now considering 98/512 (removed 414) transitions.
// Phase 1: matrix 98 rows 53 cols
[2021-05-14 13:25:10] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-14 13:25:10] [INFO ] Implicit Places using invariants in 42 ms returned [0, 5, 18, 25]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 43 ms to find 4 implicit places.
// Phase 1: matrix 98 rows 49 cols
[2021-05-14 13:25:10] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-14 13:25:10] [INFO ] Dead Transitions using invariants and state equation in 75 ms returned []
Starting structural reductions, iteration 1 : 49/141 places, 98/512 transitions.
Applied a total of 0 rules in 8 ms. Remains 49 /49 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 49 cols
[2021-05-14 13:25:10] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 13:25:10] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 2 iterations. Remains : 49/141 places, 98/512 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-05-10 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: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LEQ s36 s29)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 173 ms.
Product exploration explored 100000 steps with 25000 reset in 192 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 49 transition count 98
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (OR (G p0) (G (NOT p0)))), p0]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 149 ms.
Product exploration explored 100000 steps with 25000 reset in 155 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 49 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 49/49 places, 98/98 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 49 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 49 transition count 98
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 48 transition count 97
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 48 transition count 97
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 4 rules in 6 ms. Remains 48 /49 variables (removed 1) and now considering 97/98 (removed 1) transitions.
[2021-05-14 13:25:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 97 rows 48 cols
[2021-05-14 13:25:11] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-14 13:25:11] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Finished structural reductions, in 1 iterations. Remains : 48/49 places, 97/98 transitions.
Product exploration explored 100000 steps with 25000 reset in 294 ms.
Product exploration explored 100000 steps with 25000 reset in 301 ms.
[2021-05-14 13:25:12] [INFO ] Flatten gal took : 7 ms
[2021-05-14 13:25:12] [INFO ] Flatten gal took : 7 ms
[2021-05-14 13:25:12] [INFO ] Time to serialize gal into /tmp/LTL2211137779063381000.gal : 1 ms
[2021-05-14 13:25:12] [INFO ] Time to serialize properties into /tmp/LTL16545885246879124504.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/LTL2211137779063381000.gal, -t, CGAL, -LTL, /tmp/LTL16545885246879124504.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/LTL2211137779063381000.gal -t CGAL -LTL /tmp/LTL16545885246879124504.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(c9<=aux9_4)"))))))
Formula 0 simplified : !XXXF"(c9<=aux9_4)"
Detected timeout of ITS tools.
[2021-05-14 13:25:27] [INFO ] Flatten gal took : 15 ms
[2021-05-14 13:25:27] [INFO ] Applying decomposition
[2021-05-14 13:25:27] [INFO ] Flatten gal took : 7 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/graph16147957216682312752.txt, -o, /tmp/graph16147957216682312752.bin, -w, /tmp/graph16147957216682312752.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/graph16147957216682312752.bin, -l, -1, -v, -w, /tmp/graph16147957216682312752.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 13:25:30] [INFO ] Decomposing Gal with order
[2021-05-14 13:25:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 13:25:30] [INFO ] Removed a total of 58 redundant transitions.
[2021-05-14 13:25:30] [INFO ] Flatten gal took : 35 ms
[2021-05-14 13:25:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 2 ms.
[2021-05-14 13:25:30] [INFO ] Time to serialize gal into /tmp/LTL8620908019124961660.gal : 1 ms
[2021-05-14 13:25:30] [INFO ] Time to serialize properties into /tmp/LTL3225956366729471619.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/LTL8620908019124961660.gal, -t, CGAL, -LTL, /tmp/LTL3225956366729471619.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/LTL8620908019124961660.gal -t CGAL -LTL /tmp/LTL3225956366729471619.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(gu3.c9<=gu3.aux9_4)"))))))
Formula 0 simplified : !XXXF"(gu3.c9<=gu3.aux9_4)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9458339484048708424
[2021-05-14 13:25:45] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9458339484048708424
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/ltsmin9458339484048708424]
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/ltsmin9458339484048708424] 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/ltsmin9458339484048708424] 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 PermAdmissibility-PT-05-10 finished in 36071 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&F(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 141 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 141/141 places, 512/512 transitions.
Graph (complete) has 1225 edges and 141 vertex of which 99 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.2 ms
Discarding 42 places :
Also discarding 0 output transitions
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 22 place count 78 transition count 344
Iterating global reduction 0 with 21 rules applied. Total rules applied 43 place count 78 transition count 344
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 66 place count 55 transition count 114
Iterating global reduction 0 with 23 rules applied. Total rules applied 89 place count 55 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 90 place count 54 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 91 place count 54 transition count 106
Applied a total of 91 rules in 18 ms. Remains 54 /141 variables (removed 87) and now considering 106/512 (removed 406) transitions.
// Phase 1: matrix 106 rows 54 cols
[2021-05-14 13:25:46] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-14 13:25:46] [INFO ] Implicit Places using invariants in 38 ms returned [0, 5, 19, 26]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 38 ms to find 4 implicit places.
[2021-05-14 13:25:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 106 rows 50 cols
[2021-05-14 13:25:46] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-14 13:25:47] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Starting structural reductions, iteration 1 : 50/141 places, 106/512 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 50 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 49 transition count 105
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 49 transition count 104
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 48 transition count 104
Applied a total of 4 rules in 5 ms. Remains 48 /50 variables (removed 2) and now considering 104/106 (removed 2) transitions.
// Phase 1: matrix 104 rows 48 cols
[2021-05-14 13:25:47] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 13:25:47] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 104 rows 48 cols
[2021-05-14 13:25:47] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 13:25:47] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 48/141 places, 104/512 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-PT-05-11 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(LEQ s9 s36), p1:(LEQ 1 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-PT-05-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-11 finished in 818 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 141/141 places, 512/512 transitions.
Graph (complete) has 1225 edges and 141 vertex of which 99 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.2 ms
Discarding 42 places :
Also discarding 0 output transitions
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 79 transition count 346
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 79 transition count 346
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 63 place count 57 transition count 124
Iterating global reduction 0 with 22 rules applied. Total rules applied 85 place count 57 transition count 124
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 87 place count 55 transition count 108
Iterating global reduction 0 with 2 rules applied. Total rules applied 89 place count 55 transition count 108
Applied a total of 89 rules in 14 ms. Remains 55 /141 variables (removed 86) and now considering 108/512 (removed 404) transitions.
// Phase 1: matrix 108 rows 55 cols
[2021-05-14 13:25:47] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-14 13:25:47] [INFO ] Implicit Places using invariants in 40 ms returned [0, 5, 20, 27]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 41 ms to find 4 implicit places.
[2021-05-14 13:25:47] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 108 rows 51 cols
[2021-05-14 13:25:47] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 13:25:47] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Starting structural reductions, iteration 1 : 51/141 places, 108/512 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 51 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 50 transition count 107
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 50 transition count 106
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 49 transition count 106
Applied a total of 4 rules in 4 ms. Remains 49 /51 variables (removed 2) and now considering 106/108 (removed 2) transitions.
// Phase 1: matrix 106 rows 49 cols
[2021-05-14 13:25:47] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-14 13:25:47] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 106 rows 49 cols
[2021-05-14 13:25:47] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-14 13:25:47] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 49/141 places, 106/512 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-05-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s13 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2986 reset in 362 ms.
Product exploration explored 100000 steps with 3037 reset in 381 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 49 transition count 106
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (OR (G p0) (G (NOT p0)))), p0]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3005 reset in 363 ms.
Product exploration explored 100000 steps with 3040 reset in 378 ms.
[2021-05-14 13:25:49] [INFO ] Flatten gal took : 7 ms
[2021-05-14 13:25:49] [INFO ] Flatten gal took : 6 ms
[2021-05-14 13:25:49] [INFO ] Time to serialize gal into /tmp/LTL4166418611441240742.gal : 2 ms
[2021-05-14 13:25:49] [INFO ] Time to serialize properties into /tmp/LTL14073704540996652722.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/LTL4166418611441240742.gal, -t, CGAL, -LTL, /tmp/LTL14073704540996652722.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/LTL4166418611441240742.gal -t CGAL -LTL /tmp/LTL14073704540996652722.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(aux6_5<=aux13_6)"))))
Formula 0 simplified : !GF"(aux6_5<=aux13_6)"
Detected timeout of ITS tools.
[2021-05-14 13:26:04] [INFO ] Flatten gal took : 6 ms
[2021-05-14 13:26:04] [INFO ] Applying decomposition
[2021-05-14 13:26:04] [INFO ] Flatten gal took : 6 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/graph9593496406757431217.txt, -o, /tmp/graph9593496406757431217.bin, -w, /tmp/graph9593496406757431217.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/graph9593496406757431217.bin, -l, -1, -v, -w, /tmp/graph9593496406757431217.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 13:26:07] [INFO ] Decomposing Gal with order
[2021-05-14 13:26:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 13:26:07] [INFO ] Removed a total of 66 redundant transitions.
[2021-05-14 13:26:07] [INFO ] Flatten gal took : 16 ms
[2021-05-14 13:26:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 2 ms.
[2021-05-14 13:26:07] [INFO ] Time to serialize gal into /tmp/LTL14703164626950116691.gal : 66 ms
[2021-05-14 13:26:07] [INFO ] Time to serialize properties into /tmp/LTL13832972853866268873.ltl : 2 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/LTL14703164626950116691.gal, -t, CGAL, -LTL, /tmp/LTL13832972853866268873.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/LTL14703164626950116691.gal -t CGAL -LTL /tmp/LTL13832972853866268873.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(gu2.aux6_5<=gu2.aux13_6)"))))
Formula 0 simplified : !GF"(gu2.aux6_5<=gu2.aux13_6)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6434032640486655898
[2021-05-14 13:26:28] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6434032640486655898
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/ltsmin6434032640486655898]
Compilation finished in 868 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin6434032640486655898]
Link finished in 42 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, [](<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin6434032640486655898]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PermAdmissibility-PT-05-14 finished in 56103 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 141 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 141/141 places, 512/512 transitions.
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 102 transition count 512
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 57 place count 84 transition count 354
Iterating global reduction 1 with 18 rules applied. Total rules applied 75 place count 84 transition count 354
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 95 place count 64 transition count 138
Iterating global reduction 1 with 20 rules applied. Total rules applied 115 place count 64 transition count 138
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 117 place count 62 transition count 122
Iterating global reduction 1 with 2 rules applied. Total rules applied 119 place count 62 transition count 122
Applied a total of 119 rules in 6 ms. Remains 62 /141 variables (removed 79) and now considering 122/512 (removed 390) transitions.
// Phase 1: matrix 122 rows 62 cols
[2021-05-14 13:26:49] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-14 13:26:49] [INFO ] Implicit Places using invariants in 46 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
// Phase 1: matrix 122 rows 61 cols
[2021-05-14 13:26:49] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-14 13:26:49] [INFO ] Dead Transitions using invariants and state equation in 96 ms returned []
Starting structural reductions, iteration 1 : 61/141 places, 122/512 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 122/122 (removed 0) transitions.
// Phase 1: matrix 122 rows 61 cols
[2021-05-14 13:26:49] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-14 13:26:49] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 2 iterations. Remains : 61/141 places, 122/512 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-05-15 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(LEQ 1 s13), p1:(LEQ s7 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 161 steps with 1 reset in 0 ms.
FORMULA PermAdmissibility-PT-05-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-15 finished in 5967 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11233469764638495795
[2021-05-14 13:26:49] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2021-05-14 13:26:49] [INFO ] Applying decomposition
[2021-05-14 13:26:49] [INFO ] Computation of Complete disable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 13:26:49] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2021-05-14 13:26:49] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 13:26:49] [INFO ] Flatten gal took : 28 ms
[2021-05-14 13:26:49] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
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/graph8119523505200141622.txt, -o, /tmp/graph8119523505200141622.bin, -w, /tmp/graph8119523505200141622.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/graph8119523505200141622.bin, -l, -1, -v, -w, /tmp/graph8119523505200141622.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 13:26:49] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 13:26:49] [INFO ] Decomposing Gal with order
[2021-05-14 13:26:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 13:26:49] [INFO ] Built C files in 175ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11233469764638495795
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/ltsmin11233469764638495795]
[2021-05-14 13:26:49] [INFO ] Removed a total of 856 redundant transitions.
[2021-05-14 13:26:49] [INFO ] Flatten gal took : 110 ms
[2021-05-14 13:26:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 202 labels/synchronizations in 15 ms.
[2021-05-14 13:26:49] [INFO ] Time to serialize gal into /tmp/LTLCardinality732025285277995115.gal : 3 ms
[2021-05-14 13:26:49] [INFO ] Time to serialize properties into /tmp/LTLCardinality17282968529910346907.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/LTLCardinality732025285277995115.gal, -t, CGAL, -LTL, /tmp/LTLCardinality17282968529910346907.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/LTLCardinality732025285277995115.gal -t CGAL -LTL /tmp/LTLCardinality17282968529910346907.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 3 LTL properties
Checking formula 0 : !((F(G(("((((((((gu1.aux12_6+gu1.aux12_5)+gu1.aux12_4)+gu1.aux12_3)+gu1.aux12_2)+gu1.aux12_1)+gu1.aux12_0)+gu1.aux12_7)>(((((((gu1.out5_1+gu1.out5_2)+gu1.out5_0)+gu1.out5_5)+gu1.out5_6)+gu1.out5_3)+gu1.out5_4)+gu1.out5_7))")U(("((((((((gu2.aux15_2+gu2.aux15_1)+gu2.aux15_0)+gu2.aux15_6)+gu2.aux15_5)+gu2.aux15_4)+gu2.aux15_3)+gu2.aux15_7)>=1)")&&(F("((((((((gu1.aux12_6+gu1.aux12_5)+gu1.aux12_4)+gu1.aux12_3)+gu1.aux12_2)+gu1.aux12_1)+gu1.aux12_0)+gu1.aux12_7)<=(((((((gu1.out5_1+gu1.out5_2)+gu1.out5_0)+gu1.out5_5)+gu1.out5_6)+gu1.out5_3)+gu1.out5_4)+gu1.out5_7))")))))))
Formula 0 simplified : !FG("((((((((gu1.aux12_6+gu1.aux12_5)+gu1.aux12_4)+gu1.aux12_3)+gu1.aux12_2)+gu1.aux12_1)+gu1.aux12_0)+gu1.aux12_7)>(((((((gu1.out5_1+gu1.out5_2)+gu1.out5_0)+gu1.out5_5)+gu1.out5_6)+gu1.out5_3)+gu1.out5_4)+gu1.out5_7))" U ("((((((((gu2.aux15_2+gu2.aux15_1)+gu2.aux15_0)+gu2.aux15_6)+gu2.aux15_5)+gu2.aux15_4)+gu2.aux15_3)+gu2.aux15_7)>=1)" & F"((((((((gu1.aux12_6+gu1.aux12_5)+gu1.aux12_4)+gu1.aux12_3)+gu1.aux12_2)+gu1.aux12_1)+gu1.aux12_0)+gu1.aux12_7)<=(((((((gu1.out5_1+gu1.out5_2)+gu1.out5_0)+gu1.out5_5)+gu1.out5_6)+gu1.out5_3)+gu1.out5_4)+gu1.out5_7))"))
Compilation finished in 3406 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11233469764638495795]
Link finished in 53 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>([](((LTLAPp0==true) U ((LTLAPp1==true)&&<>(!(LTLAPp0==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11233469764638495795]
WARNING : LTSmin timed out (>360 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>([](((LTLAPp0==true) U ((LTLAPp1==true)&&<>(!(LTLAPp0==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11233469764638495795]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(X(<>((LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11233469764638495795]
LTSmin run took 332 ms.
FORMULA PermAdmissibility-PT-05-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp3==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin11233469764638495795]
WARNING : LTSmin timed out (>360 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp3==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin11233469764638495795]
Retrying LTSmin with larger timeout 2880 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>([](((LTLAPp0==true) U ((LTLAPp1==true)&&<>(!(LTLAPp0==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11233469764638495795]
Detected timeout of ITS tools.
[2021-05-14 13:47:43] [INFO ] Flatten gal took : 58 ms
[2021-05-14 13:47:43] [INFO ] Time to serialize gal into /tmp/LTLCardinality17952052677623795610.gal : 4 ms
[2021-05-14 13:47:43] [INFO ] Time to serialize properties into /tmp/LTLCardinality8573477375051346895.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/LTLCardinality17952052677623795610.gal, -t, CGAL, -LTL, /tmp/LTLCardinality8573477375051346895.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/LTLCardinality17952052677623795610.gal -t CGAL -LTL /tmp/LTLCardinality8573477375051346895.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 2 LTL properties
Checking formula 0 : !((F(G(("((((((((aux12_6+aux12_5)+aux12_4)+aux12_3)+aux12_2)+aux12_1)+aux12_0)+aux12_7)>(((((((out5_1+out5_2)+out5_0)+out5_5)+out5_6)+out5_3)+out5_4)+out5_7))")U(("((((((((aux15_2+aux15_1)+aux15_0)+aux15_6)+aux15_5)+aux15_4)+aux15_3)+aux15_7)>=1)")&&(F("((((((((aux12_6+aux12_5)+aux12_4)+aux12_3)+aux12_2)+aux12_1)+aux12_0)+aux12_7)<=(((((((out5_1+out5_2)+out5_0)+out5_5)+out5_6)+out5_3)+out5_4)+out5_7))")))))))
Formula 0 simplified : !FG("((((((((aux12_6+aux12_5)+aux12_4)+aux12_3)+aux12_2)+aux12_1)+aux12_0)+aux12_7)>(((((((out5_1+out5_2)+out5_0)+out5_5)+out5_6)+out5_3)+out5_4)+out5_7))" U ("((((((((aux15_2+aux15_1)+aux15_0)+aux15_6)+aux15_5)+aux15_4)+aux15_3)+aux15_7)>=1)" & F"((((((((aux12_6+aux12_5)+aux12_4)+aux12_3)+aux12_2)+aux12_1)+aux12_0)+aux12_7)<=(((((((out5_1+out5_2)+out5_0)+out5_5)+out5_6)+out5_3)+out5_4)+out5_7))"))
Detected timeout of ITS tools.
[2021-05-14 14:08:37] [INFO ] Flatten gal took : 61 ms
[2021-05-14 14:08:37] [INFO ] Input system was already deterministic with 512 transitions.
[2021-05-14 14:08:37] [INFO ] Transformed 141 places.
[2021-05-14 14:08:37] [INFO ] Transformed 512 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-14 14:09:07] [INFO ] Time to serialize gal into /tmp/LTLCardinality4384213434086382412.gal : 3 ms
[2021-05-14 14:09:07] [INFO ] Time to serialize properties into /tmp/LTLCardinality1149987534345641403.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/LTLCardinality4384213434086382412.gal, -t, CGAL, -LTL, /tmp/LTLCardinality1149987534345641403.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/LTLCardinality4384213434086382412.gal -t CGAL -LTL /tmp/LTLCardinality1149987534345641403.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G(("((((((((aux12_6+aux12_5)+aux12_4)+aux12_3)+aux12_2)+aux12_1)+aux12_0)+aux12_7)>(((((((out5_1+out5_2)+out5_0)+out5_5)+out5_6)+out5_3)+out5_4)+out5_7))")U(("((((((((aux15_2+aux15_1)+aux15_0)+aux15_6)+aux15_5)+aux15_4)+aux15_3)+aux15_7)>=1)")&&(F("((((((((aux12_6+aux12_5)+aux12_4)+aux12_3)+aux12_2)+aux12_1)+aux12_0)+aux12_7)<=(((((((out5_1+out5_2)+out5_0)+out5_5)+out5_6)+out5_3)+out5_4)+out5_7))")))))))
Formula 0 simplified : !FG("((((((((aux12_6+aux12_5)+aux12_4)+aux12_3)+aux12_2)+aux12_1)+aux12_0)+aux12_7)>(((((((out5_1+out5_2)+out5_0)+out5_5)+out5_6)+out5_3)+out5_4)+out5_7))" U ("((((((((aux15_2+aux15_1)+aux15_0)+aux15_6)+aux15_5)+aux15_4)+aux15_3)+aux15_7)>=1)" & F"((((((((aux12_6+aux12_5)+aux12_4)+aux12_3)+aux12_2)+aux12_1)+aux12_0)+aux12_7)<=(((((((out5_1+out5_2)+out5_0)+out5_5)+out5_6)+out5_3)+out5_4)+out5_7))"))
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
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination 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="PermAdmissibility-PT-05"
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 PermAdmissibility-PT-05, 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 r140-tall-162089128000524"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-PT-05.tgz
mv PermAdmissibility-PT-05 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 '
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 ;