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-162089128000540.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-20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089128000540
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.1M
-rw-r--r-- 1 mcc users 26K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 185K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 357K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.8M 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 4.9K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 73K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Mar 27 06:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 06:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K Mar 25 08:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Mar 25 08:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.3K 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-20-00
FORMULA_NAME PermAdmissibility-PT-20-01
FORMULA_NAME PermAdmissibility-PT-20-02
FORMULA_NAME PermAdmissibility-PT-20-03
FORMULA_NAME PermAdmissibility-PT-20-04
FORMULA_NAME PermAdmissibility-PT-20-05
FORMULA_NAME PermAdmissibility-PT-20-06
FORMULA_NAME PermAdmissibility-PT-20-07
FORMULA_NAME PermAdmissibility-PT-20-08
FORMULA_NAME PermAdmissibility-PT-20-09
FORMULA_NAME PermAdmissibility-PT-20-10
FORMULA_NAME PermAdmissibility-PT-20-11
FORMULA_NAME PermAdmissibility-PT-20-12
FORMULA_NAME PermAdmissibility-PT-20-13
FORMULA_NAME PermAdmissibility-PT-20-14
FORMULA_NAME PermAdmissibility-PT-20-15

=== Now, execution of the tool begins

BK_START 1621003573669

Running Version 0
[2021-05-14 14:46:25] [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 14:46:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 14:46:25] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2021-05-14 14:46:25] [INFO ] Transformed 168 places.
[2021-05-14 14:46:25] [INFO ] Transformed 592 transitions.
[2021-05-14 14:46:25] [INFO ] Parsed PT model containing 168 places and 592 transitions in 159 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
[2021-05-14 14:46:25] [INFO ] Initial state test concluded for 3 properties.
FORMULA PermAdmissibility-PT-20-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-20-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 92 out of 168 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 147 transition count 592
Applied a total of 21 rules in 26 ms. Remains 147 /168 variables (removed 21) and now considering 592/592 (removed 0) transitions.
// Phase 1: matrix 592 rows 147 cols
[2021-05-14 14:46:25] [INFO ] Computed 21 place invariants in 31 ms
[2021-05-14 14:46:25] [INFO ] Implicit Places using invariants in 212 ms returned []
// Phase 1: matrix 592 rows 147 cols
[2021-05-14 14:46:25] [INFO ] Computed 21 place invariants in 17 ms
[2021-05-14 14:46:26] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
// Phase 1: matrix 592 rows 147 cols
[2021-05-14 14:46:26] [INFO ] Computed 21 place invariants in 16 ms
[2021-05-14 14:46:26] [INFO ] Dead Transitions using invariants and state equation in 278 ms returned []
Finished structural reductions, in 1 iterations. Remains : 147/168 places, 592/592 transitions.
[2021-05-14 14:46:26] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-14 14:46:26] [INFO ] Flatten gal took : 98 ms
FORMULA PermAdmissibility-PT-20-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 14:46:26] [INFO ] Flatten gal took : 63 ms
[2021-05-14 14:46:26] [INFO ] Input system was already deterministic with 592 transitions.
Incomplete random walk after 100019 steps, including 296 resets, run finished after 195 ms. (steps per millisecond=512 ) properties (out of 24) seen :22
Running SMT prover for 2 properties.
// Phase 1: matrix 592 rows 147 cols
[2021-05-14 14:46:27] [INFO ] Computed 21 place invariants in 6 ms
[2021-05-14 14:46:27] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 4 ms returned unsat
[2021-05-14 14:46:27] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 3 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
[2021-05-14 14:46:27] [INFO ] Initial state test concluded for 1 properties.
FORMULA PermAdmissibility-PT-20-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 147/147 places, 592/592 transitions.
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 104 transition count 592
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 69 place count 78 transition count 344
Iterating global reduction 1 with 26 rules applied. Total rules applied 95 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 119 place count 54 transition count 108
Iterating global reduction 1 with 24 rules applied. Total rules applied 143 place count 54 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 146 place count 51 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 149 place count 51 transition count 84
Applied a total of 149 rules in 20 ms. Remains 51 /147 variables (removed 96) and now considering 84/592 (removed 508) transitions.
// Phase 1: matrix 84 rows 51 cols
[2021-05-14 14:46:27] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-14 14:46:27] [INFO ] Implicit Places using invariants in 47 ms returned [0, 5, 18, 25]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 50 ms to find 4 implicit places.
// Phase 1: matrix 84 rows 47 cols
[2021-05-14 14:46:27] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 14:46:27] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Starting structural reductions, iteration 1 : 47/147 places, 84/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 47 /47 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 47 cols
[2021-05-14 14:46:27] [INFO ] Computed 12 place invariants in 4 ms
[2021-05-14 14:46:27] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 2 iterations. Remains : 47/147 places, 84/592 transitions.
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-20-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 868 reset in 573 ms.
Product exploration explored 100000 steps with 847 reset in 549 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 47 transition count 84
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)))), (NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 857 reset in 492 ms.
Product exploration explored 100000 steps with 863 reset in 482 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 47 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 47/47 places, 84/84 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 47 transition count 84
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 47 transition count 84
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 46 transition count 83
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 46 transition count 83
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 4 rules in 11 ms. Remains 46 /47 variables (removed 1) and now considering 83/84 (removed 1) transitions.
[2021-05-14 14:46:30] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 83 rows 46 cols
[2021-05-14 14:46:30] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 14:46:30] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 46/47 places, 83/84 transitions.
Product exploration explored 100000 steps with 1415 reset in 516 ms.
Product exploration explored 100000 steps with 1407 reset in 494 ms.
[2021-05-14 14:46:31] [INFO ] Flatten gal took : 8 ms
[2021-05-14 14:46:31] [INFO ] Flatten gal took : 6 ms
[2021-05-14 14:46:31] [INFO ] Time to serialize gal into /tmp/LTL11683034834800731176.gal : 3 ms
[2021-05-14 14:46:31] [INFO ] Time to serialize properties into /tmp/LTL2714134996204133327.ltl : 101 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/LTL11683034834800731176.gal, -t, CGAL, -LTL, /tmp/LTL2714134996204133327.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/LTL11683034834800731176.gal -t CGAL -LTL /tmp/LTL2714134996204133327.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(c19>=1)"))))
Formula 0 simplified : !XF"(c19>=1)"
Detected timeout of ITS tools.
[2021-05-14 14:46:54] [INFO ] Flatten gal took : 7 ms
[2021-05-14 14:46:54] [INFO ] Applying decomposition
[2021-05-14 14:46:54] [INFO ] Flatten gal took : 25 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/graph4021809061169253745.txt, -o, /tmp/graph4021809061169253745.bin, -w, /tmp/graph4021809061169253745.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/graph4021809061169253745.bin, -l, -1, -v, -w, /tmp/graph4021809061169253745.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 14:46:54] [INFO ] Decomposing Gal with order
[2021-05-14 14:46:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 14:46:54] [INFO ] Removed a total of 50 redundant transitions.
[2021-05-14 14:46:54] [INFO ] Flatten gal took : 65 ms
[2021-05-14 14:46:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 5 ms.
[2021-05-14 14:46:54] [INFO ] Time to serialize gal into /tmp/LTL1608324915747052304.gal : 3 ms
[2021-05-14 14:46:54] [INFO ] Time to serialize properties into /tmp/LTL2759953543080909003.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/LTL1608324915747052304.gal, -t, CGAL, -LTL, /tmp/LTL2759953543080909003.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/LTL1608324915747052304.gal -t CGAL -LTL /tmp/LTL2759953543080909003.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("(i3.u3.c19>=1)"))))
Formula 0 simplified : !XF"(i3.u3.c19>=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9676570500195353077
[2021-05-14 14:47:11] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9676570500195353077
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/ltsmin9676570500195353077]
Compilation finished in 923 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin9676570500195353077]
Link finished in 37 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, X(<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin9676570500195353077]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PermAdmissibility-PT-20-02 finished in 60685 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&X(p1)))))], workingDir=/home/mcc/execution]
Support contains 13 out of 147 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 147/147 places, 592/592 transitions.
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 104 transition count 592
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 62 place count 85 transition count 372
Iterating global reduction 1 with 19 rules applied. Total rules applied 81 place count 85 transition count 372
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 91 place count 75 transition count 262
Iterating global reduction 1 with 10 rules applied. Total rules applied 101 place count 75 transition count 262
Applied a total of 101 rules in 21 ms. Remains 75 /147 variables (removed 72) and now considering 262/592 (removed 330) transitions.
// Phase 1: matrix 262 rows 75 cols
[2021-05-14 14:47:27] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-14 14:47:28] [INFO ] Implicit Places using invariants in 68 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
// Phase 1: matrix 262 rows 74 cols
[2021-05-14 14:47:28] [INFO ] Computed 15 place invariants in 2 ms
[2021-05-14 14:47:28] [INFO ] Dead Transitions using invariants and state equation in 105 ms returned []
Starting structural reductions, iteration 1 : 74/147 places, 262/592 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 74 cols
[2021-05-14 14:47:28] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-14 14:47:28] [INFO ] Dead Transitions using invariants and state equation in 116 ms returned []
Finished structural reductions, in 2 iterations. Remains : 74/147 places, 262/592 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : PermAdmissibility-PT-20-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s71 (ADD s16 s21 s23 s24)), p1:(AND (OR (GT 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7)) (LEQ s71 (ADD s16 s21 s23 s24))) (LEQ s71 (ADD s16 s21 s23 s24)))], 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-20-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-04 finished in 456 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G((p1&&(p1 U p2)))))))], workingDir=/home/mcc/execution]
Support contains 33 out of 147 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 147/147 places, 592/592 transitions.
Graph (complete) has 1405 edges and 147 vertex of which 120 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.4 ms
Discarding 27 places :
Also discarding 0 output transitions
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 101 transition count 372
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 101 transition count 372
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 49 place count 91 transition count 262
Iterating global reduction 0 with 10 rules applied. Total rules applied 59 place count 91 transition count 262
Applied a total of 59 rules in 24 ms. Remains 91 /147 variables (removed 56) and now considering 262/592 (removed 330) transitions.
// Phase 1: matrix 262 rows 91 cols
[2021-05-14 14:47:28] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-14 14:47:28] [INFO ] Implicit Places using invariants in 73 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 73 ms to find 1 implicit places.
[2021-05-14 14:47:28] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 262 rows 90 cols
[2021-05-14 14:47:28] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-14 14:47:28] [INFO ] Dead Transitions using invariants and state equation in 105 ms returned []
Starting structural reductions, iteration 1 : 90/147 places, 262/592 transitions.
Applied a total of 0 rules in 8 ms. Remains 90 /90 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2021-05-14 14:47:28] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 262 rows 90 cols
[2021-05-14 14:47:28] [INFO ] Computed 17 place invariants in 2 ms
[2021-05-14 14:47:28] [INFO ] Dead Transitions using invariants and state equation in 102 ms returned []
Finished structural reductions, in 2 iterations. Remains : 90/147 places, 262/592 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : PermAdmissibility-PT-20-05 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=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ (ADD s41 s42 s43 s44 s45 s46 s47 s52) (ADD s19 s20 s22 s23 s24 s25 s26 s27)), p1:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7) s48), p2:(LEQ 1 (ADD s11 s12 s13 s14 s15 s16 s17 s18))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 320 reset in 781 ms.
Product exploration explored 100000 steps with 318 reset in 826 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 90 transition count 262
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)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), p0, p1, (NOT p2)]
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 321 reset in 726 ms.
Product exploration explored 100000 steps with 315 reset in 759 ms.
[2021-05-14 14:47:32] [INFO ] Flatten gal took : 18 ms
[2021-05-14 14:47:32] [INFO ] Flatten gal took : 17 ms
[2021-05-14 14:47:32] [INFO ] Time to serialize gal into /tmp/LTL3838635676699926442.gal : 3 ms
[2021-05-14 14:47:32] [INFO ] Time to serialize properties into /tmp/LTL246529213632070299.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/LTL3838635676699926442.gal, -t, CGAL, -LTL, /tmp/LTL246529213632070299.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/LTL3838635676699926442.gal -t CGAL -LTL /tmp/LTL246529213632070299.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((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))"))&&(F(G(("((((((((aux16_0+aux16_1)+aux16_2)+aux16_3)+aux16_4)+aux16_5)+aux16_6)+aux16_7)<=c13)")&&(("((((((((aux16_0+aux16_1)+aux16_2)+aux16_3)+aux16_4)+aux16_5)+aux16_6)+aux16_7)<=c13)")U("((((((((out7_1+out7_0)+out7_3)+out7_2)+out7_5)+out7_4)+out7_7)+out7_6)>=1)"))))))))
Formula 0 simplified : !G(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))" & FG("((((((((aux16_0+aux16_1)+aux16_2)+aux16_3)+aux16_4)+aux16_5)+aux16_6)+aux16_7)<=c13)" & ("((((((((aux16_0+aux16_1)+aux16_2)+aux16_3)+aux16_4)+aux16_5)+aux16_6)+aux16_7)<=c13)" U "((((((((out7_1+out7_0)+out7_3)+out7_2)+out7_5)+out7_4)+out7_7)+out7_6)>=1)")))
Detected timeout of ITS tools.
[2021-05-14 14:47:47] [INFO ] Flatten gal took : 16 ms
[2021-05-14 14:47:47] [INFO ] Applying decomposition
[2021-05-14 14:47:47] [INFO ] Flatten gal took : 29 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/graph10447075847951882341.txt, -o, /tmp/graph10447075847951882341.bin, -w, /tmp/graph10447075847951882341.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/graph10447075847951882341.bin, -l, -1, -v, -w, /tmp/graph10447075847951882341.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 14:47:47] [INFO ] Decomposing Gal with order
[2021-05-14 14:47:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 14:47:47] [INFO ] Removed a total of 404 redundant transitions.
[2021-05-14 14:47:47] [INFO ] Flatten gal took : 79 ms
[2021-05-14 14:47:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 5 ms.
[2021-05-14 14:47:47] [INFO ] Time to serialize gal into /tmp/LTL8555472739972827411.gal : 3 ms
[2021-05-14 14:47:47] [INFO ] Time to serialize properties into /tmp/LTL8622157024816749548.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/LTL8555472739972827411.gal, -t, CGAL, -LTL, /tmp/LTL8622157024816749548.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/LTL8555472739972827411.gal -t CGAL -LTL /tmp/LTL8622157024816749548.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((F("((((((((gu2.aux12_6+gu2.aux12_5)+gu2.aux12_4)+gu2.aux12_3)+gu2.aux12_2)+gu2.aux12_1)+gu2.aux12_0)+gu2.aux12_7)<=(((((((gu2.out5_1+gu2.out5_2)+gu2.out5_0)+gu2.out5_5)+gu2.out5_6)+gu2.out5_3)+gu2.out5_4)+gu2.out5_7))"))&&(F(G(("((((((((gu0.aux16_0+gu0.aux16_1)+gu0.aux16_2)+gu0.aux16_3)+gu0.aux16_4)+gu0.aux16_5)+gu0.aux16_6)+gu0.aux16_7)<=gu0.c13)")&&(("((((((((gu0.aux16_0+gu0.aux16_1)+gu0.aux16_2)+gu0.aux16_3)+gu0.aux16_4)+gu0.aux16_5)+gu0.aux16_6)+gu0.aux16_7)<=gu0.c13)")U("((((((((gu1.out7_1+gu1.out7_0)+gu1.out7_3)+gu1.out7_2)+gu1.out7_5)+gu1.out7_4)+gu1.out7_7)+gu1.out7_6)>=1)"))))))))
Formula 0 simplified : !G(F"((((((((gu2.aux12_6+gu2.aux12_5)+gu2.aux12_4)+gu2.aux12_3)+gu2.aux12_2)+gu2.aux12_1)+gu2.aux12_0)+gu2.aux12_7)<=(((((((gu2.out5_1+gu2.out5_2)+gu2.out5_0)+gu2.out5_5)+gu2.out5_6)+gu2.out5_3)+gu2.out5_4)+gu2.out5_7))" & FG("((((((((gu0.aux16_0+gu0.aux16_1)+gu0.aux16_2)+gu0.aux16_3)+gu0.aux16_4)+gu0.aux16_5)+gu0.aux16_6)+gu0.aux16_7)<=gu0.c13)" & ("((((((((gu0.aux16_0+gu0.aux16_1)+gu0.aux16_2)+gu0.aux16_3)+gu0.aux16_4)+gu0.aux16_5)+gu0.aux16_6)+gu0.aux16_7)<=gu0.c13)" U "((((((((gu1.out7_1+gu1.out7_0)+gu1.out7_3)+gu1.out7_2)+gu1.out7_5)+gu1.out7_4)+gu1.out7_7)+gu1.out7_6)>=1)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9110409227468701925
[2021-05-14 14:48:02] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9110409227468701925
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/ltsmin9110409227468701925]
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/ltsmin9110409227468701925] 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/ltsmin9110409227468701925] 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-20-05 finished in 35409 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 9 out of 147 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 147/147 places, 592/592 transitions.
Graph (complete) has 1405 edges and 147 vertex of which 112 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.3 ms
Discarding 35 places :
Also discarding 0 output transitions
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 92 transition count 356
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 92 transition count 356
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 55 place count 78 transition count 230
Iterating global reduction 0 with 14 rules applied. Total rules applied 69 place count 78 transition count 230
Applied a total of 69 rules in 21 ms. Remains 78 /147 variables (removed 69) and now considering 230/592 (removed 362) transitions.
// Phase 1: matrix 230 rows 78 cols
[2021-05-14 14:48:03] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-14 14:48:03] [INFO ] Implicit Places using invariants in 94 ms returned [0, 18, 33, 44]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 95 ms to find 4 implicit places.
[2021-05-14 14:48:03] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 230 rows 74 cols
[2021-05-14 14:48:03] [INFO ] Computed 13 place invariants in 2 ms
[2021-05-14 14:48:04] [INFO ] Dead Transitions using invariants and state equation in 94 ms returned []
Starting structural reductions, iteration 1 : 74/147 places, 230/592 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 15 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 14:48:04] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-14 14:48:04] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 228 rows 72 cols
[2021-05-14 14:48:04] [INFO ] Computed 13 place invariants in 8 ms
[2021-05-14 14:48:04] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 72/147 places, 228/592 transitions.
Stuttering acceptance computed with spot in 10767 ms :[true, (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-20-06 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:(LEQ (ADD s10 s11 s12 s13 s14 s15 s16 s17) s9)], 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 30 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-20-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-06 finished in 11175 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 8 out of 147 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 147/147 places, 592/592 transitions.
Graph (complete) has 1405 edges and 147 vertex of which 112 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.2 ms
Discarding 35 places :
Also discarding 0 output transitions
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 92 transition count 356
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 92 transition count 356
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 55 place count 78 transition count 230
Iterating global reduction 0 with 14 rules applied. Total rules applied 69 place count 78 transition count 230
Applied a total of 69 rules in 18 ms. Remains 78 /147 variables (removed 69) and now considering 230/592 (removed 362) transitions.
// Phase 1: matrix 230 rows 78 cols
[2021-05-14 14:48:15] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-14 14:48:15] [INFO ] Implicit Places using invariants in 85 ms returned [0, 5, 33, 44]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 86 ms to find 4 implicit places.
[2021-05-14 14:48:15] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 230 rows 74 cols
[2021-05-14 14:48:15] [INFO ] Computed 13 place invariants in 6 ms
[2021-05-14 14:48:15] [INFO ] Dead Transitions using invariants and state equation in 192 ms returned []
Starting structural reductions, iteration 1 : 74/147 places, 230/592 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 10 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 14:48:15] [INFO ] Computed 13 place invariants in 2 ms
[2021-05-14 14:48:15] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 228 rows 72 cols
[2021-05-14 14:48:15] [INFO ] Computed 13 place invariants in 9 ms
[2021-05-14 14:48:15] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 72/147 places, 228/592 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-20-07 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 2 (ADD s13 s14 s16 s17 s18 s19 s20 s21))], 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 1717 reset in 614 ms.
Product exploration explored 100000 steps with 1718 reset in 625 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 72 transition count 228
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)))), (NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1706 reset in 598 ms.
Product exploration explored 100000 steps with 1709 reset in 626 ms.
[2021-05-14 14:48:18] [INFO ] Flatten gal took : 13 ms
[2021-05-14 14:48:18] [INFO ] Flatten gal took : 13 ms
[2021-05-14 14:48:18] [INFO ] Time to serialize gal into /tmp/LTL13827765402295101941.gal : 2 ms
[2021-05-14 14:48:18] [INFO ] Time to serialize properties into /tmp/LTL11936603229792414240.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/LTL13827765402295101941.gal, -t, CGAL, -LTL, /tmp/LTL11936603229792414240.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/LTL13827765402295101941.gal -t CGAL -LTL /tmp/LTL11936603229792414240.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((out2_0+out2_7)+out2_5)+out2_6)+out2_3)+out2_4)+out2_1)+out2_2)>=2)"))))
Formula 0 simplified : !GF"((((((((out2_0+out2_7)+out2_5)+out2_6)+out2_3)+out2_4)+out2_1)+out2_2)>=2)"
Detected timeout of ITS tools.
[2021-05-14 14:48:33] [INFO ] Flatten gal took : 24 ms
[2021-05-14 14:48:33] [INFO ] Applying decomposition
[2021-05-14 14:48:33] [INFO ] Flatten gal took : 12 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/graph948252943241995096.txt, -o, /tmp/graph948252943241995096.bin, -w, /tmp/graph948252943241995096.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/graph948252943241995096.bin, -l, -1, -v, -w, /tmp/graph948252943241995096.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 14:48:33] [INFO ] Decomposing Gal with order
[2021-05-14 14:48:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 14:48:33] [INFO ] Removed a total of 39 redundant transitions.
[2021-05-14 14:48:33] [INFO ] Flatten gal took : 30 ms
[2021-05-14 14:48:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 2 ms.
[2021-05-14 14:48:33] [INFO ] Time to serialize gal into /tmp/LTL17096545759220476890.gal : 3 ms
[2021-05-14 14:48:33] [INFO ] Time to serialize properties into /tmp/LTL13835551284762488559.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/LTL17096545759220476890.gal, -t, CGAL, -LTL, /tmp/LTL13835551284762488559.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/LTL17096545759220476890.gal -t CGAL -LTL /tmp/LTL13835551284762488559.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((gu1.out2_0+gu1.out2_7)+gu1.out2_5)+gu1.out2_6)+gu1.out2_3)+gu1.out2_4)+gu1.out2_1)+gu1.out2_2)>=2)"))))
Formula 0 simplified : !GF"((((((((gu1.out2_0+gu1.out2_7)+gu1.out2_5)+gu1.out2_6)+gu1.out2_3)+gu1.out2_4)+gu1.out2_1)+gu1.out2_2)>=2)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin841644371645004368
[2021-05-14 14:48:48] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin841644371645004368
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/ltsmin841644371645004368]
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/ltsmin841644371645004368] 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/ltsmin841644371645004368] 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-20-07 finished in 34478 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(F((p1&&(X(p3)||p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 147 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 147/147 places, 592/592 transitions.
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 104 transition count 592
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 68 place count 79 transition count 346
Iterating global reduction 1 with 25 rules applied. Total rules applied 93 place count 79 transition count 346
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 114 place count 58 transition count 132
Iterating global reduction 1 with 21 rules applied. Total rules applied 135 place count 58 transition count 132
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 137 place count 56 transition count 116
Iterating global reduction 1 with 2 rules applied. Total rules applied 139 place count 56 transition count 116
Applied a total of 139 rules in 7 ms. Remains 56 /147 variables (removed 91) and now considering 116/592 (removed 476) transitions.
// Phase 1: matrix 116 rows 56 cols
[2021-05-14 14:48:49] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-14 14:48:49] [INFO ] Implicit Places using invariants in 43 ms returned [0, 5, 20, 28]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 44 ms to find 4 implicit places.
// Phase 1: matrix 116 rows 52 cols
[2021-05-14 14:48:49] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 14:48:49] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Starting structural reductions, iteration 1 : 52/147 places, 116/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 52 cols
[2021-05-14 14:48:49] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 14:48:49] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 2 iterations. Remains : 52/147 places, 116/592 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3)))]
Running random walk in product with property : PermAdmissibility-PT-20-08 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(GT 2 s7), p2:(OR (GT s3 s31) (GT s19 s8)), p3:(GT s3 s31), p0:(LEQ s19 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1496 reset in 506 ms.
Product exploration explored 100000 steps with 1479 reset in 522 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 52 transition count 116
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 p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p0) (G (NOT p0)))), p1, (NOT p2), (NOT p3), p0]
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3)))]
Product exploration explored 100000 steps with 1476 reset in 496 ms.
Product exploration explored 100000 steps with 1500 reset in 514 ms.
[2021-05-14 14:49:02] [INFO ] Flatten gal took : 7 ms
[2021-05-14 14:49:02] [INFO ] Flatten gal took : 7 ms
[2021-05-14 14:49:02] [INFO ] Time to serialize gal into /tmp/LTL16003329616496641850.gal : 1 ms
[2021-05-14 14:49:02] [INFO ] Time to serialize properties into /tmp/LTL12650290730524059836.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/LTL16003329616496641850.gal, -t, CGAL, -LTL, /tmp/LTL12650290730524059836.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/LTL16003329616496641850.gal -t CGAL -LTL /tmp/LTL12650290730524059836.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("(aux11_5<=c17)"))||(X(F(("(aux13_6<2)")&&(("((c19>aux7_2)||(aux11_5>c17))")||(X("(c19>aux7_2)"))))))))
Formula 0 simplified : !(G"(aux11_5<=c17)" | XF("(aux13_6<2)" & ("((c19>aux7_2)||(aux11_5>c17))" | X"(c19>aux7_2)")))
Detected timeout of ITS tools.
[2021-05-14 14:49:19] [INFO ] Flatten gal took : 11 ms
[2021-05-14 14:49:19] [INFO ] Applying decomposition
[2021-05-14 14:49:19] [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/graph11173300757546983246.txt, -o, /tmp/graph11173300757546983246.bin, -w, /tmp/graph11173300757546983246.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/graph11173300757546983246.bin, -l, -1, -v, -w, /tmp/graph11173300757546983246.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 14:49:19] [INFO ] Decomposing Gal with order
[2021-05-14 14:49:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 14:49:19] [INFO ] Removed a total of 74 redundant transitions.
[2021-05-14 14:49:19] [INFO ] Flatten gal took : 14 ms
[2021-05-14 14:49:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 65 labels/synchronizations in 2 ms.
[2021-05-14 14:49:19] [INFO ] Time to serialize gal into /tmp/LTL5532852502753594963.gal : 1 ms
[2021-05-14 14:49:19] [INFO ] Time to serialize properties into /tmp/LTL16205586686038080918.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/LTL5532852502753594963.gal, -t, CGAL, -LTL, /tmp/LTL16205586686038080918.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/LTL5532852502753594963.gal -t CGAL -LTL /tmp/LTL16205586686038080918.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("(gu1.aux11_5<=gu1.c17)"))||(X(F(("(gi2.gu2.aux13_6<2)")&&(("((gu0.c19>gu0.aux7_2)||(gu1.aux11_5>gu1.c17))")||(X("(gu0.c19>gu0.aux7_2)"))))))))
Formula 0 simplified : !(G"(gu1.aux11_5<=gu1.c17)" | XF("(gi2.gu2.aux13_6<2)" & ("((gu0.c19>gu0.aux7_2)||(gu1.aux11_5>gu1.c17))" | X"(gu0.c19>gu0.aux7_2)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12978621791090948646
[2021-05-14 14:49:36] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12978621791090948646
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/ltsmin12978621791090948646]
Compilation finished in 549 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin12978621791090948646]
Link finished in 37 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))||X(<>(((LTLAPp1==true)&&(X((LTLAPp3==true))||(LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12978621791090948646]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PermAdmissibility-PT-20-08 finished in 61631 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 147/147 places, 592/592 transitions.
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 105 transition count 592
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 66 place count 81 transition count 352
Iterating global reduction 1 with 24 rules applied. Total rules applied 90 place count 81 transition count 352
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 110 place count 61 transition count 132
Iterating global reduction 1 with 20 rules applied. Total rules applied 130 place count 61 transition count 132
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 132 place count 59 transition count 116
Iterating global reduction 1 with 2 rules applied. Total rules applied 134 place count 59 transition count 116
Applied a total of 134 rules in 14 ms. Remains 59 /147 variables (removed 88) and now considering 116/592 (removed 476) transitions.
// Phase 1: matrix 116 rows 59 cols
[2021-05-14 14:49:51] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-14 14:49:51] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 116 rows 59 cols
[2021-05-14 14:49:51] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-14 14:49:51] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
// Phase 1: matrix 116 rows 59 cols
[2021-05-14 14:49:51] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-14 14:49:51] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Finished structural reductions, in 1 iterations. Remains : 59/147 places, 116/592 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-20-09 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:(OR (GT s5 s49) (LEQ 2 s7))], 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]]
Stuttering criterion allowed to conclude after 3394 steps with 28 reset in 18 ms.
FORMULA PermAdmissibility-PT-20-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-09 finished in 281 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 147 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 147/147 places, 592/592 transitions.
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 105 transition count 592
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 67 place count 80 transition count 346
Iterating global reduction 1 with 25 rules applied. Total rules applied 92 place count 80 transition count 346
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 114 place count 58 transition count 124
Iterating global reduction 1 with 22 rules applied. Total rules applied 136 place count 58 transition count 124
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 138 place count 56 transition count 108
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 56 transition count 108
Applied a total of 140 rules in 10 ms. Remains 56 /147 variables (removed 91) and now considering 108/592 (removed 484) transitions.
// Phase 1: matrix 108 rows 56 cols
[2021-05-14 14:49:51] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-14 14:49:51] [INFO ] Implicit Places using invariants in 44 ms returned [0, 5, 20, 28]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 53 ms to find 4 implicit places.
// Phase 1: matrix 108 rows 52 cols
[2021-05-14 14:49:51] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 14:49:51] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Starting structural reductions, iteration 1 : 52/147 places, 108/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 108/108 (removed 0) transitions.
// Phase 1: matrix 108 rows 52 cols
[2021-05-14 14:49:51] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 14:49:51] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 2 iterations. Remains : 52/147 places, 108/592 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-20-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: 1}]], initial=2, aps=[p0:(GT 1 s10)], 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 155 ms.
Product exploration explored 100000 steps with 33333 reset in 161 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 52 transition count 108
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 200 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 147 ms.
Product exploration explored 100000 steps with 33333 reset in 169 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 861 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 52 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 52/52 places, 108/108 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 52 transition count 108
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 52 transition count 108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 51 transition count 107
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 51 transition count 107
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 4 rules in 7 ms. Remains 51 /52 variables (removed 1) and now considering 107/108 (removed 1) transitions.
[2021-05-14 14:49:53] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 107 rows 51 cols
[2021-05-14 14:49:53] [INFO ] Computed 12 place invariants in 7 ms
[2021-05-14 14:49:53] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Finished structural reductions, in 1 iterations. Remains : 51/52 places, 107/108 transitions.
Product exploration explored 100000 steps with 33333 reset in 278 ms.
Product exploration explored 100000 steps with 33333 reset in 295 ms.
[2021-05-14 14:49:54] [INFO ] Flatten gal took : 5 ms
[2021-05-14 14:49:54] [INFO ] Flatten gal took : 5 ms
[2021-05-14 14:49:54] [INFO ] Time to serialize gal into /tmp/LTL4891865487444963724.gal : 1 ms
[2021-05-14 14:49:54] [INFO ] Time to serialize properties into /tmp/LTL6653983065532414056.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/LTL4891865487444963724.gal, -t, CGAL, -LTL, /tmp/LTL6653983065532414056.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/LTL4891865487444963724.gal -t CGAL -LTL /tmp/LTL6653983065532414056.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(out2_4<1)")))))
Formula 0 simplified : !XXF"(out2_4<1)"
Detected timeout of ITS tools.
[2021-05-14 14:50:09] [INFO ] Flatten gal took : 5 ms
[2021-05-14 14:50:09] [INFO ] Applying decomposition
[2021-05-14 14:50:09] [INFO ] Flatten gal took : 5 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/graph15402293357761496887.txt, -o, /tmp/graph15402293357761496887.bin, -w, /tmp/graph15402293357761496887.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/graph15402293357761496887.bin, -l, -1, -v, -w, /tmp/graph15402293357761496887.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 14:50:09] [INFO ] Decomposing Gal with order
[2021-05-14 14:50:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 14:50:09] [INFO ] Removed a total of 68 redundant transitions.
[2021-05-14 14:50:09] [INFO ] Flatten gal took : 31 ms
[2021-05-14 14:50:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 9 ms.
[2021-05-14 14:50:09] [INFO ] Time to serialize gal into /tmp/LTL15579175324727471282.gal : 18 ms
[2021-05-14 14:50:09] [INFO ] Time to serialize properties into /tmp/LTL4537645350719564241.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/LTL15579175324727471282.gal, -t, CGAL, -LTL, /tmp/LTL4537645350719564241.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/LTL15579175324727471282.gal -t CGAL -LTL /tmp/LTL4537645350719564241.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(u0.out2_4<1)")))))
Formula 0 simplified : !XXF"(u0.out2_4<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5295762752902008704
[2021-05-14 14:50:24] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5295762752902008704
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/ltsmin5295762752902008704]
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/ltsmin5295762752902008704] 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/ltsmin5295762752902008704] 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-20-10 finished in 34397 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 147/147 places, 592/592 transitions.
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 105 transition count 592
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 67 place count 80 transition count 348
Iterating global reduction 1 with 25 rules applied. Total rules applied 92 place count 80 transition count 348
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 114 place count 58 transition count 118
Iterating global reduction 1 with 22 rules applied. Total rules applied 136 place count 58 transition count 118
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 139 place count 55 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 142 place count 55 transition count 94
Applied a total of 142 rules in 7 ms. Remains 55 /147 variables (removed 92) and now considering 94/592 (removed 498) transitions.
// Phase 1: matrix 94 rows 55 cols
[2021-05-14 14:50:35] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-14 14:50:35] [INFO ] Implicit Places using invariants in 57 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
// Phase 1: matrix 94 rows 54 cols
[2021-05-14 14:50:35] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-14 14:50:35] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Starting structural reductions, iteration 1 : 54/147 places, 94/592 transitions.
Applied a total of 0 rules in 0 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
// Phase 1: matrix 94 rows 54 cols
[2021-05-14 14:50:35] [INFO ] Computed 15 place invariants in 0 ms
[2021-05-14 14:50:35] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Finished structural reductions, in 2 iterations. Remains : 54/147 places, 94/592 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-20-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 168 ms.
Product exploration explored 100000 steps with 50000 reset in 196 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 94
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 47 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 166 ms.
Product exploration explored 100000 steps with 50000 reset in 158 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 54 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 54/54 places, 94/94 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2021-05-14 14:50:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 94 rows 54 cols
[2021-05-14 14:50:36] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-14 14:50:36] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 94/94 transitions.
Product exploration explored 100000 steps with 50000 reset in 324 ms.
Product exploration explored 100000 steps with 50000 reset in 336 ms.
[2021-05-14 14:50:37] [INFO ] Flatten gal took : 4 ms
[2021-05-14 14:50:37] [INFO ] Flatten gal took : 6 ms
[2021-05-14 14:50:37] [INFO ] Time to serialize gal into /tmp/LTL16523032620973277459.gal : 1 ms
[2021-05-14 14:50:37] [INFO ] Time to serialize properties into /tmp/LTL14823309921829771210.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/LTL16523032620973277459.gal, -t, CGAL, -LTL, /tmp/LTL14823309921829771210.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/LTL16523032620973277459.gal -t CGAL -LTL /tmp/LTL14823309921829771210.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(out3_2<1)"))))
Formula 0 simplified : !XF"(out3_2<1)"
Detected timeout of ITS tools.
[2021-05-14 14:50:52] [INFO ] Flatten gal took : 5 ms
[2021-05-14 14:50:52] [INFO ] Applying decomposition
[2021-05-14 14:50:52] [INFO ] Flatten gal took : 5 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/graph5052391953703572253.txt, -o, /tmp/graph5052391953703572253.bin, -w, /tmp/graph5052391953703572253.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/graph5052391953703572253.bin, -l, -1, -v, -w, /tmp/graph5052391953703572253.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 14:50:52] [INFO ] Decomposing Gal with order
[2021-05-14 14:50:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 14:50:52] [INFO ] Removed a total of 73 redundant transitions.
[2021-05-14 14:50:52] [INFO ] Flatten gal took : 10 ms
[2021-05-14 14:50:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 2 ms.
[2021-05-14 14:50:52] [INFO ] Time to serialize gal into /tmp/LTL17999857663112953872.gal : 1 ms
[2021-05-14 14:50:52] [INFO ] Time to serialize properties into /tmp/LTL5390776799844311194.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/LTL17999857663112953872.gal, -t, CGAL, -LTL, /tmp/LTL5390776799844311194.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/LTL17999857663112953872.gal -t CGAL -LTL /tmp/LTL5390776799844311194.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("(i0.u0.out3_2<1)"))))
Formula 0 simplified : !XF"(i0.u0.out3_2<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5699719656463034423
[2021-05-14 14:51:07] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5699719656463034423
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/ltsmin5699719656463034423]
Compilation finished in 465 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5699719656463034423]
Link finished in 38 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, X(<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin5699719656463034423]
LTSmin run took 495 ms.
FORMULA PermAdmissibility-PT-20-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-PT-20-11 finished in 42572 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G((p0||F(p1)))&&X(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 147/147 places, 592/592 transitions.
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 105 transition count 592
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 67 place count 80 transition count 348
Iterating global reduction 1 with 25 rules applied. Total rules applied 92 place count 80 transition count 348
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 113 place count 59 transition count 122
Iterating global reduction 1 with 21 rules applied. Total rules applied 134 place count 59 transition count 122
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 136 place count 57 transition count 106
Iterating global reduction 1 with 2 rules applied. Total rules applied 138 place count 57 transition count 106
Applied a total of 138 rules in 6 ms. Remains 57 /147 variables (removed 90) and now considering 106/592 (removed 486) transitions.
// Phase 1: matrix 106 rows 57 cols
[2021-05-14 14:51:08] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-14 14:51:08] [INFO ] Implicit Places using invariants in 63 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
// Phase 1: matrix 106 rows 56 cols
[2021-05-14 14:51:08] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-14 14:51:08] [INFO ] Dead Transitions using invariants and state equation in 101 ms returned []
Starting structural reductions, iteration 1 : 56/147 places, 106/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 56 /56 variables (removed 0) and now considering 106/106 (removed 0) transitions.
// Phase 1: matrix 106 rows 56 cols
[2021-05-14 14:51:08] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-14 14:51:08] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Finished structural reductions, in 2 iterations. Remains : 56/147 places, 106/592 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-20-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT s42 s31), p1:(GT s10 s38)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 5013 steps with 23 reset in 26 ms.
FORMULA PermAdmissibility-PT-20-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-13 finished in 467 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||(p1 U (p2||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 147/147 places, 592/592 transitions.
Graph (complete) has 1405 edges and 147 vertex of which 104 are kept as prefixes of interest. Removing 43 places using SCC suffix rule.1 ms
Discarding 43 places :
Also discarding 0 output transitions
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 26 place count 79 transition count 346
Iterating global reduction 0 with 25 rules applied. Total rules applied 51 place count 79 transition count 346
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 73 place count 57 transition count 124
Iterating global reduction 0 with 22 rules applied. Total rules applied 95 place count 57 transition count 124
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 97 place count 55 transition count 108
Iterating global reduction 0 with 2 rules applied. Total rules applied 99 place count 55 transition count 108
Applied a total of 99 rules in 12 ms. Remains 55 /147 variables (removed 92) and now considering 108/592 (removed 484) transitions.
// Phase 1: matrix 108 rows 55 cols
[2021-05-14 14:51:08] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-14 14:51:08] [INFO ] Implicit Places using invariants in 77 ms returned [0, 5, 20, 27]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 84 ms to find 4 implicit places.
[2021-05-14 14:51:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 108 rows 51 cols
[2021-05-14 14:51:08] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 14:51:08] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Starting structural reductions, iteration 1 : 51/147 places, 108/592 transitions.
Applied a total of 0 rules in 9 ms. Remains 51 /51 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2021-05-14 14:51:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 108 rows 51 cols
[2021-05-14 14:51:09] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 14:51:09] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Finished structural reductions, in 2 iterations. Remains : 51/147 places, 108/592 transitions.
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-20-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p2:(AND (LEQ s11 s40) (GT s14 s7)), p0:(GT s11 s40), p1:(GT s14 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 323 steps with 1 reset in 2 ms.
FORMULA PermAdmissibility-PT-20-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-14 finished in 281 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 147/147 places, 592/592 transitions.
Graph (complete) has 1405 edges and 147 vertex of which 104 are kept as prefixes of interest. Removing 43 places using SCC suffix rule.1 ms
Discarding 43 places :
Also discarding 0 output transitions
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 27 place count 78 transition count 344
Iterating global reduction 0 with 26 rules applied. Total rules applied 53 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 77 place count 54 transition count 108
Iterating global reduction 0 with 24 rules applied. Total rules applied 101 place count 54 transition count 108
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 104 place count 51 transition count 84
Iterating global reduction 0 with 3 rules applied. Total rules applied 107 place count 51 transition count 84
Applied a total of 107 rules in 9 ms. Remains 51 /147 variables (removed 96) and now considering 84/592 (removed 508) transitions.
// Phase 1: matrix 84 rows 51 cols
[2021-05-14 14:51:09] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-14 14:51:09] [INFO ] Implicit Places using invariants in 36 ms returned [0, 5, 18, 25]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 36 ms to find 4 implicit places.
[2021-05-14 14:51:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 84 rows 47 cols
[2021-05-14 14:51:09] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-14 14:51:09] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Starting structural reductions, iteration 1 : 47/147 places, 84/592 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2021-05-14 14:51:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 84 rows 47 cols
[2021-05-14 14:51:09] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-14 14:51:09] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 2 iterations. Remains : 47/147 places, 84/592 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-20-15 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT 2 s36)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 311 reset in 342 ms.
Product exploration explored 100000 steps with 311 reset in 360 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 47 transition count 84
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 (G p0)), p0]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA PermAdmissibility-PT-20-15 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property PermAdmissibility-PT-20-15 finished in 936 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3110591696145482594
[2021-05-14 14:51:10] [INFO ] Computing symmetric may disable matrix : 592 transitions.
[2021-05-14 14:51:10] [INFO ] Applying decomposition
[2021-05-14 14:51:10] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 14:51:10] [INFO ] Computing symmetric may enable matrix : 592 transitions.
[2021-05-14 14:51:10] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 14:51:10] [INFO ] Flatten gal took : 29 ms
[2021-05-14 14:51:10] [INFO ] Computing Do-Not-Accords matrix : 592 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/graph8070736470828807712.txt, -o, /tmp/graph8070736470828807712.bin, -w, /tmp/graph8070736470828807712.weights], workingDir=null]
[2021-05-14 14:51:10] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph8070736470828807712.bin, -l, -1, -v, -w, /tmp/graph8070736470828807712.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 14:51:10] [INFO ] Decomposing Gal with order
[2021-05-14 14:51:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 14:51:10] [INFO ] Built C files in 137ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3110591696145482594
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/ltsmin3110591696145482594]
[2021-05-14 14:51:10] [INFO ] Removed a total of 1369 redundant transitions.
[2021-05-14 14:51:10] [INFO ] Flatten gal took : 122 ms
[2021-05-14 14:51:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 209 labels/synchronizations in 17 ms.
[2021-05-14 14:51:10] [INFO ] Time to serialize gal into /tmp/LTLCardinality3247477462449477077.gal : 3 ms
[2021-05-14 14:51:10] [INFO ] Time to serialize properties into /tmp/LTLCardinality12484303615991964544.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/LTLCardinality3247477462449477077.gal, -t, CGAL, -LTL, /tmp/LTLCardinality12484303615991964544.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/LTLCardinality3247477462449477077.gal -t CGAL -LTL /tmp/LTLCardinality12484303615991964544.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 5 LTL properties
Checking formula 0 : !((X(F("(gi3.gu4.c19>=1)"))))
Formula 0 simplified : !XF"(gi3.gu4.c19>=1)"
Compilation finished in 12119 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin3110591696145482594]
Link finished in 63 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, X(<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin3110591696145482594]
WARNING : LTSmin timed out (>276 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin3110591696145482594]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, []((<>((LTLAPp1==true))&&<>([](((LTLAPp2==true)&&((LTLAPp2==true) U (LTLAPp3==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin3110591696145482594]
WARNING : LTSmin timed out (>276 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, []((<>((LTLAPp1==true))&&<>([](((LTLAPp2==true)&&((LTLAPp2==true) U (LTLAPp3==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin3110591696145482594]
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, [](<>((LTLAPp4==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin3110591696145482594]
WARNING : LTSmin timed out (>276 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, [](<>((LTLAPp4==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin3110591696145482594]
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, ([]((LTLAPp5==true))||X(<>(((LTLAPp6==true)&&(X((LTLAPp8==true))||(LTLAPp7==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin3110591696145482594]
WARNING : LTSmin timed out (>276 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, ([]((LTLAPp5==true))||X(<>(((LTLAPp6==true)&&(X((LTLAPp8==true))||(LTLAPp7==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin3110591696145482594]
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(<>((LTLAPp9==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin3110591696145482594]
LTSmin run took 514 ms.
FORMULA PermAdmissibility-PT-20-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 2208 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, --when, --ltl, X(<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin3110591696145482594]
Detected timeout of ITS tools.
[2021-05-14 15:12:45] [INFO ] Flatten gal took : 73 ms
[2021-05-14 15:12:45] [INFO ] Time to serialize gal into /tmp/LTLCardinality1626996744698903165.gal : 18 ms
[2021-05-14 15:12:48] [INFO ] Time to serialize properties into /tmp/LTLCardinality11123086835429310682.ltl : 3169 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/LTLCardinality1626996744698903165.gal, -t, CGAL, -LTL, /tmp/LTLCardinality11123086835429310682.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/LTLCardinality1626996744698903165.gal -t CGAL -LTL /tmp/LTLCardinality11123086835429310682.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 4 LTL properties
Checking formula 0 : !((X(F("(c19>=1)"))))
Formula 0 simplified : !XF"(c19>=1)"
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.026: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.032: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.032: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.032: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.032: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.033: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.443: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.460: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.443: LTL layer: formula: X(<>((LTLAPp0==true)))
pins2lts-mc-linux64( 6/ 8), 0.444: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.444: "X(<>((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.446: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.478: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.457: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.461: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.468: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.464: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.489: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.715: DFS-FIFO for weak LTL, using special progress label 603
pins2lts-mc-linux64( 0/ 8), 0.715: There are 604 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.715: State length is 148, there are 594 groups
pins2lts-mc-linux64( 0/ 8), 0.715: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.715: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.715: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.715: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.885: ~88 levels ~960 states ~23320 transitions
pins2lts-mc-linux64( 6/ 8), 0.921: ~148 levels ~1920 states ~48984 transitions
pins2lts-mc-linux64( 6/ 8), 1.004: ~222 levels ~3840 states ~88592 transitions
pins2lts-mc-linux64( 4/ 8), 1.070: ~262 levels ~7680 states ~120464 transitions
pins2lts-mc-linux64( 4/ 8), 1.186: ~262 levels ~15360 states ~129360 transitions
pins2lts-mc-linux64( 4/ 8), 1.406: ~262 levels ~30720 states ~151256 transitions
pins2lts-mc-linux64( 4/ 8), 1.857: ~262 levels ~61440 states ~195616 transitions
pins2lts-mc-linux64( 4/ 8), 2.813: ~262 levels ~122880 states ~285536 transitions
pins2lts-mc-linux64( 4/ 8), 4.966: ~262 levels ~245760 states ~461176 transitions
pins2lts-mc-linux64( 4/ 8), 9.111: ~262 levels ~491520 states ~815480 transitions
pins2lts-mc-linux64( 4/ 8), 18.111: ~262 levels ~983040 states ~1541136 transitions
pins2lts-mc-linux64( 4/ 8), 37.861: ~262 levels ~1966080 states ~3000944 transitions
pins2lts-mc-linux64( 6/ 8), 76.496: ~262 levels ~3932160 states ~5738224 transitions
pins2lts-mc-linux64( 6/ 8), 156.056: ~262 levels ~7864320 states ~11776408 transitions
pins2lts-mc-linux64( 1/ 8), 301.189: ~262 levels ~15728640 states ~28060864 transitions
pins2lts-mc-linux64( 4/ 8), 638.476: ~262 levels ~31457280 states ~57807264 transitions
pins2lts-mc-linux64( 4/ 8), 1152.102: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1153.076:
pins2lts-mc-linux64( 0/ 8), 1153.078: mean standard work distribution: 3.1% (states) 4.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 1153.078:
pins2lts-mc-linux64( 0/ 8), 1153.078: Explored 55344129 states 96427665 transitions, fanout: 1.742
pins2lts-mc-linux64( 0/ 8), 1153.078: Total exploration time 1152.340 sec (1151.370 sec minimum, 1151.774 sec on average)
pins2lts-mc-linux64( 0/ 8), 1153.078: States per second: 48028, Transitions per second: 83680
pins2lts-mc-linux64( 0/ 8), 1153.078:
pins2lts-mc-linux64( 0/ 8), 1153.078: Progress states detected: 0
pins2lts-mc-linux64( 0/ 8), 1153.078: Redundant explorations: -0.1913
pins2lts-mc-linux64( 0/ 8), 1153.078:
pins2lts-mc-linux64( 0/ 8), 1153.078: Queue width: 8B, total height: 2104, memory: 0.02MB
pins2lts-mc-linux64( 0/ 8), 1153.078: Tree memory: 679.1MB, 12.8 B/state, compr.: 2.2%
pins2lts-mc-linux64( 0/ 8), 1153.078: Tree fill ratio (roots/leafs): 41.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1153.078: Stored 601 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1153.078: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1153.078: Est. total memory use: 679.1MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing 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(<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin3110591696145482594]
255
java.lang.RuntimeException: Unexpected exception when executing 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(<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin3110591696145482594]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:102)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-14 15:34:22] [INFO ] Flatten gal took : 26 ms
[2021-05-14 15:34:23] [INFO ] Input system was already deterministic with 592 transitions.
[2021-05-14 15:34:23] [INFO ] Transformed 147 places.
[2021-05-14 15:34:23] [INFO ] Transformed 592 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 15:34:53] [INFO ] Time to serialize gal into /tmp/LTLCardinality6650716688934207414.gal : 5 ms
[2021-05-14 15:34:53] [INFO ] Time to serialize properties into /tmp/LTLCardinality14919261507555351756.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/LTLCardinality6650716688934207414.gal, -t, CGAL, -LTL, /tmp/LTLCardinality14919261507555351756.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/LTLCardinality6650716688934207414.gal -t CGAL -LTL /tmp/LTLCardinality14919261507555351756.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 4 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F("(c19>=1)"))))
Formula 0 simplified : !XF"(c19>=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
++ 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-20"
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-20, 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-162089128000540"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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