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

About the Execution of ITS-Tools for TCPcondis-PT-50

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16239.487 3600000.00 4153558.00 96085.10 FFTFFFF?TFTFT?FF 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-162106746600861.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-50, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-162106746600861
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 400K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 128K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K 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.2K Mar 28 16:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 17K Mar 28 16:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 27 14:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 14:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 20:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 20:12 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-50-00
FORMULA_NAME TCPcondis-PT-50-01
FORMULA_NAME TCPcondis-PT-50-02
FORMULA_NAME TCPcondis-PT-50-03
FORMULA_NAME TCPcondis-PT-50-04
FORMULA_NAME TCPcondis-PT-50-05
FORMULA_NAME TCPcondis-PT-50-06
FORMULA_NAME TCPcondis-PT-50-07
FORMULA_NAME TCPcondis-PT-50-08
FORMULA_NAME TCPcondis-PT-50-09
FORMULA_NAME TCPcondis-PT-50-10
FORMULA_NAME TCPcondis-PT-50-11
FORMULA_NAME TCPcondis-PT-50-12
FORMULA_NAME TCPcondis-PT-50-13
FORMULA_NAME TCPcondis-PT-50-14
FORMULA_NAME TCPcondis-PT-50-15

=== Now, execution of the tool begins

BK_START 1621295630551

