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.r512-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 ltsminxred
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 r512-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 1717243440212

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:04:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 12:04:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:04:03] [INFO ] Load time of PNML (sax parser for PT used): 261 ms
[2024-06-01 12:04:03] [INFO ] Transformed 231 places.
[2024-06-01 12:04:03] [INFO ] Transformed 202 transitions.
[2024-06-01 12:04:03] [INFO ] Found NUPN structural information;
[2024-06-01 12:04:03] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 509 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 28 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 101 ms. Remains 226 /231 variables (removed 5) and now considering 197/202 (removed 5) transitions.
// Phase 1: matrix 197 rows 226 cols
[2024-06-01 12:04:04] [INFO ] Computed 59 invariants in 57 ms
[2024-06-01 12:04:05] [INFO ] Implicit Places using invariants in 1089 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 1157 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 37 ms. Remains 186 /188 variables (removed 2) and now considering 195/197 (removed 2) transitions.
// Phase 1: matrix 195 rows 186 cols
[2024-06-01 12:04:05] [INFO ] Computed 21 invariants in 5 ms
[2024-06-01 12:04:05] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-06-01 12:04:05] [INFO ] Invariant cache hit.
[2024-06-01 12:04:05] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-01 12:04:06] [INFO ] Implicit Places using invariants and state equation in 537 ms returned []
Implicit Place search using SMT with State Equation took 769 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 2105 ms. Remains : 186/231 places, 195/202 transitions.
Support contains 21 out of 186 places after structural reductions.
[2024-06-01 12:04:06] [INFO ] Flatten gal took : 83 ms
[2024-06-01 12:04:06] [INFO ] Flatten gal took : 35 ms
[2024-06-01 12:04:06] [INFO ] Input system was already deterministic with 195 transitions.
RANDOM walk for 4245 steps (1 resets) in 251 ms. (16 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 18 ms. Remains 185 /186 variables (removed 1) and now considering 194/195 (removed 1) transitions.
// Phase 1: matrix 194 rows 185 cols
[2024-06-01 12:04:07] [INFO ] Computed 21 invariants in 5 ms
[2024-06-01 12:04:07] [INFO ] Implicit Places using invariants in 232 ms returned [134]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 235 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 8 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 261 ms. Remains : 184/186 places, 194/195 transitions.
Stuttering acceptance computed with spot in 319 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 656 ms.
Product exploration explored 100000 steps with 50000 reset in 252 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 19 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 1626 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 0 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 0 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 49 ms. Remains 88 /186 variables (removed 98) and now considering 97/195 (removed 98) transitions.
// Phase 1: matrix 97 rows 88 cols
[2024-06-01 12:04:08] [INFO ] Computed 21 invariants in 1 ms
[2024-06-01 12:04:08] [INFO ] Implicit Places using invariants in 132 ms returned [64]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 134 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 1 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 11 ms. Remains 86 /87 variables (removed 1) and now considering 96/97 (removed 1) transitions.
// Phase 1: matrix 96 rows 86 cols
[2024-06-01 12:04:08] [INFO ] Computed 20 invariants in 1 ms
[2024-06-01 12:04:08] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-01 12:04:08] [INFO ] Invariant cache hit.
[2024-06-01 12:04:09] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:04:09] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 433 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 630 ms. Remains : 86/186 places, 96/195 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLCardinality-04
Product exploration explored 100000 steps with 1152 reset in 646 ms.
Product exploration explored 100000 steps with 1159 reset in 376 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 129 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 46 ms :[(NOT p0)]
RANDOM walk for 355 steps (0 resets) in 8 ms. (39 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 126 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 66 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
[2024-06-01 12:04:10] [INFO ] Invariant cache hit.
[2024-06-01 12:04:10] [INFO ] [Real]Absence check using 18 positive place invariants in 11 ms returned sat
[2024-06-01 12:04:10] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 3 ms returned sat
[2024-06-01 12:04:11] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2024-06-01 12:04:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:04:11] [INFO ] [Nat]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-06-01 12:04:11] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 7 ms returned sat
[2024-06-01 12:04:11] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2024-06-01 12:04:11] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:04:11] [INFO ] [Nat]Added 67 Read/Feed constraints in 27 ms returned sat
[2024-06-01 12:04:11] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 9 ms to minimize.
[2024-06-01 12:04:11] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 2 ms to minimize.
[2024-06-01 12:04:11] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 2 ms to minimize.
[2024-06-01 12:04:11] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 2 ms to minimize.
[2024-06-01 12:04:11] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 2 ms to minimize.
[2024-06-01 12:04:11] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 3 ms to minimize.
[2024-06-01 12:04:11] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:04:12] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 2 ms to minimize.
[2024-06-01 12:04:12] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 2 ms to minimize.
[2024-06-01 12:04:12] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 732 ms
[2024-06-01 12:04:12] [INFO ] Computed and/alt/rep : 94/218/94 causal constraints (skipped 0 transitions) in 20 ms.
[2024-06-01 12:04:12] [INFO ] Added : 87 causal constraints over 18 iterations in 418 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 6 ms. Remains 86 /86 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-06-01 12:04:12] [INFO ] Invariant cache hit.
[2024-06-01 12:04:12] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-06-01 12:04:12] [INFO ] Invariant cache hit.
[2024-06-01 12:04:12] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:04:13] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
[2024-06-01 12:04:13] [INFO ] Redundant transitions in 4 ms returned []
Running 94 sub problems to find dead transitions.
[2024-06-01 12:04:13] [INFO ] Invariant cache hit.
[2024-06-01 12:04:13] [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-06-01 12:04:13] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 2 ms to minimize.
[2024-06-01 12:04:13] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:04:13] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:04:13] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:04:14] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 2 ms to minimize.
[2024-06-01 12:04:14] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 2 ms to minimize.
[2024-06-01 12:04:14] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:04:14] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 2 ms to minimize.
[2024-06-01 12:04:14] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 2 ms to minimize.
[2024-06-01 12:04:14] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:04:14] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:04:14] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:04:14] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:04:14] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2024-06-01 12:04:14] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:04:14] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-06-01 12:04:14] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:04:14] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:04:14] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:04:14] [INFO ] Deduced a trap composed of 5 places in 36 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-06-01 12:04:15] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 2 ms to minimize.
[2024-06-01 12:04:15] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
[2024-06-01 12:04:15] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 5 ms to minimize.
[2024-06-01 12:04:15] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:04:15] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 2 ms to minimize.
[2024-06-01 12:04:15] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 2 ms to minimize.
[2024-06-01 12:04:15] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:04:15] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:04:15] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:04:15] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:04:15] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 2 ms to minimize.
[2024-06-01 12:04:15] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 2 ms to minimize.
[2024-06-01 12:04:15] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 2 ms to minimize.
[2024-06-01 12:04:15] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:04:16] [INFO ] Deduced a trap composed of 20 places in 45 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-06-01 12:04:16] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:04:16] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 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-06-01 12:04:17] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:04:17] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-06-01 12:04:17] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 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-06-01 12:04:19] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
[2024-06-01 12:04:19] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/86 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 12:04:19] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 2 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 10157 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-06-01 12:04:23] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 12:04:24] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 2 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-06-01 12:04:27] [INFO ] Deduced a trap composed of 11 places in 37 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-06-01 12:04:29] [INFO ] Deduced a trap composed of 11 places in 29 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-06-01 12:04:32] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 12 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-06-01 12:04:34] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 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 16371 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 26632ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 26655ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 27182 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 83 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 39 ms :[(NOT p0)]
RANDOM walk for 349 steps (0 resets) in 9 ms. (34 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 159 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 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
[2024-06-01 12:04:40] [INFO ] Invariant cache hit.
[2024-06-01 12:04:40] [INFO ] [Real]Absence check using 18 positive place invariants in 11 ms returned sat
[2024-06-01 12:04:40] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 3 ms returned sat
[2024-06-01 12:04:40] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2024-06-01 12:04:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:04:40] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2024-06-01 12:04:40] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 12:04:40] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2024-06-01 12:04:40] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:04:40] [INFO ] [Nat]Added 67 Read/Feed constraints in 23 ms returned sat
[2024-06-01 12:04:40] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 2 ms to minimize.
[2024-06-01 12:04:40] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 2 ms to minimize.
[2024-06-01 12:04:40] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 2 ms to minimize.
[2024-06-01 12:04:40] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 2 ms to minimize.
[2024-06-01 12:04:41] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
[2024-06-01 12:04:41] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:04:41] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:04:41] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:04:41] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:04:41] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 618 ms
[2024-06-01 12:04:41] [INFO ] Computed and/alt/rep : 94/218/94 causal constraints (skipped 0 transitions) in 13 ms.
[2024-06-01 12:04:41] [INFO ] Added : 87 causal constraints over 18 iterations in 397 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1152 reset in 205 ms.
Product exploration explored 100000 steps with 1166 reset in 238 ms.
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 7 ms. Remains 86 /86 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-06-01 12:04:42] [INFO ] Invariant cache hit.
[2024-06-01 12:04:42] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-06-01 12:04:42] [INFO ] Invariant cache hit.
[2024-06-01 12:04:42] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:04:42] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
[2024-06-01 12:04:42] [INFO ] Redundant transitions in 3 ms returned []
Running 94 sub problems to find dead transitions.
[2024-06-01 12:04:42] [INFO ] Invariant cache hit.
[2024-06-01 12:04:42] [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-06-01 12:04:43] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 2 ms to minimize.
[2024-06-01 12:04:43] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:04:43] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 2 ms to minimize.
[2024-06-01 12:04:43] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 2 ms to minimize.
[2024-06-01 12:04:43] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:04:43] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:04:43] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 2 ms to minimize.
[2024-06-01 12:04:43] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:04:43] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:04:43] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:04:43] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 2 ms to minimize.
[2024-06-01 12:04:43] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:04:43] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:04:44] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 2 ms to minimize.
[2024-06-01 12:04:44] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:04:44] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 2 ms to minimize.
[2024-06-01 12:04:44] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:04:44] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:04:44] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:04:44] [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-06-01 12:04:44] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 2 ms to minimize.
[2024-06-01 12:04:44] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:04:44] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 2 ms to minimize.
[2024-06-01 12:04:44] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:04:44] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:04:44] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 2 ms to minimize.
[2024-06-01 12:04:44] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:04:44] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:04:44] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:04:45] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:04:45] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 2 ms to minimize.
[2024-06-01 12:04:45] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:04:45] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:04:45] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:04:45] [INFO ] Deduced a trap composed of 20 places in 33 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-06-01 12:04:45] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:04:45] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 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-06-01 12:04:47] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:04:47] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:04:47] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 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-06-01 12:04:48] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:04:48] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/86 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 12:04:49] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 2 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 10344 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-06-01 12:04:53] [INFO ] Deduced a trap composed of 17 places in 50 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-06-01 12:04:53] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 2 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-06-01 12:04:57] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/182 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-06-01 12:04:58] [INFO ] Deduced a trap composed of 11 places in 28 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-06-01 12:05:01] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 2 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-06-01 12:05:04] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 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 15138 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 25529ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 25533ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 26080 ms. Remains : 86/86 places, 96/96 transitions.
Treatment of property ParamProductionCell-PT-3-LTLCardinality-04 finished in 59684 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 0 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 1 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 44 ms. Remains 89 /186 variables (removed 97) and now considering 98/195 (removed 97) transitions.
// Phase 1: matrix 98 rows 89 cols
[2024-06-01 12:05:08] [INFO ] Computed 21 invariants in 1 ms
[2024-06-01 12:05:08] [INFO ] Implicit Places using invariants in 96 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 98 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 0 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 8 ms. Remains 87 /88 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 87 cols
[2024-06-01 12:05:08] [INFO ] Computed 20 invariants in 1 ms
[2024-06-01 12:05:08] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-01 12:05:08] [INFO ] Invariant cache hit.
[2024-06-01 12:05:08] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:05:08] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 290 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 441 ms. Remains : 87/186 places, 97/195 transitions.
Stuttering acceptance computed with spot in 45 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 242 ms.
Stack based approach found an accepted trace after 175 steps with 0 reset with depth 176 and stack size 176 in 1 ms.
FORMULA ParamProductionCell-PT-3-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-3-LTLCardinality-12 finished in 752 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-06-01 12:05:09] [INFO ] Computed 21 invariants in 2 ms
[2024-06-01 12:05:09] [INFO ] Implicit Places using invariants in 220 ms returned [135]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 225 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 5 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 234 ms. Remains : 185/186 places, 195/195 transitions.
Stuttering acceptance computed with spot in 215 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 122 ms.
Product exploration explored 100000 steps with 33333 reset in 146 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 (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 15 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 755 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 0 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 1 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 29 ms. Remains 89 /186 variables (removed 97) and now considering 98/195 (removed 97) transitions.
// Phase 1: matrix 98 rows 89 cols
[2024-06-01 12:05:09] [INFO ] Computed 21 invariants in 1 ms
[2024-06-01 12:05:09] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-01 12:05:09] [INFO ] Invariant cache hit.
[2024-06-01 12:05:10] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:05:10] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2024-06-01 12:05:10] [INFO ] Redundant transitions in 2 ms returned []
Running 96 sub problems to find dead transitions.
[2024-06-01 12:05:10] [INFO ] Invariant cache hit.
[2024-06-01 12:05:10] [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-06-01 12:05:10] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:05:10] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:05:10] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:05:10] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:05:10] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 2 ms to minimize.
[2024-06-01 12:05:10] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 2 ms to minimize.
[2024-06-01 12:05:10] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 2 ms to minimize.
[2024-06-01 12:05:10] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 2 ms to minimize.
[2024-06-01 12:05:10] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:05:10] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 2 ms to minimize.
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 2 ms to minimize.
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 2 ms to minimize.
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 2 ms to minimize.
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 5 places in 30 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-06-01 12:05:11] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 2 ms to minimize.
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-06-01 12:05:11] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:05:12] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:05:12] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:05:12] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:05:12] [INFO ] Deduced a trap composed of 20 places in 32 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-06-01 12:05:12] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:05:12] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:05:12] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 12:05:13] [INFO ] Deduced a trap composed of 19 places in 56 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-06-01 12:05:13] [INFO ] Deduced a trap composed of 24 places in 32 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-06-01 12:05:14] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:05:14] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:05:14] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:05:14] [INFO ] Deduced a trap composed of 6 places in 38 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-06-01 12:05:16] [INFO ] Deduced a trap composed of 5 places in 22 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-06-01 12:05:17] [INFO ] Deduced a trap composed of 4 places in 23 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 11433 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-06-01 12:05:22] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 2 ms to minimize.
[2024-06-01 12:05:22] [INFO ] Deduced a trap composed of 14 places in 49 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-06-01 12:05:23] [INFO ] Deduced a trap composed of 23 places in 58 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 7321 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 18782ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 18784ms
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 19118 ms. Remains : 89/186 places, 98/195 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLCardinality-14
Product exploration explored 100000 steps with 9468 reset in 207 ms.
Product exploration explored 100000 steps with 9368 reset in 395 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 115 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 96 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 35 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 137 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 98 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
[2024-06-01 12:05:30] [INFO ] Invariant cache hit.
[2024-06-01 12:05:30] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-06-01 12:05:30] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 12:05:30] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-06-01 12:05:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:05:30] [INFO ] [Nat]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-06-01 12:05:30] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 12:05:30] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-06-01 12:05:30] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:05:30] [INFO ] [Nat]Added 67 Read/Feed constraints in 16 ms returned sat
[2024-06-01 12:05:30] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:05:30] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 2 ms to minimize.
[2024-06-01 12:05:30] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 2 ms to minimize.
[2024-06-01 12:05:30] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 2 ms to minimize.
[2024-06-01 12:05:30] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 2 ms to minimize.
[2024-06-01 12:05:31] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:05:31] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:05:31] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 4 ms to minimize.
[2024-06-01 12:05:31] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:05:31] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:05:31] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 726 ms
[2024-06-01 12:05:31] [INFO ] Computed and/alt/rep : 96/221/96 causal constraints (skipped 0 transitions) in 14 ms.
[2024-06-01 12:05:31] [INFO ] Added : 77 causal constraints over 16 iterations in 328 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 6 ms. Remains 89 /89 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-06-01 12:05:31] [INFO ] Invariant cache hit.
[2024-06-01 12:05:31] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-06-01 12:05:31] [INFO ] Invariant cache hit.
[2024-06-01 12:05:32] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:05:32] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
[2024-06-01 12:05:32] [INFO ] Redundant transitions in 3 ms returned []
Running 96 sub problems to find dead transitions.
[2024-06-01 12:05:32] [INFO ] Invariant cache hit.
[2024-06-01 12:05:32] [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-06-01 12:05:32] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 2 ms to minimize.
[2024-06-01 12:05:32] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 2 ms to minimize.
[2024-06-01 12:05:33] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 2 ms to minimize.
[2024-06-01 12:05:33] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 2 ms to minimize.
[2024-06-01 12:05:33] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 2 ms to minimize.
[2024-06-01 12:05:33] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 2 ms to minimize.
[2024-06-01 12:05:33] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:05:33] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 2 ms to minimize.
[2024-06-01 12:05:33] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:05:33] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 2 ms to minimize.
[2024-06-01 12:05:33] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 2 ms to minimize.
[2024-06-01 12:05:33] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 2 ms to minimize.
[2024-06-01 12:05:33] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 2 ms to minimize.
[2024-06-01 12:05:33] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:05:33] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:05:33] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 2 ms to minimize.
[2024-06-01 12:05:33] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:05:33] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:05:33] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:05:33] [INFO ] Deduced a trap composed of 5 places in 31 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-06-01 12:05:33] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 2 ms to minimize.
[2024-06-01 12:05:34] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:05:34] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:05:34] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:05:34] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:05:34] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:05:34] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-06-01 12:05:34] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-06-01 12:05:34] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:05:34] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:05:34] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:05:34] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:05:34] [INFO ] Deduced a trap composed of 20 places in 50 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-06-01 12:05:35] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:05:35] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:05:35] [INFO ] Deduced a trap composed of 12 places in 42 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-06-01 12:05:35] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 12:05:36] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 2 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-06-01 12:05:37] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:05:37] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-06-01 12:05:37] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-06-01 12:05:37] [INFO ] Deduced a trap composed of 6 places in 19 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-06-01 12:05:38] [INFO ] Deduced a trap composed of 5 places in 27 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-06-01 12:05:39] [INFO ] Deduced a trap composed of 4 places in 31 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 12426 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-06-01 12:05:46] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 2 ms to minimize.
[2024-06-01 12:05:46] [INFO ] Deduced a trap composed of 14 places in 37 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-06-01 12:05:46] [INFO ] Deduced a trap composed of 23 places in 59 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 6288 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 18760ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 18763ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19320 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 113 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 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 38 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 140 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 98 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
[2024-06-01 12:05:51] [INFO ] Invariant cache hit.
[2024-06-01 12:05:51] [INFO ] [Real]Absence check using 18 positive place invariants in 12 ms returned sat
[2024-06-01 12:05:51] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2024-06-01 12:05:51] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2024-06-01 12:05:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:05:51] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2024-06-01 12:05:51] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 12:05:52] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2024-06-01 12:05:52] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:05:52] [INFO ] [Nat]Added 67 Read/Feed constraints in 21 ms returned sat
[2024-06-01 12:05:52] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 2 ms to minimize.
[2024-06-01 12:05:52] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 2 ms to minimize.
[2024-06-01 12:05:52] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2024-06-01 12:05:52] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-06-01 12:05:52] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-06-01 12:05:52] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-06-01 12:05:52] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-06-01 12:05:52] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-06-01 12:05:52] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 2 ms to minimize.
[2024-06-01 12:05:52] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 2 ms to minimize.
[2024-06-01 12:05:53] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 912 ms
[2024-06-01 12:05:53] [INFO ] Computed and/alt/rep : 96/221/96 causal constraints (skipped 0 transitions) in 13 ms.
[2024-06-01 12:05:53] [INFO ] Added : 77 causal constraints over 16 iterations in 332 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9367 reset in 196 ms.
Product exploration explored 100000 steps with 9439 reset in 253 ms.
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 7 ms. Remains 89 /89 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-06-01 12:05:53] [INFO ] Invariant cache hit.
[2024-06-01 12:05:54] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-06-01 12:05:54] [INFO ] Invariant cache hit.
[2024-06-01 12:05:54] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 12:05:54] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
[2024-06-01 12:05:54] [INFO ] Redundant transitions in 2 ms returned []
Running 96 sub problems to find dead transitions.
[2024-06-01 12:05:54] [INFO ] Invariant cache hit.
[2024-06-01 12:05:54] [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-06-01 12:05:54] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:05:55] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:05:55] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 2 ms to minimize.
[2024-06-01 12:05:55] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:05:55] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:05:55] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 2 ms to minimize.
[2024-06-01 12:05:55] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:05:55] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:05:55] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:05:55] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-06-01 12:05:55] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:05:55] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:05:55] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:05:55] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:05:55] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-06-01 12:05:55] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:05:55] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:05:55] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:05:55] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 3 ms to minimize.
[2024-06-01 12:05:55] [INFO ] Deduced a trap composed of 5 places in 42 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-06-01 12:05:55] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 2 ms to minimize.
[2024-06-01 12:05:56] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:05:56] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:05:56] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:05:56] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:05:56] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 5 ms to minimize.
[2024-06-01 12:05:56] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:05:56] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-06-01 12:05:56] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:05:56] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:05:56] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:05:56] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:05:56] [INFO ] Deduced a trap composed of 20 places in 56 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-06-01 12:05:57] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:05:57] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:05:57] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 12:05:57] [INFO ] Deduced a trap composed of 19 places in 50 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-06-01 12:05:58] [INFO ] Deduced a trap composed of 24 places in 43 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-06-01 12:05:59] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-06-01 12:05:59] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:05:59] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:06:00] [INFO ] Deduced a trap composed of 6 places in 24 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-06-01 12:06:01] [INFO ] Deduced a trap composed of 5 places in 27 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-06-01 12:06:02] [INFO ] Deduced a trap composed of 4 places in 48 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 12099 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-06-01 12:06:07] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:06:07] [INFO ] Deduced a trap composed of 14 places in 35 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-06-01 12:06:08] [INFO ] Deduced a trap composed of 23 places in 54 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 7234 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 19354ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 19357ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19891 ms. Remains : 89/89 places, 98/98 transitions.
Treatment of property ParamProductionCell-PT-3-LTLCardinality-14 finished in 64047 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))'
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)))'
[2024-06-01 12:06:14] [INFO ] Flatten gal took : 19 ms
[2024-06-01 12:06:14] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 12:06:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 186 places, 195 transitions and 588 arcs took 9 ms.
Total runtime 131379 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ParamProductionCell-PT-3-LTLCardinality-04 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ParamProductionCell-PT-3-LTLCardinality-14 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717243591637

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name ParamProductionCell-PT-3-LTLCardinality-04
ltl formula formula --ltl=/tmp/1715/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 186 places, 195 transitions and 588 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1715/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1715/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1715/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1715/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 188 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 187, there are 197 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~265 levels ~10000 states ~30692 transitions
pnml2lts-mc( 2/ 4): ~266 levels ~20000 states ~54172 transitions
pnml2lts-mc( 0/ 4): ~265 levels ~40000 states ~131720 transitions
pnml2lts-mc( 0/ 4): ~265 levels ~80000 states ~256532 transitions
pnml2lts-mc( 0/ 4): ~265 levels ~160000 states ~553092 transitions
pnml2lts-mc( 2/ 4): ~266 levels ~320000 states ~1084048 transitions
pnml2lts-mc( 0/ 4): ~265 levels ~640000 states ~2499452 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 513369
pnml2lts-mc( 0/ 4): unique states count: 513369
pnml2lts-mc( 0/ 4): unique transitions count: 1945789
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1673818
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 618732
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1000
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 618732 states 2376463 transitions, fanout: 3.841
pnml2lts-mc( 0/ 4): Total exploration time 3.750 sec (3.750 sec minimum, 3.750 sec on average)
pnml2lts-mc( 0/ 4): States per second: 164995, Transitions per second: 633723
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 4.1MB, 8.4 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 1.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 195 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 4.1MB (~256.0MB paged-in)
ltl formula name ParamProductionCell-PT-3-LTLCardinality-14
ltl formula formula --ltl=/tmp/1715/ltl_1_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 186 places, 195 transitions and 588 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.000 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1715/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1715/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1715/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1715/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 188 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 187, there are 204 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~188 levels ~10000 states ~21540 transitions
pnml2lts-mc( 0/ 4): ~344 levels ~20000 states ~42808 transitions
pnml2lts-mc( 0/ 4): ~344 levels ~40000 states ~108400 transitions
pnml2lts-mc( 0/ 4): ~344 levels ~80000 states ~261984 transitions
pnml2lts-mc( 2/ 4): ~468 levels ~160000 states ~560416 transitions
pnml2lts-mc( 2/ 4): ~1433 levels ~320000 states ~1168716 transitions
pnml2lts-mc( 2/ 4): ~12912 levels ~640000 states ~2527496 transitions
pnml2lts-mc( 0/ 4): ~74394 levels ~1280000 states ~5788176 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 723973
pnml2lts-mc( 0/ 4): unique states count: 2170151
pnml2lts-mc( 0/ 4): unique transitions count: 11564960
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 5026759
pnml2lts-mc( 0/ 4): - claim found count: 4408060
pnml2lts-mc( 0/ 4): - claim success count: 2188307
pnml2lts-mc( 0/ 4): - cum. max stack depth: 280885
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2189082 states 11648916 transitions, fanout: 5.321
pnml2lts-mc( 0/ 4): Total exploration time 12.310 sec (12.310 sec minimum, 12.310 sec on average)
pnml2lts-mc( 0/ 4): States per second: 177830, Transitions per second: 946297
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 17.1MB, 8.3 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 6.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 195 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 17.1MB (~256.0MB paged-in)

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="ltsminxred"
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 ltsminxred"
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 r512-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 ;