About the Execution of ITS-Tools for CSRepetitions-COL-05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7096.915 | 1356858.00 | 5299252.00 | 325.60 | FFFFFTTFFFFFTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918700596.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is CSRepetitions-COL-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918700596
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 272K
-rw-r--r-- 1 mcc users 9.9K Apr 30 05:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 30 05:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 30 05:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 30 05:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K May 9 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 9 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 07:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 15K May 10 09:33 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 CSRepetitions-COL-05-LTLFireability-00
FORMULA_NAME CSRepetitions-COL-05-LTLFireability-01
FORMULA_NAME CSRepetitions-COL-05-LTLFireability-02
FORMULA_NAME CSRepetitions-COL-05-LTLFireability-03
FORMULA_NAME CSRepetitions-COL-05-LTLFireability-04
FORMULA_NAME CSRepetitions-COL-05-LTLFireability-05
FORMULA_NAME CSRepetitions-COL-05-LTLFireability-06
FORMULA_NAME CSRepetitions-COL-05-LTLFireability-07
FORMULA_NAME CSRepetitions-COL-05-LTLFireability-08
FORMULA_NAME CSRepetitions-COL-05-LTLFireability-09
FORMULA_NAME CSRepetitions-COL-05-LTLFireability-10
FORMULA_NAME CSRepetitions-COL-05-LTLFireability-11
FORMULA_NAME CSRepetitions-COL-05-LTLFireability-12
FORMULA_NAME CSRepetitions-COL-05-LTLFireability-13
FORMULA_NAME CSRepetitions-COL-05-LTLFireability-14
FORMULA_NAME CSRepetitions-COL-05-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652665147050
Running Version 202205111006
[2022-05-16 01:39:08] [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]
[2022-05-16 01:39:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 01:39:08] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-16 01:39:08] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-16 01:39:08] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 522 ms
[2022-05-16 01:39:08] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 206 PT places and 325.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2022-05-16 01:39:08] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 15 arcs in 8 ms.
[2022-05-16 01:39:08] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
FORMULA CSRepetitions-COL-05-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 8 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 33 steps, including 0 resets, run visited all 6 properties in 17 ms. (steps per millisecond=1 )
[2022-05-16 01:39:09] [INFO ] Flatten gal took : 14 ms
[2022-05-16 01:39:09] [INFO ] Flatten gal took : 2 ms
Transition Send_Answer forces synchronizations/join behavior on parameter c of sort Client
Symmetric sort wr.t. initial and guards and successors and join/free detected :Server
Symmetric sort wr.t. initial detected :Server
Symmetric sort wr.t. initial and guards detected :Server
Applying symmetric unfolding of full symmetric sort :Server domain size was 5
[2022-05-16 01:39:09] [INFO ] Unfolded HLPN to a Petri net with 102 places and 125 transitions 375 arcs in 10 ms.
[2022-05-16 01:39:09] [INFO ] Unfolded 15 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
FORMULA CSRepetitions-COL-05-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 102 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:39:09] [INFO ] Computed 26 place invariants in 10 ms
[2022-05-16 01:39:09] [INFO ] Implicit Places using invariants in 145 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:39:09] [INFO ] Computed 26 place invariants in 3 ms
[2022-05-16 01:39:09] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 01:39:09] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:39:09] [INFO ] Computed 26 place invariants in 13 ms
[2022-05-16 01:39:09] [INFO ] Dead Transitions using invariants and state equation in 496 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 125/125 transitions.
Support contains 102 out of 102 places after structural reductions.
[2022-05-16 01:39:09] [INFO ] Flatten gal took : 22 ms
[2022-05-16 01:39:10] [INFO ] Flatten gal took : 24 ms
[2022-05-16 01:39:10] [INFO ] Input system was already deterministic with 125 transitions.
Incomplete random walk after 10000 steps, including 201 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:39:10] [INFO ] Computed 26 place invariants in 14 ms
[2022-05-16 01:39:10] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(F(F(p0)))&&p1))))'
Support contains 75 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:39:10] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:39:10] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:39:10] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:39:10] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 01:39:10] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:39:10] [INFO ] Computed 26 place invariants in 2 ms
[2022-05-16 01:39:10] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 257 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-COL-05-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 0}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LT s65 1) (LT s64 1) (LT s67 1) (LT s66 1) (LT s69 1) (LT s68 1) (LT s71 1) (LT s70 1) (LT s73 1) (LT s72 1) (LT s75 1) (LT s74 1) (LT s76 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 304 steps with 5 reset in 9 ms.
FORMULA CSRepetitions-COL-05-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-05-LTLFireability-00 finished in 505 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!((F(X(p0))||F(!p0)) U (X(p1)&&p0)))'
Support contains 76 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 9 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:39:11] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:39:11] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:39:11] [INFO ] Computed 26 place invariants in 8 ms
[2022-05-16 01:39:11] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 01:39:11] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:39:11] [INFO ] Computed 26 place invariants in 4 ms
[2022-05-16 01:39:11] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (AND p0 p1), p1]
Running random walk in product with property : CSRepetitions-COL-05-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s36 1) (GEQ s51 1)) (AND (GEQ s37 1) (GEQ s51 1)) (AND (GEQ s26 1) (GEQ s51 1)) (AND (GEQ s32 1) (GEQ s51 1)) (AND (GEQ s41 1) (GEQ s51 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-05-LTLFireability-01 finished in 302 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(X(p0))) U (X(p1)||X(p0))))'
Support contains 75 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:39:11] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:39:11] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:39:11] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:39:11] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 01:39:11] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:39:11] [INFO ] Computed 26 place invariants in 3 ms
[2022-05-16 01:39:11] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-05-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (AND (GEQ s15 1) (GEQ s91 1)) (AND (GEQ s10 1) (GEQ s86 1)) (AND (GEQ s20 1) (GEQ s96 1)) (AND (GEQ s21 1) (GEQ s97 1)) (AND (GEQ s25 1) (GEQ s101 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-05-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-05-LTLFireability-03 finished in 328 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F((X(p0)||F(p1))))))'
Support contains 52 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 9 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:39:11] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:39:11] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:39:11] [INFO ] Computed 26 place invariants in 4 ms
[2022-05-16 01:39:11] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 01:39:11] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2022-05-16 01:39:11] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:39:11] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:39:12] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-COL-05-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s20 1)) (AND (GEQ s0 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s22 1)) (AND (GEQ s0 1) (GEQ s17 1)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 67 steps with 2 reset in 3 ms.
FORMULA CSRepetitions-COL-05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-05-LTLFireability-04 finished in 302 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 26 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 0 with 75 rules applied. Total rules applied 75 place count 52 transition count 100
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 99 place count 28 transition count 76
Iterating global reduction 0 with 24 rules applied. Total rules applied 123 place count 28 transition count 76
Applied a total of 123 rules in 25 ms. Remains 28 /102 variables (removed 74) and now considering 76/125 (removed 49) transitions.
// Phase 1: matrix 76 rows 28 cols
[2022-05-16 01:39:12] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 01:39:12] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 76 rows 28 cols
[2022-05-16 01:39:12] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-16 01:39:12] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2022-05-16 01:39:12] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 76 rows 28 cols
[2022-05-16 01:39:12] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-16 01:39:12] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/102 places, 76/125 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/102 places, 76/125 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-COL-05-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s11 1) (GEQ s26 1)) (AND (GEQ s12 1) (GEQ s26 1)) (AND (GEQ s1 1) (GEQ s26 1)) (AND (GEQ s7 1) (GEQ s26 1)) (AND (GEQ s16 1) (GEQ s26 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 50000 reset in 235 ms.
Product exploration explored 100000 steps with 50000 reset in 179 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA CSRepetitions-COL-05-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-05-LTLFireability-05 finished in 709 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||F(!(false U !p1))))'
Support contains 75 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:39:12] [INFO ] Computed 26 place invariants in 0 ms
[2022-05-16 01:39:12] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:39:12] [INFO ] Computed 26 place invariants in 0 ms
[2022-05-16 01:39:12] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 01:39:12] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2022-05-16 01:39:12] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:39:12] [INFO ] Computed 26 place invariants in 18 ms
[2022-05-16 01:39:13] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-COL-05-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s15 1) (GEQ s91 1)) (AND (GEQ s10 1) (GEQ s86 1)) (AND (GEQ s20 1) (GEQ s96 1)) (AND (GEQ s21 1) (GEQ s97 1)) (AND (GEQ s25 1) (GEQ s101 ...], 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 5173 reset in 436 ms.
Product exploration explored 100000 steps with 5131 reset in 389 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 21 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:39:14] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:39:14] [INFO ] [Real]Absence check using 26 positive place invariants in 8 ms returned sat
[2022-05-16 01:39:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:39:14] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2022-05-16 01:39:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 01:39:14] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2022-05-16 01:39:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 01:39:14] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2022-05-16 01:39:14] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 01:39:14] [INFO ] [Nat]Added 25 Read/Feed constraints in 4 ms returned sat
[2022-05-16 01:39:14] [INFO ] Computed and/alt/rep : 100/125/100 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-16 01:39:14] [INFO ] Added : 2 causal constraints over 1 iterations in 33 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 75 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:39:14] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:39:14] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:39:14] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:39:14] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 01:39:14] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2022-05-16 01:39:14] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:39:14] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:39:14] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 125/125 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 37 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:39:15] [INFO ] Computed 26 place invariants in 2 ms
[2022-05-16 01:39:15] [INFO ] [Real]Absence check using 26 positive place invariants in 6 ms returned sat
[2022-05-16 01:39:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:39:15] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2022-05-16 01:39:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 01:39:15] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2022-05-16 01:39:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 01:39:15] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2022-05-16 01:39:15] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 01:39:15] [INFO ] [Nat]Added 25 Read/Feed constraints in 2 ms returned sat
[2022-05-16 01:39:15] [INFO ] Computed and/alt/rep : 100/125/100 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 01:39:15] [INFO ] Added : 2 causal constraints over 1 iterations in 25 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5093 reset in 387 ms.
Product exploration explored 100000 steps with 5136 reset in 398 ms.
Built C files in :
/tmp/ltsmin17641924421354227649
[2022-05-16 01:39:16] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2022-05-16 01:39:16] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:39:16] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2022-05-16 01:39:16] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:39:16] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2022-05-16 01:39:16] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:39:16] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17641924421354227649
Running compilation step : cd /tmp/ltsmin17641924421354227649;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 332 ms.
Running link step : cd /tmp/ltsmin17641924421354227649;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin17641924421354227649;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14789662696684895587.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 75 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 9 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:39:31] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:39:31] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:39:31] [INFO ] Computed 26 place invariants in 2 ms
[2022-05-16 01:39:31] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 01:39:31] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2022-05-16 01:39:31] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:39:31] [INFO ] Computed 26 place invariants in 2 ms
[2022-05-16 01:39:31] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 125/125 transitions.
Built C files in :
/tmp/ltsmin13119568038417404932
[2022-05-16 01:39:31] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2022-05-16 01:39:31] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:39:31] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2022-05-16 01:39:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:39:31] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2022-05-16 01:39:32] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:39:32] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13119568038417404932
Running compilation step : cd /tmp/ltsmin13119568038417404932;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 239 ms.
Running link step : cd /tmp/ltsmin13119568038417404932;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin13119568038417404932;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8156916628320841448.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 01:39:47] [INFO ] Flatten gal took : 9 ms
[2022-05-16 01:39:47] [INFO ] Flatten gal took : 7 ms
[2022-05-16 01:39:47] [INFO ] Time to serialize gal into /tmp/LTL7188817805547134676.gal : 2 ms
[2022-05-16 01:39:47] [INFO ] Time to serialize properties into /tmp/LTL7826836483628305469.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7188817805547134676.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7826836483628305469.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7188817...266
Read 1 LTL properties
Checking formula 0 : !(((F("(((((((Client_Sending_14>=1)&&(Server_Anwering_14>=1))||((Client_Sending_9>=1)&&(Server_Anwering_9>=1)))||(((Client_Sending_19>...1954
Formula 0 simplified : !(F"(((((((Client_Sending_14>=1)&&(Server_Anwering_14>=1))||((Client_Sending_9>=1)&&(Server_Anwering_9>=1)))||(((Client_Sending_19>=...1947
Detected timeout of ITS tools.
[2022-05-16 01:40:02] [INFO ] Flatten gal took : 7 ms
[2022-05-16 01:40:02] [INFO ] Applying decomposition
[2022-05-16 01:40:02] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9668363737015525437.txt' '-o' '/tmp/graph9668363737015525437.bin' '-w' '/tmp/graph9668363737015525437.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9668363737015525437.bin' '-l' '-1' '-v' '-w' '/tmp/graph9668363737015525437.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:40:02] [INFO ] Decomposing Gal with order
[2022-05-16 01:40:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:40:02] [INFO ] Removed a total of 64 redundant transitions.
[2022-05-16 01:40:02] [INFO ] Flatten gal took : 28 ms
[2022-05-16 01:40:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-16 01:40:02] [INFO ] Time to serialize gal into /tmp/LTL11326043446119706780.gal : 3 ms
[2022-05-16 01:40:02] [INFO ] Time to serialize properties into /tmp/LTL2796891751103747334.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11326043446119706780.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2796891751103747334.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1132604...246
Read 1 LTL properties
Checking formula 0 : !(((F("(((((((u8.Client_Sending_14>=1)&&(u8.Server_Anwering_14>=1))||((u4.Client_Sending_9>=1)&&(u4.Server_Anwering_9>=1)))||(((u10.Cl...2260
Formula 0 simplified : !(F"(((((((u8.Client_Sending_14>=1)&&(u8.Server_Anwering_14>=1))||((u4.Client_Sending_9>=1)&&(u4.Server_Anwering_9>=1)))||(((u10.Cli...2253
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17675073599329760408
[2022-05-16 01:40:17] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17675073599329760408
Running compilation step : cd /tmp/ltsmin17675073599329760408;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 216 ms.
Running link step : cd /tmp/ltsmin17675073599329760408;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin17675073599329760408;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true))||<>(!(false U !(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CSRepetitions-COL-05-LTLFireability-06 finished in 79724 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(F(G((G(p1)&&p0)))))||X(p1))))'
Support contains 52 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:40:32] [INFO ] Computed 26 place invariants in 3 ms
[2022-05-16 01:40:32] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:40:32] [INFO ] Computed 26 place invariants in 6 ms
[2022-05-16 01:40:32] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 01:40:32] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:40:32] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:40:32] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : CSRepetitions-COL-05-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (OR (LT s0 1) (LT s21 1)) (OR (LT s0 1) (LT s20 1)) (OR (LT s0 1) (LT s23 1)) (OR (LT s0 1) (LT s22 1)) (OR (LT s0 1) (LT s17 1)) (OR (LT s0 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1794 reset in 479 ms.
Stack based approach found an accepted trace after 46240 steps with 830 reset with depth 29 and stack size 29 in 209 ms.
FORMULA CSRepetitions-COL-05-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-05-LTLFireability-07 finished in 1069 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(!p0))))'
Support contains 26 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 8 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:40:33] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:40:33] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:40:33] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:40:33] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 01:40:33] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2022-05-16 01:40:33] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:40:33] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:40:33] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 31 ms :[false]
Running random walk in product with property : CSRepetitions-COL-05-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s21 1)) (OR (LT s0 1) (LT s20 1)) (OR (LT s0 1) (LT s23 1)) (OR (LT s0 1) (LT s22 1)) (OR (LT s0 1) (LT s17 1)) (OR (LT s0 1) (L...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, colored, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1815 reset in 418 ms.
Stack based approach found an accepted trace after 19116 steps with 340 reset with depth 61 and stack size 61 in 73 ms.
FORMULA CSRepetitions-COL-05-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-05-LTLFireability-08 finished in 746 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U G(p1)))'
Support contains 76 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:40:34] [INFO ] Computed 26 place invariants in 2 ms
[2022-05-16 01:40:34] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:40:34] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:40:34] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 01:40:34] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2022-05-16 01:40:34] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:40:34] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:40:34] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), p0]
Running random walk in product with property : CSRepetitions-COL-05-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s15 1) (GEQ s91 1)) (AND (GEQ s10 1) (GEQ s86 1)) (AND (GEQ s20 1) (GEQ s96 1)) (AND (GEQ s21 1) (GEQ s97 1)) (AND (GEQ s25 1) (GEQ s101 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5179 steps with 141 reset in 20 ms.
FORMULA CSRepetitions-COL-05-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-05-LTLFireability-09 finished in 291 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G((F(X(!(p1 U !p2)))||p0)))))'
Support contains 77 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 7 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:40:34] [INFO ] Computed 26 place invariants in 0 ms
[2022-05-16 01:40:34] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:40:34] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:40:34] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 01:40:34] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2022-05-16 01:40:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:40:34] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:40:34] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CSRepetitions-COL-05-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p2:(AND (LT s65 1) (LT s64 1) (LT s67 1) (LT s66 1) (LT s69 1) (LT s68 1) (LT s71 1) (LT s70 1) (LT s73 1) (LT s72 1) (LT s75 1) (LT s74 1) (LT s76 1) (LT...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1859 reset in 526 ms.
Stack based approach found an accepted trace after 9426 steps with 173 reset with depth 47 and stack size 47 in 51 ms.
FORMULA CSRepetitions-COL-05-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-05-LTLFireability-10 finished in 862 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(G(X(X(p0)))) U X(p1)))'
Support contains 26 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:40:35] [INFO ] Computed 26 place invariants in 2 ms
[2022-05-16 01:40:35] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:40:35] [INFO ] Computed 26 place invariants in 0 ms
[2022-05-16 01:40:35] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 01:40:35] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:40:35] [INFO ] Computed 26 place invariants in 6 ms
[2022-05-16 01:40:35] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 188 ms :[true, p0, p1, p1, (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : CSRepetitions-COL-05-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 1}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 p0), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(OR (GEQ s26 1) (GEQ s27 1) (GEQ s28 1) (GEQ s29 1) (GEQ s30 1) (GEQ s31 1) (GEQ s32 1) (GEQ s33 1) (GEQ s34 1) (GEQ s35 1) (GEQ s36 1) (GEQ s37 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 14333 reset in 312 ms.
Stack based approach found an accepted trace after 74843 steps with 10497 reset with depth 44 and stack size 44 in 243 ms.
FORMULA CSRepetitions-COL-05-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-05-LTLFireability-11 finished in 971 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U G((!p1 U p2)))||X(G(X(p0)))))'
Support contains 51 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:40:36] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:40:36] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:40:36] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:40:36] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 01:40:36] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:40:36] [INFO ] Computed 26 place invariants in 0 ms
[2022-05-16 01:40:36] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 462 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : CSRepetitions-COL-05-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(OR (AND p2 p0) (AND (NOT p1) p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 6}, { cond=(OR (AND p2 p0) (AND (NOT p1) p0)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 4}, { cond=(OR p2 (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) p1 p0), acceptance={} source=6 dest: 4}, { cond=(OR (AND p2 p0) (AND (NOT p1) p0)), acceptance={} source=6 dest: 7}, { cond=(NOT p0), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 9}], [{ cond=(AND (NOT p2) p1 p0), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(OR (AND p2 p0) (AND (NOT p1) p0)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 10}, { cond=(OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={} source=7 dest: 11}], [{ cond=(AND (NOT p2) p1 p0), acceptance={} source=8 dest: 5}, { cond=(OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=8 dest: 8}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=8 dest: 9}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=8 dest: 10}, { cond=(OR (AND p2 p0) (AND (NOT p1) p0)), acceptance={} source=8 dest: 11}], [{ cond=(AND (NOT p2) p1 p0), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=9 dest: 8}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=9 dest: 9}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=9 dest: 10}], [{ cond=(AND (NOT p2) p1), acceptance={} source=10 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=10 dest: 10}], [{ cond=(AND (NOT p2) p1), acceptance={} source=11 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=11 dest: 10}, { cond=(OR p2 (NOT p1)), acceptance={} source=11 dest: 11}]], initial=0, aps=[p2:(OR (AND (GEQ s36 1) (GEQ s51 1)) (AND (GEQ s37 1) (GEQ s51 1)) (AND (GEQ s26 1) (GEQ s51 1)) (AND (GEQ s32 1) (GEQ s51 1)) (AND (GEQ s41 1) (GEQ s51 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 67 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-COL-05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-05-LTLFireability-13 finished in 699 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(F(p0)&&X(!p1)) U (G(!F(p0))&&!p1)))'
Support contains 75 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:40:37] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:40:37] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:40:37] [INFO ] Computed 26 place invariants in 2 ms
[2022-05-16 01:40:37] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 01:40:37] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:40:37] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:40:37] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR p0 p1), (OR p0 p1), true, true, p0, p0]
Running random walk in product with property : CSRepetitions-COL-05-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 2}, { cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 2}, { cond=(AND p1 p0), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=1, aps=[p1:(AND (LT s65 1) (LT s64 1) (LT s67 1) (LT s66 1) (LT s69 1) (LT s68 1) (LT s71 1) (LT s70 1) (LT s73 1) (LT s72 1) (LT s75 1) (LT s74 1) (LT s76 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 21 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-05-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-05-LTLFireability-14 finished in 365 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0) U G(p0))))'
Support contains 26 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:40:37] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:40:37] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:40:37] [INFO ] Computed 26 place invariants in 7 ms
[2022-05-16 01:40:37] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 01:40:37] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:40:37] [INFO ] Computed 26 place invariants in 6 ms
[2022-05-16 01:40:37] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-05-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s20 1)) (AND (GEQ s0 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s22 1)) (AND (GEQ s0 1) (GEQ s17 1)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 19 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-05-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-05-LTLFireability-15 finished in 303 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||F(!(false U !p1))))'
[2022-05-16 01:40:38] [INFO ] Flatten gal took : 9 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17667474515962225900
[2022-05-16 01:40:38] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2022-05-16 01:40:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:40:38] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2022-05-16 01:40:38] [INFO ] Applying decomposition
[2022-05-16 01:40:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:40:38] [INFO ] Flatten gal took : 6 ms
[2022-05-16 01:40:38] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2022-05-16 01:40:38] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:40:38] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17667474515962225900
Running compilation step : cd /tmp/ltsmin17667474515962225900;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14036370599464874074.txt' '-o' '/tmp/graph14036370599464874074.bin' '-w' '/tmp/graph14036370599464874074.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14036370599464874074.bin' '-l' '-1' '-v' '-w' '/tmp/graph14036370599464874074.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:40:38] [INFO ] Decomposing Gal with order
[2022-05-16 01:40:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:40:38] [INFO ] Removed a total of 64 redundant transitions.
[2022-05-16 01:40:38] [INFO ] Flatten gal took : 14 ms
[2022-05-16 01:40:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 01:40:38] [INFO ] Time to serialize gal into /tmp/LTLFireability3743185438692401459.gal : 2 ms
[2022-05-16 01:40:38] [INFO ] Time to serialize properties into /tmp/LTLFireability18401684011739123960.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3743185438692401459.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18401684011739123960.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !(((F("(((((((u22.Client_Sending_14>=1)&&(u22.Server_Anwering_14>=1))||((u18.Client_Sending_9>=1)&&(u18.Server_Anwering_9>=1)))||(((u1...2253
Formula 0 simplified : !(F"(((((((u22.Client_Sending_14>=1)&&(u22.Server_Anwering_14>=1))||((u18.Client_Sending_9>=1)&&(u18.Server_Anwering_9>=1)))||(((u10...2246
Compilation finished in 242 ms.
Running link step : cd /tmp/ltsmin17667474515962225900;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin17667474515962225900;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>((LTLAPp0==true))||<>(!(false U !(LTLAPp1==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-16 02:01:07] [INFO ] Applying decomposition
[2022-05-16 02:01:07] [INFO ] Flatten gal took : 6 ms
[2022-05-16 02:01:07] [INFO ] Decomposing Gal with order
[2022-05-16 02:01:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:01:07] [INFO ] Removed a total of 96 redundant transitions.
[2022-05-16 02:01:07] [INFO ] Flatten gal took : 44 ms
[2022-05-16 02:01:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 02:01:07] [INFO ] Time to serialize gal into /tmp/LTLFireability15476136179436395427.gal : 3 ms
[2022-05-16 02:01:07] [INFO ] Time to serialize properties into /tmp/LTLFireability4454285448149270568.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15476136179436395427.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4454285448149270568.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !(((F("(((((((Client14.Client_Sending_14>=1)&&(ClientServer14.Server_Anwering_14>=1))||((Client9.Client_Sending_9>=1)&&(ClientServer9....2749
Formula 0 simplified : !(F"(((((((Client14.Client_Sending_14>=1)&&(ClientServer14.Server_Anwering_14>=1))||((Client9.Client_Sending_9>=1)&&(ClientServer9.S...2742
Reverse transition relation is NOT exact ! Due to transitions t100, t101, t102, t103, t104, t105, t106, t107, t108, t109, t110, t111, t112, t113, t114, t11...991
Computing Next relation with stutter on 1 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
1451 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,14.5318,269648,1,0,620439,1805,1698,896128,80,12712,955501
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CSRepetitions-COL-05-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1355681 ms.
BK_STOP 1652666503908
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m
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="CSRepetitions-COL-05"
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 CSRepetitions-COL-05, 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 r024-tall-165251918700596"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-COL-05.tgz
mv CSRepetitions-COL-05 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;