About the Execution of ITS-Tools for ClientsAndServers-PT-N0020P3
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 656.943 | 78292.00 | 96399.00 | 123.50 | FFFFTTFFFFFTFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2021-input.r045-oct2-162038291600197.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-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 ClientsAndServers-PT-N0020P3, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r045-oct2-162038291600197
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 130K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 84K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 03:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 03:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 22 12:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 12:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 8 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 9.2K May 5 16:51 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ClientsAndServers-PT-N0020P3-00
FORMULA_NAME ClientsAndServers-PT-N0020P3-01
FORMULA_NAME ClientsAndServers-PT-N0020P3-02
FORMULA_NAME ClientsAndServers-PT-N0020P3-03
FORMULA_NAME ClientsAndServers-PT-N0020P3-04
FORMULA_NAME ClientsAndServers-PT-N0020P3-05
FORMULA_NAME ClientsAndServers-PT-N0020P3-06
FORMULA_NAME ClientsAndServers-PT-N0020P3-07
FORMULA_NAME ClientsAndServers-PT-N0020P3-08
FORMULA_NAME ClientsAndServers-PT-N0020P3-09
FORMULA_NAME ClientsAndServers-PT-N0020P3-10
FORMULA_NAME ClientsAndServers-PT-N0020P3-11
FORMULA_NAME ClientsAndServers-PT-N0020P3-12
FORMULA_NAME ClientsAndServers-PT-N0020P3-13
FORMULA_NAME ClientsAndServers-PT-N0020P3-14
FORMULA_NAME ClientsAndServers-PT-N0020P3-15
=== Now, execution of the tool begins
BK_START 1620566707186
Running Version 0
[2021-05-09 13:25: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]
[2021-05-09 13:25:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 13:25:08] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2021-05-09 13:25:08] [INFO ] Transformed 25 places.
[2021-05-09 13:25:08] [INFO ] Transformed 18 transitions.
[2021-05-09 13:25:08] [INFO ] Parsed PT model containing 25 places and 18 transitions in 59 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Support contains 18 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 8 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 13:25:09] [INFO ] Computed 5 place invariants in 5 ms
[2021-05-09 13:25:09] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 13:25:09] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-09 13:25:09] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 13:25:09] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-09 13:25:09] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/25 places, 18/18 transitions.
[2021-05-09 13:25:09] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-09 13:25:09] [INFO ] Flatten gal took : 19 ms
FORMULA ClientsAndServers-PT-N0020P3-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P3-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P3-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 13:25:09] [INFO ] Flatten gal took : 4 ms
[2021-05-09 13:25:09] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 3156 steps, including 0 resets, run visited all 17 properties in 9 ms. (steps per millisecond=350 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(p0))&&((p1&&F(p2)) U ((p3&&((p1&&F(p2))||G(p1)))||G(((p1&&F(p2))||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 13:25:09] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-09 13:25:09] [INFO ] Implicit Places using invariants in 51 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:25:09] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 13:25:09] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Starting structural reductions, iteration 1 : 21/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:25:09] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 13:25:09] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/22 places, 18/18 transitions.
Stuttering acceptance computed with spot in 325 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p0), (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-01 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p1), acceptance={} source=0 dest: 3}, { cond=(AND p3 p1 (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) p1), acceptance={} source=3 dest: 3}, { cond=(AND p3 p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (LT s4 1) (LT s18 1)), p3:(LT s20 1), p2:(LT s10 1), p0:(AND (GEQ s20 1) (GEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0020P3-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P3-01 finished in 488 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(G(p0))&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 13:25:09] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 13:25:09] [INFO ] Implicit Places using invariants in 17 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 18 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:25:09] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 13:25:09] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Starting structural reductions, iteration 1 : 21/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:25:09] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 13:25:09] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/22 places, 18/18 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-02 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(OR (LT s3 1) (LT s14 1)), p1:(GEQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0020P3-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P3-02 finished in 200 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(!p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 18/18 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 22 transition count 12
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 16 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 16 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 15 transition count 11
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 12 transition count 8
Applied a total of 20 rules in 13 ms. Remains 12 /22 variables (removed 10) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2021-05-09 13:25:10] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 13:25:10] [INFO ] Implicit Places using invariants in 19 ms returned [8, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 20 ms to find 2 implicit places.
[2021-05-09 13:25:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2021-05-09 13:25:10] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:25:10] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Starting structural reductions, iteration 1 : 10/22 places, 8/18 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 10 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 8 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 7 transition count 5
Applied a total of 6 rules in 2 ms. Remains 7 /10 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 7 cols
[2021-05-09 13:25:10] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:25:10] [INFO ] Implicit Places using invariants in 15 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 16 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 6/22 places, 5/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2021-05-09 13:25:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2021-05-09 13:25:10] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 13:25:10] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 3 iterations. Remains : 6/22 places, 5/18 transitions.
Stuttering acceptance computed with spot in 42 ms :[true, p0]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P3-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P3-03 finished in 132 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 13:25:10] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 13:25:10] [INFO ] Implicit Places using invariants in 17 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 18 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:25:10] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 13:25:10] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Starting structural reductions, iteration 1 : 21/22 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:25:10] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 13:25:10] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/22 places, 18/18 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 145 ms.
Product exploration explored 100000 steps with 50000 reset in 95 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 73 ms.
Product exploration explored 100000 steps with 50000 reset in 59 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 21/21 places, 18/18 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 21 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 5 place count 21 transition count 18
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 21 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 21 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 19 transition count 16
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 19 transition count 16
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 15 rules in 3 ms. Remains 19 /21 variables (removed 2) and now considering 16/18 (removed 2) transitions.
[2021-05-09 13:25:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 19 cols
[2021-05-09 13:25:10] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-09 13:25:10] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19/21 places, 16/18 transitions.
Product exploration explored 100000 steps with 50000 reset in 197 ms.
Product exploration explored 100000 steps with 50000 reset in 173 ms.
[2021-05-09 13:25:11] [INFO ] Flatten gal took : 2 ms
[2021-05-09 13:25:11] [INFO ] Flatten gal took : 2 ms
[2021-05-09 13:25:11] [INFO ] Time to serialize gal into /tmp/LTL16204261728358220879.gal : 1 ms
[2021-05-09 13:25:11] [INFO ] Time to serialize properties into /tmp/LTL3735994705661542219.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16204261728358220879.gal, -t, CGAL, -LTL, /tmp/LTL3735994705661542219.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL16204261728358220879.gal -t CGAL -LTL /tmp/LTL3735994705661542219.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((SF<1)||(Mi<1))"))))
Formula 0 simplified : !XF"((SF<1)||(Mi<1))"
Detected timeout of ITS tools.
[2021-05-09 13:25:26] [INFO ] Flatten gal took : 2 ms
[2021-05-09 13:25:26] [INFO ] Applying decomposition
[2021-05-09 13:25:26] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph8916987091158031912.txt, -o, /tmp/graph8916987091158031912.bin, -w, /tmp/graph8916987091158031912.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph8916987091158031912.bin, -l, -1, -v, -w, /tmp/graph8916987091158031912.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 13:25:26] [INFO ] Decomposing Gal with order
[2021-05-09 13:25:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 13:25:26] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 13:25:26] [INFO ] Flatten gal took : 98 ms
[2021-05-09 13:25:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 13:25:26] [INFO ] Time to serialize gal into /tmp/LTL3757593159037290383.gal : 1 ms
[2021-05-09 13:25:26] [INFO ] Time to serialize properties into /tmp/LTL9860369360076727210.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL3757593159037290383.gal, -t, CGAL, -LTL, /tmp/LTL9860369360076727210.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3757593159037290383.gal -t CGAL -LTL /tmp/LTL9860369360076727210.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("((u3.SF<1)||(i0.u4.Mi<1))"))))
Formula 0 simplified : !XF"((u3.SF<1)||(i0.u4.Mi<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8162070354611868284
[2021-05-09 13:25:41] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8162070354611868284
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8162070354611868284]
Compilation finished in 208 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin8162070354611868284]
Link finished in 44 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin8162070354611868284]
LTSmin run took 511 ms.
FORMULA ClientsAndServers-PT-N0020P3-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P3-04 finished in 32211 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(!p0)&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 13:25:42] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 13:25:42] [INFO ] Implicit Places using invariants in 17 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 18 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:25:42] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 13:25:42] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Starting structural reductions, iteration 1 : 21/22 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:25:42] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 13:25:42] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/22 places, 18/18 transitions.
Stuttering acceptance computed with spot in 97 ms :[p0, (OR (NOT p1) p0), true, (OR (NOT p1) p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 0}, { cond=p0, acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(OR (LT s2 1) (LT s14 1)), p1:(LT s19 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P3-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P3-06 finished in 188 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X(p0)&&F((!p1&&X(G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 13:25:42] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 13:25:42] [INFO ] Implicit Places using invariants in 31 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 13:25:42] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 13:25:42] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Starting structural reductions, iteration 1 : 20/22 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 13:25:42] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 13:25:42] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 18/18 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p2) (NOT p0) p1), (NOT p0), (OR (NOT p2) p1), (NOT p2), true]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LT s18 1), p0:(GEQ s15 1), p2:(AND (GEQ s5 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P3-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P3-07 finished in 217 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((!p0||X(!p0)||(p1&&G(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 13:25:42] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 13:25:42] [INFO ] Implicit Places using invariants in 11 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 11 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:25:42] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 13:25:42] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Starting structural reductions, iteration 1 : 21/22 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:25:42] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 13:25:42] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/22 places, 18/18 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), p0, (AND (NOT p2) p0), true, (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s14 1)), p1:(GEQ s12 1), p2:(AND (GEQ s8 1) (GEQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P3-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P3-08 finished in 241 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 18/18 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 22 transition count 12
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 16 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 16 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 15 transition count 11
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 12 transition count 8
Applied a total of 20 rules in 8 ms. Remains 12 /22 variables (removed 10) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2021-05-09 13:25:43] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 13:25:43] [INFO ] Implicit Places using invariants in 41 ms returned [7, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 43 ms to find 2 implicit places.
[2021-05-09 13:25:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2021-05-09 13:25:43] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 13:25:43] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Starting structural reductions, iteration 1 : 10/22 places, 8/18 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 10 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 8 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 7 transition count 5
Applied a total of 6 rules in 1 ms. Remains 7 /10 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 7 cols
[2021-05-09 13:25:43] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:25:43] [INFO ] Implicit Places using invariants in 33 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 6/22 places, 5/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2021-05-09 13:25:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2021-05-09 13:25:43] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 13:25:43] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 3 iterations. Remains : 6/22 places, 5/18 transitions.
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s5 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 10220 reset in 126 ms.
Product exploration explored 100000 steps with 10177 reset in 121 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Product exploration explored 100000 steps with 10215 reset in 54 ms.
Product exploration explored 100000 steps with 10236 reset in 57 ms.
[2021-05-09 13:25:43] [INFO ] Flatten gal took : 0 ms
[2021-05-09 13:25:43] [INFO ] Flatten gal took : 0 ms
[2021-05-09 13:25:43] [INFO ] Time to serialize gal into /tmp/LTL11103826051827909319.gal : 0 ms
[2021-05-09 13:25:43] [INFO ] Time to serialize properties into /tmp/LTL15752474493058313605.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL11103826051827909319.gal, -t, CGAL, -LTL, /tmp/LTL15752474493058313605.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL11103826051827909319.gal -t CGAL -LTL /tmp/LTL15752474493058313605.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("(SpA>=1)")))
Formula 0 simplified : !F"(SpA>=1)"
Reverse transition relation is NOT exact ! Due to transitions t13.t14, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/4/1/5
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
643 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,6.44585,123324,1,0,1727,573776,34,1395,525,583741,3295
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0020P3-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ClientsAndServers-PT-N0020P3-09 finished in 7860 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 18/18 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 13
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 17 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 16 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 16 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 15 transition count 11
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 22 place count 11 transition count 7
Applied a total of 22 rules in 3 ms. Remains 11 /22 variables (removed 11) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 11 cols
[2021-05-09 13:25:50] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 13:25:50] [INFO ] Implicit Places using invariants in 16 ms returned [7, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 17 ms to find 2 implicit places.
[2021-05-09 13:25:50] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-09 13:25:50] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:25:50] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Starting structural reductions, iteration 1 : 9/22 places, 7/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 4 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 7 cols
[2021-05-09 13:25:50] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:25:50] [INFO ] Implicit Places using invariants in 8 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 8 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 6/22 places, 5/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2021-05-09 13:25:50] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2021-05-09 13:25:50] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 13:25:50] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 3 iterations. Remains : 6/22 places, 5/18 transitions.
Stuttering acceptance computed with spot in 32 ms :[true, (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-10 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (LT s0 1) (LT s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P3-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P3-10 finished in 145 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G(p0)||X(F(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 13:25:51] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-09 13:25:51] [INFO ] Implicit Places using invariants in 22 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 23 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 13:25:51] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:25:51] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Starting structural reductions, iteration 1 : 20/22 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 13:25:51] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-09 13:25:51] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 18/18 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (GEQ s5 1) (GEQ s14 1)), p1:(GEQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 25030 reset in 60 ms.
Product exploration explored 100000 steps with 24960 reset in 63 ms.
Knowledge obtained : [(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 24978 reset in 58 ms.
Product exploration explored 100000 steps with 25007 reset in 64 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 20/20 places, 18/18 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 20 transition count 18
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 6 place count 20 transition count 18
Deduced a syphon composed of 10 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 20 transition count 18
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 14 place count 16 transition count 14
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 18 place count 16 transition count 14
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 16 transition count 14
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 15 transition count 13
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 15 transition count 13
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 22 rules in 3 ms. Remains 15 /20 variables (removed 5) and now considering 13/18 (removed 5) transitions.
[2021-05-09 13:25:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 15 cols
[2021-05-09 13:25:51] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:25:51] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/20 places, 13/18 transitions.
Product exploration explored 100000 steps with 28547 reset in 140 ms.
Product exploration explored 100000 steps with 28597 reset in 109 ms.
[2021-05-09 13:25:52] [INFO ] Flatten gal took : 1 ms
[2021-05-09 13:25:52] [INFO ] Flatten gal took : 1 ms
[2021-05-09 13:25:52] [INFO ] Time to serialize gal into /tmp/LTL15371449038566965582.gal : 4 ms
[2021-05-09 13:25:52] [INFO ] Time to serialize properties into /tmp/LTL7551316935920726677.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL15371449038566965582.gal, -t, CGAL, -LTL, /tmp/LTL7551316935920726677.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15371449038566965582.gal -t CGAL -LTL /tmp/LTL7551316935920726677.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((G("((CF>=1)&&(Si>=1))"))||(X(F("(StR>=1)")))))))
Formula 0 simplified : !XF(G"((CF>=1)&&(Si>=1))" | XF"(StR>=1)")
Detected timeout of ITS tools.
[2021-05-09 13:26:07] [INFO ] Flatten gal took : 1 ms
[2021-05-09 13:26:07] [INFO ] Applying decomposition
[2021-05-09 13:26:07] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph1397877711248683689.txt, -o, /tmp/graph1397877711248683689.bin, -w, /tmp/graph1397877711248683689.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph1397877711248683689.bin, -l, -1, -v, -w, /tmp/graph1397877711248683689.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 13:26:07] [INFO ] Decomposing Gal with order
[2021-05-09 13:26:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 13:26:07] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 13:26:07] [INFO ] Flatten gal took : 2 ms
[2021-05-09 13:26:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 13:26:07] [INFO ] Time to serialize gal into /tmp/LTL4295293375273153319.gal : 1 ms
[2021-05-09 13:26:07] [INFO ] Time to serialize properties into /tmp/LTL14676110911879860350.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4295293375273153319.gal, -t, CGAL, -LTL, /tmp/LTL14676110911879860350.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4295293375273153319.gal -t CGAL -LTL /tmp/LTL14676110911879860350.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F((G("((u2.CF>=1)&&(u1.Si>=1))"))||(X(F("(u1.StR>=1)")))))))
Formula 0 simplified : !XF(G"((u2.CF>=1)&&(u1.Si>=1))" | XF"(u1.StR>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10907202952997109035
[2021-05-09 13:26:22] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10907202952997109035
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10907202952997109035]
Compilation finished in 116 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin10907202952997109035]
Link finished in 31 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>(([]((LTLAPp0==true))||X(<>((LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin10907202952997109035]
LTSmin run took 1636 ms.
FORMULA ClientsAndServers-PT-N0020P3-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P3-11 finished in 32953 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((X(X(X(G(p1))))&&p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 13:26:23] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 13:26:24] [INFO ] Implicit Places using invariants in 14 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 14 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 13:26:24] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:26:24] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Starting structural reductions, iteration 1 : 20/22 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 13:26:24] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:26:24] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 18/18 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 3}, { cond=(NOT p0), acceptance={0} source=2 dest: 4}], [{ cond=p0, acceptance={0} source=3 dest: 5}, { cond=(NOT p0), acceptance={0} source=3 dest: 6}], [{ cond=p0, acceptance={0} source=4 dest: 7}, { cond=(NOT p0), acceptance={0} source=4 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 7}, { cond=(AND p0 p1), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 8}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=7 dest: 4}, { cond=(AND p0 p1), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=8 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=8 dest: 2}, { cond=(AND p0 p1), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(AND (LT s12 1) (LT s10 1)), p1:(LT s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 118 ms.
Stack based approach found an accepted trace after 38723 steps with 0 reset with depth 38724 and stack size 24212 in 159 ms.
FORMULA ClientsAndServers-PT-N0020P3-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P3-12 finished in 613 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 18/18 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 20 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 19 transition count 15
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 6 place count 19 transition count 11
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 14 place count 15 transition count 11
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 15 place count 14 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 19 place count 12 transition count 9
Applied a total of 19 rules in 9 ms. Remains 12 /22 variables (removed 10) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 12 cols
[2021-05-09 13:26:24] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 13:26:24] [INFO ] Implicit Places using invariants in 20 ms returned [8, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
[2021-05-09 13:26:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-09 13:26:24] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 13:26:24] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
Starting structural reductions, iteration 1 : 10/22 places, 9/18 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 10 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 8 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 8 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 7 transition count 6
Applied a total of 6 rules in 1 ms. Remains 7 /10 variables (removed 3) and now considering 6/9 (removed 3) transitions.
// Phase 1: matrix 6 rows 7 cols
[2021-05-09 13:26:24] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 13:26:24] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-09 13:26:24] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 13:26:24] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 7/22 places, 6/18 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s5 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 28120 steps with 0 reset in 19 ms.
FORMULA ClientsAndServers-PT-N0020P3-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P3-14 finished in 222 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(((!p1 U (G(!p1)||(G(p3)&&p2)))&&p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 18/18 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 14
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 18 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 18 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 17 transition count 13
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 14 transition count 10
Applied a total of 16 rules in 3 ms. Remains 14 /22 variables (removed 8) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 14 cols
[2021-05-09 13:26:24] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 13:26:24] [INFO ] Implicit Places using invariants in 13 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 14 ms to find 1 implicit places.
[2021-05-09 13:26:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 13 cols
[2021-05-09 13:26:24] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 13:26:24] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Starting structural reductions, iteration 1 : 13/22 places, 10/18 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 12 transition count 9
Applied a total of 2 rules in 1 ms. Remains 12 /13 variables (removed 1) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 12 cols
[2021-05-09 13:26:24] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 13:26:24] [INFO ] Implicit Places using invariants in 19 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 11/22 places, 9/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2021-05-09 13:26:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 11 cols
[2021-05-09 13:26:24] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:26:24] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 3 iterations. Remains : 11/22 places, 9/18 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (AND p1 (NOT p2)) (AND p1 (NOT p3))), (OR (NOT p0) (AND p1 (NOT p2)) (AND p1 (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3))), (AND p1 (NOT p3)), (OR (AND p1 (NOT p2)) (AND p1 (NOT p3)))]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) p1) (AND (NOT p3) p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p2 p3 p1), acceptance={} source=0 dest: 2}, { cond=(OR (AND p0 (NOT p2) (NOT p1)) (AND p0 (NOT p3) (NOT p1))), acceptance={} source=0 dest: 4}], [{ cond=(OR (NOT p0) (AND (NOT p2) p1) (AND (NOT p3) p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p2 p3 p1), acceptance={1} source=1 dest: 2}, { cond=(AND p0 p2 p3 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(OR (AND p0 (NOT p2) (NOT p1)) (AND p0 (NOT p3) (NOT p1))), acceptance={0} source=1 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p3) (AND p3 p1)), acceptance={1} source=2 dest: 2}, { cond=(AND p0 p3 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p3) p1), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p3 p1), acceptance={1} source=3 dest: 2}, { cond=(AND p3 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p3) p1)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p2 p3 p1), acceptance={1} source=4 dest: 2}, { cond=(AND p2 p3 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p3) (NOT p1))), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s8 1)), p2:(AND (GEQ s2 1) (GEQ s8 1)), p1:(OR (LT s2 1) (LT s8 1)), p3:(OR (LT s0 1) (LT s7 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 1 reset in 169 ms.
Stack based approach found an accepted trace after 334 steps with 0 reset with depth 335 and stack size 333 in 1 ms.
FORMULA ClientsAndServers-PT-N0020P3-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P3-15 finished in 405 ms.
All properties solved without resorting to model-checking.
BK_STOP 1620566785478
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ClientsAndServers-PT-N0020P3"
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 ClientsAndServers-PT-N0020P3, 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 r045-oct2-162038291600197"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N0020P3.tgz
mv ClientsAndServers-PT-N0020P3 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 ;