Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K Apr 12 20:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 46K Apr 12 20:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 20:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 20:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 174K May 18 16:43 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-3-LTLCardinality-00
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-01
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-02
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-03
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-04
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-05
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-06
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-07
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-08
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-09
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-10
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-11
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-12
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-13
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-14
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716653357219

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-3
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-25 16:09:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 16:09:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 16:09:19] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2024-05-25 16:09:19] [INFO ] Transformed 231 places.
[2024-05-25 16:09:19] [INFO ] Transformed 202 transitions.
[2024-05-25 16:09:19] [INFO ] Found NUPN structural information;
[2024-05-25 16:09:19] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 302 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 123 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ParamProductionCell-PT-3-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 226 transition count 197
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 226 transition count 197
Applied a total of 10 rules in 90 ms. Remains 226 /231 variables (removed 5) and now considering 197/202 (removed 5) transitions.
// Phase 1: matrix 197 rows 226 cols
[2024-05-25 16:09:19] [INFO ] Computed 59 invariants in 39 ms
[2024-05-25 16:09:20] [INFO ] Implicit Places using invariants in 795 ms returned [15, 16, 18, 19, 24, 31, 35, 36, 41, 42, 46, 47, 59, 64, 65, 73, 78, 79, 98, 99, 101, 113, 114, 116, 118, 119, 160, 161, 163, 166, 191, 192, 195, 196, 201, 202, 206, 217]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 846 ms to find 38 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/231 places, 197/202 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 195
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 195
Applied a total of 4 rules in 23 ms. Remains 186 /188 variables (removed 2) and now considering 195/197 (removed 2) transitions.
// Phase 1: matrix 195 rows 186 cols
[2024-05-25 16:09:20] [INFO ] Computed 21 invariants in 3 ms
[2024-05-25 16:09:20] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-25 16:09:20] [INFO ] Invariant cache hit.
[2024-05-25 16:09:21] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 16:09:21] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 559 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/231 places, 195/202 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1553 ms. Remains : 186/231 places, 195/202 transitions.
Support contains 21 out of 186 places after structural reductions.
[2024-05-25 16:09:21] [INFO ] Flatten gal took : 57 ms
[2024-05-25 16:09:21] [INFO ] Flatten gal took : 23 ms
[2024-05-25 16:09:21] [INFO ] Input system was already deterministic with 195 transitions.
RANDOM walk for 4934 steps (0 resets) in 225 ms. (21 steps per ms) remains 0/11 properties
FORMULA ParamProductionCell-PT-3-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ParamProductionCell-PT-3-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ParamProductionCell-PT-3-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 195/195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 194
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 194
Applied a total of 2 rules in 13 ms. Remains 185 /186 variables (removed 1) and now considering 194/195 (removed 1) transitions.
// Phase 1: matrix 194 rows 185 cols
[2024-05-25 16:09:22] [INFO ] Computed 21 invariants in 3 ms
[2024-05-25 16:09:22] [INFO ] Implicit Places using invariants in 140 ms returned [134]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 141 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/186 places, 194/195 transitions.
Applied a total of 0 rules in 5 ms. Remains 184 /184 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 159 ms. Remains : 184/186 places, 194/195 transitions.
Stuttering acceptance computed with spot in 225 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 437 ms.
Product exploration explored 100000 steps with 50000 reset in 249 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 21 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-3-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-3-LTLCardinality-00 finished in 1182 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 195/195 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 186 transition count 156
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 147 transition count 156
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 78 place count 147 transition count 143
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 104 place count 134 transition count 143
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 105 place count 133 transition count 142
Iterating global reduction 2 with 1 rules applied. Total rules applied 106 place count 133 transition count 142
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 194 place count 89 transition count 98
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 196 place count 88 transition count 97
Applied a total of 196 rules in 56 ms. Remains 88 /186 variables (removed 98) and now considering 97/195 (removed 98) transitions.
// Phase 1: matrix 97 rows 88 cols
[2024-05-25 16:09:23] [INFO ] Computed 21 invariants in 2 ms
[2024-05-25 16:09:23] [INFO ] Implicit Places using invariants in 114 ms returned [64]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 115 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/186 places, 97/195 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 86 transition count 96
Applied a total of 2 rules in 8 ms. Remains 86 /87 variables (removed 1) and now considering 96/97 (removed 1) transitions.
// Phase 1: matrix 96 rows 86 cols
[2024-05-25 16:09:23] [INFO ] Computed 20 invariants in 1 ms
[2024-05-25 16:09:23] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-25 16:09:23] [INFO ] Invariant cache hit.
[2024-05-25 16:09:23] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-25 16:09:23] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 86/186 places, 96/195 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 521 ms. Remains : 86/186 places, 96/195 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLCardinality-04
Product exploration explored 100000 steps with 1163 reset in 365 ms.
Product exploration explored 100000 steps with 1155 reset in 276 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 78 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 325 steps (0 resets) in 6 ms. (46 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 218 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2024-05-25 16:09:24] [INFO ] Invariant cache hit.
[2024-05-25 16:09:24] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2024-05-25 16:09:24] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-25 16:09:24] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-05-25 16:09:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:09:25] [INFO ] [Nat]Absence check using 18 positive place invariants in 6 ms returned sat
[2024-05-25 16:09:25] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-25 16:09:25] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-05-25 16:09:25] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-25 16:09:25] [INFO ] [Nat]Added 67 Read/Feed constraints in 17 ms returned sat
[2024-05-25 16:09:25] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 6 ms to minimize.
[2024-05-25 16:09:25] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-05-25 16:09:25] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 2 ms to minimize.
[2024-05-25 16:09:25] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2024-05-25 16:09:25] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-25 16:09:25] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-25 16:09:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-25 16:09:25] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-25 16:09:25] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-25 16:09:25] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 485 ms
[2024-05-25 16:09:25] [INFO ] Computed and/alt/rep : 94/218/94 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-25 16:09:25] [INFO ] Added : 87 causal constraints over 18 iterations in 284 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 96/96 transitions.
Applied a total of 0 rules in 5 ms. Remains 86 /86 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-25 16:09:25] [INFO ] Invariant cache hit.
[2024-05-25 16:09:26] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-25 16:09:26] [INFO ] Invariant cache hit.
[2024-05-25 16:09:26] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-25 16:09:26] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2024-05-25 16:09:26] [INFO ] Redundant transitions in 2 ms returned []
Running 94 sub problems to find dead transitions.
[2024-05-25 16:09:26] [INFO ] Invariant cache hit.
[2024-05-25 16:09:26] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 16:09:26] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 2 ms to minimize.
[2024-05-25 16:09:26] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-25 16:09:26] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 2 ms to minimize.
[2024-05-25 16:09:27] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-25 16:09:27] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-25 16:09:27] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-25 16:09:27] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-25 16:09:27] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-25 16:09:27] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-25 16:09:27] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-25 16:09:27] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-25 16:09:27] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-25 16:09:27] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-25 16:09:27] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-25 16:09:27] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-25 16:09:27] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-25 16:09:27] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-25 16:09:27] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-25 16:09:27] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-25 16:09:27] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 16:09:27] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-25 16:09:27] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-25 16:09:27] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 2 ms to minimize.
[2024-05-25 16:09:28] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-25 16:09:28] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-25 16:09:28] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-25 16:09:28] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-25 16:09:28] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-25 16:09:28] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-25 16:09:28] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-25 16:09:28] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-25 16:09:28] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-25 16:09:28] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-25 16:09:28] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-25 16:09:28] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 16:09:28] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-25 16:09:28] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 1/85 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 16:09:29] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-25 16:09:29] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-25 16:09:29] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (OVERLAPS) 1/86 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 16:09:30] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-25 16:09:30] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/86 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 16:09:31] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/86 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 13 (OVERLAPS) 96/182 variables, 86/149 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/182 variables, 67/216 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/182 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 16 (OVERLAPS) 0/182 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 216 constraints, problems are : Problem set: 0 solved, 94 unsolved in 7215 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 42/60 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 16:09:33] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 16:09:34] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 1/85 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (OVERLAPS) 1/86 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/86 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (OVERLAPS) 96/182 variables, 86/151 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/182 variables, 67/218 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/182 variables, 94/312 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 16:09:36] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/182 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 16:09:37] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/182 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/182 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 16:09:39] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 8 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/182 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/182 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-25 16:09:40] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/182 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/182 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 21 (OVERLAPS) 0/182 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 316 constraints, problems are : Problem set: 0 solved, 94 unsolved in 10462 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 49/49 constraints]
After SMT, in 17747ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 17774ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18119 ms. Remains : 86/86 places, 96/96 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 78 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 313 steps (0 resets) in 5 ms. (52 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2024-05-25 16:09:44] [INFO ] Invariant cache hit.
[2024-05-25 16:09:44] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-25 16:09:44] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-25 16:09:44] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-05-25 16:09:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:09:44] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2024-05-25 16:09:44] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-25 16:09:44] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-25 16:09:44] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-25 16:09:44] [INFO ] [Nat]Added 67 Read/Feed constraints in 15 ms returned sat
[2024-05-25 16:09:44] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-25 16:09:44] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-25 16:09:44] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-25 16:09:44] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 2 ms to minimize.
[2024-05-25 16:09:44] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-25 16:09:45] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-25 16:09:45] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-25 16:09:45] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-25 16:09:45] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-25 16:09:45] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 392 ms
[2024-05-25 16:09:45] [INFO ] Computed and/alt/rep : 94/218/94 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-25 16:09:45] [INFO ] Added : 87 causal constraints over 18 iterations in 262 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 71 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1165 reset in 121 ms.
Product exploration explored 100000 steps with 1156 reset in 141 ms.
Built C files in :
/tmp/ltsmin15956704263189394480
[2024-05-25 16:09:45] [INFO ] Computing symmetric may disable matrix : 96 transitions.
[2024-05-25 16:09:45] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:09:45] [INFO ] Computing symmetric may enable matrix : 96 transitions.
[2024-05-25 16:09:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:09:45] [INFO ] Computing Do-Not-Accords matrix : 96 transitions.
[2024-05-25 16:09:45] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:09:45] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15956704263189394480
Running compilation step : cd /tmp/ltsmin15956704263189394480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 644 ms.
Running link step : cd /tmp/ltsmin15956704263189394480;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin15956704263189394480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18398636027041212037.hoa' '--buchi-type=spotba'
LTSmin run took 1675 ms.
FORMULA ParamProductionCell-PT-3-LTLCardinality-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-3-LTLCardinality-04 finished in 25089 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 195/195 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 186 transition count 157
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 148 transition count 157
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 76 place count 148 transition count 145
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 100 place count 136 transition count 145
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 135 transition count 144
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 135 transition count 144
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 192 place count 90 transition count 99
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 194 place count 89 transition count 98
Applied a total of 194 rules in 33 ms. Remains 89 /186 variables (removed 97) and now considering 98/195 (removed 97) transitions.
// Phase 1: matrix 98 rows 89 cols
[2024-05-25 16:09:48] [INFO ] Computed 21 invariants in 2 ms
[2024-05-25 16:09:48] [INFO ] Implicit Places using invariants in 98 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 99 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/186 places, 98/195 transitions.
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 2 place count 87 transition count 97
Applied a total of 2 rules in 7 ms. Remains 87 /88 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 87 cols
[2024-05-25 16:09:48] [INFO ] Computed 20 invariants in 1 ms
[2024-05-25 16:09:48] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-25 16:09:48] [INFO ] Invariant cache hit.
[2024-05-25 16:09:48] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-25 16:09:48] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 87/186 places, 97/195 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 561 ms. Remains : 87/186 places, 97/195 transitions.
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-3-LTLCardinality-12
Product exploration explored 100000 steps with 0 reset in 215 ms.
Stack based approach found an accepted trace after 105 steps with 0 reset with depth 106 and stack size 106 in 1 ms.
FORMULA ParamProductionCell-PT-3-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-3-LTLCardinality-12 finished in 839 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||(p0&&F(p1))))))'
Support contains 4 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 195/195 transitions.
Applied a total of 0 rules in 3 ms. Remains 186 /186 variables (removed 0) and now considering 195/195 (removed 0) transitions.
// Phase 1: matrix 195 rows 186 cols
[2024-05-25 16:09:49] [INFO ] Computed 21 invariants in 2 ms
[2024-05-25 16:09:49] [INFO ] Implicit Places using invariants in 159 ms returned [135]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 160 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/186 places, 195/195 transitions.
Applied a total of 0 rules in 2 ms. Remains 185 /185 variables (removed 0) and now considering 195/195 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 167 ms. Remains : 185/186 places, 195/195 transitions.
Stuttering acceptance computed with spot in 238 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLCardinality-13
Product exploration explored 100000 steps with 33333 reset in 121 ms.
Product exploration explored 100000 steps with 33333 reset in 188 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 p1 p0), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 18 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-3-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-3-LTLCardinality-13 finished in 754 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 195/195 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 186 transition count 157
Reduce places removed 38 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 39 rules applied. Total rules applied 77 place count 148 transition count 156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 78 place count 147 transition count 156
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 78 place count 147 transition count 144
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 102 place count 135 transition count 144
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 103 place count 134 transition count 143
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 134 transition count 143
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 192 place count 90 transition count 99
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 3 with 2 rules applied. Total rules applied 194 place count 89 transition count 98
Applied a total of 194 rules in 25 ms. Remains 89 /186 variables (removed 97) and now considering 98/195 (removed 97) transitions.
// Phase 1: matrix 98 rows 89 cols
[2024-05-25 16:09:49] [INFO ] Computed 21 invariants in 1 ms
[2024-05-25 16:09:49] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-25 16:09:49] [INFO ] Invariant cache hit.
[2024-05-25 16:09:50] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-25 16:09:50] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2024-05-25 16:09:50] [INFO ] Redundant transitions in 2 ms returned []
Running 96 sub problems to find dead transitions.
[2024-05-25 16:09:50] [INFO ] Invariant cache hit.
[2024-05-25 16:09:50] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 16:09:50] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-05-25 16:09:50] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-25 16:09:50] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-25 16:09:51] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-25 16:09:51] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-25 16:09:51] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-05-25 16:09:51] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-25 16:09:51] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-25 16:09:51] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-25 16:09:51] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-25 16:09:51] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-25 16:09:51] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-25 16:09:51] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-25 16:09:51] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-25 16:09:51] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-25 16:09:51] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 3 ms to minimize.
[2024-05-25 16:09:51] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-25 16:09:51] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-25 16:09:51] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-25 16:09:51] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 16:09:51] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 2 ms to minimize.
[2024-05-25 16:09:51] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 2 ms to minimize.
[2024-05-25 16:09:52] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-25 16:09:52] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-25 16:09:52] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-25 16:09:52] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-25 16:09:52] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-25 16:09:52] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-25 16:09:52] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-25 16:09:52] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-25 16:09:52] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-25 16:09:52] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-25 16:09:52] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 13/52 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 16:09:53] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-25 16:09:53] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-25 16:09:53] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 16:09:53] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 16:09:54] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 1/88 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 16:09:54] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-25 16:09:54] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-05-25 16:09:54] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-25 16:09:55] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (OVERLAPS) 1/89 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 16:09:55] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/89 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 16:09:56] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/89 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/89 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 15 (OVERLAPS) 98/187 variables, 89/154 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/187 variables, 67/221 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/187 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 96 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 0/187 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 221 constraints, problems are : Problem set: 0 solved, 96 unsolved in 9624 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 42/61 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 1/88 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 16:10:00] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-25 16:10:00] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 16:10:00] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 1/89 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (OVERLAPS) 98/187 variables, 89/157 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/187 variables, 67/224 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/187 variables, 96/320 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/187 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 15 (OVERLAPS) 0/187 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 320 constraints, problems are : Problem set: 0 solved, 96 unsolved in 4709 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 47/47 constraints]
After SMT, in 14365ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 14368ms
Starting structural reductions in SI_LTL mode, iteration 1 : 89/186 places, 98/195 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14713 ms. Remains : 89/186 places, 98/195 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLCardinality-14
Product exploration explored 100000 steps with 9428 reset in 110 ms.
Product exploration explored 100000 steps with 9343 reset in 129 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 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 37 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
[2024-05-25 16:10:05] [INFO ] Invariant cache hit.
[2024-05-25 16:10:05] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-25 16:10:05] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-25 16:10:05] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-05-25 16:10:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:10:05] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2024-05-25 16:10:05] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-25 16:10:05] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-05-25 16:10:05] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-25 16:10:05] [INFO ] [Nat]Added 67 Read/Feed constraints in 13 ms returned sat
[2024-05-25 16:10:05] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-25 16:10:05] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-25 16:10:05] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-25 16:10:05] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-25 16:10:06] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 2 ms to minimize.
[2024-05-25 16:10:06] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-25 16:10:06] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-25 16:10:06] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-25 16:10:06] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 2 ms to minimize.
[2024-05-25 16:10:06] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 2 ms to minimize.
[2024-05-25 16:10:06] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 504 ms
[2024-05-25 16:10:06] [INFO ] Computed and/alt/rep : 96/221/96 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-25 16:10:06] [INFO ] Added : 77 causal constraints over 16 iterations in 230 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 98/98 transitions.
Applied a total of 0 rules in 4 ms. Remains 89 /89 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-05-25 16:10:06] [INFO ] Invariant cache hit.
[2024-05-25 16:10:06] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-25 16:10:06] [INFO ] Invariant cache hit.
[2024-05-25 16:10:06] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-25 16:10:06] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2024-05-25 16:10:06] [INFO ] Redundant transitions in 3 ms returned []
Running 96 sub problems to find dead transitions.
[2024-05-25 16:10:06] [INFO ] Invariant cache hit.
[2024-05-25 16:10:06] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 16:10:07] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-25 16:10:07] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-25 16:10:07] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-25 16:10:07] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-25 16:10:07] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-25 16:10:07] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-05-25 16:10:07] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-25 16:10:07] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-05-25 16:10:07] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-25 16:10:07] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-25 16:10:07] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-25 16:10:07] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-25 16:10:07] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-25 16:10:07] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-25 16:10:07] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-25 16:10:07] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-25 16:10:07] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-25 16:10:07] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-05-25 16:10:07] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-25 16:10:07] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 16:10:08] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-25 16:10:08] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-25 16:10:08] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-25 16:10:08] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-25 16:10:08] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-25 16:10:08] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-25 16:10:08] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-25 16:10:08] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-05-25 16:10:08] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-25 16:10:08] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-25 16:10:08] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-25 16:10:08] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-25 16:10:08] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 13/52 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 16:10:09] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-25 16:10:09] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-25 16:10:09] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 16:10:09] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 16:10:09] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 1/88 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 16:10:10] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-05-25 16:10:10] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-05-25 16:10:10] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-25 16:10:10] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (OVERLAPS) 1/89 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 16:10:11] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/89 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 16:10:12] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/89 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/89 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 15 (OVERLAPS) 98/187 variables, 89/154 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/187 variables, 67/221 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/187 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 96 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 0/187 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 221 constraints, problems are : Problem set: 0 solved, 96 unsolved in 8633 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 42/61 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 1/88 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 16:10:16] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 2 ms to minimize.
[2024-05-25 16:10:16] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-25 16:10:16] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 1/89 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (OVERLAPS) 98/187 variables, 89/157 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/187 variables, 67/224 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/187 variables, 96/320 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/187 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 15 (OVERLAPS) 0/187 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 320 constraints, problems are : Problem set: 0 solved, 96 unsolved in 4810 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 89/89 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 47/47 constraints]
After SMT, in 13469ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 13472ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13810 ms. Remains : 89/89 places, 98/98 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 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 43 steps (0 resets) in 4 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
[2024-05-25 16:10:20] [INFO ] Invariant cache hit.
[2024-05-25 16:10:20] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-25 16:10:20] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-25 16:10:20] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-25 16:10:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:10:20] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2024-05-25 16:10:20] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-25 16:10:21] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-05-25 16:10:21] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-25 16:10:21] [INFO ] [Nat]Added 67 Read/Feed constraints in 13 ms returned sat
[2024-05-25 16:10:21] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-25 16:10:21] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-25 16:10:21] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-25 16:10:21] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-25 16:10:21] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-25 16:10:21] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-25 16:10:21] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-25 16:10:21] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-25 16:10:21] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 2 ms to minimize.
[2024-05-25 16:10:21] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-05-25 16:10:21] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 501 ms
[2024-05-25 16:10:21] [INFO ] Computed and/alt/rep : 96/221/96 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-25 16:10:21] [INFO ] Added : 77 causal constraints over 16 iterations in 201 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9427 reset in 104 ms.
Product exploration explored 100000 steps with 9477 reset in 126 ms.
Built C files in :
/tmp/ltsmin10205106653328115572
[2024-05-25 16:10:22] [INFO ] Computing symmetric may disable matrix : 98 transitions.
[2024-05-25 16:10:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:10:22] [INFO ] Computing symmetric may enable matrix : 98 transitions.
[2024-05-25 16:10:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:10:22] [INFO ] Computing Do-Not-Accords matrix : 98 transitions.
[2024-05-25 16:10:22] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 16:10:22] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10205106653328115572
Running compilation step : cd /tmp/ltsmin10205106653328115572;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 385 ms.
Running link step : cd /tmp/ltsmin10205106653328115572;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin10205106653328115572;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9118733511211124245.hoa' '--buchi-type=spotba'
LTSmin run took 1671 ms.
FORMULA ParamProductionCell-PT-3-LTLCardinality-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-3-LTLCardinality-14 finished in 34511 ms.
All properties solved by simple procedures.
Total runtime 65302 ms.

BK_STOP 1716653424381

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-3"
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-5568"
echo " Executing tool itstools"
echo " Input is ParamProductionCell-PT-3, 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 r268-smll-171654406800035"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-3.tgz
mv ParamProductionCell-PT-3 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 ;