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.r140-tall-162089127800397.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 ParamProductionCell-PT-4, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127800397
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K 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.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Mar 28 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 27 06:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 06:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 25 07:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 07:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 174K 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 ParamProductionCell-PT-4-00
FORMULA_NAME ParamProductionCell-PT-4-01
FORMULA_NAME ParamProductionCell-PT-4-02
FORMULA_NAME ParamProductionCell-PT-4-03
FORMULA_NAME ParamProductionCell-PT-4-04
FORMULA_NAME ParamProductionCell-PT-4-05
FORMULA_NAME ParamProductionCell-PT-4-06
FORMULA_NAME ParamProductionCell-PT-4-07
FORMULA_NAME ParamProductionCell-PT-4-08
FORMULA_NAME ParamProductionCell-PT-4-09
FORMULA_NAME ParamProductionCell-PT-4-10
FORMULA_NAME ParamProductionCell-PT-4-11
FORMULA_NAME ParamProductionCell-PT-4-12
FORMULA_NAME ParamProductionCell-PT-4-13
FORMULA_NAME ParamProductionCell-PT-4-14
FORMULA_NAME ParamProductionCell-PT-4-15

=== Now, execution of the tool begins

BK_START 1620980171276

Running Version 0
[2021-05-14 08:16:12] [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-14 08:16:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 08:16:12] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2021-05-14 08:16:12] [INFO ] Transformed 231 places.
[2021-05-14 08:16:12] [INFO ] Transformed 202 transitions.
[2021-05-14 08:16:12] [INFO ] Found NUPN structural information;
[2021-05-14 08:16:12] [INFO ] Parsed PT model containing 231 places and 202 transitions in 109 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-14 08:16:12] [INFO ] Initial state test concluded for 3 properties.
FORMULA ParamProductionCell-PT-4-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 55 out of 231 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 225 transition count 196
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 225 transition count 196
Applied a total of 12 rules in 34 ms. Remains 225 /231 variables (removed 6) and now considering 196/202 (removed 6) transitions.
// Phase 1: matrix 196 rows 225 cols
[2021-05-14 08:16:13] [INFO ] Computed 59 place invariants in 24 ms
[2021-05-14 08:16:13] [INFO ] Implicit Places using invariants in 247 ms returned [15, 16, 18, 24, 31, 35, 36, 47, 59, 65, 73, 78, 79, 118, 119, 160, 164, 165, 190, 191, 195, 200, 201, 205, 216]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 275 ms to find 25 implicit places.
// Phase 1: matrix 196 rows 200 cols
[2021-05-14 08:16:13] [INFO ] Computed 34 place invariants in 4 ms
[2021-05-14 08:16:13] [INFO ] Dead Transitions using invariants and state equation in 143 ms returned []
Starting structural reductions, iteration 1 : 200/231 places, 196/202 transitions.
Applied a total of 0 rules in 9 ms. Remains 200 /200 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 200 cols
[2021-05-14 08:16:13] [INFO ] Computed 34 place invariants in 4 ms
[2021-05-14 08:16:13] [INFO ] Dead Transitions using invariants and state equation in 100 ms returned []
Finished structural reductions, in 2 iterations. Remains : 200/231 places, 196/202 transitions.
[2021-05-14 08:16:13] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-14 08:16:13] [INFO ] Flatten gal took : 44 ms
FORMULA ParamProductionCell-PT-4-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 08:16:13] [INFO ] Flatten gal took : 17 ms
[2021-05-14 08:16:13] [INFO ] Input system was already deterministic with 196 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 339 ms. (steps per millisecond=294 ) properties (out of 22) seen :20
Running SMT prover for 2 properties.
// Phase 1: matrix 196 rows 200 cols
[2021-05-14 08:16:14] [INFO ] Computed 34 place invariants in 3 ms
[2021-05-14 08:16:14] [INFO ] [Real]Absence check using 22 positive place invariants in 3 ms returned unsat
[2021-05-14 08:16:14] [INFO ] [Real]Absence check using 22 positive place invariants in 2 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
[2021-05-14 08:16:14] [INFO ] Initial state test concluded for 1 properties.
FORMULA ParamProductionCell-PT-4-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 5 out of 200 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 200/200 places, 196/196 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 200 transition count 167
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 171 transition count 167
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 58 place count 171 transition count 155
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 82 place count 159 transition count 155
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 120 place count 140 transition count 136
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 122 place count 139 transition count 135
Applied a total of 122 rules in 38 ms. Remains 139 /200 variables (removed 61) and now considering 135/196 (removed 61) transitions.
// Phase 1: matrix 135 rows 139 cols
[2021-05-14 08:16:14] [INFO ] Computed 34 place invariants in 2 ms
[2021-05-14 08:16:14] [INFO ] Implicit Places using invariants in 121 ms returned [11, 23, 26, 37, 53, 54, 56, 68, 69, 71, 103, 104, 127]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 124 ms to find 13 implicit places.
[2021-05-14 08:16:14] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 135 rows 126 cols
[2021-05-14 08:16:14] [INFO ] Computed 21 place invariants in 4 ms
[2021-05-14 08:16:14] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Starting structural reductions, iteration 1 : 126/200 places, 135/196 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 126 transition count 132
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 123 transition count 132
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 123 transition count 128
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 119 transition count 128
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 117 transition count 126
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 117 transition count 126
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 74 place count 89 transition count 98
Applied a total of 74 rules in 17 ms. Remains 89 /126 variables (removed 37) and now considering 98/135 (removed 37) transitions.
// Phase 1: matrix 98 rows 89 cols
[2021-05-14 08:16:14] [INFO ] Computed 21 place invariants in 0 ms
[2021-05-14 08:16:14] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 98 rows 89 cols
[2021-05-14 08:16:14] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-14 08:16:14] [INFO ] State equation strengthened by 67 read => feed constraints.
[2021-05-14 08:16:14] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 89/200 places, 98/196 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-4-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s16 1) (EQ s18 1) (EQ s28 1) (OR (NEQ s40 1) (NEQ s43 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 260 ms.
Stack based approach found an accepted trace after 165 steps with 0 reset with depth 166 and stack size 166 in 1 ms.
FORMULA ParamProductionCell-PT-4-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-4-00 finished in 808 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 200 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 200/200 places, 196/196 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 200 transition count 169
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 173 transition count 169
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 54 place count 173 transition count 156
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 80 place count 160 transition count 156
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 116 place count 142 transition count 138
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 118 place count 141 transition count 137
Applied a total of 118 rules in 19 ms. Remains 141 /200 variables (removed 59) and now considering 137/196 (removed 59) transitions.
// Phase 1: matrix 137 rows 141 cols
[2021-05-14 08:16:15] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-14 08:16:15] [INFO ] Implicit Places using invariants in 89 ms returned [11, 23, 24, 27, 38, 54, 55, 69, 70, 72, 104, 105, 129]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 90 ms to find 13 implicit places.
[2021-05-14 08:16:15] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 137 rows 128 cols
[2021-05-14 08:16:15] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-14 08:16:15] [INFO ] Dead Transitions using invariants and state equation in 74 ms returned []
Starting structural reductions, iteration 1 : 128/200 places, 137/196 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 128 transition count 135
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 126 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 125 transition count 134
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 6 place count 125 transition count 131
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 12 place count 122 transition count 131
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 54 place count 101 transition count 110
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 3 with 2 rules applied. Total rules applied 56 place count 100 transition count 109
Applied a total of 56 rules in 14 ms. Remains 100 /128 variables (removed 28) and now considering 109/137 (removed 28) transitions.
// Phase 1: matrix 109 rows 100 cols
[2021-05-14 08:16:15] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-14 08:16:15] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 109 rows 100 cols
[2021-05-14 08:16:15] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-14 08:16:15] [INFO ] State equation strengthened by 66 read => feed constraints.
[2021-05-14 08:16:15] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 100/200 places, 109/196 transitions.
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-4-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (EQ s7 1) (EQ s10 1)) (EQ s76 1)), p1:(OR (EQ s39 0) (EQ s41 0) (EQ s69 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 7721 reset in 179 ms.
Product exploration explored 100000 steps with 7660 reset in 187 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 69 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 7731 reset in 154 ms.
Product exploration explored 100000 steps with 7734 reset in 190 ms.
[2021-05-14 08:16:16] [INFO ] Flatten gal took : 8 ms
[2021-05-14 08:16:16] [INFO ] Flatten gal took : 7 ms
[2021-05-14 08:16:16] [INFO ] Time to serialize gal into /tmp/LTL13328515040637347345.gal : 4 ms
[2021-05-14 08:16:16] [INFO ] Time to serialize properties into /tmp/LTL10437537712067935266.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/LTL13328515040637347345.gal, -t, CGAL, -LTL, /tmp/LTL10437537712067935266.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/LTL13328515040637347345.gal -t CGAL -LTL /tmp/LTL10437537712067935266.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((F("(((press_at_lower_pos==1)&&(PU_lower_run==1))||(A1U_out==1))"))&&(F(G("(((robot_left==0)||(arm1_release_angle==0))||(A1L_rot1_run==0))"))))))
Formula 0 simplified : !G(F"(((press_at_lower_pos==1)&&(PU_lower_run==1))||(A1U_out==1))" & FG"(((robot_left==0)||(arm1_release_angle==0))||(A1L_rot1_run==0))")
Reverse transition relation is NOT exact ! Due to transitions t77, t95, t96, t98, t99, t102, t125, t126, t128, t129, t131, t132, t155, t166.t186, t51.t167.t181, t8.t6, t36.t37.t42, t124.t137, t153.t160, t117.t118.t0.t10, t94.t107, t24.t19.t48.t49.t54, t21.t20.t26, t33.t32.t30, t75.t85, t72.t71.t85, t79.t71.t85, t88.t87.t64.t65, t110.t109.t66.t2.t14.t62, t140.t139.t119.t115.t18.t22, t147.t146.t160, t150.t146.t160, t172.t171.t177, t193.t192.t190, t57.t56.t50.t16.t34, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/74/35/109
4 unique states visited
3 strongly connected components in search stack
5 transitions explored
3 items max in DFS search stack
536 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,5.38813,185896,1,0,916,948882,261,395,3294,899545,1942
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ParamProductionCell-PT-4-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ParamProductionCell-PT-4-01 finished in 7673 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((G(p0)||(p1&&X(p0))||(X(p0)&&F(p2))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 200 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 200/200 places, 196/196 transitions.
Applied a total of 0 rules in 4 ms. Remains 200 /200 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 200 cols
[2021-05-14 08:16:22] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-14 08:16:22] [INFO ] Implicit Places using invariants in 129 ms returned [16, 34, 35, 39, 55, 85, 86, 88, 100, 101, 103, 144, 146]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 131 ms to find 13 implicit places.
// Phase 1: matrix 196 rows 187 cols
[2021-05-14 08:16:22] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-14 08:16:23] [INFO ] Dead Transitions using invariants and state equation in 96 ms returned []
Starting structural reductions, iteration 1 : 187/200 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 6 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2021-05-14 08:16:23] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-14 08:16:23] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 194 rows 185 cols
[2021-05-14 08:16:23] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-14 08:16:23] [INFO ] State equation strengthened by 68 read => feed constraints.
[2021-05-14 08:16:23] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 185/200 places, 194/196 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ParamProductionCell-PT-4-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (NEQ s162 0) (NEQ s170 0)), p1:(OR (NEQ s78 1) (NEQ s140 1)), p2:(OR (NEQ s158 1) (NEQ s159 1) (NEQ s168 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 642 reset in 147 ms.
Product exploration explored 100000 steps with 643 reset in 307 ms.
Knowledge obtained : [(NOT p0), p1, p2]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 644 reset in 138 ms.
Product exploration explored 100000 steps with 641 reset in 155 ms.
[2021-05-14 08:16:24] [INFO ] Flatten gal took : 10 ms
[2021-05-14 08:16:24] [INFO ] Flatten gal took : 10 ms
[2021-05-14 08:16:24] [INFO ] Time to serialize gal into /tmp/LTL13023456874903244760.gal : 9 ms
[2021-05-14 08:16:24] [INFO ] Time to serialize properties into /tmp/LTL12703163859358644528.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/LTL13023456874903244760.gal, -t, CGAL, -LTL, /tmp/LTL12703163859358644528.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/LTL13023456874903244760.gal -t CGAL -LTL /tmp/LTL12703163859358644528.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F(((G("((crane_above_deposit_belt!=0)&&(CU_trans_run!=0))"))||((X("((crane_above_deposit_belt!=0)&&(CU_trans_run!=0))"))&&("((arm2_release_angle!=1)||(A1U_in!=1))")))||((X("((crane_above_deposit_belt!=0)&&(CU_trans_run!=0))"))&&(F("(((crane_release_height!=1)||(crane_lift!=1))||(CU_lift_run!=1))")))))))
Formula 0 simplified : !GF(G"((crane_above_deposit_belt!=0)&&(CU_trans_run!=0))" | ("((arm2_release_angle!=1)||(A1U_in!=1))" & X"((crane_above_deposit_belt!=0)&&(CU_trans_run!=0))") | (X"((crane_above_deposit_belt!=0)&&(CU_trans_run!=0))" & F"(((crane_release_height!=1)||(crane_lift!=1))||(CU_lift_run!=1))"))
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t14, t22, t26, t30, t34, t42, t46, t54, t58, t62, t65, t72, t73, t76, t77, t79, t80, t85, t89, t95, t96, t98, t99, t102, t107, t111, t115, t118, t125, t126, t128, t129, t131, t132, t137, t141, t148, t150, t151, t154, t155, t160, t164, t173, t177, t181, t186, t190, t194, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/143/51/194
Detected timeout of ITS tools.
[2021-05-14 08:16:39] [INFO ] Flatten gal took : 15 ms
[2021-05-14 08:16:39] [INFO ] Applying decomposition
[2021-05-14 08:16:39] [INFO ] Flatten gal took : 9 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/graph904948202036933072.txt, -o, /tmp/graph904948202036933072.bin, -w, /tmp/graph904948202036933072.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/graph904948202036933072.bin, -l, -1, -v, -w, /tmp/graph904948202036933072.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 08:16:39] [INFO ] Decomposing Gal with order
[2021-05-14 08:16:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 08:16:39] [INFO ] Removed a total of 49 redundant transitions.
[2021-05-14 08:16:39] [INFO ] Flatten gal took : 42 ms
[2021-05-14 08:16:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 7 ms.
[2021-05-14 08:16:39] [INFO ] Time to serialize gal into /tmp/LTL2667142485742024811.gal : 4 ms
[2021-05-14 08:16:39] [INFO ] Time to serialize properties into /tmp/LTL3523587598901585295.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/LTL2667142485742024811.gal, -t, CGAL, -LTL, /tmp/LTL3523587598901585295.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/LTL2667142485742024811.gal -t CGAL -LTL /tmp/LTL3523587598901585295.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F(((G("((i9.i1.u67.crane_above_deposit_belt!=0)&&(i9.i1.u66.CU_trans_run!=0))"))||((X("((i9.i1.u67.crane_above_deposit_belt!=0)&&(i9.i1.u66.CU_trans_run!=0))"))&&("((i4.u33.arm2_release_angle!=1)||(i8.u49.A1U_in!=1))")))||((X("((i9.i1.u67.crane_above_deposit_belt!=0)&&(i9.i1.u66.CU_trans_run!=0))"))&&(F("(((i9.i0.u65.crane_release_height!=1)||(i9.i0.u65.crane_lift!=1))||(i9.i0.u70.CU_lift_run!=1))")))))))
Formula 0 simplified : !GF(G"((i9.i1.u67.crane_above_deposit_belt!=0)&&(i9.i1.u66.CU_trans_run!=0))" | ("((i4.u33.arm2_release_angle!=1)||(i8.u49.A1U_in!=1))" & X"((i9.i1.u67.crane_above_deposit_belt!=0)&&(i9.i1.u66.CU_trans_run!=0))") | (X"((i9.i1.u67.crane_above_deposit_belt!=0)&&(i9.i1.u66.CU_trans_run!=0))" & F"(((i9.i0.u65.crane_release_height!=1)||(i9.i0.u65.crane_lift!=1))||(i9.i0.u70.CU_lift_run!=1))"))
Reverse transition relation is NOT exact ! Due to transitions t62, t118, i0.i0.u3.t14, i0.i1.u1.t10, i0.i1.u6.t6, i1.i0.u8.t22, i1.i0.u10.t26, i1.i1.u12.t34, i1.i1.u14.t30, i2.u18.t42, i2.u19.t46, i3.u23.t58, i3.u25.t54, i4.t131, i4.t128, i4.t125, i4.t79, i4.t76, i4.t72, i4.u31.t73, i4.u34.t77, i4.u35.t80, i4.u51.t132, i4.u52.t126, i4.u53.t129, i5.t98, i5.t95, i5.t65, i5.u40.t99, i5.u41.t102, i5.u42.t96, i5.u45.t107, i6.i1.u28.t85, i6.i1.u37.t89, i6.i2.u44.t111, i7.i1.u55.t141, i7.i1.u56.t137, i7.i2.u64.t164, i8.t154, i8.t150, i8.u57.t160, i8.u59.t148, i8.u60.t151, i8.u61.t155, i9.i0.t173, i9.i0.t194, i9.i0.u69.t181, i9.i0.u72.t186, i9.i0.u75.t190, i9.i1.u66.t177, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/143/50/193
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin683508439279245090
[2021-05-14 08:16:54] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin683508439279245090
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/ltsmin683508439279245090]
Compilation finished in 835 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin683508439279245090]
Link finished in 42 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, [](<>(([]((LTLAPp0==true))||(X((LTLAPp0==true))&&(LTLAPp1==true))||(X((LTLAPp0==true))&&<>((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin683508439279245090]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ParamProductionCell-PT-4-03 finished in 47100 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 200 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 200/200 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 200 /200 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 200 cols
[2021-05-14 08:17:09] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-14 08:17:10] [INFO ] Implicit Places using invariants in 121 ms returned [34, 35, 39, 55, 85, 86, 88, 100, 101, 103, 144, 146, 174]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 122 ms to find 13 implicit places.
// Phase 1: matrix 196 rows 187 cols
[2021-05-14 08:17:10] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-14 08:17:10] [INFO ] Dead Transitions using invariants and state equation in 87 ms returned []
Starting structural reductions, iteration 1 : 187/200 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 5 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2021-05-14 08:17:10] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-14 08:17:10] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 194 rows 185 cols
[2021-05-14 08:17:10] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-14 08:17:10] [INFO ] State equation strengthened by 68 read => feed constraints.
[2021-05-14 08:17:10] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 185/200 places, 194/196 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-4-05 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}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s16 1) (EQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-4-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-4-05 finished in 636 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((F(p0)&&F(p1)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 200 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 200/200 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 200 /200 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 200 cols
[2021-05-14 08:17:10] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-14 08:17:10] [INFO ] Implicit Places using invariants in 122 ms returned [16, 34, 35, 39, 55, 86, 88, 100, 101, 103, 144, 146, 174]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 123 ms to find 13 implicit places.
// Phase 1: matrix 196 rows 187 cols
[2021-05-14 08:17:10] [INFO ] Computed 21 place invariants in 0 ms
[2021-05-14 08:17:10] [INFO ] Dead Transitions using invariants and state equation in 95 ms returned []
Starting structural reductions, iteration 1 : 187/200 places, 196/196 transitions.
Applied a total of 0 rules in 6 ms. Remains 187 /187 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 187 cols
[2021-05-14 08:17:10] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-14 08:17:10] [INFO ] Dead Transitions using invariants and state equation in 87 ms returned []
Finished structural reductions, in 2 iterations. Remains : 187/200 places, 196/196 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-4-06 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(OR (NEQ s50 1) (NEQ s57 1)), p0:(AND (EQ s79 1) (EQ s80 1) (EQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 21 reset in 149 ms.
Stack based approach found an accepted trace after 240 steps with 0 reset with depth 241 and stack size 241 in 1 ms.
FORMULA ParamProductionCell-PT-4-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-4-06 finished in 584 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 200 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 200/200 places, 196/196 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 200 transition count 167
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 171 transition count 167
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 58 place count 171 transition count 155
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 82 place count 159 transition count 155
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 116 place count 142 transition count 138
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 118 place count 141 transition count 137
Applied a total of 118 rules in 16 ms. Remains 141 /200 variables (removed 59) and now considering 137/196 (removed 59) transitions.
// Phase 1: matrix 137 rows 141 cols
[2021-05-14 08:17:11] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-14 08:17:11] [INFO ] Implicit Places using invariants in 90 ms returned [11, 22, 23, 26, 37, 55, 56, 58, 70, 71, 73, 105, 106, 129]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 100 ms to find 14 implicit places.
[2021-05-14 08:17:11] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 137 rows 127 cols
[2021-05-14 08:17:11] [INFO ] Computed 20 place invariants in 0 ms
[2021-05-14 08:17:11] [INFO ] Dead Transitions using invariants and state equation in 82 ms returned []
Starting structural reductions, iteration 1 : 127/200 places, 137/196 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 127 transition count 134
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 124 transition count 134
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 6 place count 124 transition count 129
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 16 place count 119 transition count 129
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 117 transition count 127
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 117 transition count 127
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 80 place count 87 transition count 97
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 82 place count 86 transition count 96
Applied a total of 82 rules in 12 ms. Remains 86 /127 variables (removed 41) and now considering 96/137 (removed 41) transitions.
// Phase 1: matrix 96 rows 86 cols
[2021-05-14 08:17:11] [INFO ] Computed 20 place invariants in 0 ms
[2021-05-14 08:17:11] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 96 rows 86 cols
[2021-05-14 08:17:11] [INFO ] Computed 20 place invariants in 0 ms
[2021-05-14 08:17:11] [INFO ] State equation strengthened by 66 read => feed constraints.
[2021-05-14 08:17:11] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 86/200 places, 96/196 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-4-07 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:(EQ s35 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1796 reset in 120 ms.
Product exploration explored 100000 steps with 1782 reset in 138 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1786 reset in 120 ms.
Product exploration explored 100000 steps with 1810 reset in 132 ms.
[2021-05-14 08:17:12] [INFO ] Flatten gal took : 5 ms
[2021-05-14 08:17:12] [INFO ] Flatten gal took : 5 ms
[2021-05-14 08:17:12] [INFO ] Time to serialize gal into /tmp/LTL6654321397318312069.gal : 1 ms
[2021-05-14 08:17:12] [INFO ] Time to serialize properties into /tmp/LTL13473878175503948001.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/LTL6654321397318312069.gal, -t, CGAL, -LTL, /tmp/LTL13473878175503948001.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/LTL6654321397318312069.gal -t CGAL -LTL /tmp/LTL13473878175503948001.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(arm2_having_swivel_2==1)"))))
Formula 0 simplified : !GF"(arm2_having_swivel_2==1)"
Reverse transition relation is NOT exact ! Due to transitions t65, t166.t186, t51.t167.t181, t36.t37.t42, t24.t19.t48.t49.t54, t21.t20.t26, t33.t32.t30, t72.t71.t85, t76.t71.t85, t79.t71.t85, t95.t94.t107, t98.t94.t107, t101.t94.t107, t110.t109.t66.t2.t14.t62, t125.t124.t137, t128.t124.t137, t131.t124.t137, t140.t139.t119.t115.t18.t22, t147.t146.t160, t150.t146.t160, t154.t146.t160, t163.t162.t117.t118.t0.t10, t172.t171.t177, t193.t192.t190, t57.t56.t50.t16.t34, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/71/25/96
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
577 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,5.7978,187944,1,0,500,947368,222,100,2829,663171,1015
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ParamProductionCell-PT-4-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ParamProductionCell-PT-4-07 finished in 7722 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p1)||F((X((p1 U p3))||p2))||p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 200 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 200/200 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 200 /200 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 200 cols
[2021-05-14 08:17:18] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-14 08:17:18] [INFO ] Implicit Places using invariants in 93 ms returned [16, 34, 35, 39, 55, 85, 86, 88, 100, 101, 144, 146]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 94 ms to find 12 implicit places.
// Phase 1: matrix 196 rows 188 cols
[2021-05-14 08:17:18] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-14 08:17:19] [INFO ] Dead Transitions using invariants and state equation in 86 ms returned []
Starting structural reductions, iteration 1 : 188/200 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 5 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2021-05-14 08:17:19] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-14 08:17:19] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 194 rows 186 cols
[2021-05-14 08:17:19] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-14 08:17:19] [INFO ] State equation strengthened by 68 read => feed constraints.
[2021-05-14 08:17:19] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 186/200 places, 194/196 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-4-08 automaton TGBA [mat=[[{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(OR (EQ s92 0) (EQ s113 0)), p3:(AND (EQ s160 1) (EQ s168 1) (OR (EQ s92 0) (EQ s113 0))), p0:(OR (EQ s160 0) (EQ s168 0)), p1:(AND (EQ s160 1) (EQ s168 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 250 ms.
Product exploration explored 100000 steps with 50000 reset in 258 ms.
Knowledge obtained : [p2, (NOT p3), p0, (NOT p1)]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 240 ms.
Product exploration explored 100000 steps with 50000 reset in 251 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p1))]
Support contains 4 out of 186 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 186/186 places, 194/194 transitions.
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 186 transition count 194
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 37 place count 186 transition count 196
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 51 place count 186 transition count 196
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 61 place count 176 transition count 185
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 71 place count 176 transition count 185
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 107 place count 176 transition count 185
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 126 place count 157 transition count 166
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 145 place count 157 transition count 166
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 147 place count 157 transition count 166
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 149 place count 155 transition count 164
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 151 place count 155 transition count 164
Deduced a syphon composed of 58 places in 1 ms
Applied a total of 151 rules in 31 ms. Remains 155 /186 variables (removed 31) and now considering 164/194 (removed 30) transitions.
[2021-05-14 08:17:20] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 164 rows 155 cols
[2021-05-14 08:17:20] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-14 08:17:20] [INFO ] Dead Transitions using invariants and state equation in 81 ms returned []
Finished structural reductions, in 1 iterations. Remains : 155/186 places, 164/194 transitions.
Product exploration explored 100000 steps with 50000 reset in 270 ms.
Product exploration explored 100000 steps with 50000 reset in 293 ms.
[2021-05-14 08:17:21] [INFO ] Flatten gal took : 8 ms
[2021-05-14 08:17:21] [INFO ] Flatten gal took : 8 ms
[2021-05-14 08:17:21] [INFO ] Time to serialize gal into /tmp/LTL10387514614920082721.gal : 1 ms
[2021-05-14 08:17:21] [INFO ] Time to serialize properties into /tmp/LTL7993332738768549284.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/LTL10387514614920082721.gal, -t, CGAL, -LTL, /tmp/LTL7993332738768549284.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/LTL10387514614920082721.gal -t CGAL -LTL /tmp/LTL7993332738768549284.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((("((crane_lift==0)||(CU_lift_rs==0))")||(G("((crane_lift==1)&&(CU_lift_rs==1))")))||(F(("((arm2_backward==0)||(A2L_ret_rs==0))")||(X(("((crane_lift==1)&&(CU_lift_rs==1))")U("(((crane_lift==1)&&(CU_lift_rs==1))&&((arm2_backward==0)||(A2L_ret_rs==0)))"))))))))
Formula 0 simplified : !X("((crane_lift==0)||(CU_lift_rs==0))" | G"((crane_lift==1)&&(CU_lift_rs==1))" | F("((arm2_backward==0)||(A2L_ret_rs==0))" | X("((crane_lift==1)&&(CU_lift_rs==1))" U "(((crane_lift==1)&&(CU_lift_rs==1))&&((arm2_backward==0)||(A2L_ret_rs==0)))")))
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t14, t22, t26, t30, t34, t42, t46, t54, t58, t62, t65, t72, t73, t76, t77, t79, t80, t85, t89, t95, t96, t98, t99, t102, t107, t111, t115, t118, t125, t126, t128, t129, t131, t132, t137, t141, t148, t150, t151, t154, t155, t160, t164, t173, t177, t181, t186, t190, t194, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/143/51/194
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
745 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,7.4646,231948,1,0,341,997957,421,197,5336,652438,401
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ParamProductionCell-PT-4-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ParamProductionCell-PT-4-08 finished in 10899 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0&&X(X(X(X(G((p1||G(p2))))))))))], workingDir=/home/mcc/execution]
Support contains 8 out of 200 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 200/200 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 200 /200 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 200 cols
[2021-05-14 08:17:29] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-14 08:17:29] [INFO ] Implicit Places using invariants in 90 ms returned [16, 34, 35, 39, 86, 88, 100, 101, 103, 144, 146, 174]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 99 ms to find 12 implicit places.
// Phase 1: matrix 196 rows 188 cols
[2021-05-14 08:17:29] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-14 08:17:29] [INFO ] Dead Transitions using invariants and state equation in 89 ms returned []
Starting structural reductions, iteration 1 : 188/200 places, 196/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 188 /188 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 188 cols
[2021-05-14 08:17:29] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-14 08:17:30] [INFO ] Dead Transitions using invariants and state equation in 86 ms returned []
Finished structural reductions, in 2 iterations. Remains : 188/200 places, 196/196 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true]
Running random walk in product with property : ParamProductionCell-PT-4-13 automaton TGBA [mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=0 dest: 6}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=1 dest: 6}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=p0, acceptance={} source=4 dest: 5}, { cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=p0, acceptance={} source=5 dest: 3}, { cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=4, aps=[p0:(OR (NEQ s14 1) (NEQ s118 1)), p1:(AND (OR (NEQ s50 1) (NEQ s51 1) (NEQ s56 1)) (OR (NEQ s81 1) (NEQ s86 1) (NEQ s91 1))), p2:(OR (NEQ s81 1) (NEQ s86 1) (NEQ s91 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 32 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-4-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-4-13 finished in 493 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 200 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 200/200 places, 196/196 transitions.
Applied a total of 0 rules in 1 ms. Remains 200 /200 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 200 cols
[2021-05-14 08:17:30] [INFO ] Computed 34 place invariants in 1 ms
[2021-05-14 08:17:30] [INFO ] Implicit Places using invariants in 105 ms returned [16, 34, 35, 39, 55, 85, 88, 100, 101, 103, 144, 146, 174]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 106 ms to find 13 implicit places.
// Phase 1: matrix 196 rows 187 cols
[2021-05-14 08:17:30] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-14 08:17:30] [INFO ] Dead Transitions using invariants and state equation in 86 ms returned []
Starting structural reductions, iteration 1 : 187/200 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 3 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2021-05-14 08:17:30] [INFO ] Computed 21 place invariants in 0 ms
[2021-05-14 08:17:30] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 194 rows 185 cols
[2021-05-14 08:17:30] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-14 08:17:30] [INFO ] State equation strengthened by 68 read => feed constraints.
[2021-05-14 08:17:30] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 185/200 places, 194/196 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-4-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s80 1) (EQ s124 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 426 reset in 129 ms.
Stack based approach found an accepted trace after 900 steps with 2 reset with depth 215 and stack size 215 in 2 ms.
FORMULA ParamProductionCell-PT-4-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-4-14 finished in 698 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 5 out of 200 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 200/200 places, 196/196 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 200 transition count 167
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 171 transition count 167
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 58 place count 171 transition count 155
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 82 place count 159 transition count 155
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 118 place count 141 transition count 137
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 120 place count 140 transition count 136
Applied a total of 120 rules in 11 ms. Remains 140 /200 variables (removed 60) and now considering 136/196 (removed 60) transitions.
// Phase 1: matrix 136 rows 140 cols
[2021-05-14 08:17:30] [INFO ] Computed 34 place invariants in 0 ms
[2021-05-14 08:17:31] [INFO ] Implicit Places using invariants in 88 ms returned [11, 22, 23, 26, 37, 53, 54, 56, 69, 71, 103, 104, 128]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 89 ms to find 13 implicit places.
[2021-05-14 08:17:31] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 136 rows 127 cols
[2021-05-14 08:17:31] [INFO ] Computed 21 place invariants in 1 ms
[2021-05-14 08:17:31] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Starting structural reductions, iteration 1 : 127/200 places, 136/196 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 127 transition count 134
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 125 transition count 134
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 4 place count 125 transition count 128
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 16 place count 119 transition count 128
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 117 transition count 126
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 117 transition count 126
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 72 place count 91 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 90 transition count 99
Applied a total of 74 rules in 8 ms. Remains 90 /127 variables (removed 37) and now considering 99/136 (removed 37) transitions.
// Phase 1: matrix 99 rows 90 cols
[2021-05-14 08:17:31] [INFO ] Computed 21 place invariants in 0 ms
[2021-05-14 08:17:31] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 99 rows 90 cols
[2021-05-14 08:17:31] [INFO ] Computed 21 place invariants in 0 ms
[2021-05-14 08:17:31] [INFO ] State equation strengthened by 66 read => feed constraints.
[2021-05-14 08:17:31] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 90/200 places, 99/196 transitions.
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-4-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s45 1) (EQ s46 1) (EQ s48 1)), p1:(AND (EQ s74 1) (EQ s75 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1661 reset in 125 ms.
Product exploration explored 100000 steps with 1641 reset in 137 ms.
Knowledge obtained : [(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1630 reset in 122 ms.
Product exploration explored 100000 steps with 1642 reset in 136 ms.
[2021-05-14 08:17:31] [INFO ] Flatten gal took : 5 ms
[2021-05-14 08:17:31] [INFO ] Flatten gal took : 5 ms
[2021-05-14 08:17:31] [INFO ] Time to serialize gal into /tmp/LTL18176102311167358547.gal : 1 ms
[2021-05-14 08:17:31] [INFO ] Time to serialize properties into /tmp/LTL15210043543165025820.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/LTL18176102311167358547.gal, -t, CGAL, -LTL, /tmp/LTL15210043543165025820.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/LTL18176102311167358547.gal -t CGAL -LTL /tmp/LTL15210043543165025820.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((F("(((arm2_retract_ext==1)&&(arm2_forward==1))&&(A2U_ext_run==1))"))&&(F("((arm1_release_ext==1)&&(A1U_ext_run==1))")))))
Formula 0 simplified : !G(F"(((arm2_retract_ext==1)&&(arm2_forward==1))&&(A2U_ext_run==1))" & F"((arm1_release_ext==1)&&(A1U_ext_run==1))")
Reverse transition relation is NOT exact ! Due to transitions t72, t76, t79, t95, t98, t150, t154, t166.t186, t51.t167.t181, t36.t37.t42, t83.t82.t89, t105.t104.t111, t24.t19.t48.t49.t54, t71.t85, t94.t107, t146.t160, t21.t20.t26, t33.t32.t30, t88.t87.t64.t65, t110.t109.t66.t2.t14.t62, t125.t124.t137, t128.t124.t137, t131.t124.t137, t140.t139.t119.t115.t18.t22, t163.t162.t117.t118.t0.t10, t172.t171.t177, t193.t192.t190, t57.t56.t50.t16.t34, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/71/28/99
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
402 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,4.0355,143428,1,0,800,774452,237,104,2986,494314,1755
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ParamProductionCell-PT-4-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ParamProductionCell-PT-4-15 finished in 5743 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10717917413357949046
[2021-05-14 08:17:36] [INFO ] Computing symmetric may disable matrix : 196 transitions.
[2021-05-14 08:17:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 08:17:36] [INFO ] Computing symmetric may enable matrix : 196 transitions.
[2021-05-14 08:17:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 08:17:36] [INFO ] Applying decomposition
[2021-05-14 08:17:36] [INFO ] Flatten gal took : 8 ms
[2021-05-14 08:17:36] [INFO ] Computing Do-Not-Accords matrix : 196 transitions.
[2021-05-14 08:17:36] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 08:17:36] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10717917413357949046
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/ltsmin10717917413357949046]
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/graph5514358208546585882.txt, -o, /tmp/graph5514358208546585882.bin, -w, /tmp/graph5514358208546585882.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/graph5514358208546585882.bin, -l, -1, -v, -w, /tmp/graph5514358208546585882.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 08:17:36] [INFO ] Decomposing Gal with order
[2021-05-14 08:17:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 08:17:36] [INFO ] Removed a total of 63 redundant transitions.
[2021-05-14 08:17:36] [INFO ] Flatten gal took : 44 ms
[2021-05-14 08:17:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-14 08:17:36] [INFO ] Time to serialize gal into /tmp/LTLFireability18181232259365689107.gal : 11 ms
[2021-05-14 08:17:36] [INFO ] Time to serialize properties into /tmp/LTLFireability501623976727762732.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/LTLFireability18181232259365689107.gal, -t, CGAL, -LTL, /tmp/LTLFireability501623976727762732.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/LTLFireability18181232259365689107.gal -t CGAL -LTL /tmp/LTLFireability501623976727762732.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F((X(!("((i9.i0.u61.crane_above_deposit_belt==0)||(i9.i0.u60.CU_trans_run==0))")))U((((!("((i6.u33.arm2_release_angle==1)&&(i6.u53.A1U_in==1))"))||(F(!("(((i9.i1.u58.crane_release_height==1)&&(i9.i1.u58.crane_lift==1))&&(i9.i1.u63.CU_lift_run==1))"))))&&(X(!("((i9.i0.u61.crane_above_deposit_belt==0)||(i9.i0.u60.CU_trans_run==0))"))))||(G(X(!("((i9.i0.u61.crane_above_deposit_belt==0)||(i9.i0.u60.CU_trans_run==0))")))))))))
Formula 0 simplified : !GF(X!"((i9.i0.u61.crane_above_deposit_belt==0)||(i9.i0.u60.CU_trans_run==0))" U ((X!"((i9.i0.u61.crane_above_deposit_belt==0)||(i9.i0.u60.CU_trans_run==0))" & (!"((i6.u33.arm2_release_angle==1)&&(i6.u53.A1U_in==1))" | F!"(((i9.i1.u58.crane_release_height==1)&&(i9.i1.u58.crane_lift==1))&&(i9.i1.u63.CU_lift_run==1))")) | GX!"((i9.i0.u61.crane_above_deposit_belt==0)||(i9.i0.u60.CU_trans_run==0))"))
Reverse transition relation is NOT exact ! Due to transitions arm2_unlock_swivel_2, A2U_ext_Pstart, A1U_rot3_Pstop, i0.PU_lower_Pstart, i0.u9.forge_Pstart, i1.TU_lift_Pstart, i1.TL_lower_Pstart, i2.TU_rot_Pstart, i2.TL_rot_Pstart, i3.DB_deliver_Pstart, i3.DB_trans_Pstart, i4.u27.FB_deliver_Pstart, i4.u29.FB_trans_Pstart, i5.arm1_unlock_swivel_1, i5.i0.arm2_unlock_swivel_1, i5.i0.arm1_unlock_swivel_2, i5.i1.u11.PL_lower_Pstart, i6.A1U_rot3_Pstart, i6.A1U_rot2_Pstart, i6.A1U_rot1_Pstart, i6.A1L_rot3_Pstart, i6.A1L_rot2_Pstart, i6.A1L_rot1_Pstart, i6.A2L_rot3_Pstart, i6.A2L_rot2_Pstart, i6.A2L_rot1_Pstart, i6.A2U_rot3_Pstart, i6.A2U_rot2_Pstart, i6.A2U_rot2_Pstop, i6.A2U_rot1_Pstart, i6.A2U_rot1_Pstop, i6.u33.A2U_rot1_Cstop, i6.u33.A2U_rot3_Cstop, i6.u34.A1L_rot1_Cstop, i6.u34.A1L_rot2_Cstop, i6.u34.A1L_rot3_Cstop, i6.u36.A1U_rot2_Cstop, i6.u43.A2L_rot1_Cstop, i6.u43.A2L_rot2_Cstop, i7.A2L_ret_Pstart, i7.A2L_ext_Pstart, i7.A2U_ret_Pstart, i8.A1U_ret_Pstart, i8.A1U_ext_Pstart, i8.A1L_ret_Pstart, i8.u49.A1L_ext_Pstart, i9.i0.u60.CU_trans_Pstart, i9.i1.CU_lift_Pstart, i9.i1.CL_lift_Pstart, i9.i1.u64.CU_lower_Pstart, i9.i1.u66.CL_trans_Pstart, i9.i1.u68.CL_lower_Pstart, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/144/52/196
Compilation finished in 917 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin10717917413357949046]
Link finished in 38 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, [](<>(([]((LTLAPp0==true))||((LTLAPp1==true)&&X((LTLAPp0==true)))||(X((LTLAPp0==true))&&<>((LTLAPp2==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin10717917413357949046]
3125 unique states visited
0 strongly connected components in search stack
5585 transitions explored
390 items max in DFS search stack
2221 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,22.2414,492076,1,0,933017,799,3526,1.27859e+06,359,2931,1576769
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ParamProductionCell-PT-4-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
LTSmin run took 54320 ms.
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1620980313038

--------------------
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="ParamProductionCell-PT-4"
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 ParamProductionCell-PT-4, 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 r140-tall-162089127800397"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-4.tgz
mv ParamProductionCell-PT-4 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;