Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r150-smll-165276998600251.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ParamProductionCell-PT-0, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-smll-165276998600251
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 9.2K Apr 29 17:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 29 17:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 29 17:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 29 17:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K May 9 08:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 9 08:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 08:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 149K May 10 09:34 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-0-LTLCardinality-00
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-01
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-02
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-03
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-04
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-05
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-06
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-07
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-08
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-09
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-10
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-11
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-12
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-13
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-14
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653049332363

Running Version 202205111006
[2022-05-20 12:22:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 12:22:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 12:22:14] [INFO ] Load time of PNML (sax parser for PT used): 183 ms
[2022-05-20 12:22:14] [INFO ] Transformed 198 places.
[2022-05-20 12:22:14] [INFO ] Transformed 176 transitions.
[2022-05-20 12:22:14] [INFO ] Found NUPN structural information;
[2022-05-20 12:22:14] [INFO ] Parsed PT model containing 198 places and 176 transitions in 414 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ParamProductionCell-PT-0-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-0-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-0-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 176/176 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 192 transition count 170
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 192 transition count 170
Applied a total of 12 rules in 43 ms. Remains 192 /198 variables (removed 6) and now considering 170/176 (removed 6) transitions.
// Phase 1: matrix 170 rows 192 cols
[2022-05-20 12:22:15] [INFO ] Computed 49 place invariants in 19 ms
[2022-05-20 12:22:15] [INFO ] Implicit Places using invariants in 603 ms returned [15, 24, 31, 36, 41, 42, 46, 47, 59, 65, 73, 78, 79, 98, 99, 101, 113, 114, 116, 118, 119, 159, 160, 162, 164, 165]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 648 ms to find 26 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 166/198 places, 170/176 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 164 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 164 transition count 168
Applied a total of 4 rules in 28 ms. Remains 164 /166 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 164 cols
[2022-05-20 12:22:15] [INFO ] Computed 23 place invariants in 10 ms
[2022-05-20 12:22:15] [INFO ] Implicit Places using invariants in 228 ms returned []
// Phase 1: matrix 168 rows 164 cols
[2022-05-20 12:22:15] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-20 12:22:16] [INFO ] State equation strengthened by 59 read => feed constraints.
[2022-05-20 12:22:16] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 164/198 places, 168/176 transitions.
Finished structural reductions, in 2 iterations. Remains : 164/198 places, 168/176 transitions.
Support contains 30 out of 164 places after structural reductions.
[2022-05-20 12:22:16] [INFO ] Flatten gal took : 65 ms
[2022-05-20 12:22:16] [INFO ] Flatten gal took : 33 ms
[2022-05-20 12:22:16] [INFO ] Input system was already deterministic with 168 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 601 ms. (steps per millisecond=16 ) properties (out of 21) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 168 rows 164 cols
[2022-05-20 12:22:17] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-20 12:22:17] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-20 12:22:17] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2022-05-20 12:22:17] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 16 ms returned sat
[2022-05-20 12:22:17] [INFO ] After 137ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA ParamProductionCell-PT-0-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ParamProductionCell-PT-0-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
FORMULA ParamProductionCell-PT-0-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(G((G(X(p0))||F(p0)))))||F(p0)))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 168/168 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 164 transition count 140
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 136 transition count 140
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 56 place count 136 transition count 131
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 74 place count 127 transition count 131
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 156 place count 85 transition count 91
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 156 place count 85 transition count 90
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 158 place count 84 transition count 90
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 160 place count 83 transition count 89
Applied a total of 160 rules in 79 ms. Remains 83 /164 variables (removed 81) and now considering 89/168 (removed 79) transitions.
// Phase 1: matrix 89 rows 83 cols
[2022-05-20 12:22:18] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-20 12:22:18] [INFO ] Implicit Places using invariants in 207 ms returned [0, 1, 11, 12, 13, 22, 34]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 211 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/164 places, 89/168 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 76 transition count 88
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 75 transition count 88
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 16 place count 68 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 67 transition count 80
Applied a total of 18 rules in 38 ms. Remains 67 /76 variables (removed 9) and now considering 80/89 (removed 9) transitions.
// Phase 1: matrix 80 rows 67 cols
[2022-05-20 12:22:18] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-20 12:22:18] [INFO ] Implicit Places using invariants in 115 ms returned []
// Phase 1: matrix 80 rows 67 cols
[2022-05-20 12:22:18] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-20 12:22:18] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-05-20 12:22:18] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 67/164 places, 80/168 transitions.
Finished structural reductions, in 2 iterations. Remains : 67/164 places, 80/168 transitions.
Stuttering acceptance computed with spot in 233 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s51 0) (EQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 212 reset in 595 ms.
Stack based approach found an accepted trace after 65 steps with 0 reset with depth 66 and stack size 66 in 1 ms.
FORMULA ParamProductionCell-PT-0-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-0-LTLCardinality-01 finished in 1617 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(!(p0 U p1))))))'
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 168/168 transitions.
Applied a total of 0 rules in 4 ms. Remains 164 /164 variables (removed 0) and now considering 168/168 (removed 0) transitions.
// Phase 1: matrix 168 rows 164 cols
[2022-05-20 12:22:19] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-20 12:22:19] [INFO ] Implicit Places using invariants in 130 ms returned [15, 18, 55]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 131 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/164 places, 168/168 transitions.
Applied a total of 0 rules in 3 ms. Remains 161 /161 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 161/164 places, 168/168 transitions.
Stuttering acceptance computed with spot in 262 ms :[p1, p1, p1, p1]
Running random walk in product with property : ParamProductionCell-PT-0-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s16 0) (EQ s30 1) (NEQ s42 1)), p1:(OR (EQ s16 0) (EQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 6247 reset in 226 ms.
Product exploration explored 100000 steps with 6259 reset in 278 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 221 ms :[p1, p1, p1, p1]
Finished random walk after 15 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 193 ms :[p1, p1, p1, p1]
Stuttering acceptance computed with spot in 173 ms :[p1, p1, p1, p1]
// Phase 1: matrix 168 rows 161 cols
[2022-05-20 12:22:21] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-20 12:22:21] [INFO ] [Real]Absence check using 20 positive place invariants in 16 ms returned sat
[2022-05-20 12:22:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:22:21] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2022-05-20 12:22:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:22:22] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2022-05-20 12:22:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:22:22] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2022-05-20 12:22:22] [INFO ] State equation strengthened by 59 read => feed constraints.
[2022-05-20 12:22:22] [INFO ] [Nat]Added 59 Read/Feed constraints in 23 ms returned sat
[2022-05-20 12:22:22] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 7 ms to minimize.
[2022-05-20 12:22:22] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 2 ms to minimize.
[2022-05-20 12:22:22] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2022-05-20 12:22:22] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 4 ms to minimize.
[2022-05-20 12:22:22] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 1 ms to minimize.
[2022-05-20 12:22:23] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2022-05-20 12:22:23] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 1 ms to minimize.
[2022-05-20 12:22:23] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
[2022-05-20 12:22:23] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 1 ms to minimize.
[2022-05-20 12:22:23] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 1 ms to minimize.
[2022-05-20 12:22:23] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2022-05-20 12:22:23] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 1 ms to minimize.
[2022-05-20 12:22:23] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2022-05-20 12:22:23] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 2 ms to minimize.
[2022-05-20 12:22:24] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 1 ms to minimize.
[2022-05-20 12:22:24] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 1 ms to minimize.
[2022-05-20 12:22:24] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 1 ms to minimize.
[2022-05-20 12:22:24] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2022-05-20 12:22:24] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2038 ms
[2022-05-20 12:22:24] [INFO ] Computed and/alt/rep : 167/276/167 causal constraints (skipped 0 transitions) in 25 ms.
[2022-05-20 12:22:25] [INFO ] Added : 151 causal constraints over 31 iterations in 768 ms. Result :sat
Could not prove EG p1
Support contains 3 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 168/168 transitions.
Applied a total of 0 rules in 6 ms. Remains 161 /161 variables (removed 0) and now considering 168/168 (removed 0) transitions.
// Phase 1: matrix 168 rows 161 cols
[2022-05-20 12:22:25] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-20 12:22:25] [INFO ] Implicit Places using invariants in 142 ms returned []
// Phase 1: matrix 168 rows 161 cols
[2022-05-20 12:22:25] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 12:22:25] [INFO ] State equation strengthened by 59 read => feed constraints.
[2022-05-20 12:22:25] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
// Phase 1: matrix 168 rows 161 cols
[2022-05-20 12:22:25] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 12:22:25] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 161/161 places, 168/168 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 183 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 168 ms :[p1, p1, p1, p1]
Finished random walk after 16 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 152 ms :[p1, p1, p1, p1]
Stuttering acceptance computed with spot in 156 ms :[p1, p1, p1, p1]
// Phase 1: matrix 168 rows 161 cols
[2022-05-20 12:22:26] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-20 12:22:26] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned sat
[2022-05-20 12:22:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:22:27] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2022-05-20 12:22:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:22:27] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2022-05-20 12:22:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:22:27] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2022-05-20 12:22:27] [INFO ] State equation strengthened by 59 read => feed constraints.
[2022-05-20 12:22:27] [INFO ] [Nat]Added 59 Read/Feed constraints in 22 ms returned sat
[2022-05-20 12:22:27] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2022-05-20 12:22:27] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 1 ms to minimize.
[2022-05-20 12:22:27] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2022-05-20 12:22:27] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2022-05-20 12:22:27] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2022-05-20 12:22:27] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 0 ms to minimize.
[2022-05-20 12:22:28] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2022-05-20 12:22:28] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2022-05-20 12:22:28] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 0 ms to minimize.
[2022-05-20 12:22:28] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2022-05-20 12:22:28] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2022-05-20 12:22:28] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2022-05-20 12:22:28] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 0 ms to minimize.
[2022-05-20 12:22:28] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 0 ms to minimize.
[2022-05-20 12:22:28] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2022-05-20 12:22:28] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2022-05-20 12:22:28] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 8 ms to minimize.
[2022-05-20 12:22:29] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2022-05-20 12:22:29] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1571 ms
[2022-05-20 12:22:29] [INFO ] Computed and/alt/rep : 167/276/167 causal constraints (skipped 0 transitions) in 14 ms.
[2022-05-20 12:22:29] [INFO ] Added : 151 causal constraints over 31 iterations in 626 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 155 ms :[p1, p1, p1, p1]
Product exploration explored 100000 steps with 6253 reset in 198 ms.
Product exploration explored 100000 steps with 6254 reset in 545 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 298 ms :[p1, p1, p1, p1]
Support contains 3 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 168/168 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 161 transition count 168
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 22 place count 161 transition count 168
Deduced a syphon composed of 35 places in 1 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 35 place count 161 transition count 168
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 156 transition count 163
Deduced a syphon composed of 30 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 156 transition count 163
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 85 place count 156 transition count 163
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 104 place count 137 transition count 144
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 123 place count 137 transition count 144
Deduced a syphon composed of 51 places in 0 ms
Applied a total of 123 rules in 45 ms. Remains 137 /161 variables (removed 24) and now considering 144/168 (removed 24) transitions.
[2022-05-20 12:22:31] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 144 rows 137 cols
[2022-05-20 12:22:31] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-20 12:22:31] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 137/161 places, 144/168 transitions.
Finished structural reductions, in 1 iterations. Remains : 137/161 places, 144/168 transitions.
Product exploration explored 100000 steps with 9305 reset in 649 ms.
Product exploration explored 100000 steps with 9310 reset in 596 ms.
Built C files in :
/tmp/ltsmin5794328807832170943
[2022-05-20 12:22:32] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5794328807832170943
Running compilation step : cd /tmp/ltsmin5794328807832170943;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 594 ms.
Running link step : cd /tmp/ltsmin5794328807832170943;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin5794328807832170943;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16913414542467293941.hoa' '--buchi-type=spotba'
LTSmin run took 109 ms.
FORMULA ParamProductionCell-PT-0-LTLCardinality-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-0-LTLCardinality-02 finished in 13639 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p1))&&p0)))'
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 168/168 transitions.
Applied a total of 0 rules in 5 ms. Remains 164 /164 variables (removed 0) and now considering 168/168 (removed 0) transitions.
// Phase 1: matrix 168 rows 164 cols
[2022-05-20 12:22:33] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-20 12:22:33] [INFO ] Implicit Places using invariants in 189 ms returned [15, 17, 18, 32, 55]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 191 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 159/164 places, 168/168 transitions.
Applied a total of 0 rules in 4 ms. Remains 159 /159 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 159/164 places, 168/168 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s80 0) (EQ s121 1)), p1:(EQ s64 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-0-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-0-LTLCardinality-03 finished in 436 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(X(X(X(p0))))) U G(p0)))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 168/168 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 164 transition count 142
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 138 transition count 142
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 52 place count 138 transition count 131
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 74 place count 127 transition count 131
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 154 place count 86 transition count 92
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 154 place count 86 transition count 91
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 156 place count 85 transition count 91
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 158 place count 84 transition count 90
Applied a total of 158 rules in 30 ms. Remains 84 /164 variables (removed 80) and now considering 90/168 (removed 78) transitions.
// Phase 1: matrix 90 rows 84 cols
[2022-05-20 12:22:33] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 12:22:34] [INFO ] Implicit Places using invariants in 151 ms returned [0, 1, 11, 12, 13, 22, 35]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 153 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/164 places, 90/168 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 77 transition count 89
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 76 transition count 89
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 16 place count 69 transition count 82
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 0 with 2 rules applied. Total rules applied 18 place count 68 transition count 81
Applied a total of 18 rules in 17 ms. Remains 68 /77 variables (removed 9) and now considering 81/90 (removed 9) transitions.
// Phase 1: matrix 81 rows 68 cols
[2022-05-20 12:22:34] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-20 12:22:34] [INFO ] Implicit Places using invariants in 109 ms returned []
// Phase 1: matrix 81 rows 68 cols
[2022-05-20 12:22:34] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-20 12:22:34] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-05-20 12:22:34] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 68/164 places, 81/168 transitions.
Finished structural reductions, in 2 iterations. Remains : 68/164 places, 81/168 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s30 0) (EQ s17 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 211 ms.
Stack based approach found an accepted trace after 65 steps with 0 reset with depth 66 and stack size 66 in 1 ms.
FORMULA ParamProductionCell-PT-0-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-0-LTLCardinality-04 finished in 827 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 168/168 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 164 transition count 141
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 137 transition count 141
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 54 place count 137 transition count 132
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 72 place count 128 transition count 132
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 158 place count 84 transition count 90
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 158 place count 84 transition count 89
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 160 place count 83 transition count 89
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 162 place count 82 transition count 88
Applied a total of 162 rules in 29 ms. Remains 82 /164 variables (removed 82) and now considering 88/168 (removed 80) transitions.
// Phase 1: matrix 88 rows 82 cols
[2022-05-20 12:22:34] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 12:22:34] [INFO ] Implicit Places using invariants in 200 ms returned [0, 1, 11, 12, 13, 22, 35]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 202 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/164 places, 88/168 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 75 transition count 87
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 74 transition count 87
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 14 place count 68 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 67 transition count 80
Applied a total of 16 rules in 15 ms. Remains 67 /75 variables (removed 8) and now considering 80/88 (removed 8) transitions.
// Phase 1: matrix 80 rows 67 cols
[2022-05-20 12:22:34] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-20 12:22:35] [INFO ] Implicit Places using invariants in 141 ms returned []
// Phase 1: matrix 80 rows 67 cols
[2022-05-20 12:22:35] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-20 12:22:35] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-05-20 12:22:35] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 67/164 places, 80/168 transitions.
Finished structural reductions, in 2 iterations. Remains : 67/164 places, 80/168 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s13 0) (EQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 16666 reset in 186 ms.
Product exploration explored 100000 steps with 16666 reset in 227 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 265 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
// Phase 1: matrix 80 rows 67 cols
[2022-05-20 12:22:36] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-20 12:22:36] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2022-05-20 12:22:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:22:36] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2022-05-20 12:22:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:22:36] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2022-05-20 12:22:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:22:36] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2022-05-20 12:22:36] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-05-20 12:22:36] [INFO ] [Nat]Added 58 Read/Feed constraints in 14 ms returned sat
[2022-05-20 12:22:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-20 12:22:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2022-05-20 12:22:36] [INFO ] Computed and/alt/rep : 79/195/79 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-20 12:22:36] [INFO ] Added : 3 causal constraints over 1 iterations in 37 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 80/80 transitions.
Applied a total of 0 rules in 4 ms. Remains 67 /67 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 67 cols
[2022-05-20 12:22:36] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-20 12:22:36] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 80 rows 67 cols
[2022-05-20 12:22:36] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-20 12:22:36] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-05-20 12:22:37] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2022-05-20 12:22:37] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 80 rows 67 cols
[2022-05-20 12:22:37] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-20 12:22:37] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 67/67 places, 80/80 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 151 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
// Phase 1: matrix 80 rows 67 cols
[2022-05-20 12:22:37] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-20 12:22:37] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2022-05-20 12:22:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:22:37] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2022-05-20 12:22:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:22:37] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2022-05-20 12:22:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:22:37] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2022-05-20 12:22:37] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-05-20 12:22:37] [INFO ] [Nat]Added 58 Read/Feed constraints in 14 ms returned sat
[2022-05-20 12:22:37] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-20 12:22:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2022-05-20 12:22:37] [INFO ] Computed and/alt/rep : 79/195/79 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-20 12:22:38] [INFO ] Added : 3 causal constraints over 1 iterations in 34 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 16666 reset in 175 ms.
Product exploration explored 100000 steps with 16666 reset in 213 ms.
Built C files in :
/tmp/ltsmin7888873235095556698
[2022-05-20 12:22:38] [INFO ] Computing symmetric may disable matrix : 80 transitions.
[2022-05-20 12:22:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:22:38] [INFO ] Computing symmetric may enable matrix : 80 transitions.
[2022-05-20 12:22:38] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:22:38] [INFO ] Computing Do-Not-Accords matrix : 80 transitions.
[2022-05-20 12:22:38] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:22:38] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7888873235095556698
Running compilation step : cd /tmp/ltsmin7888873235095556698;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 430 ms.
Running link step : cd /tmp/ltsmin7888873235095556698;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin7888873235095556698;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased658311126181010998.hoa' '--buchi-type=spotba'
LTSmin run took 546 ms.
FORMULA ParamProductionCell-PT-0-LTLCardinality-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-0-LTLCardinality-06 finished in 4816 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(p0)||p1)))))'
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 168/168 transitions.
Applied a total of 0 rules in 1 ms. Remains 164 /164 variables (removed 0) and now considering 168/168 (removed 0) transitions.
// Phase 1: matrix 168 rows 164 cols
[2022-05-20 12:22:39] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-20 12:22:39] [INFO ] Implicit Places using invariants in 117 ms returned [15, 17, 18, 32, 55]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 119 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 159/164 places, 168/168 transitions.
Applied a total of 0 rules in 2 ms. Remains 159 /159 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 159/164 places, 168/168 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-0-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p1:(AND (NEQ s74 0) (NEQ s108 1)), p0:(AND (NEQ s92 0) (NEQ s124 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 684 reset in 143 ms.
Product exploration explored 100000 steps with 685 reset in 211 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 131 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=32 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 168 rows 159 cols
[2022-05-20 12:22:40] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-20 12:22:40] [INFO ] [Real]Absence check using 18 positive place invariants in 13 ms returned sat
[2022-05-20 12:22:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:22:41] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2022-05-20 12:22:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:22:41] [INFO ] [Nat]Absence check using 18 positive place invariants in 14 ms returned sat
[2022-05-20 12:22:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:22:41] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2022-05-20 12:22:41] [INFO ] State equation strengthened by 59 read => feed constraints.
[2022-05-20 12:22:41] [INFO ] [Nat]Added 59 Read/Feed constraints in 14 ms returned sat
[2022-05-20 12:22:41] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2022-05-20 12:22:41] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2022-05-20 12:22:41] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 0 ms to minimize.
[2022-05-20 12:22:41] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2022-05-20 12:22:41] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 0 ms to minimize.
[2022-05-20 12:22:41] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 0 ms to minimize.
[2022-05-20 12:22:42] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2022-05-20 12:22:42] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 0 ms to minimize.
[2022-05-20 12:22:42] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2022-05-20 12:22:42] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 0 ms to minimize.
[2022-05-20 12:22:42] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 0 ms to minimize.
[2022-05-20 12:22:42] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2022-05-20 12:22:42] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 2 ms to minimize.
[2022-05-20 12:22:42] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2022-05-20 12:22:42] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 0 ms to minimize.
[2022-05-20 12:22:42] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 1 ms to minimize.
[2022-05-20 12:22:42] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2022-05-20 12:22:42] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2022-05-20 12:22:42] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1522 ms
[2022-05-20 12:22:43] [INFO ] Computed and/alt/rep : 167/276/167 causal constraints (skipped 0 transitions) in 19 ms.
[2022-05-20 12:22:43] [INFO ] Added : 133 causal constraints over 27 iterations in 743 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 168/168 transitions.
Applied a total of 0 rules in 3 ms. Remains 159 /159 variables (removed 0) and now considering 168/168 (removed 0) transitions.
// Phase 1: matrix 168 rows 159 cols
[2022-05-20 12:22:43] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-20 12:22:43] [INFO ] Implicit Places using invariants in 132 ms returned []
// Phase 1: matrix 168 rows 159 cols
[2022-05-20 12:22:43] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-20 12:22:44] [INFO ] State equation strengthened by 59 read => feed constraints.
[2022-05-20 12:22:44] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
// Phase 1: matrix 168 rows 159 cols
[2022-05-20 12:22:44] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-20 12:22:44] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 159/159 places, 168/168 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 109 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 168 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=84 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 168 rows 159 cols
[2022-05-20 12:22:45] [INFO ] Computed 18 place invariants in 0 ms
[2022-05-20 12:22:45] [INFO ] [Real]Absence check using 18 positive place invariants in 16 ms returned sat
[2022-05-20 12:22:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:22:45] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2022-05-20 12:22:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:22:45] [INFO ] [Nat]Absence check using 18 positive place invariants in 15 ms returned sat
[2022-05-20 12:22:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:22:46] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2022-05-20 12:22:46] [INFO ] State equation strengthened by 59 read => feed constraints.
[2022-05-20 12:22:46] [INFO ] [Nat]Added 59 Read/Feed constraints in 18 ms returned sat
[2022-05-20 12:22:46] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2022-05-20 12:22:46] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2022-05-20 12:22:46] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2022-05-20 12:22:46] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 0 ms to minimize.
[2022-05-20 12:22:46] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2022-05-20 12:22:46] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2022-05-20 12:22:46] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 0 ms to minimize.
[2022-05-20 12:22:46] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 0 ms to minimize.
[2022-05-20 12:22:46] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 0 ms to minimize.
[2022-05-20 12:22:46] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2022-05-20 12:22:46] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 2 ms to minimize.
[2022-05-20 12:22:47] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2022-05-20 12:22:47] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 5 ms to minimize.
[2022-05-20 12:22:47] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2022-05-20 12:22:47] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 1 ms to minimize.
[2022-05-20 12:22:47] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 1 ms to minimize.
[2022-05-20 12:22:47] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 1 ms to minimize.
[2022-05-20 12:22:47] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2022-05-20 12:22:47] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1639 ms
[2022-05-20 12:22:47] [INFO ] Computed and/alt/rep : 167/276/167 causal constraints (skipped 0 transitions) in 16 ms.
[2022-05-20 12:22:48] [INFO ] Added : 133 causal constraints over 27 iterations in 738 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 691 reset in 147 ms.
Product exploration explored 100000 steps with 686 reset in 142 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 168/168 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 159 transition count 168
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 28 place count 159 transition count 168
Deduced a syphon composed of 36 places in 1 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 159 transition count 168
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 155 transition count 164
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 155 transition count 164
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 74 places in 1 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 86 place count 155 transition count 164
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 109 place count 132 transition count 141
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 132 place count 132 transition count 141
Deduced a syphon composed of 51 places in 0 ms
Applied a total of 132 rules in 25 ms. Remains 132 /159 variables (removed 27) and now considering 141/168 (removed 27) transitions.
[2022-05-20 12:22:49] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 141 rows 132 cols
[2022-05-20 12:22:49] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-20 12:22:49] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/159 places, 141/168 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/159 places, 141/168 transitions.
Product exploration explored 100000 steps with 1397 reset in 259 ms.
Product exploration explored 100000 steps with 1404 reset in 298 ms.
Built C files in :
/tmp/ltsmin11529367437283587285
[2022-05-20 12:22:49] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11529367437283587285
Running compilation step : cd /tmp/ltsmin11529367437283587285;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 431 ms.
Running link step : cd /tmp/ltsmin11529367437283587285;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin11529367437283587285;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2748444776786383763.hoa' '--buchi-type=spotba'
LTSmin run took 4630 ms.
FORMULA ParamProductionCell-PT-0-LTLCardinality-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-0-LTLCardinality-07 finished in 15537 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 168/168 transitions.
Applied a total of 0 rules in 2 ms. Remains 164 /164 variables (removed 0) and now considering 168/168 (removed 0) transitions.
// Phase 1: matrix 168 rows 164 cols
[2022-05-20 12:22:55] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-20 12:22:55] [INFO ] Implicit Places using invariants in 99 ms returned [15, 17, 18, 32]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 100 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/164 places, 168/168 transitions.
Applied a total of 0 rules in 2 ms. Remains 160 /160 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 160/164 places, 168/168 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-0-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s154 0) (EQ s54 1)), p0:(OR (EQ s51 0) (EQ s63 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 94 steps with 0 reset in 1 ms.
FORMULA ParamProductionCell-PT-0-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-0-LTLCardinality-08 finished in 241 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 168/168 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 164 transition count 141
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 137 transition count 141
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 54 place count 137 transition count 131
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 74 place count 127 transition count 131
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 158 place count 84 transition count 90
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 158 place count 84 transition count 89
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 160 place count 83 transition count 89
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 162 place count 82 transition count 88
Applied a total of 162 rules in 14 ms. Remains 82 /164 variables (removed 82) and now considering 88/168 (removed 80) transitions.
// Phase 1: matrix 88 rows 82 cols
[2022-05-20 12:22:55] [INFO ] Computed 21 place invariants in 0 ms
[2022-05-20 12:22:55] [INFO ] Implicit Places using invariants in 115 ms returned [0, 1, 11, 12, 22, 35]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 116 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/164 places, 88/168 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 70 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 69 transition count 81
Applied a total of 14 rules in 7 ms. Remains 69 /76 variables (removed 7) and now considering 81/88 (removed 7) transitions.
// Phase 1: matrix 81 rows 69 cols
[2022-05-20 12:22:55] [INFO ] Computed 15 place invariants in 0 ms
[2022-05-20 12:22:55] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 81 rows 69 cols
[2022-05-20 12:22:55] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-20 12:22:55] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-05-20 12:22:55] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 69/164 places, 81/168 transitions.
Finished structural reductions, in 2 iterations. Remains : 69/164 places, 81/168 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s4 0) (NEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2386 reset in 177 ms.
Stack based approach found an accepted trace after 1633 steps with 38 reset with depth 94 and stack size 94 in 4 ms.
FORMULA ParamProductionCell-PT-0-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-0-LTLCardinality-09 finished in 608 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(!X(G(p0)) U p1)))'
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 168/168 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 164 transition count 141
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 137 transition count 141
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 54 place count 137 transition count 133
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 70 place count 129 transition count 133
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 154 place count 86 transition count 92
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 154 place count 86 transition count 91
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 156 place count 85 transition count 91
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 158 place count 84 transition count 90
Applied a total of 158 rules in 15 ms. Remains 84 /164 variables (removed 80) and now considering 90/168 (removed 78) transitions.
// Phase 1: matrix 90 rows 84 cols
[2022-05-20 12:22:55] [INFO ] Computed 21 place invariants in 0 ms
[2022-05-20 12:22:56] [INFO ] Implicit Places using invariants in 144 ms returned [0, 1, 11, 12, 13, 22, 34]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 146 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/164 places, 90/168 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 77 transition count 89
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 76 transition count 89
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 14 place count 70 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 69 transition count 82
Applied a total of 16 rules in 7 ms. Remains 69 /77 variables (removed 8) and now considering 82/90 (removed 8) transitions.
// Phase 1: matrix 82 rows 69 cols
[2022-05-20 12:22:56] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-20 12:22:56] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 82 rows 69 cols
[2022-05-20 12:22:56] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-20 12:22:56] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-05-20 12:22:56] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 69/164 places, 82/168 transitions.
Finished structural reductions, in 2 iterations. Remains : 69/164 places, 82/168 transitions.
Stuttering acceptance computed with spot in 178 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-0-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0, 1} source=0 dest: 0}, { cond=(NOT p1), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={1} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s34 0) (EQ s21 1)), p0:(OR (EQ s54 0) (EQ s30 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 159 ms.
Stack based approach found an accepted trace after 391 steps with 0 reset with depth 392 and stack size 327 in 1 ms.
FORMULA ParamProductionCell-PT-0-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-0-LTLCardinality-12 finished in 793 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||p1)))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 168/168 transitions.
Applied a total of 0 rules in 2 ms. Remains 164 /164 variables (removed 0) and now considering 168/168 (removed 0) transitions.
// Phase 1: matrix 168 rows 164 cols
[2022-05-20 12:22:56] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-20 12:22:56] [INFO ] Implicit Places using invariants in 121 ms returned [15, 17, 18, 32, 55]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 127 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 159/164 places, 168/168 transitions.
Applied a total of 0 rules in 3 ms. Remains 159 /159 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 159/164 places, 168/168 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s69 0), p0:(EQ s28 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 63568 steps with 0 reset in 82 ms.
FORMULA ParamProductionCell-PT-0-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-0-LTLCardinality-15 finished in 347 ms.
All properties solved by simple procedures.
Total runtime 42696 ms.

BK_STOP 1653049377177

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ParamProductionCell-PT-0"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ParamProductionCell-PT-0, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r150-smll-165276998600251"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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