About the Execution of ITS-Tools for TCPcondis-PT-35
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1674.060 | 164826.00 | 199216.00 | 19209.80 | TFFF?FFFFTFF???? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r254-tall-162106746600845.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 TCPcondis-PT-35, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-162106746600845
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K May 10 09:44 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 3.6K Mar 28 16:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 27 14:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 14:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 20:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 20:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rwxr-xr-x 1 mcc users 24K May 5 16:52 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 TCPcondis-PT-35-00
FORMULA_NAME TCPcondis-PT-35-01
FORMULA_NAME TCPcondis-PT-35-02
FORMULA_NAME TCPcondis-PT-35-03
FORMULA_NAME TCPcondis-PT-35-04
FORMULA_NAME TCPcondis-PT-35-05
FORMULA_NAME TCPcondis-PT-35-06
FORMULA_NAME TCPcondis-PT-35-07
FORMULA_NAME TCPcondis-PT-35-08
FORMULA_NAME TCPcondis-PT-35-09
FORMULA_NAME TCPcondis-PT-35-10
FORMULA_NAME TCPcondis-PT-35-11
FORMULA_NAME TCPcondis-PT-35-12
FORMULA_NAME TCPcondis-PT-35-13
FORMULA_NAME TCPcondis-PT-35-14
FORMULA_NAME TCPcondis-PT-35-15
=== Now, execution of the tool begins
BK_START 1621291662291
Running Version 0
[2021-05-17 22:47:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 22:47:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 22:47:52] [WARNING] Skipping unknown tool specific annotation : Tina
[2021-05-17 22:47:52] [WARNING] Unknown XML tag in source file: size
[2021-05-17 22:47:52] [WARNING] Unknown XML tag in source file: color
[2021-05-17 22:47:52] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2021-05-17 22:47:52] [INFO ] Transformed 30 places.
[2021-05-17 22:47:52] [INFO ] Transformed 32 transitions.
[2021-05-17 22:47:52] [INFO ] Parsed PT model containing 30 places and 32 transitions in 64 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 22:47:52] [INFO ] Initial state test concluded for 2 properties.
FORMULA TCPcondis-PT-35-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 8 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 22:47:52] [INFO ] Computed 9 place invariants in 6 ms
[2021-05-17 22:47:52] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 22:47:52] [INFO ] Computed 9 place invariants in 4 ms
[2021-05-17 22:47:52] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 22:47:52] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 22:47:52] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
[2021-05-17 22:47:52] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-17 22:47:52] [INFO ] Flatten gal took : 21 ms
FORMULA TCPcondis-PT-35-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 22:47:52] [INFO ] Flatten gal took : 6 ms
[2021-05-17 22:47:52] [INFO ] Input system was already deterministic with 32 transitions.
Finished random walk after 26653 steps, including 0 resets, run visited all 22 properties in 26 ms. (steps per millisecond=1025 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F((G(p0)||G(!p0))) U p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 22:47:52] [INFO ] Computed 9 place invariants in 3 ms
[2021-05-17 22:47:52] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 22:47:52] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 22:47:52] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 22:47:52] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 22:47:52] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (NOT p1), false]
Running random walk in product with property : TCPcondis-PT-35-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LT s2 1) (LT s20 1)), p0:(GEQ s16 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 202 ms.
Product exploration explored 100000 steps with 50000 reset in 169 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1), false]
Product exploration explored 100000 steps with 50000 reset in 154 ms.
Product exploration explored 100000 steps with 50000 reset in 114 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1), false]
Support contains 3 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 30 transition count 32
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 29 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 29 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 29 transition count 29
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 7 place count 29 transition count 31
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 29 transition count 31
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 9 rules in 13 ms. Remains 29 /30 variables (removed 1) and now considering 31/32 (removed 1) transitions.
[2021-05-17 22:47:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 31 rows 29 cols
[2021-05-17 22:47:53] [INFO ] Computed 9 place invariants in 3 ms
[2021-05-17 22:47:53] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 29/30 places, 31/32 transitions.
Product exploration explored 100000 steps with 50000 reset in 294 ms.
Product exploration explored 100000 steps with 50000 reset in 261 ms.
[2021-05-17 22:47:54] [INFO ] Flatten gal took : 5 ms
[2021-05-17 22:47:54] [INFO ] Flatten gal took : 4 ms
[2021-05-17 22:47:54] [INFO ] Time to serialize gal into /tmp/LTL6465979897451549210.gal : 1 ms
[2021-05-17 22:47:54] [INFO ] Time to serialize properties into /tmp/LTL3334858497692989532.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/LTL6465979897451549210.gal, -t, CGAL, -LTL, /tmp/LTL3334858497692989532.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/LTL6465979897451549210.gal -t CGAL -LTL /tmp/LTL3334858497692989532.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F((G("(xCLOSEWAIT>=1)"))||(G("(xCLOSEWAIT<1)"))))U("((CLOSING<1)||(xFINACK<1))"))))
Formula 0 simplified : !X(F(G"(xCLOSEWAIT>=1)" | G"(xCLOSEWAIT<1)") U "((CLOSING<1)||(xFINACK<1))")
Detected timeout of ITS tools.
[2021-05-17 22:48:09] [INFO ] Flatten gal took : 4 ms
[2021-05-17 22:48:09] [INFO ] Applying decomposition
[2021-05-17 22:48:09] [INFO ] Flatten gal took : 3 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/graph5810468028259605629.txt, -o, /tmp/graph5810468028259605629.bin, -w, /tmp/graph5810468028259605629.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/graph5810468028259605629.bin, -l, -1, -v, -w, /tmp/graph5810468028259605629.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 22:48:09] [INFO ] Decomposing Gal with order
[2021-05-17 22:48:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 22:48:09] [INFO ] Removed a total of 24 redundant transitions.
[2021-05-17 22:48:09] [INFO ] Flatten gal took : 27 ms
[2021-05-17 22:48:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-17 22:48:09] [INFO ] Time to serialize gal into /tmp/LTL8003500855986741766.gal : 2 ms
[2021-05-17 22:48:09] [INFO ] Time to serialize properties into /tmp/LTL4923093604413046391.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/LTL8003500855986741766.gal, -t, CGAL, -LTL, /tmp/LTL4923093604413046391.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/LTL8003500855986741766.gal -t CGAL -LTL /tmp/LTL4923093604413046391.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((F((G("(i2.i1.u7.xCLOSEWAIT>=1)"))||(G("(i2.i1.u7.xCLOSEWAIT<1)"))))U("((u0.CLOSING<1)||(i1.i1.u5.xFINACK<1))"))))
Formula 0 simplified : !X(F(G"(i2.i1.u7.xCLOSEWAIT>=1)" | G"(i2.i1.u7.xCLOSEWAIT<1)") U "((u0.CLOSING<1)||(i1.i1.u5.xFINACK<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13391408462172015842
[2021-05-17 22:48:24] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13391408462172015842
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/ltsmin13391408462172015842]
Compilation finished in 239 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin13391408462172015842]
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))||[](!(LTLAPp0==true)))) U (LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin13391408462172015842]
LTSmin run took 55 ms.
FORMULA TCPcondis-PT-35-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-35-00 finished in 32448 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(X(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 22:48:25] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 22:48:25] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 22:48:25] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 22:48:25] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 22:48:25] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 22:48:25] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TCPcondis-PT-35-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (GEQ s12 1) (GEQ s26 1)), p0:(OR (AND (GEQ s11 1) (GEQ s27 1)) (AND (GEQ s9 1) (GEQ s25 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 7361 reset in 133 ms.
Product exploration explored 100000 steps with 7381 reset in 271 ms.
Knowledge obtained : [(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 7438 reset in 122 ms.
Product exploration explored 100000 steps with 7404 reset in 143 ms.
Applying partial POR strategy [false, true, false, false, true]
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 30 transition count 32
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 28 transition count 30
Deduced a syphon composed of 4 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 28 transition count 30
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 8 rules in 3 ms. Remains 28 /30 variables (removed 2) and now considering 30/32 (removed 2) transitions.
[2021-05-17 22:48:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 28 cols
[2021-05-17 22:48:26] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 22:48:26] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/30 places, 30/32 transitions.
Product exploration explored 100000 steps with 7370 reset in 233 ms.
Stack based approach found an accepted trace after 83737 steps with 6185 reset with depth 13 and stack size 11 in 145 ms.
FORMULA TCPcondis-PT-35-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-35-01 finished in 1683 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(G(p0)))&&G(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 22:48:26] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 22:48:26] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 22:48:26] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 22:48:26] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 22:48:26] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 22:48:26] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : TCPcondis-PT-35-02 automaton TGBA [mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (LT s4 1) (LT s21 1)), p0:(GEQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA TCPcondis-PT-35-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-35-02 finished in 196 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 24 transition count 26
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 24 transition count 26
Applied a total of 12 rules in 9 ms. Remains 24 /30 variables (removed 6) and now considering 26/32 (removed 6) transitions.
// Phase 1: matrix 26 rows 24 cols
[2021-05-17 22:48:26] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 22:48:26] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 26 rows 24 cols
[2021-05-17 22:48:26] [INFO ] Computed 9 place invariants in 3 ms
[2021-05-17 22:48:26] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2021-05-17 22:48:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 26 rows 24 cols
[2021-05-17 22:48:27] [INFO ] Computed 9 place invariants in 3 ms
[2021-05-17 22:48:27] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/30 places, 26/32 transitions.
Stuttering acceptance computed with spot in 30 ms :[true, (NOT p0)]
Running random walk in product with property : TCPcondis-PT-35-03 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:(OR (GEQ s2 1) (LT s8 1) (LT s9 1) (LT s23 1))], 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 5 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-35-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-35-03 finished in 121 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 24 transition count 26
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 24 transition count 26
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 24 transition count 24
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 14 place count 24 transition count 22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 22 transition count 22
Applied a total of 18 rules in 5 ms. Remains 22 /30 variables (removed 8) and now considering 22/32 (removed 10) transitions.
// Phase 1: matrix 22 rows 22 cols
[2021-05-17 22:48:27] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 22:48:27] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 22 rows 22 cols
[2021-05-17 22:48:27] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 22:48:27] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2021-05-17 22:48:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 22 rows 22 cols
[2021-05-17 22:48:27] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 22:48:27] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/30 places, 22/32 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-35-04 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:(GEQ s2 1)], 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 9505 reset in 119 ms.
Product exploration explored 100000 steps with 9498 reset in 166 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9437 reset in 141 ms.
Product exploration explored 100000 steps with 9533 reset in 131 ms.
[2021-05-17 22:48:27] [INFO ] Flatten gal took : 3 ms
[2021-05-17 22:48:27] [INFO ] Flatten gal took : 2 ms
[2021-05-17 22:48:27] [INFO ] Time to serialize gal into /tmp/LTL8876442010655744131.gal : 1 ms
[2021-05-17 22:48:27] [INFO ] Time to serialize properties into /tmp/LTL16794420400274886900.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/LTL8876442010655744131.gal, -t, CGAL, -LTL, /tmp/LTL16794420400274886900.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/LTL8876442010655744131.gal -t CGAL -LTL /tmp/LTL16794420400274886900.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(ESTAB>=1)"))))
Formula 0 simplified : !GF"(ESTAB>=1)"
Detected timeout of ITS tools.
[2021-05-17 22:48:42] [INFO ] Flatten gal took : 2 ms
[2021-05-17 22:48:42] [INFO ] Applying decomposition
[2021-05-17 22:48:42] [INFO ] Flatten gal took : 2 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/graph3167584693777085750.txt, -o, /tmp/graph3167584693777085750.bin, -w, /tmp/graph3167584693777085750.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/graph3167584693777085750.bin, -l, -1, -v, -w, /tmp/graph3167584693777085750.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 22:48:42] [INFO ] Decomposing Gal with order
[2021-05-17 22:48:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 22:48:42] [INFO ] Removed a total of 24 redundant transitions.
[2021-05-17 22:48:42] [INFO ] Flatten gal took : 5 ms
[2021-05-17 22:48:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-17 22:48:42] [INFO ] Time to serialize gal into /tmp/LTL5281126817303385301.gal : 1 ms
[2021-05-17 22:48:42] [INFO ] Time to serialize properties into /tmp/LTL9260333893419452773.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/LTL5281126817303385301.gal, -t, CGAL, -LTL, /tmp/LTL9260333893419452773.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/LTL5281126817303385301.gal -t CGAL -LTL /tmp/LTL9260333893419452773.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F("(i1.u0.ESTAB>=1)"))))
Formula 0 simplified : !GF"(i1.u0.ESTAB>=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9351730545578429097
[2021-05-17 22:48:57] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9351730545578429097
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/ltsmin9351730545578429097]
Compilation finished in 144 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin9351730545578429097]
Link finished in 34 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, [](<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin9351730545578429097]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property TCPcondis-PT-35-04 finished in 45866 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X((F(p0) U X((p1||(p2 U p3)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 22:49:12] [INFO ] Computed 9 place invariants in 7 ms
[2021-05-17 22:49:12] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 22:49:12] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 22:49:12] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 22:49:12] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 22:49:13] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : TCPcondis-PT-35-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s29 1), p1:(GEQ s0 1), p3:(OR (LT s8 1) (LT s20 1)), p2:(GEQ s15 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3014 reset in 272 ms.
Product exploration explored 100000 steps with 2914 reset in 203 ms.
Knowledge obtained : [(NOT p0), p1, p3, p2]
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 2895 reset in 172 ms.
Product exploration explored 100000 steps with 2966 reset in 187 ms.
Applying partial POR strategy [false, true, false, false, true, true]
Stuttering acceptance computed with spot in 5920 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 5 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 30 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2021-05-17 22:49:20] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 22:49:20] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 22:49:20] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Product exploration explored 100000 steps with 2807 reset in 178 ms.
Product exploration explored 100000 steps with 3024 reset in 192 ms.
[2021-05-17 22:49:20] [INFO ] Flatten gal took : 2 ms
[2021-05-17 22:49:20] [INFO ] Flatten gal took : 3 ms
[2021-05-17 22:49:20] [INFO ] Time to serialize gal into /tmp/LTL13798206904426399032.gal : 1 ms
[2021-05-17 22:49:20] [INFO ] Time to serialize properties into /tmp/LTL15310678452899076745.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/LTL13798206904426399032.gal, -t, CGAL, -LTL, /tmp/LTL15310678452899076745.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/LTL13798206904426399032.gal -t CGAL -LTL /tmp/LTL15310678452899076745.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(xTIMEWAIT>=1)"))&&(X((F("(xTIMEWAIT>=1)"))U(X(("(CLOSED>=1)")||(("(xCLOSED>=1)")U("((LASTACK<1)||(xFINACK<1))"))))))))
Formula 0 simplified : !(F"(xTIMEWAIT>=1)" & X(F"(xTIMEWAIT>=1)" U X("(CLOSED>=1)" | ("(xCLOSED>=1)" U "((LASTACK<1)||(xFINACK<1))"))))
Detected timeout of ITS tools.
[2021-05-17 22:49:35] [INFO ] Flatten gal took : 2 ms
[2021-05-17 22:49:35] [INFO ] Applying decomposition
[2021-05-17 22:49:35] [INFO ] Flatten gal took : 2 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/graph16124132697020050494.txt, -o, /tmp/graph16124132697020050494.bin, -w, /tmp/graph16124132697020050494.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/graph16124132697020050494.bin, -l, -1, -v, -w, /tmp/graph16124132697020050494.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 22:49:35] [INFO ] Decomposing Gal with order
[2021-05-17 22:49:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 22:49:35] [INFO ] Removed a total of 24 redundant transitions.
[2021-05-17 22:49:35] [INFO ] Flatten gal took : 5 ms
[2021-05-17 22:49:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 22:49:35] [INFO ] Time to serialize gal into /tmp/LTL4860277169404063135.gal : 1 ms
[2021-05-17 22:49:35] [INFO ] Time to serialize properties into /tmp/LTL9879993123892742018.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/LTL4860277169404063135.gal, -t, CGAL, -LTL, /tmp/LTL9879993123892742018.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/LTL4860277169404063135.gal -t CGAL -LTL /tmp/LTL9879993123892742018.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F("(u8.xTIMEWAIT>=1)"))&&(X((F("(u8.xTIMEWAIT>=1)"))U(X(("(u0.CLOSED>=1)")||(("(u8.xCLOSED>=1)")U("((i1.i0.u2.LASTACK<1)||(i1.i0.u6.xFINACK<1))"))))))))
Formula 0 simplified : !(F"(u8.xTIMEWAIT>=1)" & X(F"(u8.xTIMEWAIT>=1)" U X("(u0.CLOSED>=1)" | ("(u8.xCLOSED>=1)" U "((i1.i0.u2.LASTACK<1)||(i1.i0.u6.xFINACK<1))"))))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4575449812161764924
[2021-05-17 22:49:50] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4575449812161764924
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/ltsmin4575449812161764924]
Compilation finished in 177 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin4575449812161764924]
Link finished in 32 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((<>((LTLAPp0==true)) U X(((LTLAPp1==true)||((LTLAPp2==true) U (LTLAPp3==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin4575449812161764924]
LTSmin run took 898 ms.
FORMULA TCPcondis-PT-35-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-35-05 finished in 38995 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G((X(!p1)||p0))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 22:49:51] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 22:49:51] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 22:49:51] [INFO ] Computed 9 place invariants in 6 ms
[2021-05-17 22:49:51] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 22:49:51] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 22:49:51] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 125 ms :[p1, (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), true]
Running random walk in product with property : TCPcondis-PT-35-06 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=3, aps=[p0:(OR (LT s6 1) (LT s19 1)), p1:(GEQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 50 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-35-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-35-06 finished in 206 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(!p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 22:49:52] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 22:49:52] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 22:49:52] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 22:49:52] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 22:49:52] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 22:49:52] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 42 ms :[p0, p0]
Running random walk in product with property : TCPcondis-PT-35-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s8 1) (LT s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1290 reset in 178 ms.
Stack based approach found an accepted trace after 64928 steps with 883 reset with depth 25 and stack size 25 in 123 ms.
FORMULA TCPcondis-PT-35-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-35-08 finished in 423 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||F(p1)||(X(p0)&&(!p0 U (p2||G(!p0)))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 22:49:52] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 22:49:52] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 22:49:52] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 22:49:52] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 22:49:52] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 22:49:52] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : TCPcondis-PT-35-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s19 1)), p1:(OR (LT s5 1) (LT s21 1)), p2:(AND (OR (LT s2 1) (LT s20 1)) (OR (LT s7 1) (LT s19 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 88 ms.
Product exploration explored 100000 steps with 50000 reset in 100 ms.
Knowledge obtained : [(NOT p0), p1, p2]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 50000 reset in 93 ms.
Product exploration explored 100000 steps with 50000 reset in 101 ms.
Applying partial POR strategy [false, true, true, false, true]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 6 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 30 transition count 32
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 29 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 29 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 29 transition count 29
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 7 place count 29 transition count 31
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 29 transition count 31
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 9 rules in 3 ms. Remains 29 /30 variables (removed 1) and now considering 31/32 (removed 1) transitions.
[2021-05-17 22:49:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 31 rows 29 cols
[2021-05-17 22:49:53] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 22:49:53] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 29/30 places, 31/32 transitions.
Product exploration explored 100000 steps with 50000 reset in 91 ms.
Product exploration explored 100000 steps with 50000 reset in 98 ms.
[2021-05-17 22:49:53] [INFO ] Flatten gal took : 2 ms
[2021-05-17 22:49:53] [INFO ] Flatten gal took : 5 ms
[2021-05-17 22:49:53] [INFO ] Time to serialize gal into /tmp/LTL8652663581448347780.gal : 1 ms
[2021-05-17 22:49:53] [INFO ] Time to serialize properties into /tmp/LTL832432087453699849.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/LTL8652663581448347780.gal, -t, CGAL, -LTL, /tmp/LTL832432087453699849.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/LTL8652663581448347780.gal -t CGAL -LTL /tmp/LTL832432087453699849.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(((F("((FINACK<1)||(xFINWAIT1<1))"))||("((FINWAIT2>=1)&&(xFIN>=1))"))||((X("((FINWAIT2>=1)&&(xFIN>=1))"))&&(("((FINWAIT2<1)||(xFIN<1))")U(("(((CLOSING<1)||(xFINACK<1))&&((FINWAIT2<1)||(xFIN<1)))")||(G("((FINWAIT2<1)||(xFIN<1))"))))))))
Formula 0 simplified : !X("((FINWAIT2>=1)&&(xFIN>=1))" | F"((FINACK<1)||(xFINWAIT1<1))" | (X"((FINWAIT2>=1)&&(xFIN>=1))" & ("((FINWAIT2<1)||(xFIN<1))" U ("(((CLOSING<1)||(xFINACK<1))&&((FINWAIT2<1)||(xFIN<1)))" | G"((FINWAIT2<1)||(xFIN<1))"))))
Detected timeout of ITS tools.
[2021-05-17 22:50:08] [INFO ] Flatten gal took : 2 ms
[2021-05-17 22:50:08] [INFO ] Applying decomposition
[2021-05-17 22:50:08] [INFO ] Flatten gal took : 1 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/graph14895566510593967580.txt, -o, /tmp/graph14895566510593967580.bin, -w, /tmp/graph14895566510593967580.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/graph14895566510593967580.bin, -l, -1, -v, -w, /tmp/graph14895566510593967580.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 22:50:08] [INFO ] Decomposing Gal with order
[2021-05-17 22:50:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 22:50:08] [INFO ] Removed a total of 24 redundant transitions.
[2021-05-17 22:50:08] [INFO ] Flatten gal took : 5 ms
[2021-05-17 22:50:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2021-05-17 22:50:08] [INFO ] Time to serialize gal into /tmp/LTL862808228123743337.gal : 1 ms
[2021-05-17 22:50:08] [INFO ] Time to serialize properties into /tmp/LTL10437752786949081540.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/LTL862808228123743337.gal, -t, CGAL, -LTL, /tmp/LTL10437752786949081540.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/LTL862808228123743337.gal -t CGAL -LTL /tmp/LTL10437752786949081540.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(((F("((i2.i1.u0.FINACK<1)||(i2.i0.u7.xFINWAIT1<1))"))||("((u4.FINWAIT2>=1)&&(i2.i1.u0.xFIN>=1))"))||((X("((u4.FINWAIT2>=1)&&(i2.i1.u0.xFIN>=1))"))&&(("((u4.FINWAIT2<1)||(i2.i1.u0.xFIN<1))")U(("(((u4.CLOSING<1)||(u4.xFINACK<1))&&((u4.FINWAIT2<1)||(i2.i1.u0.xFIN<1)))")||(G("((u4.FINWAIT2<1)||(i2.i1.u0.xFIN<1))"))))))))
Formula 0 simplified : !X("((u4.FINWAIT2>=1)&&(i2.i1.u0.xFIN>=1))" | F"((i2.i1.u0.FINACK<1)||(i2.i0.u7.xFINWAIT1<1))" | (X"((u4.FINWAIT2>=1)&&(i2.i1.u0.xFIN>=1))" & ("((u4.FINWAIT2<1)||(i2.i1.u0.xFIN<1))" U ("(((u4.CLOSING<1)||(u4.xFINACK<1))&&((u4.FINWAIT2<1)||(i2.i1.u0.xFIN<1)))" | G"((u4.FINWAIT2<1)||(i2.i1.u0.xFIN<1))"))))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1650918287559428169
[2021-05-17 22:50:23] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1650918287559428169
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/ltsmin1650918287559428169]
Compilation finished in 182 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin1650918287559428169]
Link finished in 41 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))||(LTLAPp1==true)||(X((LTLAPp1==true))&&(!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin1650918287559428169]
LTSmin run took 236 ms.
FORMULA TCPcondis-PT-35-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-35-09 finished in 31754 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||(G((p1 U !p2)) U G(p3))))], workingDir=/home/mcc/execution]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 29 transition count 31
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 29 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 3 place count 29 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 28 transition count 29
Applied a total of 5 rules in 3 ms. Remains 28 /30 variables (removed 2) and now considering 29/32 (removed 3) transitions.
// Phase 1: matrix 29 rows 28 cols
[2021-05-17 22:50:24] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 22:50:24] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 29 rows 28 cols
[2021-05-17 22:50:24] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 22:50:24] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2021-05-17 22:50:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 29 rows 28 cols
[2021-05-17 22:50:24] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 22:50:24] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/30 places, 29/32 transitions.
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) (NOT p3)), true, (NOT p0), p2, (AND p2 p3), (NOT p3), (NOT p3), (AND (NOT p0) p2 p3), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : TCPcondis-PT-35-10 automaton TGBA [mat=[[{ cond=(OR (AND p0 (NOT p2)) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3) p2 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p3) p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2 p1), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p0) (NOT p3) p1)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p0) p3 p2 (NOT p1)), acceptance={} source=0 dest: 5}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), acceptance={} source=0 dest: 6}, { cond=(OR (AND p0 (NOT p3) (NOT p2)) (AND p0 (NOT p3) p1)), acceptance={} source=0 dest: 7}, { cond=(AND p0 p3 p2 (NOT p1)), acceptance={} source=0 dest: 8}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p2 p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND p3 p2 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p3 p2 p1), acceptance={} source=4 dest: 3}, { cond=(OR (AND p3 (NOT p2)) (AND p3 p1)), acceptance={} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 1}, { cond=p3, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p3) p2 p1), acceptance={} source=6 dest: 3}, { cond=(OR (AND (NOT p3) (NOT p2)) (AND (NOT p3) p1)), acceptance={} source=6 dest: 4}, { cond=(AND p3 p2 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(OR (AND (NOT p3) (NOT p2)) (AND (NOT p3) p1)), acceptance={0} source=6 dest: 6}, { cond=(OR (AND p3 (NOT p2)) (AND p3 p1)), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) p3 p2 (NOT p1)), acceptance={} source=7 dest: 1}, { cond=(AND p0 p3 p2 (NOT p1)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p0) p3 p2 p1), acceptance={} source=7 dest: 3}, { cond=(OR (AND (NOT p0) p3 (NOT p2)) (AND (NOT p0) p3 p1)), acceptance={} source=7 dest: 4}, { cond=(OR (AND p0 p3 (NOT p2)) (AND p0 p3 p1)), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=8 dest: 1}, { cond=(AND p0 (NOT p3)), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p0) p3), acceptance={} source=8 dest: 5}, { cond=(AND p0 p3), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(OR (AND (GEQ s5 1) (GEQ s17 1)) (GEQ s0 1)), p2:(AND (GEQ s7 1) (GEQ s19 1)), p1:(GEQ s1 1), p3:(AND (GEQ s5 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 33738 steps with 11178 reset in 127 ms.
FORMULA TCPcondis-PT-35-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-35-10 finished in 427 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((G(p0) U p1)&&X(F(p2))))], workingDir=/home/mcc/execution]
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 22:50:24] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 22:50:24] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 22:50:24] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 22:50:24] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 22:50:24] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 22:50:24] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : TCPcondis-PT-35-12 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}, { cond=(OR p1 p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (LT s4 1) (LT s21 1)), p0:(OR (LT s4 1) (LT s21 1) (LT s11 1) (LT s27 1)), p2:(GEQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 104 ms.
Product exploration explored 100000 steps with 50000 reset in 103 ms.
Knowledge obtained : [p1, p0, p2]
Adopting property with smaller alphabet thanks to knowledge :p1
Stuttering acceptance computed with spot in 43 ms :[(AND p1 (NOT p2)), (NOT p2)]
Support contains 3 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 22:50:25] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 22:50:25] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 22:50:25] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 22:50:25] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 22:50:25] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 22:50:25] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 48 ms :[(AND p1 (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 50000 reset in 79 ms.
Product exploration explored 100000 steps with 50000 reset in 89 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 43 ms :[(AND p1 (NOT p2)), (NOT p2)]
Support contains 3 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 32
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 29 transition count 31
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 29 transition count 31
Deduced a syphon composed of 2 places in 0 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 29 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 5 place count 29 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 29 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 6 rules in 4 ms. Remains 29 /30 variables (removed 1) and now considering 31/32 (removed 1) transitions.
[2021-05-17 22:50:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 31 rows 29 cols
[2021-05-17 22:50:25] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 22:50:25] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 29/30 places, 31/32 transitions.
Product exploration explored 100000 steps with 50000 reset in 194 ms.
Product exploration explored 100000 steps with 50000 reset in 203 ms.
Starting structural reductions, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 22:50:26] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 22:50:26] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 22:50:26] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 22:50:26] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 22:50:26] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 22:50:26] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Application raised an uncaught exception null
java.lang.UnsupportedOperationException
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:879)
at fr.lip6.move.gal.application.MccTranslator.lambda$3(MccTranslator.java:862)
at fr.lip6.move.gal.structural.expr.NaryOp.forEachChild(NaryOp.java:153)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:862)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:760)
at fr.lip6.move.gal.application.MccTranslator.rebuildSpecification(MccTranslator.java:729)
at fr.lip6.move.gal.application.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:585)
at fr.lip6.move.gal.application.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:269)
at fr.lip6.move.gal.application.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:60)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:470)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
BK_STOP 1621291827117
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="TCPcondis-PT-35"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is TCPcondis-PT-35, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r254-tall-162106746600845"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/TCPcondis-PT-35.tgz
mv TCPcondis-PT-35 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;