About the Execution of ITS-Tools for Kanban-PT-00020
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 587.775 | 40720.00 | 52674.00 | 195.00 | FFFFFFFFTFFFTFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r121-tall-162075407000500.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Kanban-PT-00020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075407000500
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 06:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 06:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 25 07:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 25 07:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 14K 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 Kanban-PT-00020-00
FORMULA_NAME Kanban-PT-00020-01
FORMULA_NAME Kanban-PT-00020-02
FORMULA_NAME Kanban-PT-00020-03
FORMULA_NAME Kanban-PT-00020-04
FORMULA_NAME Kanban-PT-00020-05
FORMULA_NAME Kanban-PT-00020-06
FORMULA_NAME Kanban-PT-00020-07
FORMULA_NAME Kanban-PT-00020-08
FORMULA_NAME Kanban-PT-00020-09
FORMULA_NAME Kanban-PT-00020-10
FORMULA_NAME Kanban-PT-00020-11
FORMULA_NAME Kanban-PT-00020-12
FORMULA_NAME Kanban-PT-00020-13
FORMULA_NAME Kanban-PT-00020-14
FORMULA_NAME Kanban-PT-00020-15
=== Now, execution of the tool begins
BK_START 1620857591254
Running Version 0
[2021-05-12 22:13:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-12 22:13:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 22:13:12] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2021-05-12 22:13:12] [INFO ] Transformed 16 places.
[2021-05-12 22:13:12] [INFO ] Transformed 16 transitions.
[2021-05-12 22:13:12] [INFO ] Parsed PT model containing 16 places and 16 transitions in 63 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-12 22:13:12] [INFO ] Initial state test concluded for 5 properties.
FORMULA Kanban-PT-00020-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-00020-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-00020-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 9 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 16 cols
[2021-05-12 22:13:13] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-12 22:13:13] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2021-05-12 22:13:13] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-12 22:13:13] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 16 cols
[2021-05-12 22:13:13] [INFO ] Computed 5 place invariants in 6 ms
[2021-05-12 22:13:13] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 16/16 transitions.
[2021-05-12 22:13:13] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-12 22:13:13] [INFO ] Flatten gal took : 21 ms
FORMULA Kanban-PT-00020-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-00020-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 22:13:13] [INFO ] Flatten gal took : 6 ms
[2021-05-12 22:13:13] [INFO ] Input system was already deterministic with 16 transitions.
Finished random walk after 1239 steps, including 0 resets, run visited all 22 properties in 7 ms. (steps per millisecond=177 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G((p0&&F(p1)))||(p0&&F(p1)&&G(F(p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 4 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2021-05-12 22:13:13] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 22:13:13] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-12 22:13:13] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:13:13] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2021-05-12 22:13:13] [INFO ] Computed 4 place invariants in 3 ms
[2021-05-12 22:13:13] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 362 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Kanban-PT-00020-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(NOT p0), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(GT s13 s0), p1:(GT s1 s13), p2:(GT 1 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Kanban-PT-00020-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00020-00 finished in 480 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 11 edges and 16 vertex of which 6 / 16 are part of one of the 3 SCC in 3 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Ensure Unique test removed 1 places
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 2 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 12
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 5 place count 10 transition count 11
Applied a total of 5 rules in 17 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
[2021-05-12 22:13:13] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-12 22:13:13] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:13:13] [INFO ] Implicit Places using invariants in 22 ms returned []
[2021-05-12 22:13:13] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-12 22:13:13] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:13:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-12 22:13:13] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2021-05-12 22:13:13] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-12 22:13:13] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 10 cols
[2021-05-12 22:13:13] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:13:13] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/16 places, 11/16 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : Kanban-PT-00020-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s0)], 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 0 steps with 0 reset in 1 ms.
FORMULA Kanban-PT-00020-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00020-01 finished in 129 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((X(p0)||(!p0 U (p1||G(!p0)))) U (G((X(p0)||(!p0 U (p1||G(!p0)))))||((X(p0)||(!p0 U (p1||G(!p0))))&&X(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 1 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 15 cols
[2021-05-12 22:13:14] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:13:14] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 16 rows 15 cols
[2021-05-12 22:13:14] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:13:14] [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.
// Phase 1: matrix 16 rows 15 cols
[2021-05-12 22:13:14] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:13:14] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 134 ms :[false, (NOT p0), false, false, true, (AND (NOT p1) p0)]
Running random walk in product with property : Kanban-PT-00020-03 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (LEQ s3 s13) (GT s7 s2)), p0:(GT s3 s13), p2:(GT s13 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33470 reset in 235 ms.
Product exploration explored 100000 steps with 33580 reset in 138 ms.
Knowledge obtained : [(NOT p1), p0, (NOT p2)]
Stuttering acceptance computed with spot in 133 ms :[false, (NOT p0), false, false, true, (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 33400 reset in 80 ms.
Product exploration explored 100000 steps with 33414 reset in 98 ms.
Applying partial POR strategy [false, true, false, true, true, true]
Stuttering acceptance computed with spot in 133 ms :[false, (NOT p0), false, false, true, (AND (NOT p1) p0)]
Support contains 5 out of 15 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 15/15 places, 16/16 transitions.
Graph (trivial) has 5 edges and 15 vertex of which 4 / 15 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 13 transition count 14
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 14/16 (removed 2) transitions.
[2021-05-12 22:13:15] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-12 22:13:15] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 13 cols
[2021-05-12 22:13:15] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 22:13:15] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/15 places, 14/16 transitions.
Product exploration explored 100000 steps with 33333 reset in 178 ms.
Product exploration explored 100000 steps with 33356 reset in 207 ms.
[2021-05-12 22:13:15] [INFO ] Flatten gal took : 3 ms
[2021-05-12 22:13:15] [INFO ] Flatten gal took : 3 ms
[2021-05-12 22:13:15] [INFO ] Time to serialize gal into /tmp/LTL16653370161706872126.gal : 1 ms
[2021-05-12 22:13:15] [INFO ] Time to serialize properties into /tmp/LTL10011241159174808366.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/LTL16653370161706872126.gal, -t, CGAL, -LTL, /tmp/LTL10011241159174808366.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/LTL16653370161706872126.gal -t CGAL -LTL /tmp/LTL10011241159174808366.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((((X("(P4>Pout2)"))||(("(P4<=Pout2)")U(("((P4<=Pout2)&&(Pm1>Pout3))")||(G("(P4<=Pout2)")))))U((G((X("(P4>Pout2)"))||(("(P4<=Pout2)")U(("((P4<=Pout2)&&(Pm1>Pout3))")||(G("(P4<=Pout2)"))))))||((X("(Pout2>Pm4)"))&&((X("(P4>Pout2)"))||(("(P4<=Pout2)")U(("((P4<=Pout2)&&(Pm1>Pout3))")||(G("(P4<=Pout2)")))))))))
Formula 0 simplified : !((X"(P4>Pout2)" | ("(P4<=Pout2)" U ("((P4<=Pout2)&&(Pm1>Pout3))" | G"(P4<=Pout2)"))) U (G(X"(P4>Pout2)" | ("(P4<=Pout2)" U ("((P4<=Pout2)&&(Pm1>Pout3))" | G"(P4<=Pout2)"))) | ((X"(P4>Pout2)" | ("(P4<=Pout2)" U ("((P4<=Pout2)&&(Pm1>Pout3))" | G"(P4<=Pout2)"))) & X"(Pout2>Pm4)")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-05-12 22:13:30] [INFO ] Flatten gal took : 2 ms
[2021-05-12 22:13:30] [INFO ] Applying decomposition
[2021-05-12 22:13:30] [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/graph16329374451171843022.txt, -o, /tmp/graph16329374451171843022.bin, -w, /tmp/graph16329374451171843022.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/graph16329374451171843022.bin, -l, -1, -v, -w, /tmp/graph16329374451171843022.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 22:13:30] [INFO ] Decomposing Gal with order
[2021-05-12 22:13:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 22:13:30] [INFO ] Flatten gal took : 33 ms
[2021-05-12 22:13:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-12 22:13:30] [INFO ] Time to serialize gal into /tmp/LTL10300365543274375564.gal : 1 ms
[2021-05-12 22:13:30] [INFO ] Time to serialize properties into /tmp/LTL4856690345694851338.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/LTL10300365543274375564.gal, -t, CGAL, -LTL, /tmp/LTL4856690345694851338.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/LTL10300365543274375564.gal -t CGAL -LTL /tmp/LTL4856690345694851338.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((((X("(gu4.P4>gu4.Pout2)"))||(("(gu4.P4<=gu4.Pout2)")U(("((gu4.P4<=gu4.Pout2)&&(gi0.gu1.Pm1>gi0.gu1.Pout3))")||(G("(gu4.P4<=gu4.Pout2)")))))U((G((X("(gu4.P4>gu4.Pout2)"))||(("(gu4.P4<=gu4.Pout2)")U(("((gu4.P4<=gu4.Pout2)&&(gi0.gu1.Pm1>gi0.gu1.Pout3))")||(G("(gu4.P4<=gu4.Pout2)"))))))||((X("(gu4.Pout2>gu4.Pm4)"))&&((X("(gu4.P4>gu4.Pout2)"))||(("(gu4.P4<=gu4.Pout2)")U(("((gu4.P4<=gu4.Pout2)&&(gi0.gu1.Pm1>gi0.gu1.Pout3))")||(G("(gu4.P4<=gu4.Pout2)")))))))))
Formula 0 simplified : !((X"(gu4.P4>gu4.Pout2)" | ("(gu4.P4<=gu4.Pout2)" U ("((gu4.P4<=gu4.Pout2)&&(gi0.gu1.Pm1>gi0.gu1.Pout3))" | G"(gu4.P4<=gu4.Pout2)"))) U (G(X"(gu4.P4>gu4.Pout2)" | ("(gu4.P4<=gu4.Pout2)" U ("((gu4.P4<=gu4.Pout2)&&(gi0.gu1.Pm1>gi0.gu1.Pout3))" | G"(gu4.P4<=gu4.Pout2)"))) | ((X"(gu4.P4>gu4.Pout2)" | ("(gu4.P4<=gu4.Pout2)" U ("((gu4.P4<=gu4.Pout2)&&(gi0.gu1.Pm1>gi0.gu1.Pout3))" | G"(gu4.P4<=gu4.Pout2)"))) & X"(gu4.Pout2>gu4.Pm4)")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16589721348139034115
[2021-05-12 22:13:45] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16589721348139034115
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/ltsmin16589721348139034115]
Compilation finished in 193 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin16589721348139034115]
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))||(!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true))))) U ([]((X((LTLAPp0==true))||(!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true))))))||(X((LTLAPp2==true))&&(X((LTLAPp0==true))||(!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin16589721348139034115]
LTSmin run took 430 ms.
FORMULA Kanban-PT-00020-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Kanban-PT-00020-03 finished in 32507 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 9 edges and 16 vertex of which 4 / 16 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Ensure Unique test removed 1 places
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 2 place count 13 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 12 transition count 13
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 5 place count 11 transition count 12
Applied a total of 5 rules in 2 ms. Remains 11 /16 variables (removed 5) and now considering 12/16 (removed 4) transitions.
[2021-05-12 22:13:46] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2021-05-12 22:13:46] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 22:13:46] [INFO ] Implicit Places using invariants in 11 ms returned []
[2021-05-12 22:13:46] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2021-05-12 22:13:46] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:13:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-12 22:13:46] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
[2021-05-12 22:13:46] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-12 22:13:46] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 11 cols
[2021-05-12 22:13:46] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:13:46] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/16 places, 12/16 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-00020-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s0 s4)], 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 4 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-00020-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00020-04 finished in 120 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||G(p1)||(p2 U (p3||G(p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 5 edges and 16 vertex of which 2 / 16 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Ensure Unique test removed 1 places
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 3 place count 13 transition count 14
Applied a total of 3 rules in 2 ms. Remains 13 /16 variables (removed 3) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 13 cols
[2021-05-12 22:13:46] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:13:46] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 14 rows 13 cols
[2021-05-12 22:13:46] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:13:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-12 22:13:46] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2021-05-12 22:13:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 13 cols
[2021-05-12 22:13:46] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 22:13:46] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/16 places, 14/16 transitions.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), true, (AND (NOT p2) (NOT p3)), (NOT p1)]
Running random walk in product with property : Kanban-PT-00020-05 automaton TGBA [mat=[[{ cond=(AND p1 (NOT p3) p2), acceptance={} source=0 dest: 0}, { cond=p3, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={} source=1 dest: 0}, { cond=(OR p0 p3), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p3) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p3, acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(LEQ s3 s8), p3:(AND (GT s3 s8) (GT s12 s7)), p2:(GT s12 s7), p0:(AND (LEQ s3 s8) (LEQ 1 s9))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-00020-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00020-05 finished in 208 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 10 edges and 16 vertex of which 6 / 16 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Ensure Unique test removed 1 places
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 3 place count 11 transition count 12
Applied a total of 3 rules in 2 ms. Remains 11 /16 variables (removed 5) and now considering 12/16 (removed 4) transitions.
[2021-05-12 22:13:46] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2021-05-12 22:13:46] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 22:13:46] [INFO ] Implicit Places using invariants in 11 ms returned []
[2021-05-12 22:13:46] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2021-05-12 22:13:46] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:13:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-12 22:13:46] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2021-05-12 22:13:46] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-12 22:13:46] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 11 cols
[2021-05-12 22:13:46] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:13:46] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/16 places, 12/16 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : Kanban-PT-00020-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s3 s6)], 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 20 steps with 0 reset in 0 ms.
FORMULA Kanban-PT-00020-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00020-07 finished in 93 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2021-05-12 22:13:46] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:13:46] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-12 22:13:46] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:13:46] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2021-05-12 22:13:46] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:13:46] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-00020-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1 reset in 163 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA Kanban-PT-00020-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00020-09 finished in 265 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F(p0)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 14 cols
[2021-05-12 22:13:47] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:13:47] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 15 rows 14 cols
[2021-05-12 22:13:47] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:13:47] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 14 cols
[2021-05-12 22:13:47] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 22:13:47] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Kanban-PT-00020-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(GT 1 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 14876 reset in 93 ms.
Stack based approach found an accepted trace after 164 steps with 34 reset with depth 9 and stack size 9 in 1 ms.
FORMULA Kanban-PT-00020-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00020-10 finished in 243 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((((p0||G(p1)) U X(!p0))&&X(X(F(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 15 transition count 15
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 15 transition count 15
Applied a total of 2 rules in 1 ms. Remains 15 /16 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 15 cols
[2021-05-12 22:13:47] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 22:13:47] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 15 rows 15 cols
[2021-05-12 22:13:47] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 22:13:47] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
// Phase 1: matrix 15 rows 15 cols
[2021-05-12 22:13:47] [INFO ] Computed 5 place invariants in 9 ms
[2021-05-12 22:13:47] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/16 places, 15/16 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p2) p0), p0, (NOT p2), p0, (AND (NOT p1) p0), true, (NOT p2), (NOT p1)]
Running random walk in product with property : Kanban-PT-00020-12 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(OR p0 p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 6}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p0 p1), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 5}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(GT 3 s8), p1:(LEQ s12 s14), p2:(LEQ s5 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 40005 reset in 111 ms.
Product exploration explored 100000 steps with 40092 reset in 121 ms.
Knowledge obtained : [(NOT p0), (NOT p1), p2]
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p2) p0), p0, (NOT p2), p0, (AND (NOT p1) p0), true, (NOT p2), (NOT p1)]
Product exploration explored 100000 steps with 39970 reset in 81 ms.
Product exploration explored 100000 steps with 40027 reset in 94 ms.
Applying partial POR strategy [false, true, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p2) p0), p0, (NOT p2), p0, (AND (NOT p1) p0), true, (NOT p2), (NOT p1)]
Support contains 5 out of 15 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 15/15 places, 15/15 transitions.
Graph (trivial) has 7 edges and 15 vertex of which 4 / 15 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Applied a total of 1 rules in 2 ms. Remains 13 /15 variables (removed 2) and now considering 13/15 (removed 2) transitions.
[2021-05-12 22:13:48] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-12 22:13:48] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 13 cols
[2021-05-12 22:13:48] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 22:13:48] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/15 places, 13/15 transitions.
Product exploration explored 100000 steps with 39973 reset in 176 ms.
Product exploration explored 100000 steps with 39949 reset in 173 ms.
[2021-05-12 22:13:49] [INFO ] Flatten gal took : 1 ms
[2021-05-12 22:13:49] [INFO ] Flatten gal took : 2 ms
[2021-05-12 22:13:49] [INFO ] Time to serialize gal into /tmp/LTL14991144948555954596.gal : 1 ms
[2021-05-12 22:13:49] [INFO ] Time to serialize properties into /tmp/LTL12259256674546841401.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/LTL14991144948555954596.gal, -t, CGAL, -LTL, /tmp/LTL12259256674546841401.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/LTL14991144948555954596.gal -t CGAL -LTL /tmp/LTL12259256674546841401.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((((("(P1<3)")||(G("(P2<=Pback2)")))U(X("(P1>=3)")))&&(X(X(F("(Pm4<=P3)"))))))
Formula 0 simplified : !((("(P1<3)" | G"(P2<=Pback2)") U X"(P1>=3)") & XXF"(Pm4<=P3)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
0 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
57 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,0.575526,31756,1,0,7,102540,41,0,630,108192,22
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Kanban-PT-00020-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property Kanban-PT-00020-12 finished in 2173 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&X(((p1 U p2) U (p0 U X(X(X(G(p1))))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 0 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 15 cols
[2021-05-12 22:13:49] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:13:49] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 16 rows 15 cols
[2021-05-12 22:13:49] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:13:49] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 15 cols
[2021-05-12 22:13:49] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:13:49] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 992 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Kanban-PT-00020-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(OR p0 p2 p1), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 4}], [{ cond=(OR p0 p2 p1), acceptance={0} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=2 dest: 6}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 7}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 8}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 9}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 10}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 11}], [{ cond=p0, acceptance={0} source=4 dest: 10}, { cond=(NOT p0), acceptance={0} source=4 dest: 11}], [{ cond=(OR p0 p2 p1), acceptance={0} source=5 dest: 12}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=5 dest: 13}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 14}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=6 dest: 15}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=6 dest: 16}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 17}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 18}], [{ cond=p0, acceptance={0} source=7 dest: 17}, { cond=(NOT p0), acceptance={0} source=7 dest: 18}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=8 dest: 19}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=8 dest: 20}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=8 dest: 21}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=8 dest: 22}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=9 dest: 23}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=9 dest: 24}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=9 dest: 25}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=9 dest: 26}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=10 dest: 20}, { cond=(OR p0 p2 p1), acceptance={0} source=10 dest: 21}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=10 dest: 22}], [{ cond=p0, acceptance={0} source=11 dest: 25}, { cond=(NOT p0), acceptance={0} source=11 dest: 26}], [{ cond=(OR (AND p0 (NOT p1)) (AND p2 (NOT p1))), acceptance={0} source=12 dest: 12}, { cond=p1, acceptance={} source=12 dest: 12}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=12 dest: 13}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=12 dest: 14}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=13 dest: 15}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=13 dest: 16}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=13 dest: 17}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=13 dest: 18}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=14 dest: 17}, { cond=(AND p0 p1), acceptance={} source=14 dest: 17}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=14 dest: 18}, { cond=(AND (NOT p0) p1), acceptance={} source=14 dest: 18}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=15 dest: 19}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=15 dest: 20}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=15 dest: 21}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=15 dest: 22}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=16 dest: 23}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=16 dest: 24}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=16 dest: 25}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=16 dest: 26}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=17 dest: 20}, { cond=(OR (AND p0 (NOT p1)) (AND p2 (NOT p1))), acceptance={0} source=17 dest: 21}, { cond=p1, acceptance={} source=17 dest: 21}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=17 dest: 22}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=18 dest: 25}, { cond=(AND p0 p1), acceptance={} source=18 dest: 25}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=18 dest: 26}, { cond=(AND (NOT p0) p1), acceptance={} source=18 dest: 26}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=19 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=19 dest: 7}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=19 dest: 13}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=19 dest: 27}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=20 dest: 10}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=20 dest: 11}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=20 dest: 15}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=20 dest: 16}], [{ cond=(OR (AND p0 (NOT p1)) (AND p2 (NOT p1))), acceptance={0} source=21 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=21 dest: 7}, { cond=p1, acceptance={} source=21 dest: 12}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=21 dest: 13}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=22 dest: 10}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=22 dest: 11}, { cond=(AND p0 p1), acceptance={} source=22 dest: 17}, { cond=(AND (NOT p0) p1), acceptance={} source=22 dest: 18}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=23 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=23 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=23 dest: 19}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=23 dest: 20}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=24 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=24 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=24 dest: 23}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=24 dest: 24}], [{ cond=(OR (AND p0 (NOT p1)) (AND p2 (NOT p1))), acceptance={0} source=25 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=25 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=25 dest: 20}, { cond=p1, acceptance={} source=25 dest: 21}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=26 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=26 dest: 1}, { cond=(AND p0 p1), acceptance={} source=26 dest: 25}, { cond=(AND (NOT p0) p1), acceptance={} source=26 dest: 26}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=27 dest: 12}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=27 dest: 13}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=27 dest: 14}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=27 dest: 27}]], initial=0, aps=[p0:(LEQ s4 s0), p2:(LEQ s11 s7), p1:(LEQ 3 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 37 reset in 184 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA Kanban-PT-00020-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00020-13 finished in 1234 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G((G(p0) U (p1 U p2)))||G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 16 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 4 edges and 16 vertex of which 2 / 16 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 14 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 13 transition count 14
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 12 transition count 13
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 12 transition count 13
Applied a total of 5 rules in 2 ms. Remains 12 /16 variables (removed 4) and now considering 13/16 (removed 3) transitions.
// Phase 1: matrix 13 rows 12 cols
[2021-05-12 22:13:50] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:13:50] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 13 rows 12 cols
[2021-05-12 22:13:50] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:13:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-12 22:13:50] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 25 ms to find 0 implicit places.
[2021-05-12 22:13:50] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 12 cols
[2021-05-12 22:13:50] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-12 22:13:50] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/16 places, 13/16 transitions.
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : Kanban-PT-00020-15 automaton TGBA [mat=[[{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(OR (AND p2 (NOT p1)) (AND (NOT p1) p0)), acceptance={0, 2} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1, 2} source=0 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={1, 2} source=0 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={1, 2} source=1 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=2 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0, 2} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={1, 2} source=2 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={2} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 2} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={1, 2} source=3 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={1, 2} source=4 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ s6 s2), p1:(LEQ 2 s4), p0:(LEQ 1 s0)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 87 steps with 1 reset in 0 ms.
FORMULA Kanban-PT-00020-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Kanban-PT-00020-15 finished in 225 ms.
All properties solved without resorting to model-checking.
BK_STOP 1620857631974
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Kanban-PT-00020"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Kanban-PT-00020, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r121-tall-162075407000500"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Kanban-PT-00020.tgz
mv Kanban-PT-00020 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;