Running Version 0
[2021-05-17 23:53:52] [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 23:53:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 23:53:52] [WARNING] Skipping unknown tool specific annotation : Tina
[2021-05-17 23:53:52] [WARNING] Unknown XML tag in source file: size
[2021-05-17 23:53:52] [WARNING] Unknown XML tag in source file: color
[2021-05-17 23:53:52] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2021-05-17 23:53:52] [INFO ] Transformed 30 places.
[2021-05-17 23:53:52] [INFO ] Transformed 32 transitions.
[2021-05-17 23:53:52] [INFO ] Parsed PT model containing 30 places and 32 transitions in 66 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 23:53:52] [INFO ] Initial state test concluded for 3 properties.
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 9 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 23:53:52] [INFO ] Computed 9 place invariants in 11 ms
[2021-05-17 23:53:52] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:53:52] [INFO ] Computed 9 place invariants in 4 ms
[2021-05-17 23:53:52] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:53:52] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 23:53:52] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
[2021-05-17 23:53:52] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-17 23:53:52] [INFO ] Flatten gal took : 22 ms
FORMULA TCPcondis-PT-50-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-50-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-50-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 23:53:52] [INFO ] Flatten gal took : 7 ms
[2021-05-17 23:53:52] [INFO ] Input system was already deterministic with 32 transitions.
Finished random walk after 3119 steps, including 0 resets, run visited all 26 properties in 8 ms. (steps per millisecond=389 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0))||(F(p1)&&F(G(p2)))))], 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.
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 23:53:52] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 23:53:52] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:53:52] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:53:52] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:53:52] [INFO ] Computed 9 place invariants in 6 ms
[2021-05-17 23:53:52] [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 270 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Running random walk in product with property : TCPcondis-PT-50-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (LT s5 1) (LT s21 1)), p0:(GEQ s1 1), p2:(LT s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 343 ms.
Product exploration explored 100000 steps with 0 reset in 380 ms.
Knowledge obtained : [p1, (NOT p0), p2]
Stuttering acceptance computed with spot in 119 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 223 ms.
Product exploration explored 100000 steps with 0 reset in 319 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 119 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Support contains 4 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 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 28 transition count 30
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 28 transition count 30
Deduced a syphon composed of 2 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 8 place count 28 transition count 28
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 8 place count 28 transition count 30
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 28 transition count 30
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 10 rules in 12 ms. Remains 28 /30 variables (removed 2) and now considering 30/32 (removed 2) transitions.
[2021-05-17 23:53:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 28 cols
[2021-05-17 23:53:54] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:53:54] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/30 places, 30/32 transitions.
Product exploration explored 100000 steps with 0 reset in 378 ms.
Stack based approach found an accepted trace after 12038 steps with 0 reset with depth 12039 and stack size 12038 in 32 ms.
FORMULA TCPcondis-PT-50-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-50-00 finished in 2616 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||((X(F(p0))&&F(p1)) U G(p2))))], workingDir=/home/mcc/execution]
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.
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 23:53:55] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:53:55] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:53:55] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:53:55] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:53:55] [INFO ] Computed 9 place invariants in 3 ms
[2021-05-17 23:53:55] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : TCPcondis-PT-50-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s10 1) (GEQ s11 1) (GEQ s28 1)), p2:(AND (GEQ s12 1) (GEQ s26 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 8603 reset in 163 ms.
Product exploration explored 100000 steps with 8564 reset in 188 ms.
Knowledge obtained : [(NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 8546 reset in 127 ms.
Product exploration explored 100000 steps with 8538 reset in 151 ms.
Applying partial POR strategy [true, true]
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (AND (NOT p0) (NOT p2))]
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 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 0 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 23:53:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 28 cols
[2021-05-17 23:53:56] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:53:56] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/30 places, 30/32 transitions.
Product exploration explored 100000 steps with 8525 reset in 149 ms.
Product exploration explored 100000 steps with 8609 reset in 175 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 23:53:57] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:53:57] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:53:57] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:53:57] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:53:57] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:53:57] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
[2021-05-17 23:53:57] [INFO ] Flatten gal took : 6 ms
[2021-05-17 23:53:57] [INFO ] Flatten gal took : 4 ms
[2021-05-17 23:53:57] [INFO ] Time to serialize gal into /tmp/LTL17274544677521433881.gal : 1 ms
[2021-05-17 23:53:57] [INFO ] Time to serialize properties into /tmp/LTL7013069563676625195.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/LTL17274544677521433881.gal, -t, CGAL, -LTL, /tmp/LTL7013069563676625195.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/LTL17274544677521433881.gal -t CGAL -LTL /tmp/LTL7013069563676625195.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 12 LTL properties
Checking formula 0 : !(((F("(((SYN>=1)&&(SYNACK>=1))&&(xSYNSENT>=1))"))||(((X(F("(((SYN>=1)&&(SYNACK>=1))&&(xSYNSENT>=1))")))&&(F("((LASTACK>=1)&&(xFINACK>=1))")))U(G("((SYNRCVD>=1)&&(xSYNACK>=1))")))))
Formula 0 simplified : !(F"(((SYN>=1)&&(SYNACK>=1))&&(xSYNSENT>=1))" | ((XF"(((SYN>=1)&&(SYNACK>=1))&&(xSYNSENT>=1))" & F"((LASTACK>=1)&&(xFINACK>=1))") U G"((SYNRCVD>=1)&&(xSYNACK>=1))"))
Detected timeout of ITS tools.
[2021-05-17 23:54:12] [INFO ] Flatten gal took : 4 ms
[2021-05-17 23:54:12] [INFO ] Applying decomposition
[2021-05-17 23:54:12] [INFO ] Flatten gal took : 10 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/graph6390065743173367022.txt, -o, /tmp/graph6390065743173367022.bin, -w, /tmp/graph6390065743173367022.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/graph6390065743173367022.bin, -l, -1, -v, -w, /tmp/graph6390065743173367022.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 23:54:12] [INFO ] Decomposing Gal with order
[2021-05-17 23:54:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 23:54:12] [INFO ] Removed a total of 24 redundant transitions.
[2021-05-17 23:54:12] [INFO ] Flatten gal took : 100 ms
[2021-05-17 23:54:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-17 23:54:12] [INFO ] Time to serialize gal into /tmp/LTL2769055165606906746.gal : 2 ms
[2021-05-17 23:54:12] [INFO ] Time to serialize properties into /tmp/LTL3147400473875790221.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/LTL2769055165606906746.gal, -t, CGAL, -LTL, /tmp/LTL3147400473875790221.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/LTL2769055165606906746.gal -t CGAL -LTL /tmp/LTL3147400473875790221.ltl -c -stutter-deadlock
Read 12 LTL properties
Checking formula 0 : !(((F("(((u5.SYN>=1)&&(i1.u7.SYNACK>=1))&&(u6.xSYNSENT>=1))"))||(((X(F("(((u5.SYN>=1)&&(i1.u7.SYNACK>=1))&&(u6.xSYNSENT>=1))")))&&(F("((i0.i1.u4.LASTACK>=1)&&(i0.i1.u1.xFINACK>=1))")))U(G("((i0.i0.u0.SYNRCVD>=1)&&(i0.i0.u0.xSYNACK>=1))")))))
Formula 0 simplified : !(F"(((u5.SYN>=1)&&(i1.u7.SYNACK>=1))&&(u6.xSYNSENT>=1))" | ((XF"(((u5.SYN>=1)&&(i1.u7.SYNACK>=1))&&(u6.xSYNSENT>=1))" & F"((i0.i1.u4.LASTACK>=1)&&(i0.i1.u1.xFINACK>=1))") U G"((i0.i0.u0.SYNRCVD>=1)&&(i0.i0.u0.xSYNACK>=1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin23209447356774572
[2021-05-17 23:54:28] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin23209447356774572
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/ltsmin23209447356774572]
Compilation finished in 283 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin23209447356774572]
Link finished in 47 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)))&&<>((LTLAPp1==true))) U []((LTLAPp2==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin23209447356774572]
LTSmin run took 377 ms.
FORMULA TCPcondis-PT-50-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(([]((LTLAPp4==true))||(LTLAPp3==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin23209447356774572]
LTSmin run took 238 ms.
FORMULA TCPcondis-PT-50-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X([]((LTLAPp5==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin23209447356774572]
LTSmin run took 945 ms.
FORMULA TCPcondis-PT-50-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((<>((LTLAPp6==true)) U X((LTLAPp7==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin23209447356774572]
LTSmin run took 6773 ms.
FORMULA TCPcondis-PT-50-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, ((LTLAPp8==true) U ((LTLAPp9==true)||[]((!(LTLAPp6==true)||[]((LTLAPp8==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin23209447356774572]
LTSmin run took 1324 ms.
FORMULA TCPcondis-PT-50-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (<>(((LTLAPp10==true)&&<>((LTLAPp11==true)))) U []((LTLAPp9==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin23209447356774572]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property TCPcondis-PT-50-01 finished in 47644 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F((p0&&F(p1))) U G(p2)))], 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.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 25 transition count 27
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 25 transition count 27
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 25 transition count 25
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 12 place count 25 transition count 23
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 16 place count 23 transition count 23
Applied a total of 16 rules in 8 ms. Remains 23 /30 variables (removed 7) and now considering 23/32 (removed 9) transitions.
// Phase 1: matrix 23 rows 23 cols
[2021-05-17 23:54:43] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:54:43] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 23 rows 23 cols
[2021-05-17 23:54:43] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 23:54:43] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2021-05-17 23:54:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 23 rows 23 cols
[2021-05-17 23:54:43] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:54:43] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/30 places, 23/32 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p2), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : TCPcondis-PT-50-07 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s5 1) (GEQ s15 1)), p0:(OR (GEQ s14 1) (AND (GEQ s5 1) (GEQ s15 1))), p1:(GEQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 9317 reset in 163 ms.
Product exploration explored 100000 steps with 9401 reset in 187 ms.
Knowledge obtained : [(NOT p2), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p2), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 9230 reset in 148 ms.
Product exploration explored 100000 steps with 9437 reset in 164 ms.
[2021-05-17 23:54:44] [INFO ] Flatten gal took : 2 ms
[2021-05-17 23:54:44] [INFO ] Flatten gal took : 2 ms
[2021-05-17 23:54:44] [INFO ] Time to serialize gal into /tmp/LTL12859716968554445049.gal : 1 ms
[2021-05-17 23:54:44] [INFO ] Time to serialize properties into /tmp/LTL10906642181711486962.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/LTL12859716968554445049.gal, -t, CGAL, -LTL, /tmp/LTL10906642181711486962.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/LTL12859716968554445049.gal -t CGAL -LTL /tmp/LTL10906642181711486962.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F((F("(xESTAB>=1)"))&&("((xESTAB>=1)||((FINWAIT1>=1)&&(xFIN>=1)))")))U(G("((FINWAIT1>=1)&&(xFIN>=1))"))))
Formula 0 simplified : !(F("((xESTAB>=1)||((FINWAIT1>=1)&&(xFIN>=1)))" & F"(xESTAB>=1)") U G"((FINWAIT1>=1)&&(xFIN>=1))")
Detected timeout of ITS tools.
[2021-05-17 23:54:59] [INFO ] Flatten gal took : 2 ms
[2021-05-17 23:54:59] [INFO ] Applying decomposition
[2021-05-17 23:54:59] [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/graph16378335656068640071.txt, -o, /tmp/graph16378335656068640071.bin, -w, /tmp/graph16378335656068640071.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/graph16378335656068640071.bin, -l, -1, -v, -w, /tmp/graph16378335656068640071.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 23:54:59] [INFO ] Decomposing Gal with order
[2021-05-17 23:54:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 23:54:59] [INFO ] Removed a total of 24 redundant transitions.
[2021-05-17 23:54:59] [INFO ] Flatten gal took : 4 ms
[2021-05-17 23:54:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-17 23:54:59] [INFO ] Time to serialize gal into /tmp/LTL27460193846940965.gal : 1 ms
[2021-05-17 23:54:59] [INFO ] Time to serialize properties into /tmp/LTL11347004747155893681.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/LTL27460193846940965.gal, -t, CGAL, -LTL, /tmp/LTL11347004747155893681.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/LTL27460193846940965.gal -t CGAL -LTL /tmp/LTL11347004747155893681.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F((F("(i1.u7.xESTAB>=1)"))&&("((i1.u7.xESTAB>=1)||((i0.u3.FINWAIT1>=1)&&(i1.u2.xFIN>=1)))")))U(G("((i0.u3.FINWAIT1>=1)&&(i1.u2.xFIN>=1))"))))
Formula 0 simplified : !(F("((i1.u7.xESTAB>=1)||((i0.u3.FINWAIT1>=1)&&(i1.u2.xFIN>=1)))" & F"(i1.u7.xESTAB>=1)") U G"((i0.u3.FINWAIT1>=1)&&(i1.u2.xFIN>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8205005693914298240
[2021-05-17 23:55:14] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8205005693914298240
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/ltsmin8205005693914298240]
Compilation finished in 161 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin8205005693914298240]
Link finished in 37 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (<>((<>((LTLAPp0==true))&&(LTLAPp1==true))) U []((LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin8205005693914298240]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property TCPcondis-PT-50-07 finished in 46177 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0&&X(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 23:55:29] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:55:29] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:55:29] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:55:29] [INFO ] Implicit Places using invariants and state equation in 36 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 23:55:29] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:55:29] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : TCPcondis-PT-50-09 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s6 1) (LT s20 1)), p1:(AND (GEQ s6 1) (GEQ s20 1) (OR (LT s2 1) (LT s20 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1807 reset in 200 ms.
Product exploration explored 100000 steps with 1815 reset in 212 ms.
Knowledge obtained : [p0, (NOT p1)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1800 reset in 196 ms.
Product exploration explored 100000 steps with 1790 reset in 214 ms.
[2021-05-17 23:55:30] [INFO ] Flatten gal took : 2 ms
[2021-05-17 23:55:30] [INFO ] Flatten gal took : 3 ms
[2021-05-17 23:55:30] [INFO ] Time to serialize gal into /tmp/LTL6870314357634506170.gal : 1 ms
[2021-05-17 23:55:30] [INFO ] Time to serialize properties into /tmp/LTL12515909963946626903.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/LTL6870314357634506170.gal, -t, CGAL, -LTL, /tmp/LTL12515909963946626903.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/LTL6870314357634506170.gal -t CGAL -LTL /tmp/LTL12515909963946626903.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((X("(((FINWAIT1>=1)&&(xFINACK>=1))&&((CLOSING<1)||(xFINACK<1)))"))&&("((FINWAIT1<1)||(xFINACK<1))")))))
Formula 0 simplified : !XF("((FINWAIT1<1)||(xFINACK<1))" & X"(((FINWAIT1>=1)&&(xFINACK>=1))&&((CLOSING<1)||(xFINACK<1)))")
Detected timeout of ITS tools.
[2021-05-17 23:55:45] [INFO ] Flatten gal took : 2 ms
[2021-05-17 23:55:45] [INFO ] Applying decomposition
[2021-05-17 23:55:45] [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/graph292913146128907508.txt, -o, /tmp/graph292913146128907508.bin, -w, /tmp/graph292913146128907508.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/graph292913146128907508.bin, -l, -1, -v, -w, /tmp/graph292913146128907508.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 23:55:45] [INFO ] Decomposing Gal with order
[2021-05-17 23:55:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 23:55:45] [INFO ] Removed a total of 24 redundant transitions.
[2021-05-17 23:55:45] [INFO ] Flatten gal took : 5 ms
[2021-05-17 23:55:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-17 23:55:45] [INFO ] Time to serialize gal into /tmp/LTL7903784076846906558.gal : 1 ms
[2021-05-17 23:55:45] [INFO ] Time to serialize properties into /tmp/LTL7997873799324686363.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/LTL7903784076846906558.gal, -t, CGAL, -LTL, /tmp/LTL7997873799324686363.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/LTL7903784076846906558.gal -t CGAL -LTL /tmp/LTL7997873799324686363.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F((X("(((i3.i1.u2.FINWAIT1>=1)&&(i3.i0.u6.xFINACK>=1))&&((u0.CLOSING<1)||(i3.i0.u6.xFINACK<1)))"))&&("((i3.i1.u2.FINWAIT1<1)||(i3.i0.u6.xFINACK<1))")))))
Formula 0 simplified : !XF("((i3.i1.u2.FINWAIT1<1)||(i3.i0.u6.xFINACK<1))" & X"(((i3.i1.u2.FINWAIT1>=1)&&(i3.i0.u6.xFINACK>=1))&&((u0.CLOSING<1)||(i3.i0.u6.xFINACK<1)))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5974950199704039888
[2021-05-17 23:56:00] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5974950199704039888
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/ltsmin5974950199704039888]
Compilation finished in 190 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5974950199704039888]
Link finished in 36 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(<>((X((LTLAPp0==true))&&(LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin5974950199704039888]
LTSmin run took 295 ms.
FORMULA TCPcondis-PT-50-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-50-09 finished in 31841 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F((G(F(p1))||G(p2)||p0)))))], 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 23:56:01] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:56:01] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:56:01] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:56:01] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:56:01] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:56:01] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : TCPcondis-PT-50-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s2 1) (LT s20 1)), p2:(OR (LT s5 1) (LT s17 1)), p1:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 71 ms.
Product exploration explored 100000 steps with 33333 reset in 81 ms.
Knowledge obtained : [p0, p2, p1]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 33333 reset in 72 ms.
Product exploration explored 100000 steps with 33333 reset in 80 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
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 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
Deduced a syphon composed of 3 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 4 place count 30 transition count 31
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 4 place count 30 transition count 32
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 30 transition count 32
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 5 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2021-05-17 23:56:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:56:01] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:56:01] [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.
Product exploration explored 100000 steps with 33333 reset in 148 ms.
Product exploration explored 100000 steps with 33333 reset in 143 ms.
[2021-05-17 23:56:02] [INFO ] Flatten gal took : 2 ms
[2021-05-17 23:56:02] [INFO ] Flatten gal took : 2 ms
[2021-05-17 23:56:02] [INFO ] Time to serialize gal into /tmp/LTL16460196399895480083.gal : 0 ms
[2021-05-17 23:56:02] [INFO ] Time to serialize properties into /tmp/LTL16359721898621457345.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/LTL16460196399895480083.gal, -t, CGAL, -LTL, /tmp/LTL16359721898621457345.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/LTL16460196399895480083.gal -t CGAL -LTL /tmp/LTL16359721898621457345.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F((("((CLOSING<1)||(xFINACK<1))")||(G(F("(CLOSED>=1)"))))||(G("((FINACK<1)||(xCLOSING<1))")))))))
Formula 0 simplified : !XXF("((CLOSING<1)||(xFINACK<1))" | GF"(CLOSED>=1)" | G"((FINACK<1)||(xCLOSING<1))")
Detected timeout of ITS tools.
[2021-05-17 23:56:17] [INFO ] Flatten gal took : 2 ms
[2021-05-17 23:56:17] [INFO ] Applying decomposition
[2021-05-17 23:56:17] [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/graph8437889963633289743.txt, -o, /tmp/graph8437889963633289743.bin, -w, /tmp/graph8437889963633289743.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/graph8437889963633289743.bin, -l, -1, -v, -w, /tmp/graph8437889963633289743.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 23:56:17] [INFO ] Decomposing Gal with order
[2021-05-17 23:56:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 23:56:17] [INFO ] Removed a total of 24 redundant transitions.
[2021-05-17 23:56:17] [INFO ] Flatten gal took : 4 ms
[2021-05-17 23:56:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 23:56:17] [INFO ] Time to serialize gal into /tmp/LTL4071367440666914214.gal : 1 ms
[2021-05-17 23:56:17] [INFO ] Time to serialize properties into /tmp/LTL7946984157669063705.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/LTL4071367440666914214.gal, -t, CGAL, -LTL, /tmp/LTL7946984157669063705.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/LTL4071367440666914214.gal -t CGAL -LTL /tmp/LTL7946984157669063705.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(F((("((u0.CLOSING<1)||(i1.u2.xFINACK<1))")||(G(F("(u0.CLOSED>=1)"))))||(G("((i2.i0.u6.FINACK<1)||(u9.xCLOSING<1))")))))))
Formula 0 simplified : !XXF("((u0.CLOSING<1)||(i1.u2.xFINACK<1))" | GF"(u0.CLOSED>=1)" | G"((i2.i0.u6.FINACK<1)||(u9.xCLOSING<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13459712419598416905
[2021-05-17 23:56:32] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13459712419598416905
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/ltsmin13459712419598416905]
Compilation finished in 238 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin13459712419598416905]
Link finished in 37 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(<>(([](<>((LTLAPp1==true)))||[]((LTLAPp2==true))||(LTLAPp0==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin13459712419598416905]
LTSmin run took 140 ms.
FORMULA TCPcondis-PT-50-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-50-10 finished in 31735 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||X(((G(p2)&&p1)||G(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 23:56:32] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:56:32] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:56:32] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:56:32] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:56:32] [INFO ] Computed 9 place invariants in 3 ms
[2021-05-17 23:56:32] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : TCPcondis-PT-50-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 p2 p3), acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p2) p3)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p3), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(AND (GEQ s4 1) (GEQ s18 1)), p1:(AND (GEQ s4 1) (GEQ s18 1)), p3:(AND (GEQ s13 1) (GEQ s25 1)), p2:(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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3280 reset in 157 ms.
Product exploration explored 100000 steps with 3271 reset in 168 ms.
Knowledge obtained : [(NOT p0), (NOT p1), (NOT p3), (NOT p2)]
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 3255 reset in 153 ms.
Product exploration explored 100000 steps with 3293 reset in 164 ms.
Applying partial POR strategy [true, false, true, true, true, true]
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2))]
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 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 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 5 place count 28 transition count 30
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 28 transition count 30
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 7 rules in 3 ms. Remains 28 /30 variables (removed 2) and now considering 30/32 (removed 2) transitions.
[2021-05-17 23:56:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 28 cols
[2021-05-17 23:56:34] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:56:34] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/30 places, 30/32 transitions.
Product exploration explored 100000 steps with 3260 reset in 163 ms.
Stack based approach found an accepted trace after 61154 steps with 2016 reset with depth 17 and stack size 16 in 106 ms.
FORMULA TCPcondis-PT-50-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-50-11 finished in 1709 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(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 4 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 23:56:34] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:56:34] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 22 rows 22 cols
[2021-05-17 23:56:34] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:56:34] [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.
[2021-05-17 23:56:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 22 rows 22 cols
[2021-05-17 23:56:34] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:56:34] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/30 places, 22/32 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-50-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 9828 reset in 112 ms.
Product exploration explored 100000 steps with 9871 reset in 124 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 20 ms :[(NOT p0)]
Product exploration explored 100000 steps with 9825 reset in 126 ms.
Product exploration explored 100000 steps with 9844 reset in 139 ms.
[2021-05-17 23:56:35] [INFO ] Flatten gal took : 2 ms
[2021-05-17 23:56:35] [INFO ] Flatten gal took : 2 ms
[2021-05-17 23:56:35] [INFO ] Time to serialize gal into /tmp/LTL2163826964946736827.gal : 0 ms
[2021-05-17 23:56:35] [INFO ] Time to serialize properties into /tmp/LTL6598871603235867910.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/LTL2163826964946736827.gal, -t, CGAL, -LTL, /tmp/LTL6598871603235867910.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/LTL2163826964946736827.gal -t CGAL -LTL /tmp/LTL6598871603235867910.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("(ESTAB>=1)")))
Formula 0 simplified : !F"(ESTAB>=1)"
Detected timeout of ITS tools.
[2021-05-17 23:56:50] [INFO ] Flatten gal took : 1 ms
[2021-05-17 23:56:50] [INFO ] Applying decomposition
[2021-05-17 23:56:50] [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/graph11633549352081403585.txt, -o, /tmp/graph11633549352081403585.bin, -w, /tmp/graph11633549352081403585.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/graph11633549352081403585.bin, -l, -1, -v, -w, /tmp/graph11633549352081403585.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 23:56:50] [INFO ] Decomposing Gal with order
[2021-05-17 23:56:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 23:56:50] [INFO ] Removed a total of 24 redundant transitions.
[2021-05-17 23:56:50] [INFO ] Flatten gal took : 3 ms
[2021-05-17 23:56:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-17 23:56:50] [INFO ] Time to serialize gal into /tmp/LTL11054339626619711532.gal : 1 ms
[2021-05-17 23:56:50] [INFO ] Time to serialize properties into /tmp/LTL14221247523523012283.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/LTL11054339626619711532.gal, -t, CGAL, -LTL, /tmp/LTL14221247523523012283.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/LTL11054339626619711532.gal -t CGAL -LTL /tmp/LTL14221247523523012283.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F("(i0.u1.ESTAB>=1)")))
Formula 0 simplified : !F"(i0.u1.ESTAB>=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8351159459960648116
[2021-05-17 23:57:05] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8351159459960648116
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/ltsmin8351159459960648116]
Compilation finished in 146 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin8351159459960648116]
Link finished in 36 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/ltsmin8351159459960648116]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property TCPcondis-PT-50-13 finished in 45776 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G((F(!p1)&&p0))||(G((F(!p1)&&F(p3)))&&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.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 26 transition count 28
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 26 transition count 28
Applied a total of 8 rules in 3 ms. Remains 26 /30 variables (removed 4) and now considering 28/32 (removed 4) transitions.
// Phase 1: matrix 28 rows 26 cols
[2021-05-17 23:57:22] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:57:22] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 28 rows 26 cols
[2021-05-17 23:57:22] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:57:22] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2021-05-17 23:57:22] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 28 rows 26 cols
[2021-05-17 23:57:22] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:57:22] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 26/30 places, 28/32 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), p1, p1, (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (AND p1 (NOT p3)), (OR p1 (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Running random walk in product with property : TCPcondis-PT-50-14 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 5}, { cond=(NOT p2), acceptance={} source=0 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p3)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 1}, { cond=(AND p0 p1), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=5 dest: 3}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s18 1)), p1:(AND (GEQ s8 1) (GEQ s18 1)), p3:(OR (LT s13 1) (LT s22 1) (LT s23 1)), p2:(AND (GEQ s8 1) (GEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 2058 reset in 196 ms.
Stack based approach found an accepted trace after 58495 steps with 1269 reset with depth 40 and stack size 40 in 126 ms.
FORMULA TCPcondis-PT-50-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-50-14 finished in 2738 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0||X(F(!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 23:57:22] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:57:23] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:57:23] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 23:57:23] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 30 cols
[2021-05-17 23:57:23] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:57:23] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Running random walk in product with property : TCPcondis-PT-50-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s10 1) (GEQ s28 1)), p1:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 13919 reset in 145 ms.
Product exploration explored 100000 steps with 12352 reset in 216 ms.
Knowledge obtained : [(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Product exploration explored 100000 steps with 13948 reset in 135 ms.
Product exploration explored 100000 steps with 14435 reset in 167 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
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 1 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 30 transition count 32
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 5 place count 28 transition count 30
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 28 transition count 30
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 7 rules in 2 ms. Remains 28 /30 variables (removed 2) and now considering 30/32 (removed 2) transitions.
[2021-05-17 23:57:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 28 cols
[2021-05-17 23:57:24] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 23:57:24] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/30 places, 30/32 transitions.
Product exploration explored 100000 steps with 14595 reset in 165 ms.
Product exploration explored 100000 steps with 14528 reset in 201 ms.
[2021-05-17 23:57:24] [INFO ] Flatten gal took : 2 ms
[2021-05-17 23:57:24] [INFO ] Flatten gal took : 2 ms
[2021-05-17 23:57:24] [INFO ] Time to serialize gal into /tmp/LTL5238395847029021730.gal : 0 ms
[2021-05-17 23:57:24] [INFO ] Time to serialize properties into /tmp/LTL8444480757062952954.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/LTL5238395847029021730.gal, -t, CGAL, -LTL, /tmp/LTL8444480757062952954.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/LTL5238395847029021730.gal -t CGAL -LTL /tmp/LTL8444480757062952954.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G((X(F("(CLOSEWAIT<1)")))||("((SYN>=1)&&(xSYNSENT>=1))")))))
Formula 0 simplified : !XG("((SYN>=1)&&(xSYNSENT>=1))" | XF"(CLOSEWAIT<1)")
Detected timeout of ITS tools.
[2021-05-17 23:57:39] [INFO ] Flatten gal took : 5 ms
[2021-05-17 23:57:39] [INFO ] Applying decomposition
[2021-05-17 23:57:39] [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/graph6625189097008363997.txt, -o, /tmp/graph6625189097008363997.bin, -w, /tmp/graph6625189097008363997.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/graph6625189097008363997.bin, -l, -1, -v, -w, /tmp/graph6625189097008363997.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 23:57:39] [INFO ] Decomposing Gal with order
[2021-05-17 23:57:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 23:57:39] [INFO ] Removed a total of 24 redundant transitions.
[2021-05-17 23:57:39] [INFO ] Flatten gal took : 4 ms
[2021-05-17 23:57:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 23:57:39] [INFO ] Time to serialize gal into /tmp/LTL6137406932625750610.gal : 0 ms
[2021-05-17 23:57:39] [INFO ] Time to serialize properties into /tmp/LTL13281865697886122179.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/LTL6137406932625750610.gal, -t, CGAL, -LTL, /tmp/LTL13281865697886122179.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/LTL6137406932625750610.gal -t CGAL -LTL /tmp/LTL13281865697886122179.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(G((X(F("(i3.i0.u1.CLOSEWAIT<1)")))||("((u0.SYN>=1)&&(u3.xSYNSENT>=1))")))))
Formula 0 simplified : !XG("((u0.SYN>=1)&&(u3.xSYNSENT>=1))" | XF"(i3.i0.u1.CLOSEWAIT<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11669552057678085715
[2021-05-17 23:57:54] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11669552057678085715
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/ltsmin11669552057678085715]
Compilation finished in 176 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11669552057678085715]
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([]((X(<>((LTLAPp0==true)))||(LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin11669552057678085715]
LTSmin run took 739 ms.
FORMULA TCPcondis-PT-50-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-50-15 finished in 32615 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15303344241459325665
[2021-05-17 23:57:55] [INFO ] Applying decomposition
[2021-05-17 23:57:55] [INFO ] Computing symmetric may disable matrix : 32 transitions.
[2021-05-17 23:57:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 23:57:55] [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/graph5357006488590622817.txt, -o, /tmp/graph5357006488590622817.bin, -w, /tmp/graph5357006488590622817.weights], workingDir=null]
[2021-05-17 23:57:55] [INFO ] Computing symmetric may enable matrix : 32 transitions.
[2021-05-17 23:57:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 23:57:55] [INFO ] Computing Do-Not-Accords matrix : 32 transitions.
[2021-05-17 23:57:55] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 23:57:55] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15303344241459325665
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/ltsmin15303344241459325665]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph5357006488590622817.bin, -l, -1, -v, -w, /tmp/graph5357006488590622817.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 23:57:55] [INFO ] Decomposing Gal with order
[2021-05-17 23:57:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 23:57:55] [INFO ] Removed a total of 24 redundant transitions.
[2021-05-17 23:57:55] [INFO ] Flatten gal took : 3 ms
[2021-05-17 23:57:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2021-05-17 23:57:55] [INFO ] Time to serialize gal into /tmp/LTLFireability8622290387497982140.gal : 0 ms
[2021-05-17 23:57:55] [INFO ] Time to serialize properties into /tmp/LTLFireability16209346106498311615.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/LTLFireability8622290387497982140.gal, -t, CGAL, -LTL, /tmp/LTLFireability16209346106498311615.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/LTLFireability8622290387497982140.gal -t CGAL -LTL /tmp/LTLFireability16209346106498311615.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !(((F(("((i3.u5.xESTAB>=1)||((i1.i1.u3.FINWAIT1>=1)&&(i3.u6.xFIN>=1)))")&&(F("(i3.u5.xESTAB>=1)"))))U(G("((i1.i1.u3.FINWAIT1>=1)&&(i3.u6.xFIN>=1))"))))
Formula 0 simplified : !(F("((i3.u5.xESTAB>=1)||((i1.i1.u3.FINWAIT1>=1)&&(i3.u6.xFIN>=1)))" & F"(i3.u5.xESTAB>=1)") U G"((i1.i1.u3.FINWAIT1>=1)&&(i3.u6.xFIN>=1))")
Compilation finished in 210 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15303344241459325665]
Link finished in 37 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, (<>(((LTLAPp0==true)&&<>((LTLAPp1==true)))) U []((LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin15303344241459325665]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: LTL layer: formula: (<>(((LTLAPp0==true)&&<>((LTLAPp1==true)))) U []((LTLAPp2==true)))
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: Initializing POR dependencies: labels 36, guards 32
pins2lts-mc-linux64( 5/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: "(<>(((LTLAPp0==true)&&<>((LTLAPp1==true)))) U []((LTLAPp2==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.167: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.178: There are 37 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.179: State length is 31, there are 43 groups
pins2lts-mc-linux64( 0/ 8), 0.179: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.179: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.179: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.179: Visible groups: 10 / 43, labels: 3 / 37
pins2lts-mc-linux64( 0/ 8), 0.179: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.179: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.295: [Blue] ~120 levels ~960 states ~4400 transitions
pins2lts-mc-linux64( 0/ 8), 0.301: [Blue] ~196 levels ~1920 states ~6680 transitions
pins2lts-mc-linux64( 0/ 8), 0.304: [Blue] ~300 levels ~3840 states ~9696 transitions
pins2lts-mc-linux64( 4/ 8), 0.307: [Blue] ~402 levels ~7680 states ~21800 transitions
pins2lts-mc-linux64( 4/ 8), 0.328: [Blue] ~402 levels ~15360 states ~41928 transitions
pins2lts-mc-linux64( 4/ 8), 0.358: [Blue] ~402 levels ~30720 states ~85200 transitions
pins2lts-mc-linux64( 0/ 8), 0.429: [Blue] ~349 levels ~61440 states ~151680 transitions
pins2lts-mc-linux64( 0/ 8), 0.580: [Blue] ~349 levels ~122880 states ~311544 transitions
pins2lts-mc-linux64( 1/ 8), 0.752: [Blue] ~291 levels ~245760 states ~686544 transitions
pins2lts-mc-linux64( 1/ 8), 1.489: [Blue] ~291 levels ~491520 states ~1538896 transitions
pins2lts-mc-linux64( 1/ 8), 3.126: [Blue] ~291 levels ~983040 states ~3214040 transitions
pins2lts-mc-linux64( 4/ 8), 6.050: [Blue] ~402 levels ~1966080 states ~6707912 transitions
pins2lts-mc-linux64( 4/ 8), 12.484: [Blue] ~402 levels ~3932160 states ~14773440 transitions
pins2lts-mc-linux64( 4/ 8), 27.240: [Blue] ~402 levels ~7864320 states ~32432064 transitions
pins2lts-mc-linux64( 5/ 8), 55.495: [Blue] ~292 levels ~15728640 states ~67584016 transitions
pins2lts-mc-linux64( 5/ 8), 117.534: [Blue] ~292 levels ~31457280 states ~143252080 transitions
pins2lts-mc-linux64( 0/ 8), 196.042: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 196.088:
pins2lts-mc-linux64( 0/ 8), 196.088: Explored 44777038 states 217861691 transitions, fanout: 4.865
pins2lts-mc-linux64( 0/ 8), 196.088: Total exploration time 195.910 sec (195.840 sec minimum, 195.871 sec on average)
pins2lts-mc-linux64( 0/ 8), 196.088: States per second: 228559, Transitions per second: 1112050
pins2lts-mc-linux64( 0/ 8), 196.088:
pins2lts-mc-linux64( 0/ 8), 196.088: State space has 40224760 states, 25679543 are accepting
pins2lts-mc-linux64( 0/ 8), 196.088: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 196.088: blue states: 44777038 (111.32%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 196.088: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 196.088: all-red states: 25679543 (63.84%), bogus 2124077 (5.28%)
pins2lts-mc-linux64( 0/ 8), 196.088:
pins2lts-mc-linux64( 0/ 8), 196.088: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 196.088:
pins2lts-mc-linux64( 0/ 8), 196.088: Queue width: 8B, total height: 2568, memory: 0.02MB
pins2lts-mc-linux64( 0/ 8), 196.088: Tree memory: 562.9MB, 14.7 B/state, compr.: 11.6%
pins2lts-mc-linux64( 0/ 8), 196.088: Tree fill ratio (roots/leafs): 29.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 196.088: Stored 32 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 196.088: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 196.088: Est. total memory use: 562.9MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, (<>(((LTLAPp0==true)&&<>((LTLAPp1==true)))) U []((LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin15303344241459325665]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, (<>(((LTLAPp0==true)&&<>((LTLAPp1==true)))) U []((LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin15303344241459325665]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-18 00:19:16] [INFO ] Flatten gal took : 27 ms
[2021-05-18 00:19:16] [INFO ] Time to serialize gal into /tmp/LTLFireability6220762670259547553.gal : 1 ms
[2021-05-18 00:19:16] [INFO ] Time to serialize properties into /tmp/LTLFireability15636763394404944112.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/LTLFireability6220762670259547553.gal, -t, CGAL, -LTL, /tmp/LTLFireability15636763394404944112.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/LTLFireability6220762670259547553.gal -t CGAL -LTL /tmp/LTLFireability15636763394404944112.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 2 LTL properties
Checking formula 0 : !(((F(("((xESTAB>=1)||((FINWAIT1>=1)&&(xFIN>=1)))")&&(F("(xESTAB>=1)"))))U(G("((FINWAIT1>=1)&&(xFIN>=1))"))))
Formula 0 simplified : !(F("((xESTAB>=1)||((FINWAIT1>=1)&&(xFIN>=1)))" & F"(xESTAB>=1)") U G"((FINWAIT1>=1)&&(xFIN>=1))")
Detected timeout of ITS tools.
[2021-05-18 00:40:39] [INFO ] Flatten gal took : 92 ms
[2021-05-18 00:40:39] [INFO ] Input system was already deterministic with 32 transitions.
[2021-05-18 00:40:39] [INFO ] Transformed 30 places.
[2021-05-18 00:40:39] [INFO ] Transformed 32 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-18 00:40:39] [INFO ] Time to serialize gal into /tmp/LTLFireability8251046059328582394.gal : 5 ms
[2021-05-18 00:40:39] [INFO ] Time to serialize properties into /tmp/LTLFireability11229978367919800891.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability8251046059328582394.gal, -t, CGAL, -LTL, /tmp/LTLFireability11229978367919800891.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability8251046059328582394.gal -t CGAL -LTL /tmp/LTLFireability11229978367919800891.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((F(("((xESTAB>=1)||((FINWAIT1>=1)&&(xFIN>=1)))")&&(F("(xESTAB>=1)"))))U(G("((FINWAIT1>=1)&&(xFIN>=1))"))))
Formula 0 simplified : !(F("((xESTAB>=1)||((FINWAIT1>=1)&&(xFIN>=1)))" & F"(xESTAB>=1)") U G"((FINWAIT1>=1)&&(xFIN>=1))")

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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-50"
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-50, 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-162106746600861"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/TCPcondis-PT-50.tgz
mv TCPcondis-PT-50 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;